www.padhle.in @padhle.

in

adhle.in
presents to you

Class 11 - Maths

Ch 1: Sets
www.padhle.in @padhle.in

adhle.in
Thank you for using www.padhle.in.

We here at Padhle, make sure that

every piece of material reaches you

without diving deep into the tabs of

your browser. These notes have

been downloaded without

compulsorily signing up, or

submitting your personal details.

Enjoy yourselves!

To help us in maintainig this, you can contribute to

Padhle. Even a small amount can do wonders.

Contribute to UPI ID - padhle@paytm

www.padhle.in @padhle.in

adhle.in

You can contribute a little to our

efforts. Even a small amount can do

wonders.

Scan the Code in any UPI App

OR
Contribute to UPI ID -
padhle@paytm

Now... Padhle!
 SETS
⮚ INTRODUCTION:
● Sets are used to define the concepts of relations and functions.
● A set is a well-defined collection of objects.
● Commonly used sets in mathematics;
o N: the set of all-natural numbers
o Z: the set of all integers
o Q: the set of all rational numbers
o R: the set of real numbers
● NOTE- the symbol ∈ (epsilon) is used to denote the phrase ‘belongs to’.

⮚ REPRESENTATION OF A SET:

▪ There are two methods of representing a set:

1) Roster or tabular form - the elements are being separated by commas and are
enclosed within braces { }.
Example- The set of all vowels in the English alphabet is {a, e, i, o, u}.
2) Set-builder form - all the elements of a set possess a single common property
which is not possessed by any element outside the set example V = {x: x is a
vowel in English alphabet}.

TABULAR FORM
Ex : {2,4,8,16,32}
Ex: {1/2, 2/3, 3/4, 4/5, 5/6, 6/7}

SET-BUILDER FORM
Ex: {x: x is an integer, x^2 ≤ 4}
Ex: {x: x is a two-digit natural number such that the sum of its digits is 8}

1. THE EMPTY SET:

● A set which does not contain any element is called the empty set or the null set or
the void set.
● Empty set is denoted by φ
 ● Example- Let A = {x : x is an even prime number greater than 2}.Then A is the
empty set, because 2 is the only even prime number.

2. FINITE AND INFINITE SETS:

● A set which is empty or consists of a definite number of elements is called finite
otherwise, the set is called infinite.
● Example- {x: x ∈ N and (x – 1) (x –2) = 0} ,given set = {1, 2}. Hence, it is finite.
● Example-{x: x ∈ N and x is prime},the given set is the set of all prime numbers and
since set of prime numbers is infinite. Hence the given set is infinite.

3. EQUAL SETS:
● They have exactly the same elements, otherwise they are said to be unequal.
● Example- the sets A = {1, 2, 3} and B = {2, 2, 1, 3, 3} are equal, since each element of A is in
B and vice-versa.

● NOTE- if wo sets A and B are equal, we write A = B and if they are said unequal,
we write A ≠ B.

4. SUBSET:
● A set A is said to be a subset of a set B if every element of A is also an element of
B.
● A is a subset of B if a is an element of A implies that a is also an element of B; A ⊂
B if a ∈ A ⇒ a ∈ B
● If it so happens that every element of B is also in A, then we shall also have B ⊂ A.
In this case, A and B are the same sets so that we have A ⊂ B and B ⊂ A ⇔ A = B.
● There are many important subsets of R;
o The set of natural numbers N = {1, 2, 3, 4, 5, . . .}
o The set of integers Z = {. . ., –3, –2, –1, 0, 1, 2, 3, . . .}
o The set of rational numbers Q = { x : x = p/q, p, q ∈ Z and q ≠ 0}
▪ Some of the obvious relations among these subsets are: N ⊂ Z ⊂ Q, Q
⊂ R, T ⊂ R, N ⊄ T
● Every set A is a subset of itself, i.e., A ⊂ A.
● NOTE- "⇔” is a symbol for two-way implications, and is usually read as if and
only if (briefly written as “iff”)
● Since the empty set φ has no elements, we agree to say that φ is a subset of every
set.
● If A ⊂ B and A ≠ B , then A is called a proper subset of B and B is called superset
of A.
 ● Example- A = {1, 2, 3} is a proper subset of B = {1, 2, 3, 4}.
● If a set has only one element, we call it a singleton set.

NOTE🡪

● The set of real numbers {y: a < y < b} is called an open interval and is denoted by (a, b)
● [ a, b] = {x: a ≤ x ≤ b}
● [ a, b) = {x: a ≤ x < b}
● (a, b] = {x: a < x ≤ b}
● { } denote a set ,( ) denote open interval & [ ] denote closed interval.

5. POWER SET:

● A The collection of all subsets of a set A is called the power set of A.

