Sets

2y ago
14 Views
3 Downloads
268.67 KB
64 Pages
Last View : 14d ago
Last Download : 3m ago
Upload by : Azalea Piercy
Transcription

SetsMAT231Transition to Higher MathematicsFall 2014MAT231 (Transition to Higher Math)SetsFall 20141 / 31

Outline1SetsIntroductionCartesian ProductsSubsetsPower SetsUnion, Intersection, DifferenceSet ComplementVenn DiagramsIndexed SetsMAT231 (Transition to Higher Math)SetsFall 20142 / 31

Definition of setDefinitionA set is a collection of items, called elements or members. The elementsof a set may beabstract: numbers, ideas, conceptsphysical: numerals, objectsWe will usually use uppercase letters to name sets, and lower case lettersas elements. The symbol denotes membership: x A indicates that x isan element of the set A.Two sets A and B are equal if and only if they have the same elements.That is, A B if and only if every element in A is contained in B andevery element in B is contained in A.MAT231 (Transition to Higher Math)SetsFall 20143 / 31

Specifying sets: EnumerationThere are many ways to specify a set. The simplest way is to list theelements contained in the set, as in 1, 2, 3. This is called enumeration.We use braces { and } to bracket the list of elements in a set.Example{1, 2, 3}{t, u, v , w , x, y , z}{,, /}For sets, membership is all that matters and the order the elements arelisted in is insignificant. Thus {a, b, c} is the same set as {c, b, a}.MAT231 (Transition to Higher Math)SetsFall 20144 / 31

Specifying sets: EnumerationListing sets is inconvenient if there are a large number of elements inthem. If there is an easy-to-see pattern then an ellipsis can be used.Example{1, 2, 3, . . . , 10}{0, 2, 4, 6, . . .}{. . . , 5, 3, 1, 1, 3, 5, . . .}MAT231 (Transition to Higher Math)SetsFall 20145 / 31

Specifying sets: Set-builder notationSets can also be specified using set-builder notation. It provides aexpression for a typical element in the set and then one or moremembership rules.Example{x : x is an even integer}{b : b is a butterfly}MAT231 (Transition to Higher Math)SetsFall 20146 / 31

Some special setsThere are some important sets of numbers, which we now name.N {1, 2, 3, 4, . . .} is the set of natural numbers.Z {. . . , 3, 2, 1, 0, 1, 2, 3, . . .} is the set of integers.Q {x/y : x, y Z, y 6 0} is the set of rational numbersR is the set of real numbers.It is not possible to specify R using enumeration and using enumerationfor Q is extremely cumbersome. Set-builder notation, however, makesspecifying Q relatively easy.Another important set is the empty set, denoted {} or . This is the setthat contains no elements.MAT231 (Transition to Higher Math)SetsFall 20147 / 31

More examples of set-builder notationHere are some more examples using set-builder notation:Example{3n : n Z} {. . . , 6, 3, 0, 3, 6, . . .}{2n 1 : n N} {1, 2, 4, 8, 16, . . .}{x Z : x 2 5} { 2, 1, 0, 1, 2, 3, 4, 5, 6}MAT231 (Transition to Higher Math)SetsFall 20148 / 31

CardinalityThe cardinality of a set is the number of elements in the set. Thecardinality of a set X is denoted X .Example {a, b, c} 3 {x : x is a letter of the alphabet} 26 0 (this is the only set with cardinality zero) {x Z : x 2 12} 7A finite set has a finite number of elements, while a set having infinitelymany elements is called an infinite set.The cardinality of a finite set is a number; the cardinality of infinite sets isusually expressed by saying what well known infinite sets have the samecardinality.MAT231 (Transition to Higher Math)SetsFall 20149 / 31

CardinalityWhat are the cardinalities of the following sets:A {a, {b, c, d}} B {{a}, {b, c}, d} C {{a, b, c, d}} D {{a, b, {c, d}}, , { }} MAT231 (Transition to Higher Math)SetsFall 201410 / 31

CardinalityWhat are the cardinalities of the following sets:A {a, {b, c, d}} A 2B {{a}, {b, c}, d} C {{a, b, c, d}} D {{a, b, {c, d}}, , { }} MAT231 (Transition to Higher Math)SetsFall 201410 / 31

CardinalityWhat are the cardinalities of the following sets:A {a, {b, c, d}} A 2B {{a}, {b, c}, d} B 3C {{a, b, c, d}} D {{a, b, {c, d}}, , { }} MAT231 (Transition to Higher Math)SetsFall 201410 / 31

CardinalityWhat are the cardinalities of the following sets:A {a, {b, c, d}} A 2B {{a}, {b, c}, d} B 3C {{a, b, c, d}} C 1D {{a, b, {c, d}}, , { }} MAT231 (Transition to Higher Math)SetsFall 201410 / 31

CardinalityWhat are the cardinalities of the following sets:A {a, {b, c, d}} A 2B {{a}, {b, c}, d} B 3C {{a, b, c, d}} C 1D {{a, b, {c, d}}, , { }} D 3MAT231 (Transition to Higher Math)SetsFall 201410 / 31

Cartesian productsDefinitionThe Cartesian product of two sets A and B is another set, denotedA B whose elements are ordered pairs, defined byA B {(a, b) : a A, b B}ExampleIf A {a, b, c} and B {0, 1} thenA B {(a, 0), (a, 1), (b, 0), (b, 1), (c, 0), (c, 1)}whileB A {(0, a), (0, b), (0, c), (1, a), (1, b), (1, c)}Recall that the order of elements in a set is unimportant, but the order ofelements in a ordered pair is significant.MAT231 (Transition to Higher Math)SetsFall 201411 / 31

Cartesian productsIf we extend the idea of an ordered pair to an ordered triple or even anordered n-tuple then we can define the Cartesian product of three ormore sets:A B C {(a, b, c) : a A, b B, c C }W X Y Z {(w , x, y , z) : w W , x X , y Y , z Z }Notice that the following two sets are different. One is the Cartesianproduct of three sets while the other is the Cartesian product of two sets.One contains ordered triples while the other contains ordered pairs.A B C {(a, b, c) : a A, b B, c C }A (B C ) {(a, (b, c)) : a A, b B, c C }MAT231 (Transition to Higher Math)SetsFall 201412 / 31

Cartesian products as powers of setsIn some applications Cartesian products of a set with itself are common.We use the notation A2 A A to denote this. In generalAn A A · · · A {(x1 , x2 , . . . , xn ) : x1 , x2 , . . . , xn A}Example{a, b}3 {(a, a, a), (a, a, b), (a, b, a), (a, b, b),(b, a, a), (b, a, b), (b, b, a), (b, b, b)}MAT231 (Transition to Higher Math)SetsFall 201413 / 31

Cardinality of Cartesian productsQuestion: What is A B ?MAT231 (Transition to Higher Math)SetsFall 201414 / 31

Cardinality of Cartesian productsQuestion: What is A B ?Answer: A B A · B MAT231 (Transition to Higher Math)SetsFall 201414 / 31

Cardinality of Cartesian productsQuestion: What is A B ?Answer: A B A · B Justification: Every element from A must be paired with every elementfrom B.MAT231 (Transition to Higher Math)SetsFall 201414 / 31

SubsetsDefinitionSuppose A and B are sets. If every element of A is also an element of Bthen we say A is a subset of B and denote this as A B. If A is not asubset of B we write A * B. This means there is at least one element ofA that is not contained in B.ExampleWhich of the following sets are subsets of A {1, 2, 3, 4, 5, 6}?{2, 4, 6}{0, 1, 2, 3}{1, 2, 3, 4, 5, 6} MAT231 (Transition to Higher Math)SetsFall 201415 / 31

SubsetsDefinitionSuppose A and B are sets. If every element of A is also an element of Bthen we say A is a subset of B and denote this as A B. If A is not asubset of B we write A * B. This means there is at least one element ofA that is not contained in B.ExampleWhich of the following sets are subsets of A {1, 2, 3, 4, 5, 6}?{2, 4, 6} (is a subset){0, 1, 2, 3}{1, 2, 3, 4, 5, 6} MAT231 (Transition to Higher Math)SetsFall 201415 / 31

