Scribd
Upload
2 views

Set

The document provides an overview of set representation, properties, and operations such as union and intersection. It explains how sets can be defined, specified, and manipulated, including concepts like subsets, proper subsets, and cardinality. Additionally, it covers Venn diagrams, the empty set, and disjoint sets.

Uploaded by

dejenehundaol91
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
2 views

Set

The document provides an overview of set representation, properties, and operations such as union and intersection. It explains how sets can be defined, specified, and manipulated, including concepts like subsets, proper subsets, and cardinality. Additionally, it covers Venn diagrams, the empty set, and disjoint sets.

Uploaded by

dejenehundaol91
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 29

SETS Representation ,UNION & FIND

operation.
SETS Representation
A set is a collection of objects.
A set is a group of “objects”
– People in a class: { Dibora, kasahun , chernet }
– Classes offered by a department: { CS 101, CS 202, … }
– Colors of a rainbow: { red, orange, yellow, green, blue,
purple }
– States of matter { solid, liquid, gas, plasma }
– States in the US: { Alabama, Alaska, Virginia, … }
– Sets can contain non-related elements: { 3, a, red, Virginia }
• Although a set can contain (almost)
anything, we will most often use sets of
numbers
–All positive numbers less than or
equal to 5: {1, 2, 3, 4, 5}
–A few selected real numbers:
–{ 2.1, π, 0, -6.32, e }
Set properties 1
• Order does not matter
–We often write them in order because
it is easier for humans to understand it
that way
–{1, 2, 3, 4, 5} is equivalent to {3, 5, 2,
4, 1}
• Sets are notated with curly brackets
Set properties 2
• Sets do not have duplicate elements
– Consider the set of vowels in the alphabet.

• It makes no sense to list them as {a, a, a,


e, i, o, o, o, o, o, u}
• What we really want is just {a, e, i, o,
u}
– Consider the list of students in this class
• Again, it does not make sense to list
somebody twice
Specifying a set 1
• Sets are usually represented by a capital
letter (A, B, S, etc.)

• Elements are usually represented by an


italic lower-case letter (a, x, y, etc.)

• Easiest way to specify a set is to list all