● It is denoted by P(A).
● In P(A), every element is a set.
● Example- if A = { 1, 2 }, then P( A ) = { φ,{ 1 }, { 2 }, { 1,2 }}

6. UNIVERSAL SET:

● A set which has elements of all the related sets, without any repetition of elements.
● usually denoted by U.
● Example- A = {1,2,3} and B = {1,a,b,c}, then the universal set associated with
these two sets is given by U = {1,2,3,a,b,c}.

7. VENN DIAGRAM:

● The relationships between sets can be represented by Venn diagrams.

● The universal set is represented usually by a rectangle and its subsets by circles.

OPERATIONS ON SETS
8. UNION OF SETS:
● The union of A and B is the set which consists of all the elements of A and all the
elements of B.
● In symbols, we write, A ∪ B = {x: x ∈A or x ∈B}
● NOTE- The symbol ‘∪’ is used to denote the union. Symbolically, we write A ∪ B
and usually read as ‘A union B'.
 ● Laws in sets:
o A ∪ B = B ∪ A (Commutative law)
o (A ∪ B) ∪ C = A ∪ (B ∪ C) (Associative law)
o A ∪ φ = A (Law of identity element, φ is the identity of ∪)
o A ∪ A = A (Idempotent law)
o U ∪ A = U (Law of U)

9. INTERSECTION OF SETS:
● The intersection of sets A and B is the set of all elements which are common to both
A and B.
● Symbolically, we write A ∩ B = {x: x ∈ A and x ∈ B}
● NOTE- The symbol ‘∩’ is used to denote the intersection.

● Laws in sets:
o A ∩ B = B ∩ A (Commutative law).
o ( A ∩ B ) ∩ C = A ∩ ( B ∩ C ) (Associative law).
o φ ∩ A = φ, U ∩ A = A (Law of φ and U).
o A ∩ A = A (Idempotent law)
o A ∩ ( B ∪ C ) = ( A ∩ B ) ∪ ( A ∩ C ) (Distributive law )
● NOTE🡪If A and B are two sets such that A ∩ B = φ, then A and B are called disjoint
sets because there are no elements which are common to A and B.
● NOTE🡪 The difference of the sets A and B in this order is the set of elements which
belong to A but not to B. Symbolically, we write A – B and read as “A minus B”.
● The sets A – B, A ∩ B and B – A are mutually disjoint sets.

10. COMPLEMENT OF A SET:

● The complement of A is the set of all elements of U which are not the elements of
A or the difference between a universal set U and the set A.
● Symbolically, we write A′ to denote the complement of A with respect to U.
● Thus, A′ = {x : x ∈ U and x ∉ A }. Obviously A′ = U – A.

11. De Morgan’s laws: The complement of the union of two sets is the intersection
of their complements and the complement of the intersection of two sets is the
union of their complements.
o A ∪ A′ = U, A ∩ A′ = φ
o (A ∪ B) ´= A′ ∩ B′, (A ∩ B)′ = A′ ∪ B′
o (A′) ′= A
o φ′ = U and U′ = φ
12. Practical formulae:
● A and B are finite sets, if A ∩ B = φ;
o n(A ∪B)=n(A)+n(B)
o The elements in A ∪ B are either in A or in B but not in both as A ∩ B = φ
● A and B are finite sets
o n(A ∪B)=n(A)+n(B) –n(A ∩B)
o n ( A ∪ B) = n ( A – B) + n ( A ∩ B ) + n ( B – A )
o = n ( A – B) + n ( A ∩ B ) + n ( B – A ) + n ( A ∩ B ) – n ( A ∩
B)
o = n ( A ) + n ( B ) – n ( A ∩ B)
● A, B and C are finite sets, then
o n ( A ∪ B ∪ C ) = n ( A ) + n ( B ) + n ( C ) – n ( A ∩ B ) – n ( B ∩ C) – n (
A∩C)+n(A∩B∩C)
o (A ∪ B ∪ C ) = n (A) + n ( B ∪ C ) – n [ A ∩ ( B ∪ C ) ]
o = n (A) + n ( B ) + n ( C ) – n ( B ∩ C ) – n [ A ∩ ( B ∪ C ) ]
o Since A ∩ ( B ∪ C ) = ( A ∩ B ) ∪ ( A ∩ C ),
o we get n [ A ∩ ( B ∪ C ) ] = n ( A ∩ B ) + n ( A ∩ C ) – n [ ( A
∩ B ) ∩ (A ∩ C)]
o = n ( A ∩ B ) + n ( A ∩ C ) – n (A ∩ B ∩ C)
o Therefore n ( A ∪ B ∪ C ) = n (A) + n ( B ) + n ( C ) – n ( A ∩
B ) – n ( B ∩ C) – n ( A ∩ C ) + n ( A ∩ B ∩ C )