SubsetsDefinitionSuppose A and B are sets. If every element of A is also an element of Bthen we say A is a subset of B and denote this as A B. If A is not asubset of B we write A * B. This means there is at least one element ofA that is not contained in B.ExampleWhich of the following sets are subsets of A {1, 2, 3, 4, 5, 6}?{2, 4, 6} (is a subset){0, 1, 2, 3} (is not a subset, 0 not contained in A){1, 2, 3, 4, 5, 6} MAT231 (Transition to Higher Math)SetsFall 201415 / 31

SubsetsDefinitionSuppose A and B are sets. If every element of A is also an element of Bthen we say A is a subset of B and denote this as A B. If A is not asubset of B we write A * B. This means there is at least one element ofA that is not contained in B.ExampleWhich of the following sets are subsets of A {1, 2, 3, 4, 5, 6}?{2, 4, 6} (is a subset){0, 1, 2, 3} (is not a subset, 0 not contained in A){1, 2, 3, 4, 5, 6} (is a subset, equal to A) MAT231 (Transition to Higher Math)SetsFall 201415 / 31

SubsetsDefinitionSuppose A and B are sets. If every element of A is also an element of Bthen we say A is a subset of B and denote this as A B. If A is not asubset of B we write A * B. This means there is at least one element ofA that is not contained in B.ExampleWhich of the following sets are subsets of A {1, 2, 3, 4, 5, 6}?{2, 4, 6} (is a subset){0, 1, 2, 3} (is not a subset, 0 not contained in A){1, 2, 3, 4, 5, 6} (is a subset, equal to A) (is a subset - does not contain any element not in A)MAT231 (Transition to Higher Math)SetsFall 201415 / 31

The Empty set as a subsetThe last example leads to an important fact: the empty set is a subsetof every set. Thus X for all sets X .We can rephrase set equality in terms of subsets. Two sets A and B areequal if and only if A B and B A.MAT231 (Transition to Higher Math)SetsFall 201416 / 31

Listing subsetsSuppose L {w , x, y , z}. List the subsets of L.Clearly is a subset.MAT231 (Transition to Higher Math)SetsFall 201417 / 31

Listing subsetsSuppose L {w , x, y , z}. List the subsets of L.Clearly is a subset.{w }, {x}, {y }, and {z} are also subsets of L.MAT231 (Transition to Higher Math)SetsFall 201417 / 31

Listing subsetsSuppose L {w , x, y , z}. List the subsets of L.Clearly is a subset.{w }, {x}, {y }, and {z} are also subsets of L.So are {w , x}, {w , y }, {w , z}, {x, y }, {x, z}, and {y , z}. Thesesubsets all have cardinality 2.MAT231 (Transition to Higher Math)SetsFall 201417 / 31

Listing subsetsSuppose L {w , x, y , z}. List the subsets of L.Clearly is a subset.{w }, {x}, {y }, and {z} are also subsets of L.So are {w , x}, {w , y }, {w , z}, {x, y }, {x, z}, and {y , z}. Thesesubsets all have cardinality 2.{w , x, y }, {w , x, z}, {w , y , z}, and {x, y , z} are the only subsets withcardinality 3.MAT231 (Transition to Higher Math)SetsFall 201417 / 31

Listing subsetsSuppose L {w , x, y , z}. List the subsets of L.Clearly is a subset.{w }, {x}, {y }, and {z} are also subsets of L.So are {w , x}, {w , y }, {w , z}, {x, y }, {x, z}, and {y , z}. Thesesubsets all have cardinality 2.{w , x, y }, {w , x, z}, {w , y , z}, and {x, y , z} are the only subsets withcardinality 3.Finally, the only subset of cardinality 4 is the set L itself: {w , x, y , z}.MAT231 (Transition to Higher Math)SetsFall 201417 / 31

