Algebra Sets:

Union: A union of tub sets A and B us the set of all those elements which belong to either A
or B or both A and B denoted by AUB

Intersection: The intersection of the two sets A and B is the set of all those elements that
belong to both A and B denoted by

Difference of Sets: - The difference of Set A and B is denoted by A-B is the set of all elements
belongs A and does not belong to B

Symmetric Differences: The symmetric difference of set A and B is the set

and denoted by .
Complement of a Set: The set of All elements belongs to universal set except the defined set
is the complement of the defined set denoted by for set A.

Law of Algebra on Sets:-

Let A, B, C are any three Sets

1. (Idempotent law)
2. (Identity law)
3. (Commutative law)
4. (Associative law)

5. (Distributive laws)
6. (Distributive laws)
7. (Demorgans law)
8.

9.

10.

11.

12.
 13.

Some Important Results.

If A, B and C are three finite sets and be the finite universal set there

1.

2. - where A and B are disjoint sets

3.

4.

5.
6. No. of elements in exactly two of the sets A, B, C is

7. No. of elements is exactly one of the sets A, B, C

8.

9.
Relations: -
Cartesian product of sets
If A and B are two non empty sets, then the set of all ordered pairs (a, b) such that is
and is called The Contesive product of the set A with set B denoted by

Relation: If A and B are two sets, then a relation R from is a subset of

If , then indicates that is related to

Domain:If R is the relation from set A to set B, then the set of all first components of

the ordered pair of belongs to R is known as domain of R.

Range:If R is the relation form set A to set B, then the set of all second components

of the ordered pair of belongs to R is known as the Range.

Inverse Relation:If A and B are two sets and R be a relation from A to B. There the
inverse of r denoted by is a relation from B to A obtained by from R, by
interchanging the components of ordered pairs is R
Relation on A set: If A is a non-empty set, then a relation from A to itself i.e, subset
of is called a relation on set A
Types of Relations:
Reflexive : A Relation R onset A is said to the reflexive if Every element of A is related
to itself.

Symmetric: A relation R on set A is said to be symmetric if and only if

Transtitive:A relation R on set A said to be transitive if and only if

Equivalence: A relation on set A said to be equivalence if and only if

I. If it is reflexive

II. If the symmetric

III. If it is transitive

Void or empty relation:-If A be a non empty set then and so it is a subset

of A.
Universal Relation:If A is a non empty set. Then is known as universal
Relation.
Identity Relation:A relation on a non empty set A said to be Identity relation, if every
element of A related to itself.
Antisymmetric Relation:if two Non empty sets A, B said to be antisymmetric if

A and B are subsets of universal set of

Composition of relations:If R and S are two relations from set A to set B and set B to
set C respectively

There if SOR from A to C such that

Then exists some such that and

 Note 1:
Note2: If there are ‘n’ number of elements is set A the no. of different reflexive relation on
set

The no. of different symmetric relations onset

Functions
Definition of a function as a Relation : A non empty subset of is a function
from A to B if each element of A appears in some ordered pair is f and no two

ordered pairs in f have the same first element such that

Definition of a function as a correspondence.
If A and B are two non empty subsets, then a function f from A to B is a rule or
method or correspondence which associates elements of set A to elements of set B.
such that
I. All elements of set A are associated with elements in set B
II. Each element of set A is associated to a unique element is set B.

Denoted by

Of is associated with then is called the f image of or image of a

under f or the value of the function f at a.

Also is called the preimage of b under f.

of then set A is known as the domain of function f. and B is known as the co-
domain of function f.

The set of all f images of element in A Set A is called the range of the function ‘f’ from set A
to set B.

Equal functions: two functions are said to be equal iff

1. Domain of A= Domain of C
2. Codomain of B = Co domain of D

3. for every x belongs to their common domain

No. of functions- If A and B are two finite sets having ‘m’ and ‘n’ elements respectively.
Then each element of set A can be associated to any one of ‘n’ elements of set B. then
the total number of functions can be defined for ‘m’ no. of elements of set A is ‘n’
Hence the total no. of functions are

Kind of functions:

One-one function:A function is said to be one-one function or Injective

function if different elements of set A have different elements in set B

Of is not one-one, it is called many-one method of checking Injectivity of a

function

Algebric Method:

Step 1: take two arbitrary elements x, y is domain f

Step 2: Put and simplify. If we get . Then f is one-one otherwise

many-one

Graphical Method:

1. Draw the curve

2. If every line parallel to X-Axis cuts the curve exactly at one point, then is one-

one. It implies that the curve representing has no bend or turn.

If the parallel line cuts at more than me point is many-one function.

Calculation Method: If a function (A and B one subsets of R) is one-one

function iff it is either strictly increasing or strictly decreasing

No. of one-one functions: of where set A has got number of elements.

Then the total no. of one-one functions can be defined are

On-to function or Surjective function

A function is said to be an onto function or a surjective function if every

element of B is that f-image of some element of A

i.e or Range of f is the codomain of f

If is not onto it is called into function.

Method of checking Subjectivity

Step 1: Choose an arbitrary element y is B.

Step 2: Put

Step 3: Solve the equation and obtain x in terms of y is

If for all values of ; the values obtained from are in ‘A’

Then f is on-to

Otherwise it is into.

No. of onto Functions: -of A and B are two sets having ‘m’ and ‘n’ no. of elements
respectively and then the no. of onto functions

From A to B are equal to

Bijective (one-one onto) Function: A function is called a bijection if it is one-

one as well as onto

If is bijective function. There set A and Set B must have same no. of elements.

Composite functions: If , are two functions such that

 , then there exists a function such that

for all

Similarly, of and

Such that the range ; there exists a function such

that

Identity function:If A is a non empty set, A function is said to an identity

function onset A if f associates every element of set A to that element it set is denoted
by .

is bijection A.

Properties of Composite Functions:

1. The composition of two functions is not commutative

2. The composition of functions is associative

3. The composition of two bijective is a bijection.
4. The composition of any function with identity functions is the function itself

5. If are two functions such that . Then f is an injection g

is a surjection
6. If are two functions such that then f is a surjection
and g is an injection.
7. If and be two factions. Three case

Case a) If

Case b) If

Case c) If is one-one Then

Case d) If is onto
Inverse of Function:if . Then a function then a function

which associates each element of to a unique element such that

is called the inverse of f

denoted by

Then f is a bijection.

Properties of Inverse Function:

1. The inverse of a bijection is unique.
2. The inverse of a bijection is also a bijection
3. If is a bijection is a bijection and inverse of f, then
where and are Identity function of A and B respectively
4. If are bijections such there

5. If are two functions such that then f and

g are bijections. and

Method of finding the inverse of a Bijection.

Step I: Obtain the bijection as

Step II: Put where and

Step III: solve and obtain

Step IV: Replace x by

Method II

Step I: Obtain the bijection as

Step II: Replace by x and x by

Step III: Simplify the relation to get

So far the above are corrections.

Very good work .Thank you .

please incorporate the suggested changes .

, if case of any doubt , please feel free to call on 9010336338