ABSTRACT

[Draw your reader in with an engaging abstract. It is

typically a short summary of the document. When
you’re ready to add your content, just click here and
start typing.]
Muralikumar ME., CPEngg.,
YEAR 10
MATHEMATICS
1.2 Theory of Sets
Table of Contents
Theory of Sets................................................................................................................................................2

1 Sets........................................................................................................................................................3

2 Set Notations.........................................................................................................................................3
3 Representation of Set............................................................................................................................4

3.1 Descriptive Form............................................................................................................................4

3.2 Set-Builder Form or rule Form.......................................................................................................4

3.3 Roaster form or Tabular form........................................................................................................4

4 Types of Set............................................................................................................................................4
5 Number of Set........................................................................................................................................5
6 Set Operations.......................................................................................................................................5

6.1 Universal........................................................................................................................................5

6.2 Union of two sets...........................................................................................................................6

6.3 Intersection of two sets..................................................................................................................6

6.4 Difference of two sets....................................................................................................................6

6.5 Symmetric difference.....................................................................................................................7

6.6 Complement set.............................................................................................................................7

6.7 Disjoint set.....................................................................................................................................7

6.8 Cardinality of sets...........................................................................................................................7

7 Algebra of sets (Laws)............................................................................................................................8

8 Representation of Set Operations Using Venn diagram.........................................................................8

9 De Morgan’s laws...................................................................................................................................9

9.1 De Morgan’s laws for set difference..............................................................................................9

9.2 De Morgan’s laws for complementation........................................................................................9

www.rscoaching.com.au RS YR10 – 1.2 Theory of Sets

Theory of Sets
Ingenia was engaged by Smart Fab to perform structural analysis and design of the new proposed Diesel
Generator working platforms in multiple stages. This scope also includes to provide a safe working load
limit and design certification.

Subject Book Chapter Exercise

Theory of Cl 9 TN 03 Theory of Sets Ex 1.1, 1.2, 1.3, 1.4

sets
Cl 10 TN 01 Sets & Functions Ex 1.1, 1.2, 1.3

Yr 9 IB 05 Sets & Venn Ex Full

Yr 10 IB MYP5 01 Sets & Venn Ex Full

www.rscoaching.com.au RS YR10 – 1.2 Theory of Sets

1 Sets
A set is a collection of well-defined objects. The objects in a set are called elements or members of that
set.

2 Set Notations
∈ Element of or a member of
∉ Not an element (or) is not a member
{}∨∅ Empty set or Null set
n(S) Number of elements in set S
⋃ Union
⋂ Intersection
U Universal set
∅ Trivial subset
⊆ Subset of
⊂ Proper subset of
∀ For all
−, ¿ Difference of two sets
∆ Symmetric difference
x: x Such that
A={x : x is odd number } A is the set of all x such that x is odd number.

3 Representation of Set
A set can be represented in any one of the following three ways or forms.

3.1 Descriptive Form

One way to specify a set is to give a verbal description of its elements.

3.2 Set-Builder Form or rule Form

Set-builder notation is a notation for describing a set by indicating the properties that its members must
satisfy.

www.rscoaching.com.au RS YR10 – 1.2 Theory of Sets

3.3 Roaster form or Tabular form

Listing the elements of a set inside a pair of braces { } is called the roster form.

Note

In roster form each element of the set must be listed exactly once.

In a roster form the elements in a set can be written in any order.

If there are either infinitely many elements or a large finite number of elements, then three
consecutive dots called ellipsis are used to indicate that the pattern of the listed elements continues,
as in {5, 6, 7, …} or {1, 2, 3, …120}

4 Types of Set
Empty set: A set containing no elements is called the empty set or null set or void set.

Finite set: If the number of elements in a set is zero or finite, then the set is called a finite
set.

Infinite set: A set is said to be an infinite set if the number of elements in the set is not finite

Singleton set: A set containing only one element is called a singleton set

Equivalent set: Two sets A and B are said to be equivalent if they have the same number of
elements. A ≈ B

Equal set: Two sets A and B are said to be equal if they contain exactly the same elements,
regardless of order. A=B Otherwise the sets are said to be unequal. A ≠ B

Subset: A set X is a subset of set Y if every element of X is also an element of Y. Denoted

by X ⊆ Y

Proper Subset: A set X is said to be a proper subset of set Y, if X ⊆ Y and X ≠ Y . Denoted by

X ⊂ Y . Then Y is called super set of X

www.rscoaching.com.au RS YR10 – 1.2 Theory of Sets

Power set: The set of all subsets of A is said to be the power set of the set A. Denoted by
P( A)

Note

Every set is a subset of itself i.e. X ⊆ X for any set of X

The empty set is a subset of any set i.e., ∅ ⊆ X , for any set X

If X ⊆ Y and Y ⊆ X , then X =Y

Every set (except ∅ ) has at least two subsets, ∅ and the set itself.