Listing subsetsWhile tedious, listing subsets is straightforward:Start with the empty set .List all the singleton subsets (sets with one element).List all possible subsets with two elements.List all possible subsets with three elements.Continue until original set itself is listed as a subset.MAT231 (Transition to Higher Math)SetsFall 201418 / 31

Power SetsDefinitionIf A is a set, the power set of A is another set, denoted P(A) and is theset of all subsets of A.P(A) {X : X A}ExampleP({a, b}) { , {a}, {b}, {a, b}}P({a, b, c}) { , {a}, {b}, {c}, {a, b}, {a, c}, {b, c}, {a, b, c}}MAT231 (Transition to Higher Math)SetsFall 201419 / 31

Cardinality of power setsSuppose A is a finite set. What is the cardinality of P(A)?Notice that P( ) 1 (since P( ) { }) P({a}) 2 P({a, b}) 4 P({a, b, c}) 8Can you think of a general rule?MAT231 (Transition to Higher Math)SetsFall 201420 / 31

Cardinality of power setsSuppose A is a finite set. What is the cardinality of P(A)?Notice that P( ) 1 (since P( ) { }) P({a}) 2 P({a, b}) 4 P({a, b, c}) 8Can you think of a general rule?FactIf A is a finite set, P(A) 2 A .MAT231 (Transition to Higher Math)SetsFall 201420 / 31

Union, Intersection, DifferenceDefinitionSuppose A and B are two sets.The union of A and B is the setA B {x : x A or x B}The intersection of A and B is the setA B {x : x A and x B}The difference of A and B is the setA B {x : x A and x / B}(Sometimes A\B is used to denote set difference)MAT231 (Transition to Higher Math)SetsFall 201421 / 31

Operations involving two setsExampleLet A {4, 5, 6, 7, 8}, B {0, 1, 2, 3, 4}, and C {2, 4, 6}. ThenA B A C B C A B A C B C A B B A A C C A B C C B MAT231 (Transition to Higher Math)SetsFall 201422 / 31

Operations involving two setsExampleLet A {4, 5, 6, 7, 8}, B {0, 1, 2, 3, 4}, and C {2, 4, 6}. ThenA B {0, 1, 2, 3, 4, 5, 6, 7, 8}A C B C A B A C B C A B B A A C C A B C C B MAT231 (Transition to Higher Math)SetsFall 201422 / 31

Operations involving two setsExampleLet A {4, 5, 6, 7, 8}, B {0, 1, 2, 3, 4}, and C {2, 4, 6}. ThenA B {0, 1, 2, 3, 4, 5, 6, 7, 8}A C {2, 4, 5, 6, 7, 8}B C A B A C B C A B B A A C C A B C C B MAT231 (Transition to Higher Math)SetsFall 201422 / 31

Operations involving two setsExampleLet A {4, 5, 6, 7, 8}, B {0, 1, 2, 3, 4}, and C {2, 4, 6}. ThenA B {0, 1, 2, 3, 4, 5, 6, 7, 8}A C {2, 4, 5, 6, 7, 8}B C {0, 1, 2, 3, 4, 6}A B A C B C A B B A A C C A B C C B MAT231 (Transition to Higher Math)SetsFall 201422 / 31

Operations involving two setsExampleLet A {4, 5, 6, 7, 8}, B {0, 1, 2, 3, 4}, and C {2, 4, 6}. ThenA B {0, 1, 2, 3, 4, 5, 6, 7, 8}A C {2, 4, 5, 6, 7, 8}B C {0, 1, 2, 3, 4, 6}A B {4}A C B C A B B A A C C A B C C B MAT231 (Transition to Higher Math)SetsFall 201422 / 31

Operations involving two setsExampleLet A {4, 5, 6, 7, 8}, B {0, 1, 2, 3, 4}, and C {2, 4, 6}. ThenA B {0, 1, 2, 3, 4, 5, 6, 7, 8}A C {2, 4, 5, 6, 7, 8}B C {0, 1, 2, 3, 4, 6}A B {4}A C {4, 6}B C A B B A A C C A B C C B MAT231 (Transition to Higher Math)SetsFall 201422 / 31

