Scribd
Upload
68 views3 pages

Ch-1 Sets Notes

A set is a collection of distinct objects. There are two ways to represent a set: a roster lists the elements within braces, while a set-builder uses properties that define the elements. A set A is a subset of B if every element of A is also an element of B. The power set of a set A contains all possible subsets of A and has 2^n elements if A has n elements. Unions, intersections, complements and other set operations follow properties such as commutativity, associativity, distributivity and De Morgan's laws.

Uploaded by

Preeti
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
68 views3 pages

Ch-1 Sets Notes

A set is a collection of distinct objects. There are two ways to represent a set: a roster lists the elements within braces, while a set-builder uses properties that define the elements. A set A is a subset of B if every element of A is also an element of B. The power set of a set A contains all possible subsets of A and has 2^n elements if A has n elements. Unions, intersections, complements and other set operations follow properties such as commutativity, associativity, distributivity and De Morgan's laws.

Uploaded by

Preeti
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/ 3

A set is a well-defined collection of objects.

There are two methods of representing a set

● Roster or Tabular form, in the roster form, we list all the members of the set within braces { }
● Set-builder form, in the set-builder form, we list the property or properties satisfied by all the elements of
the sets.

A set A is said to be a subset of set B if every element of set A belongs to set B. In symbols, we write
A ⊆ B, if x ∈ A ⇒ x ∈ B
Note:

● Every set is a subset of itself.


● The empty set is a subset of every set.
● The total number of subsets of a finite set containing n elements is 2n.
Intervals as Subsets of R
Let a and b be two given real numbers such that a < b, then

● an open interval denoted by (a, b)={x: a < x < b}.


● a closed interval denoted by [a, b]={x : a ≤ x ≤ b}.
● intervals closed at one end and opened at the others are known as semi-open or semi-closed intervals and
denoted by (a, b] is the set of real numbers {x: a < x ≤ b} or [a, b) is the set of real numbers {x: a ≤ x < b}.

The collection of all subsets of a set A is called the power set of A. It is denoted by P(A). If the number of elements in
A i.e. n(A) = n, then the number of elements in P(A) = 2n.

A set that contains all sets in a given context is called the universal set.

Union of sets: The union of two sets A and B, denoted by A ∪ B is the set of all those elements which are either in A
or in B or in both A and B. Thus, A ∪ B = {x: x ∈ A or x ∈ B}.
Intersection of sets: The intersection of two sets A and B, denoted by A ∩ B, is the set of all elements which are
common to both A and B. Thus, A ∩ B = {x : x ∈ A and x ∈ B}

Two sets A and B are said to be disjoint if A ∩ B = Φ.

For any sets A and B, their difference (A – B) is defined as a set of elements, which belong to A but not to B.
Thus, A – B = {x : x ∈ A and x ∉ B}
also, B – A = {x : x ∈ B and x ∉ A}

Let U be the universal set and A is a subset of U. Then, the complement of A is the set of all elements of U which are not the element of
A.
Thus, A’ = U – A = {x : x ∈ U and x ∉ A}
Some Properties of Complement of Sets

● A ∪ A’ = ∪
● A ∩ A’ = Φ
● ∪’ = Φ
● Φ’ = ∪
● (A’)’ = A

Idempotent Laws: For any set A, we have

● A∪A=A
● A∩A=A

Identity Laws: For any set A, we have

● A∪Φ=A
● A∩U=A

Commutative Laws: For any two sets A and B, we have

● A∪B=B∪A
● A∩B=B∩A

Associative Laws: For any three sets A, B and C, we have

● A ∪ (B ∪ C) = (A ∪ B) ∪ C
● A ∩ (B ∩ C) = (A ∩ B) ∩ C

Distributive Laws: If A, B and C are three sets, then

● A ∪ (B ∩ C) = (A ∪ B) ∩ (A ∪ C)
● A ∩ (B ∪ C) = (A ∩ B) ∪ (A ∩ C)

De-Morgan’s Laws: If A and B are two sets, then

● (A ∪ B)’ = A’ ∩ B’
● (A ∩ B)’ = A’ ∪ B’

Formulae to Solve Practical Problems on Union and Intersection of Two Sets


Let A, B and C be any three finite sets, then

● n(A ∪ B) = n(A) + n (B) – n(A ∩ B)


● If (A ∩ B) = Φ, then n (A ∪ B) = n(A) + n(B)
● n(A – B) = n(A) – n(A ∩ B)
● n(A ∪ B ∪ C) = n(A) + n(B) + n(C) – n(A ∩ B) – n(B ∩ C) – n(A ∩ C) + n(A ∩ B ∩ C)

You might also like