the elements: A = {1, 2, 3, 4, 5}
– Not always feasible for large or infinite sets
Specifying a set 2
• Can use an ellipsis (…): B = {0, 1, 2, 3, …}
– Can cause confusion. Consider the set C = {3, 5,
7, …}. What comes next?
– If the set is all odd integers greater than 2, it is 9
– If the set is all prime numbers greater than 2, it is
11
• Can use set-builder notation
– D = {x | x is prime and x > 2}
– E = {x | x is odd and x > 2}
– The vertical bar means “such that”
– Thus, set D is read (in English) as: “all elements x
such that x is prime and x is greater than 2”
Specifying a set 3
• A set is said to “contain” the various “members”
or “elements” that make up the set
– If an element a is a member of (or an element of) a
set S, we use then notation a  S
• 4  {1, 2, 3, 4}
– If an element is not a member of (or an element of) a
set S, we use the notation a  S
• 7  {1, 2, 3, 4}
• Virginia  {1, 2, 3, 4}
Venn diagrams
• Represents sets graphically
– The box represents the universal set
– Circles represent the set
(s)
• Consider set S, which is
the set of all vowels in the
alphabet
• The individual elements
are usually not written
in a Venn diagram
The empty set
• If a set has zero elements, it is called the
empty (or null) set
– Written using the symbol 
– Thus,  = { }  VERY IMPORTANT
– If you get confused about the empty set in a
problem, try replacing  by { }
• As the empty set is a set, it can be a element of
other sets
– { , 1, 2, 3, x } is a valid set
Set equality
• Two sets are equal if they have the same
elements
– {1, 2, 3, 4, 5} = {5, 4, 3, 2, 1}
• Remember that order does not matter!
– {1, 2, 3, 2, 4, 3, 2, 1} = {4, 3, 2, 1}
• Remember that duplicate elements do not matter!
• Two sets are not equal if they do not have
the same elements
– {1, 2, 3, 4, 5} ≠ {1, 2, 3, 4}
Subsets 1
• If all the elements of a set S are also elements of
a set T, then S is a subset of T
– For example, if S = {2, 4, 6} and T = {1, 2, 3,
4, 5, 6, 7}, then S is a subset of T
– This is specified by S  T
Or by {2, 4, 6}  {1, 2, 3, 4, 5, 6, 7}
• If S is not a subset of T, it is written as such:
S⊄T
– For example, {1, 2, 8} ⊄ {1, 2, 3, 4, 5, 6, 7}
Subsets 2
• Note that any set is a subset of
itself!
–Given set S = {2, 4, 6}, since all
the elements of S are elements
of S, S is a subset of itself
–This is kind of like saying 5 is
less than or equal to 5
–Thus, for any set S, S  S
Proper Subsets
• If S is a subset of T, and S is not equal to T,
then S is a proper subset of T
– Let T = {0, 1, 2, 3, 4, 5}
– If S = {1, 2, 3}, S is not equal to T, and S is a
subset of T
– A proper subset is written as S  T
– Let R = {0, 1, 2, 3, 4, 5}. R is equal to T, and
thus is a subset (but not a proper subset) or T
• Can be written as: R  T and R  T (or just R = T)
– Let Q = {4, 5, 6}. Q is neither a subset or T
nor a proper subset of T
Proper subsets: Venn diagram
Set cardinality
• The cardinality of a set is the number of elements
in a set
– Written as |A|
• Examples
– Let R = {1, 2, 3, 4, 5}. Then |R| = 5
– || = 0
– Let S = {, {a}, {b}, {a, b}}. Then |S| = 4
• This is the same notation used for vector length in
geometry
• A set with one element is sometimes called a
singleton set.
Power sets
• Given the set S = {0, 1}. What are all
the possible subsets of S?
– They are:  (as it is a subset of all sets),
{0}, {1}, and {0, 1}
– The power set of S (written as P(S)) is
the set of all the subsets of S
– P(S) = { , {0}, {1}, {0,1} }
• Note that |S| = 2 and |P(S)| = 4
Power sets 2
• Let T = {0, 1, 2}. The P(T) = { , {0}, {1}, {2},
{0,1}, {0,2}, {1,2}, {0,1,2} }
• Note that |T| = 3 and |P(T)| = 8
• P() = {  }
• Note that || = 0 and |P()| = 1
• If a set has n elements, then the power set will
have 2n elements
Set operations: Union
Set operations: Union Cont..
• Formal definition for the union of two sets:
A U B = { x | x  A or x  B }
• Further examples
– {1, 2, 3} U {3, 4, 5} = {1, 2, 3, 4, 5}
– {New York, Washington} U {3, 4} = {New York,
Washington, 3, 4}
– {1, 2} U  = {1, 2}
Set operations: Union
• Properties of the union operation
–AU=A Identity law
–AUU=U Domination law
–AUA=A Idempotent law
–AUB=BUA Commutative law
– A U (B U C) = (A U B) U C Associative law
Set operations: Intersection
Set operations: Intersection 2
Set operations: Intersection 3
• Formal definition for the intersection of two
sets: A ∩ B = { x | x  A and x  B }
• Further examples
– {1, 2, 3} ∩ {3, 4, 5} = {3}
– {New York, Washington} ∩ {3, 4} = 
• No elements in common
– {1, 2} ∩  = 
• Any set intersection with the empty set yields the
empty set
Set operations: Intersection
• Properties of the intersection operation
–A∩U=A Identity law
–A∩= Domination law
–A∩A=A Idempotent law
–A∩B=B∩A Commutative law
– A ∩ (B ∩ C) = (A ∩ B) ∩ C Associative law
Disjoint sets
Disjoint sets
Disjoint sets
• Formal definition for disjoint sets: two sets are
disjoint if their intersection is the empty set
• Further examples
– {1, 2, 3} and {3, 4, 5} are not disjoint
– {New York, Washington} and {3, 4} are disjoint
– {1, 2} and  are disjoint
• Their intersection is the empty set
–  and  are disjoint!
• Their intersection is the empty set

You might also like