Operations involving two setsExampleLet A {4, 5, 6, 7, 8}, B {0, 1, 2, 3, 4}, and C {2, 4, 6}. ThenA B {0, 1, 2, 3, 4, 5, 6, 7, 8}A C {2, 4, 5, 6, 7, 8}B C {0, 1, 2, 3, 4, 6}A B {4}A C {4, 6}B C {2, 4}A B B A A C C A B C C B MAT231 (Transition to Higher Math)SetsFall 201422 / 31

Operations involving two setsExampleLet A {4, 5, 6, 7, 8}, B {0, 1, 2, 3, 4}, and C {2, 4, 6}. ThenA B {0, 1, 2, 3, 4, 5, 6, 7, 8}A C {2, 4, 5, 6, 7, 8}B C {0, 1, 2, 3, 4, 6}A B {4}A C {4, 6}B C {2, 4}A B {5, 6, 7, 8}B A A C C A B C C B MAT231 (Transition to Higher Math)SetsFall 201422 / 31

Operations involving two setsExampleLet A {4, 5, 6, 7, 8}, B {0, 1, 2, 3, 4}, and C {2, 4, 6}. ThenA B {0, 1, 2, 3, 4, 5, 6, 7, 8}A C {2, 4, 5, 6, 7, 8}B C {0, 1, 2, 3, 4, 6}A B {4}A C {4, 6}B C {2, 4}A B {5, 6, 7, 8}B A {0, 1, 2, 3}A C C A B C C B MAT231 (Transition to Higher Math)SetsFall 201422 / 31

Operations involving two setsExampleLet A {4, 5, 6, 7, 8}, B {0, 1, 2, 3, 4}, and C {2, 4, 6}. ThenA B {0, 1, 2, 3, 4, 5, 6, 7, 8}A C {2, 4, 5, 6, 7, 8}B C {0, 1, 2, 3, 4, 6}A B {4}A C {4, 6}B C {2, 4}A B {5, 6, 7, 8}B A {0, 1, 2, 3}A C {5, 7, 8}C A B C C B MAT231 (Transition to Higher Math)SetsFall 201422 / 31

Operations involving two setsExampleLet A {4, 5, 6, 7, 8}, B {0, 1, 2, 3, 4}, and C {2, 4, 6}. ThenA B {0, 1, 2, 3, 4, 5, 6, 7, 8}A C {2, 4, 5, 6, 7, 8}B C {0, 1, 2, 3, 4, 6}A B {4}A C {4, 6}B C {2, 4}A B {5, 6, 7, 8}B A {0, 1, 2, 3}A C {5, 7, 8}C A {2}B C C B MAT231 (Transition to Higher Math)SetsFall 201422 / 31

Operations involving two setsExampleLet A {4, 5, 6, 7, 8}, B {0, 1, 2, 3, 4}, and C {2, 4, 6}. ThenA B {0, 1, 2, 3, 4, 5, 6, 7, 8}A C {2, 4, 5, 6, 7, 8}B C {0, 1, 2, 3, 4, 6}A B {4}A C {4, 6}B C {2, 4}A B {5, 6, 7, 8}B A {0, 1, 2, 3}A C {5, 7, 8}C A {2}B C {0, 1, 3}C B MAT231 (Transition to Higher Math)SetsFall 201422 / 31

Operations involving two setsExampleLet A {4, 5, 6, 7, 8}, B {0, 1, 2, 3, 4}, and C {2, 4, 6}. ThenA B {0, 1, 2, 3, 4, 5, 6, 7, 8}A C {2, 4, 5, 6, 7, 8}B C {0, 1, 2, 3, 4, 6}A B {4}A C {4, 6}B C {2, 4}A B {5, 6, 7, 8}B A {0, 1, 2, 3}A C {5, 7, 8}C A {2}B C {0, 1, 3}C B {6}MAT231 (Transition to Higher Math)SetsFall 201422 / 31

