Math in Modern World Introduction To SETS Types of Set To Union
Math in Modern World Introduction To SETS Types of Set To Union
SETS
Types of Sets
There are different types of sets categorized on various parameters. Some types of sets are mentioned
below:
Singleton
A set containing exactly one element. {1}
Set
Equal Sets Sets that contain exactly the same elements. Set A = {1, 2} and Set B = {1, 2}
Universal A set containing all elements relevant to a The set of all students in a school (when
Set specific discussion. discussing student grades)
Unequal
Sets that do not have all the same elements. Set A = {1, 2, 3} and Set B = {a, b}
Sets
Power Set The set contains all possible subsets of a Power Set of {a, b} = { {}, {a}, {b}, {a,
given set. b} }
Disjoint Sets Sets that have no elements in common. Set A = {1, 2, 3} and Set B = {a, b, c}
Delimiters are special characters or sequences of characters that indicate the beginning or end of a
certain statement or function body of a specified set. The following are the delimiters set
theory symbols and meanings:
| { q | q > 6}
Such These are used to construct a set by
The statement specifies the collection of
that specifying what is contained within it.
all q’s such that q is bigger than 6.
: Such The “:” symbol is sometimes used instead The above sentence can alternatively be
that of the “|” symbol. written as {q | q > 6}.
Sets and Relational Symbols in Sets Theory
Set theory symbols are used to identify a specific set as well as to determine/show a relationship
between distinct sets or relationships inside a set, such as the relationship between a set and its
constituent. The table below depicts such relationship symbols, along with their meanings and
examples:
a∈A Is a
This specifies that an element is a If a set A={12, 17, 18, 27} we may say
Component
member of a specific set. that 27 ∈ a.
of
A⊆B When all of the items of A are A= {31, b} and B={a, b, 31, 54}
Subset
present in B, A is a subset of B. {31, b} ⊆ {a, b, 31, 54}
A⊇B A is a superset of B if set B is a A = {14, 18, 26} and B={14, 18, 26}
Superset subset of A. Set A can be the same
{14, 18, 26} ⊇{14, 18, 26}
as or greater than Set B.
A⊅B When all of the elements of B are A = {11, 12, 16} and B ={11, 19}
Not a
not present in A, A is not a true
Superset {11, 12, 16} ⊅ {11, 19}
superset of B.
U A set that contains elements from If, A = {a,b,c} and B = {1,2,3,b,c}, then
Universal Set
all relevant sets, including its own. U = {1,2,3,a,b,c}
With examples, we will study set theory symbols and meanings for numerous operations such as union,
complement, intersection, difference, and others.
A∪B A = {p, q, u, v, w}
The union of sets creates an entirely new B = {r, s, x, y}
Union of Sets set by combining all of the components in
the provided sets. A ∪ B (A union B) = {p, q, u, v,
w, r, s, x, y}
A−B The difference set is a set that contains A = {12, 13, 15, 19} and B =
{13, 14, 15, 16, 17}
Set Difference items from one set that are not found in
another. A – B = {12, 19}
Union of Sets
Union of two sets means finding a set containing all the values in both sets. It is denoted using the
symbol ‘∪’ and is read as the union.
Example 1:
If A = {1, 3. 5. 7} and B = {1, 2, 3} then A∪B is read as A union B and its value is,
A∪B = {1, 2, 3, 5, 7}
Example 2:
If A = {1, 3. 5.7} and B = {2, 4} then A∪B is read as A union B and its value is,
A∪B = {1, 2, 3, 4, 5, 7}
Example 3:
If A = {1, 2, 3}, B = {2, 4} and C = {1, 3, 4}
A∪B∪C = {1, 2, 3, 4}
The union of the set can also be represented using the Venn Diagrams. For example, if we have set A and
set B which have some values in common then their Venn diagram is represented in the image below,
We can represent any set using the Venn diagram in the Venn diagram explained above the rectangle
represents the Universal set, and set A and set B are represented using the circles. The common area of
the two sets represents the intersection of the two sets and both the circles combined along with the
common area represent the union of the set.
Commutative Property A∪ B = B ∪ A
(A ∪ B) ∪ C = A ∪
Associative Property
(B ∪ C)
Property of Universal
A∪ U=U
Set
Properties of Union Notation
Commutative Property
The commutative property of the union of the set explains that the order in which the union of two sets
is taken is not important. For example, if take the union of two sets, set A and set B then the value of A
∪ B is equal to the B ∪ A. We can write this property as,
A∪B=B∪A
Example: Take two sets, set A = {1, 3, 5, 7}, and set B = {a, b, c, d} and find their union.
Solution:
Given sets,
A = {1,3,5,7}
B = {a,b,c,d}
Now, for proving the commutative property.
A ∪ B = {1,3,5,7} ∪ {a,b,c,d}
⇒ A ∪ B = {1,3,5,7,a,b,c,d}…(i)
Similarly,
B ∪ A = {a,b,c,d} ∪ {1,3,5,7} = {a,b,c,d,1,3,5,7}
As we know the order of elements is not important in sets so,
B ∪ A = {a, b, c, d, 1, 3, 5, 7}
⇒ B ∪ A = {1, 3, 5, 7, a, b, c, d}…(ii)
Thus from (i) and (ii) we say that
A ∪ B = B ∪ A,
Thus, commutative property for union of sets can be verified.
Associative Property
The associative property of the union of the set explains that the order in which the two sets are
grouped for finding the union of two or more sets is not important. For example, if take the union of
three finite sets, set P, set Q, and set R then,
(P ∪ Q) ∪ R = P ∪ (Q ∪ R)
Example: Take three sets, set P = {1, 3, 5, 7}, set Q = {a, b, c, d}, and set R = {p, q, r, s}.
Verify Associative property.
Solution:
Given sets,
P = {1, 3, 5, 7}
Q = {a, b, c, d}
R = {p, q, r, s}
Now, for proving the associative property.
P ∪ Q = {1,3,5,7} ∪ {a,b,c,d} = {1,3,5,7,a,b,c,d}
⇒ (P ∪ Q) ∪ R = {1, 3, 5, 7, a, b, c, d} ∪ {p, q, r, s}
⇒ (P ∪ Q) ∪ R = {1, 3, 5, 7, a, b, c, d, p, q, r, s}…(i)
Similarly,
Q ∪ R = {a,b,c,d} ∪ {p,q,r,s} = {a,b,c,d,p,q,r,s}
⇒ P ∪ (Q ∪ R) = {1, 3, 5, 7} ∪ {a, b, c, d, p, q, r, s}
⇒ (P ∪ Q) ∪ R= {1, 3, 5, 7, a, b, c, d, p, q, r, s}…(ii)
Thus from (i) and (ii) we say that
(P ∪ Q) ∪ R = P ∪ (Q ∪ R)
Thus, the associative property of the union of the set is verified.
The Identity Law of the union of the sets states that the union of any set with an identity element will
result in the same set. It can be represented as
A∪Ⲫ=A
where Ⲫ is the identity set or null set. This is also called the Property of Ⲫ or the Property of identity
set.
Example: If A = {1,2,3,4,5,6} prove A ∪ Ⲫ = A
Solution:
Given,
A ∪ Ⲫ = {1, 2, 3, 4, 5, 6} ∪ { } = {1, 2, 3, 4, 5, 6}
⇒A∪Ⲫ=A
Thus, Identity Law is verified.
Property of the Universal Set of the union of the sets states that the union of any set with the universal
set will result in the Universal set. It can be represented as
A∪U=U
Note: This property is sometimes referred to as Domination Law.
Example: If A = {1,2,3} and U = {1,2,3,4,5,6,7,8} then prove A ∪ U = U
Solution:
Given,
A ∪ U = {1, 2, 3} ∪ {1, 2, 3, 4, 5, 6, 7, 8}
⇒ A ∪ U = {1, 2, 3, 4, 5, 6, 7, 8}
⇒A∪U=U
Thus, Property of Universal set is verified.
Idempotent Property
Idempotent property of the union of the sets states that the union of any set with itself will result in
the same set. It can be represented as
A∪A=A
Example: If A = {1, 2, 3, 4, 5, 6} then verify the idempotent property.
Solution:
Given,
A ∪ A = {1, 2, 3, 4, 5, 6} ∪ {1, 2, 3, 4, 5, 6}
⇒ A ∪ A = {1,2,3,4,5,6}
⇒A∪A=A
Thus, Idempotent Property is verified.