4.1 Product Sets and Partitions

Slides:



Advertisements
Similar presentations
More Set Definitions and Proofs 1.6, 1.7. Ordered n-tuple The ordered n-tuple (a1,a2,…an) is the ordered collection that has a1 as its first element,
Advertisements

2.1 Sets ‒Sets ‒Common Universal Sets ‒Subsets 2.2 Set Operations 2.3 Functions 2.4 Sequences and Summations 1.
2.1 Sets. DEFINITION 1 A set is an unordered collection of objects. DEFINITION 2 The objects in a set are called the elements, or members, of the set.
Sets Definition of a Set: NAME = {list of elements or description of elements} i.e. B = {1,2,3} or C = {x  Z + | -4 < x < 4} Axiom of Extension: A set.
Chapter 5 Section 1 Sets Basics Set –Definition: Collection of objects –Specified by listing the elements of the set inside a pair of braces. –Denoted.
Sets, Relation and Functions A set is a collection of objects (elements) or a container of objects. Defining sets –Empty set (Ø): no elements –Universal.
Sets 1.
Sets 1.
1 Section 7.1 Relations and their properties. 2 Binary relation A binary relation is a set of ordered pairs that expresses a relationship between elements.
Chapter 2 The Basic Concepts of Set Theory © 2008 Pearson Addison-Wesley. All rights reserved.
Survey of Mathematical Ideas Math 100 Chapter 2
Chapter 2 The Basic Concepts of Set Theory © 2008 Pearson Addison-Wesley. All rights reserved.
5.1 Sets Sets and Elements Union and Intersection Subset and Empty Set
Sets.
Discrete Mathematics Unit - I. Set Theory Sets and Subsets A well-defined collection of objects (the set of outstanding people, outstanding is very subjective)
Partially borrowed from Florida State University
Relation. Relations Recall the definition of the Cartesian (Cross) Product: The Cartesian Product of sets A and B, A x B, is the set A x B = { : x  A.
Ordered Sets. Relations. Equivalence Relations 1.
Sets --- A set is a collection of objects. Sets are denoted by A, B, C, … --- The objects in the set are called the elements of the set. The elements are.
2.3 – Set Operations and Cartesian Products Intersection of Sets: The intersection of sets A and B is the set of elements common to both A and B. A  B.
1 ENM 503 Block 1 Algebraic Systems Lesson 2 – The Algebra of Sets The Essence of Sets What are they?
Mathematical Proofs. Chapter 1 Sets 1.1 Describing a Set 1.2 Subsets 1.3 Set Operations 1.4 Indexed Collections of Sets 1.5 Partitions of Sets.
1 Section 1.6 Sets. 2 Set Fundamental discrete structure on which all other discrete structures are built Can be loosely defined as a collection of elements.
Sets, Relations, and Lattices
Unit 2 Sets.
SECTION 2-3 Set Operations and Cartesian Products Slide
2.2 Set Operations. The Union DEFINITION 1 Let A and B be sets. The union of the sets A and B, denoted by A U B, is the set that contains those elements.
Mathematical Preliminaries
CSNB143 – Discrete Structure Topic 1 - Set. Topic 1 - Sets Learning Outcomes – Student should be able to identify sets and its important components. –
Lecture 2.1: Sets and Set Operations CS 250, Discrete Structures, Fall 2014 Nitesh Saxena Adopted from previous lectures by Cinda Heeren.
Chapter 2 With Question/Answer Animations. Section 2.1.
Database System Concepts, 5th Ed. ©Silberschatz, Korth and Sudarshan See for conditions on re-usewww.db-book.com ICOM 5016 – Introduction.
4. Relations and Digraphs Binary Relation Geometric and Algebraic Representation Method Properties Equivalence Relations Operations.
Discrete Mathematics. Set Theory - Definitions and notation A set is an unordered collection of elements. Some examples: {1, 2, 3} is the set containing.
Basic Definitions of Set Theory Lecture 23 Section 5.1 Wed, Mar 8, 2006.
Basic Definitions of Set Theory Lecture 23 Section 5.1 Mon, Feb 21, 2005.
Set Operations Section 2.2.
1 Set Theory Second Part. 2 Disjoint Set let A and B be a set. the two sets are called disjoint if their intersection is an empty set. Intersection of.
 Union Symbol ∪ If A and B are sets, their union is equal to all elements in both A & B A = {1,2,3,4} B = {2,4,5,6,7,8} A ∪ B = {1,2,3,4,5,6,7,8}
Fr: Discrete Mathematics by Washburn, Marlowe, and Ryan.
Chapter 7 Sets and Probability Section 7.1 Sets What is a Set? A set is a well-defined collection of objects in which it is possible to determine whether.
Introduction to Graph Theory & its Applications
Discrete Mathematics CS 2610 August 31, Agenda Set Theory Set Builder Notation Universal Set Power Set and Cardinality Set Operations Set Identities.
1 Discrete Structures – CNS2300 Text Discrete Mathematics and Its Applications Kenneth H. Rosen (5 th Edition) Chapter 1 The Foundations: Logic, Sets,
2004/10/5fuzzy set theory chap03.ppt1 Classical Set Theory.
The Basic Concepts of Set Theory. Chapter 1 Set Operations and Cartesian Products.
“It is impossible to define every concept.” For example a “set” can not be defined. But Here are a list of things we shall simply assume about sets. A.
Set. Outline Universal Set Venn Diagram Operations on Sets.
Citra Noviyasari, S.Si, MT
The set of whole numbers less than 7 is {1, 2, 3, 4, 5, 6}
The Basic Concepts of Set Theory
Sets Section 2.1.
The Basic Concepts of Set Theory
The Basic Concepts of Set Theory
The Basic Concepts of Set Theory
Chapter 2 The Basic Concepts of Set Theory
Sets. EXAMPLE 1 The set O of odd positive integers less than 10 can be expressed by O = { l, 3, 5, 7, 9}. * This way of describing a set is known as.
Discrete Mathematics CS 2610
Introduction to Sets.
Chapter 2 The Basic Concepts of Set Theory
Lecture 2.1: Sets and Set Operations*
Mathematical Background
ICOM 5016 – Introduction to Database Systems
2.1 – Symbols and Terminology
Lecture Sets 2.2 Set Operations.
ICOM 5016 – Introduction to Database Systems
Basic Definitions of Set Theory
Section 3.2 More set operations.
Terminology and Symbols
Presentation transcript:

4.1 Product Sets and Partitions

An ordered pair (a,b) is a listing of the objects a and b in a prescribed order with “a” appearing first and “b” appearing second. The cartesian product AxB is defined as the ordered pairs (a,b) with a ∈ A and b ∈ B

AXB = {(1,r), (1,s),(2,r), (2,s),(3,r),(3,s)} AXB = {(a,b)| } A = {1,2,3} |A| = 3 B = {r,s} |B| = 2 AXB = {(1,r), (1,s),(2,r), (2,s),(3,r),(3,s)} The cardinality of AXB = |A||B| 3*2 = 6 AXB will have 6 elements or pairs a ∈ A and b ∈ B

Partition A partition or quotient set denoted P, of set A is a collection P of non-empty subsets of A such that : 1. Each element of A belongs to a set in P. Each element of P is called a cell or a block 2. If A1 and A2 are distinct elements of P, then A1 ∩ A2 = 0 (A sub 1 intersect A sub 2)

Partition Example A1 A2 A3 A4 A5 A6 A7 A8 A9 A10 A11 A12

Example A = {a,b,c,d,e,f,g,h} A1 = {a,b,c,d} A2 = {a,c,e,f,g,h} A3 = {a,c,e,g} A4 = {b,d} A5 = {f,h} {A1, A2} IS NOT a partition since A1 ∩ A2 = 0 P = {A3, A4, A5}

Cartesian Plane Example