Operations involving three or more setsExampleLet A {4, 5, 6, 7, 8}, B {0, 1, 2, 3, 4}, and C {2, 4, 6}. Then(A B) (A C ) (A B) (A C ) (A B) (B A) (A B) (B A) MAT231 (Transition to Higher Math)SetsFall 201423 / 31

Operations involving three or more setsExampleLet A {4, 5, 6, 7, 8}, B {0, 1, 2, 3, 4}, and C {2, 4, 6}. Then(A B) (A C ) {2, 4, 5, 6, 7, 8}(A B) (A C ) (A B) (B A) (A B) (B A) MAT231 (Transition to Higher Math)SetsFall 201423 / 31

Operations involving three or more setsExampleLet A {4, 5, 6, 7, 8}, B {0, 1, 2, 3, 4}, and C {2, 4, 6}. Then(A B) (A C ) {2, 4, 5, 6, 7, 8}(A B) (A C ) {4, 6}(A B) (B A) (A B) (B A) MAT231 (Transition to Higher Math)SetsFall 201423 / 31

Operations involving three or more setsExampleLet A {4, 5, 6, 7, 8}, B {0, 1, 2, 3, 4}, and C {2, 4, 6}. Then(A B) (A C ) {2, 4, 5, 6, 7, 8}(A B) (A C ) {4, 6}(A B) (B A) {0, 1, 2, 3, 5, 6, 7, 8}(A B) (B A) MAT231 (Transition to Higher Math)SetsFall 201423 / 31

Operations involving three or more setsExampleLet A {4, 5, 6, 7, 8}, B {0, 1, 2, 3, 4}, and C {2, 4, 6}. Then(A B) (A C ) {2, 4, 5, 6, 7, 8}(A B) (A C ) {4, 6}(A B) (B A) {0, 1, 2, 3, 5, 6, 7, 8}(A B) (B A) MAT231 (Transition to Higher Math)SetsFall 201423 / 31

Disjoint setsTwo sets are disjoint if they have no elements in common.Another way to say this: Sets A and B are disjoint if A B .MAT231 (Transition to Higher Math)SetsFall 201424 / 31

The Universal SetWe can always consider a set to be a subset of another set. In any givensituation involving sets, we assume there is a universal set that containseach of our sets as a subset.ExampleConsider the sets A {1, 2, 3}, B { 21 , 53 , 5}, and C {π, e}.When dealing with only set A, we can use N, Z, Q, or R as theuniversal set.When dealing with both A and B, we could consider Q or R to be theuniversal set.When dealing with all three sets we would take R to be the universalset.Often the context will suggest what the universal set should be.MAT231 (Transition to Higher Math)SetsFall 201425 / 31

Set ComplementDefinitionLet A be a set with universal set U. The complement of A, denoted A, isthe setA U A.Essentially A is a set of everything not in A.ExampleLet A {x N : x 10}. We can infer from the definition of A thatU N.Then A {x N : x 10}.MAT231 (Transition to Higher Math)SetsFall 201426 / 31

Venn DiagramsA Venn Diagram can help understand set operations on a small numberof sets. Closed regions are used to represent sets. Overlapping regions oftwo or more sets denote elements common to the sets.ABUOften the rectangle representing the universal set is not drawn.MAT231 (Transition to Higher Math)SetsFall 201427 / 31

Venn DiagramsHere are some Venn diagrams of common two-set operations.AABBUUUABA BA BMAT231 (Transition to Higher Math)SetsA BFall 201428 / 31

Three Set Venn DiagramsConstruct a Venn diagram for A (B C ) and for A (B C )MAT231 (Transition to Higher Math)SetsFall 201429 / 31

Three Set Venn DiagramsConstruct a Venn diagram for A (B C ) and for A (B C )CABA (B C )MAT231 (Transition to Higher Math)SetsFall 201429 / 31

Three Set Venn DiagramsConstruct a Venn diagram for A (B C ) and for A (B C )CCAABA (B C )MAT231 (Transition to Higher Math)BA (B C )SetsFall 201429 / 31

