CA Foundation – Mathematics, Stats and LR | Revision Notes | Set Function and Relations

SET

Set means Collection

ollection of well
well-defined distinct objects. It is usually denoted by capital letter
l
Element Each object of set is called as element.. It is usually denoted by small letter
Braces Form When set shown as a list of elements within braces { } e.g. A = {1,3,5,7
1,3,5,7}
Descriptive Form Set can be present
presented in statement form e.g. A = set of first four odd numbers
Here Set is written in the algebraic form in this format –
Set-Builder or
{𝑥: 𝑥 satis ies some properties or rule}. The method off writing this form is
Algebraic form
called as Property or Rule method
It is denoted d by ‘∊’, a ∊ A means that element a is one of the element of Set A A. ∉
Belongs to
used for do not belongs to.
Set A is a subset of Set B if all the elements of Set A also exist iin Set B. It is
Subset
denoted as - A A⊂B
Proper Subset A is a proper subset of B if A is a subset of B and A A≠B
Improper Subset Two equal sets are improper subsets of each other
Null Set A set having no elements is called as Null or Empty Set. It is denoted by ϕ
No. of subsets Formula: no. of subsets = 2n, no. of proper subsets = 2n-1
Intersection Intersection
ion set of A and B is a set that contains common elements between
denoted by [A∩B] both of the sets
Union Union set of A and B is a set that contains all the elements contained in both the
denoted by [A∪B] sets without repeating the common elements
The set which contains all the elements under consideration in a particular
Universal Set
problem is called the universal set generally denoted by S
A complement set of set P is a set that contains all the elements contained in
Complement Set
the universe other than elements of P P. It is denoted by P’ or Pc
A-BB is a set that contains elements of A other than those which are common in
Set (A-B)
A and B. [A-B B = A - A∩B]
1. (P∪Q)’’ = P’∩Q’
De Morgan’s Law
2. (P∩Q)’’ = P’∪Q’

S
Universal
Set

Union Set
A B
A
A∪B

Venn Diagrams

Intersection
A B
Set A∩B

Set A
A-B A B

2 sets – Formula n(A∪B) = n(A) + n(B) – n(A∩B)

3 sets – Formula n(A∪B∪C)
C) = n(A) + n(B) + n(C) – n(A∩B) –n(B∩C) –n(C∩A)) + n(A∩B∩C)
n(

Learn with CA. Pranav

 CA Foundation – Mathematics, Stats and LR | Revision Notes | Set Function and Relations

A or B , atleast A or B, either A or B A∪B

Venn Diagram A and B, Both A and B A∩B
related some Only A means A−B
basics Only B means B−A
Neither A nor B (A∪B)’
Cardinal Number No. of distinct elements contained in a finite Set A is called Cardinal Number.
For Set A = {4,6,8,3}, cardinal no. n(A) = 4
Equivalent Set Two sets A and B are equivalent sets if n(A) = n(B)
Power Set Collection of all possible subsets of a given set A is called Power set of Set A. It
is denoted by P(A)
Ordered Pair Pair of two elements both taken from different Sets. E.g. if a∊A and b∊B then
ordered pair is (a,b) where first element will always from A and second always
from B in every pair
Product of Sets Also called as Cartesian Product. If A and B are two non-empty sets, then set of
all the ordered pairs such that a∊A and b∊B is called as Product Set. It is
denoted by A×B. [A×B = {(a:b): a∊A and b∊B}]
Why Product? n(A×B) = n(A) × n(B) i.e. cardinal no. of product set is equal to product of
cardinal no. of each set

FUNCTION

Relation Any subset of product set is called A×B is said to define relation from A to B.
It’s any collection of ordered pairs taken from a product set.
Function (set A relation where no ordered pairs have same first elements is called Function.
based definition) First element of the ordered should not be repeated in the relation set. (a,b) all
a should be unique for different values of b
Function (non set A rule which associate all elements of A to B is called function from A to B. It is
based definition) denoted by 𝑓: 𝐴 → 𝐵 or 𝑓(𝑥) of B
Image, Pre-image 𝑓(𝑥) is called the image of 𝑥 and 𝑥 is called the pre-image of 𝑓(𝑥)
Pre-image is input and Image is output
Domain, Co- Let 𝑓: 𝐴 → 𝐵, then A is called domain of f and B is called the co-domain of f.
domain, Range Set of all the images (contained in B) of pre-images taken from A is called
Range. Domain is a set of all pre-images and Range is a set of all images. Also
Range is a subset of Co-domain.
Types of Let 𝑓: 𝐴 → 𝐵, if different elements in A have different images in B
One-One
Functions Function then f is one-one or injective function or one-one mapping
Onto Let 𝑓: 𝐴 → 𝐵, if every element in B has at least one pre-image in
Function A, then f is an onto or surjective function
Into Let 𝑓: 𝐴 → 𝐵, if even a single element in B is not having pre-image
Function in A, then it is said to be into function
Bijection If a function is both one-one and onto it is called as Bijection
Function Function
Identity If domain and co-domain are same then function is identity
Function function Let 𝑓: 𝐴 → 𝐴 𝑎𝑛𝑑 𝑓(𝑥) = 𝑥
Constant If all pre-images in A will have a single constant value in B then
Function the function is constant function
Equal Function Two functions f and g are said to be equal function if both have same domain
and same range
Inverse Function Let 𝑓: 𝐴 → 𝐵, is a one-one and onto function. Every value of 𝑥 (preimage)will
give unique image 𝑓(𝑥) using f. If there is a function that takes value of images
as input and gives pre-images as output, such function is called inverse
Learn with CA. Pranav
 CA Foundation – Mathematics, Stats and LR | Revision Notes | Set Function and Relations

function. It is denoted as 𝑓 : 𝐵 → 𝐴.

Composite A function of function is called composite function. Example: if

Function 𝑓 𝑎𝑛𝑑 𝑔 are functions, then 𝑓[𝑔(𝑥)]𝑎𝑛𝑑 𝑔[𝑓(𝑥)]are composite functions. Also
called as 𝑓𝑜𝑔 𝑜𝑟 𝑔𝑜𝑓

RELATION

Relations Any subset of product set is called A×B is said to define relation from A to B.
It’s any collection of ordered pairs taken from a product set.
Domain and If R is a relation from A to B, then set of all first elements of ordered pairs is
Range domain and set of all second elements of ordered pairs is range.
Reflexive If S is a universal set, S = {a,b,c …} then R is a relation from S to
S. If this R contains all the ordered pairs in the form (a,a) in
S×S, then it is a reflexive relation
Types of Relation Symmetric If (a,b) ∊ R, then if (b,a) ∊ R then R is called Symmetric
Transitive If (a,b) ∊ R and also (b,c) ∊ R, then if (a,c) ∊ R such relation is
Transitive. [ if in a relation only (a,b) is present but (b,c) is not
present we will consider it as transitive relation]
Equivalence If a relation is Reflexive, Transitive and Symmetric as well, then it is called as
Relation Equivalence Relation

Learn with CA. Pranav