MA701:FOM Unit1: Set Function and Relation MCA-I
Set:
A set is a collection of distinct, symbols unordered objects. Sets are typically collections of
numbers, though a set may contain any type of data (including other sets).The objects in a set are
called the members of the set or the elements of the set.
A set should satisfy the following:
1) The members of the set should be distinct.(not be repeated)
2) The members of the set should be well-defined.(well-explained)
Describing Set
There are two ways of describing or specifying the members of a set.
First way is by intensional definition, using a rule or semantic description:
A is the set whose members are the first four positive integers.
B is the set of colors of the French flag.
The second way is by extension that is, listing each member of the set. An extensional
definition is denoted by enclosing the list of members in curly brackets:
C = {4, 2, 1, 3}
D = {blue, white, red}
Third way is by using set notation builder:
The set N of first 10 natural number.
N={x : x is natural numbe;0<x<11}
The set F of the twenty smallest integers that are four less than perfect squares can be
denoted:
F = {n2 4 : n is an integer; and 0 n 19}.
Membership
The key relation between sets is membership when one set is an element of another. If a is a
member of B, this is denoted a B, while if c is not a member of B then c B.
For example, with respect to the sets
A = {1,2,3,4}, B = {blue, white, red}, and F = {n2 4 : n is an integer; and 0 n 19} defined
above,
1
CMPICA
A.M.Shukla
MA701:FOM Unit1: Set Function and Relation MCA-I
4 A and 285 F; but 9 F and green B.
Subset/Superset
If every member of set A is also a member of set B, then A is said to be a subset of B, written A
B (also pronounced A is contained in B). Equivalently, we can write B A, read as B is a
superset of A, B includes A, or B contains A. The relationship between sets established by is
called inclusion or containment.
Proper Subset
If A is a subset of, but not equal to, B, then A is called a proper subset of B, written A B (A is a
proper subset of B) or B A (B is a proper superset of A).
Power Set
The power set of a set S is the set of all subsets of S, including S itself and the empty set. For
example, the power set of the set {1, 2, 3} is {{1, 2, 3}, {1, 2}, {1, 3}, {2, 3}, {1}, {2}, {3}, }.
The power set of a set S usually written as P(S).
The power set of a finite set with n elements has 2n elements. This relationship is one of the
reasons for the terminology power set. For example, the set {1, 2, 3} contains three elements,
and the power set shown above contains 23 = 8 elements.
The power set of an infinite (either countable or uncountable) set is always uncountable.
Moreover, the power set of a set is always strictly "bigger" than the original set in the sense that
there is no way to pair the elements of a set S with the elements of its power set P(S) such that
every element of S set is paired with exactly one element of P(S), and every element of P(S) is
paired with exactly one element of S.
Cardinality
The cardinality |S|or n(S) of a set S is "the number of members of S." For example, if B = {blue,
white, red}, |B| = 3.
Empty Set
There is a unique set with no members and zero cardinality, which is called the empty set (or the
null set) and is denoted by the symbol (other notations are used; see empty set).
Special Set
There are some sets which hold great mathematical importance and are referred to with such
regularity that they have acquired special names and notational conventions to identify them.
- Empty Set
2
CMPICA
A.M.Shukla
MA701:FOM Unit1: Set Function and Relation MCA-I
{1} unit set which contain only one element.
P or , denoting the set of all primes: P = {2, 3, 5, 7, 11, 13, 17, ...}.
N or , denoting the set of all natural numbers: N = {1, 2, 3, . . .} (sometimes defined
containing 0).
Z or , denoting the set of all integers (whether positive, negative or zero): Z = {..., 2,
1, 0, 1, 2, ...}.
Q or , denoting the set of all rational numbers (that is, the set of all proper and
improper fractions): Q = {a/b : a, b Z, b 0}. For example, 1/4 Q and 11/6 Q. All
integers are in this set since every integer a can be expressed as the fraction a/1 (Z Q).
R or , denoting the set of all real numbers. This set includes all rational numbers,
together with all irrational numbers (that is, numbers which cannot be rewritten as
fractions, such as 2, as well as transcendental numbers such as , e and numbers that
cannot be defined).
C or , denoting the set of all complex numbers: C = {a + bi : a, b R}. For example, 1
+ 2i C.
Basic Operations
Union AUB = {x|xA or xB}
Intersection - A B = {x|xA and xB}
Complement A-B = {x|xA and x B}
Cartesian Product = AxB = {(x,y)|xA and yB}
Union
Two sets can be "added" together. The union of A and B, denoted by A B, is the set of all
things which are members of either A or B.
Examples:
{1, 2} {red, white} ={1, 2, red, white}.
{1, 2, green} {red, white, green} ={1, 2, red, white, green}.
3
CMPICA
A.M.Shukla
MA701:FOM Unit1: Set Function and Relation MCA-I
{1, 2} {1, 2} = {1, 2}.
Some basic properties of unions:
A B = B A.
A (B C) = (A B) C.
A (A B).
A B if and only if A B = B.
A A = A.
A = A.
Intersection
A new set can also be constructed by determining which members two sets have "in common".
The intersection of A and B, denoted by A B, is the set of all things which are members of both
A and B. If A B = , then A and B are said to be disjoint.
Examples:
{1, 2} {red, white} = .
{1, 2, green} {red, white, green} = {green}.
{1, 2} {1, 2} = {1, 2}.
Some basic properties of intersections:
A B = B A.
A (B C) = (A B) C.
A B A.
A A = A.
A = .
A B if and only if A B = A.
Complement
4
CMPICA
A.M.Shukla
MA701:FOM Unit1: Set Function and Relation MCA-I
Two sets can also be "subtracted". The relative complement of B in A (also called the settheoretic difference of A and B), denoted by A \ B (or A B), is the set of all elements which are
members of A but not members of B.
In certain settings all sets under discussion are considered to be subsets of a given universal set
U. In such cases, U \ A is called the absolute complement or simply complement of A, and is
denoted by A.
Examples:
{1, 2} \ {red, white} = {1, 2}.
{1, 2, green} \ {red, white, green} = {1, 2}.
{1, 2} \ {1, 2} = .
{1, 2, 3, 4} \ {1, 3} = {2, 4}.
If U is the set of integers, E is the set of even integers, and O is the set of odd integers, then U \ E
= E = O.
Some basic properties of complements:
A \ B B \ A for A B.
A A = U.
A A = .
(A) = A.
A \ A = .
U = and = U.
5
CMPICA
A.M.Shukla
MA701:FOM Unit1: Set Function and Relation MCA-I
A \ B = A B.
An extension of the complement is the symmetric difference, defined for sets A, B as
AB = (AB)- (AB)
For example, the symmetric difference of {7,8,9,10} and {9,10,11,12} is the set {7,8,11,12}.
Cartesian Product
A new set can be constructed by associating every element of one set with every element of
another set. The Cartesian product of two sets A and B, denoted by A B is the set of all ordered
pairs (a, b) such that a is a member of A and b is a member of B.
Examples:
{1, 2} {red, white} = {(1, red), (1, white), (2, red), (2, white)}.
{1, 2, green} {red, white, green} = {(1, red), (1, white), (1, green), (2, red), (2, white),
(2, green), (green, red), (green, white), (green, green)}.
{1, 2} {1, 2} = {(1, 1), (1, 2), (2, 1), (2, 2)}.
Some basic properties of Cartesian products:
A = .
A (B C) = (A B) (A C).
(A B) C = (A C) (B C).
Let A and B be finite sets, then|A B| = |B A| = |A| |B|.
Laws of Algebra of Sets
Identity Law
A =A
A U=A
Domination Law
A U=U
6
CMPICA
A.M.Shukla
MA701:FOM Unit1: Set Function and Relation MCA-I
A =
Idempotent Law
A A=A
A A=A
Inverse Law/Complement Law
A A=
AA=U
Involution Law/Double complements Law
(A)=A
Commutative Law
AB=BA
AB=BA
Associative Law
(AB)C= A(B C)
(AB)C= A(B C)
Distributive Law
A(BC)= (AB) (AC)
A (BC)= (AB) (AC)
Absorption Law
A (AB)=A
A (AB)=A
DeMorgans Law
(AB)=AB
(AB)=AB
Equation
n(AB) = n(A)+n(B)-n(AB)
n(ABC) = n(A)+n(B)+n(C)-n(AB)- n(AC)- n(BC)+ n(ABC)
n()=0
7
CMPICA
A.M.Shukla
MA701:FOM Unit1: Set Function and Relation MCA-I
n(A-B) = n(A)- n(AB)
Prove Following Statements
A-B=AB (analytically)
AB=BA (Hint : AB = (AB)- (AB)
A-=A
-=
A-A=
A-U=
U-A=A
A-(BC)=(A-B) (A-C)
A-B=B-A
A=A
A(BC)=(AB) (AC) (use analytical approach)
(A-C) (C-B)= (use analytical approach)
A(B-C)= (A B)-(A C) (use analytical approach)
A-(BC)=(A-B) (A-C) (use analytical approach)
Prove DeMorgans Law
Examples
Ex-1 If A={1,2,3,4,5}, B={x/x2-7x+10=0}, C={x/x2-8x+15=0}.
Verify that A(BC)=(AUB) (AUC).
Ex-2 If A={ x/x2+x-12=0}, B={ x/x3-5x2+6x=0}, Find AUB, AB and A-B
Ex-3 Out of 80 students in a class 60 play football, 53 play hockey and 35 play both game. Find
out following
No of students do not play any of this game.
No of student who play hockey but not football.
Ex-4 In a group of 400 people, 250 can speak English only, and 70 can speak hindi only then
find out following
How many can speak English?
How many can speak Hindi?
How man can speak both?
Ex-5 900Student appeared for 2 papers in mathematics. 740 students passed in paper1 and 660
students passed in paper2. If 640 students passed both then find out who failed in both?
8
CMPICA
A.M.Shukla
MA701:FOM Unit1: Set Function and Relation MCA-I
Ex-6 Find the number of MCAs students at a college taking at least one of the three
programming language C, C++ and Java.
130 study C
90 study C++
42 study Java
40 study C and C++
50 study C and Java
30 study C++ and Java
16 study C,C++and Java
Ex-7 A project review team examines 100 students of MCA 6 th Semester on the basis of
designing, coding and testing and fined that
28 students good in designing
33 students good in coding
14 students good in testing
12 students good in designing and coding
9 students good in coding and testing
6 students good in designing and testing
5 students good in all three.
Then,
Find number of students who are good in either of three aspects (coding, designing and
testing).
Find number of students who are good in neither of three aspects (coding, designing and
testing).
Ex-8 A and B are two sets which contain 3 and 6 number of elements respectively. Find
maximum and minimum cardinality of AUB.
Solution:
n(A)=3, n(B)=6
CASE 1: A and B are disjoint set . i.e. AB= , i.e n(AB)=0
n(AUB)= n(A)+n(B)-n(AB) = 3+6-0=9
CASE 2: A and B are equal set. i.e. A=B, i.e. n(A)=n(B)
But here n(A) n(B) so this case is not possible.
CASE 3: B is subset of A. i.e. n(B)<n(A)
9
CMPICA
A.M.Shukla
MA701:FOM Unit1: Set Function and Relation MCA-I
But here n(B)>n(A) so this case is not possible.
CASE 4: A is subset of B. i.e. n(A)<n(B)
i.e. AB= A
n(AB)=n(A)=3
n(AUB)= n(A)+n(B)-n(AB) = 3+6-3=6
Ans:
Maximum cardinality of AUB : 9
Minimum cardinality of AUB : 6
FUNCTION
To be continue.
10
CMPICA
A.M.Shukla