Indexed SetsWhen working with many sets, it is often convenient to use indexed sets.Thus, rather than setsA, B, C , D, E ,we might use setsA1 , A2 , A3 , A4 , A5 .We can express the union and intersections of all of these sets as5[Aiandi 1MAT231 (Transition to Higher Math)5\Aii 1SetsFall 201430 / 31

Indexed SetsSometimes an even more general notation is used. Suppose I is any set(including an infinite set). If we use the elements of I as indices then wecan have indexed sets Aα where α I .Example[Aα {x : x Aα for at least one set Aα with α I }α I\Aα {x : x Aα for every set Aα with α I }α IMAT231 (Transition to Higher Math)SetsFall 201431 / 31

The cardinality of a nite set is a number; the cardinality of in nite sets is usually expressed by saying what well known in nite sets have the same cardinality. MAT231 (Transition to Higher Math) Sets Fall 2014 9 / 31. Cardinality What are

Related Documents:

He then keeps counting out sets of . sets of 2 b) sets of 3 c) sets of 3 d) sets of 4 3. Draw a picture to solve the problem. Hint: Start by drawing a circle and placing the correct number of dots in the circle. . The picture shows 12 objects divided into

Sets/gets the join delay on Rx window 2. AT RX1DL. Sets/gets the delay of the Rx window 1. AT RX2DL. Sets/gets the delay of the Rx window 2. AT RX2DR [ datarate] where X [0:7] Sets/gets data rate of the Rx window 2. AT RX2FQ [ freq] where freq in Hz Sets/gets the frequency of the Rx window 2. AT TXP [ txpow] where txpow [0:7] Sets/gets the .

MAT 142 - Module Sets and Counting 5 Set Operations We will need to be able to do some basic operations with sets. Set Union [. The rst operation we will consider is called the union of sets. This is the set that we get when we combine the elements of two sets. T

CONTENTS CHAPTER 1 Set Theory 1 1.1 Introduction 1 1.2 Sets and Elements, Subsets 1 1.3 Venn Diagrams 3 1.4 Set Operations 4 1.5 Algebra of Sets, Duality 7 1.6 Finite Sets, Counting Principle 8 1.7 Classes of Sets, Power Sets, Partitions 10 1.8 Mathematical Induction 12 SolvedProblems 12 SupplementaryProblems 18 CHAPT

Sets and Logic This chapter introduces sets. In it we study the structure on subsets of a set, operations on subsets, the relations of inclusion and equality on sets, and the close connection with propositional logic. 2.1 Sets A set (or cla

Length of Workout:_ Weight: _ Location:_ Exercise Set #1 Set #2 Set #3 Arnold Press: 3 sets of 12-15 reps Front Raise: 3 sets of 12-15 reps Lateral Raise: 3 sets of 12-15 reps Rear Delt Cable Fly: 3 sets of 12-15 reps Dumbbell Shrug: 3 sets of 12-15 reps Seated Calf .

3 10, no rest 5. bodyweight squat sets reps 3 45 sec., rest 30 sec. superset 6 chest-supported row sets reps 3 10-12, no rest 7. t-bar row * sets reps 3 10-12, one dropset each set,* rest 60 sec. superset 8 single-arm cable curl sets reps 3 8-10, each side, no rest 9. ez-bar preacher curl sets reps 3 10, one dropset each set,* rest 30 sec .

Rapid fat loss DAY 2 – ChESt AND tRICEpS 3 sets, 8 reps 3 INCLINE BENCh pRESS 3 sets 8-10 reps 2 sets, 10-12 reps ChESt 4 sets of 10 8 CRUNCh AND oBLIqUE twISt to fAILURE 7 ABDUCtoR RAISES 9 30-45 MINUtES of hIGh INtENSItY RUNNING/SpRINtS oR ELLIptICAL CYCLE. ABS CARDIo 2 sets, 8-10 reps 5 BENt ovER tRICEp ExtENSIoNS 4 ovERhEAD