Proper subsets have at least one element less than its superset.

No set is a proper subset of itself.

The empty set ∅ is a proper subset of every set except itself

Thus ∅ ⊆{a , b , c } is true, but ∅ ∈{a , b , c } is not true.

5 Number of Set
m
The number of subsets of a set with m elements is 2m That is n ( A ) =m⟹ n[ P ( A ) ]=2

The number of proper subsets of a set with m elements is 2m −1

Note

The set A=∅ has only itself as a subset

The set A={5 } has subsets ∅ and {5 }

The set A={5 , 6 } has subsets are ∅ , { 5 } , { 6 } , {5 , 6 }

6 Set Operations
6.1 Universal

The set that contains all the elements under consideration in a given discussion is called the universal set.
The universal set is denoted byU .

The universal set may change from problem to problem.

6.2 Union of two sets

The union of two sets A and B is the set of elements which are in A or in B or in both A and B. We write
the union of sets A and B as A ⋃ B .
A ⋃ A= A
A ⋃ ∅=A
A ⋃ A ' =A
A ⋃ B=B ⋃ A

www.rscoaching.com.au RS YR10 – 1.2 Theory of Sets

 If A is any subset of U then A ⋃ U =U

If A ⊆B if and only if A ⋃ B=B

6.3 Intersection of two sets

The intersection of two sets A and B is the set of all elements common to both A and B. We denote it as
A⋂ B
A ⋂ A= A
A ⋂ ∅=∅
A ⋂ A ' =∅
A ⋂ B=B ⋂ A
If A is any subset of U then A ⋂ U = A

If A ⊆ B if and only if A ⋂ B=A

Note

When B⊆ A the union and intersection of two sets A and B are represented by

6.4 Difference of two sets

The difference of the two sets A and B is the set of all elements belonging to A but not to B. The
difference of the two sets is denoted by A−B∨ A ¿ .
A−B ≠ B− A
U −A= A '
A−∅= A
A−B=B− A ⟹ A=B

6.5 Symmetric
difference

The symmetric difference of two sets A and B is the union of their

differences and is denoted by A ∆ B
Thus A ∆ B=( A−B ) ⋃ ( B− A )
A ∆ A=∅

www.rscoaching.com.au RS YR10 – 1.2 Theory of Sets

 A ∆ B=B ∆ A

6.6 Complement set

The complement of A is denoted by A’.

'
( A' ) = A ∅' =U U ' =∅
If X ⊆ U , then U ¿ is called the complement of X with respect to U. If
'
underlying universal set is fixed, then we denote U ¿ by X and is
called complement of X . The difference set A\B can also be viewed as the complement of B with respect
to A.

6.7 Disjoint set

Two sets A and B are said to be disjoint if there is no element common to both A and B.

In other words, if A and B are disjoint sets, then A ⋂ B=∅

6.8 Cardinality of sets

The number of elements in a set is called the cardinal number of the set.
nA=n ( A−B )+ n( A ⋂ B)
nB=n ( B− A ) +n (A ⋂ B)
n ( A ⋃ B )=n ( A−B ) +n ( B− A ) + n( A ⋂ B)
n ( A ⋃ B )=n ( A )+ n ( B )−n( A ⋂ B)
n ( A ) +n (A ')=n(U )
n ( A ∪ B ∪C )=n ( A ) +n ( B ) +n ( C )−n ( A ∩B )−n ( B ∩C ) −n ( A ∩C ) +n( A ∩ B ∩C)

7 Algebra of sets (Laws)

Commutative A ∪ B=B ∪ A∧ A ∩ B=B ∩ A
Associative A ∪ ( B ∪C )=( A ∪ B ) ∪ C∧ A ∩(B ∩C )=( A ∩ B)∩C
Distributive A ∪ ( B ∩C )=( A ∪ B ) ∩( A ∪C)∧ A ∩ ( B ∪ C )=( A ∩B ) ∪ (A ∩ C)

www.rscoaching.com.au RS YR10 – 1.2 Theory of Sets

 '
Complement A ∪ A ' =U ∧A ∩ A ' = A∧( A ' ) = A
Idempotent A ∪ A= A∧ A ∩ A=A

8 Representation of Set Operations Using Venn diagram

A ∪B A∩B

( A ∪ B )' ( A ∩ B)'

A ∩ B' A'∩B

A ' ∪B ' A'∩B'

www.rscoaching.com.au RS YR10 – 1.2 Theory of Sets

9 De Morgan’s laws
9.1 De Morgan’s laws for set difference
A−( B ∪ C )=( A−B)∩( A−C )
A−( B ∩C )=( A−B)∪( A−C )

9.2 De Morgan’s laws for complementation

( A ∪ B )' =A ' ∩B '

( A ∩ B )' = A ' ∪ B '

www.rscoaching.com.au RS YR10 – 1.2 Theory of Sets