Scribd
Upload
600 views2 pages

Sets - Short Notes

Uploaded by

lifeparadoxx369
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
600 views2 pages

Sets - Short Notes

Uploaded by

lifeparadoxx369
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

CHAPTER

2 Sets

Set Power Set


A set is a well-defined collection of objects. A Collection is said The collection of all subsets of set A is called the power set of A. It
to be well-defined when there is no ambiguity regarding inclusion is denoted by P(A). Every element in P(A) is a set. Note that if A is
and exclusion of the object and all objects have same common a finite set having n elements, then P(A) has 2n elements.
properties. Each object of a set is called an element of a set.
Universal Set
Methods of Representing a Set It is a set which includes all the elements of the sets under
(i) Roster or Tabular Form: In this form, a set is described by listing consideration. It is denoted by U. Eg., if A = {1, 2, 3}, B = {3, 4, 7}
elements, separated by commas, within braces {}. and C = {2, 8, 9}, then U = {1, 2, 3, 4, 7, 8, 9}
(ii) Set-builder Form: In this form, a set is described by a
characterizing property P(x) of its elements x. In such a case,
Venn Diagrams
the set is described by {x: P(x) holds}, which is read as 'the Most of the relationships between sets can be represented by
set of all x such that P(x) holds'. means of diagrams which are known as Venn diagrams.

Types of Sets Operations on Sets


(i) Empty Set: A set having no element in it is called an empty Union of Sets: The union of two sets A and B is the set of all those
set. elements which are either in A or in B. It is denoted by A ∪ B.
(ii) Singleton Set : A set Containing one element is called a Properties of the Operation of Union
singleton set.
(i) A ∪ B = B ∪ A (Commutative Law)
(iii) Finite Set : A set having fixed no. of elements is called a finite
(ii) (A ∪ B) ∪ C = A ∪ (B ∪ C) (Associative Law)
set.
(iii) A ∪ f = A (Law of identity element, f is the identity of U)
(iv) Infinite Set : A set that is not finite is infinite set.
(iv) A ∪ A = A (Idempotent Law)
(v) Equal sets: Two sets A and B are said to be equal if every
element of A is a member of B and Vice-Versa. (v) U ∪ A = U (Law of U)

Subsets Intersection of Sets


A set A is said to be a subset of a set B if every element of A is also The intersection of two sets A and B is the set of all the elements
an element of B. i.e., A ⊂ B if a ∈ A ⇒ a ∈ B which are common. It is denoted by A ∩ B.
Note that: Properties of the Operation of Intersection
(i) Every set is a subset of itself. (i) A ∩ B = B ∩ A (Commutative Law)
(ii) Empty set ϕ is a subset of every set. (ii) (A ∩ B) ∩ C = A ∩ (B ∩ C) (Associative Law)
(iii) f ∩ A = f, U ∩ A = A (Law of f and ∪)
Intervals as Subsets of R
(iv) A ∩ A = A (Idempotent Law)
Let a,b ∈ R and a < b, then
(v) A ∩ (B ∪ C) = (A ∩ B) ∪ (A ∩ C) (Distributive Law)
(i) Closed Interval
[a, b] = {x ∈ R : a ≤ x ≤ b} Difference of Sets
(ii) Open Interval The difference of two sets A and B i.e., A–B, is the set of all those
(a, b) = {x ∈ R : a < x < b} elements of A which do not belong to B.
(iii) Semi-open or Semi-closed Interval Thus, A – B = {x:x ∈ A and x ∉ B}
(a, b] = {x ∈ R : a < x ≤ b}and [a, b) = {x ∈ R : a ≤ x< b} Similarly, B – A={x:x ∈ B and x ∉ A}
Some Important Results on Number of A' U
Elements in Sets
A
(i) If A and B are finite sets such that A ∩ B = f, then
n(A ∪ B) = n(A) + n(B)
(ii) If A ∪ B ≠ f, then
n(A ∪ B) = n(A) + n(B) – n(A ∩ B) Properties of Complement Sets
(1) Complement Laws
(iii) If A, B and C are finite sets, then
(i) A ∪ A' = U (ii) A ∩ A'= f
(A ∪ B ∪ C) = n(A) + n(B) + n(C) – n(A∩B) – n(B ∩ C) – n(A (2) De Morgan's Law
∩ C) + n(A ∩ B ∩ C) (i) (A ∪ B)' = A' ∩ B' (ii) (A ∩ B)' = A' ∪ B'
Complement of a Set (3) Law of Double Complementation
(A')' = A
Let U be the universal set and let A be a set such that A ⊂ U. Then,
the complement of A with respect to U is denoted by Ac or A' or (4) Laws of ϕ and U
U – A and is defined as the set of all those elements of U which f' = U and U' = f
are not in A.
Therefore, A' ={x ∈ U : x ∉ A}
Clearly, x ∈ A' ⇔ x ∉ A

4 JEE (XI) Module-1 PW

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy