CONCEPT

MAP SETS Class XI

OPERATION ON SETS TYPES OF SETS
Infinite set : A set whose elements cannot be listed by the natural
Union Intersection numbers.
AUB
= {x:xE A or xE B} AnB= {x:xe A Equal sets :Two setsA and Bare equal, if they haveexactly the same
and x e B} elements.
A B B
Finite set: Aset consisting offinite number of elements.
Singleton set :Aset having exactly single element.
Empty set :A set having no element.
Equivalent sets: Two finite sets Aand Bare equivalent if they have
same number of elements.
Laws
Universal set : Aset that contains all the sets in the given context.
Description
Subset: Ifeach element of Ais also an element of B,ACB.
Idempotent AUA=A
Every set is a subset ofitself.
AnA= A
Commutative AUB= BUA
Empty set is asubset of everyset.
Total number of subsets of finite set containing n elements is 2",
AnB =BOA
Associative AU(BUC) = (A UB) UC Superset:IfA isa subset of B, then Bis said to be superset of A,
i.e., BDA.
An (BrC) = (An B) nC
Identity Au= UA =A, An=) Powerset:The set of allsubsets of set A.
AnU=UnA=A, AUU= U Proper subset : If A is a subset of B and A #B, then A is called
Distributive AU(BOC) = (AU B) ^ (A UC) proper subset of Bi.e., Ac B.
An (BUC) = (A OB)U(AnC)

Difference Complement
A B= A'=U-A SETS XE A
{x:xe A, x¢ B} means x is an
A B
A
well defined
collection element
of objects. of set A.

IfA,Band Care finite sets, Ube the finite universal set, then Sets can
1.n(A -B) =n(A) -n(AnB) be defined
2. n(AUB) = n(A) +n(B) n(AnB)
in two
3. n(AUB) = n(A)+n(B), if A, Bare disjoint.
4. n(AUBUC) =n(A) +n(B) +n(C) - n(AnB) - n(Brnc) ways :
n(AnC)+n(AnBn)
5. n(A'UB) = (n(A nB))=n(U) - n(AnB)
6. n(A'nB) = (n(A UB)) =n(U)- n(AUB) Roster Form : A
Set Builder

set is described Form: A

by characterising set is described by

. Complement Law:AUA'=U; AnA'= listing elements
property P(x) of
. De Morgans Law : (AUBY = A' nB; (A nBY =A' UB
its element x. separated by
"Law of Double complementation : (A)'=A Commas.
" o= Uand ð =
 CONCEPT
MAP LINEAR INEQUALITIES
Class XI

Slack Strict
Inequality Inequality
Inequalities Inequalities
involving the involving the
symbols symbols 's
ork or
Quadratic
Inequality
An equation of the
form ax?+ bx +c<o
LItera
Inequality
or ax + bx +cs 0.
Inequalities
which involve
ax? + bx +c>0or
ax + bx +c20. variables,

Linear INEQUALITY Numerical

Ineguality
An equation of the Astatement invoBving Inequality
form ax+b<0or the symbols Inequalities
ax + by >0 or which do not
ax +b20 or is called an involve
variables.
ax + by s0. inequality.

Linear Inequality in One Variable Linear Inequality in Two Variable

" Alinear inequality which has only one variable, is called An inequality of theform ax+ by +c>0, ax + by +c<0,
linearinequality in one variable. ax+ by +c20orax+ by +cs0, where at0 and b0, is
called alinear inequalityin two variables xandy.
" Solution of Linear Inequality in One Variable: Any The region containing all the solutions ofan inequality,
solution ofan inequality in one variable is a value ofvariable iscalled the solution region.
which makes it a true statement. The set of all solutions of
an inequality, is called the solution set ofthe inequality. Algorithm
Convert the inequality ax + by +cs0, into equation
Graphical Representation of Intervals on the ax+by+c=0
Real Number Line (x-axis) Draw the straight line ax + by +c= 0 which divides
the plane into two half planes as ax + by + c<0 (or)
ax+by+c>0
()3 ’,xe [3, ), 3 Sx<
Choose a point not on the line if possible (0, 0) and
>xe (-, 4),-<x<4 substitute in the inequation.
(Hi) *e (-15), -1sx<5 Ifthe point satisfies the inequation ax +by +c<0, then
the half plane containing the origin represents the
(iv) *E (-1,0), -1<*<0 inequation and the otherplane represents ax +by +c>0
Note: In case of strict inequality, draw the dotted straight
’ , x e (-o, 2) U 6,)
6 line, otherwise drawthickline.
 CONCEPT
SEQUENCES AND SERIES
MAP Class XI

Sequence Series
A sequence is a Ifa,, a,, .., a is a
function from natural sequence, then the
number N (domain) expansion a, +4, + Sum of n terms of Special Series
to real numbers ta is called the
(codomain) series.

" Sum ofn natural numbersn= n(n+1)

n(n+1)(2n+1)
Sum of squares of nnatural numbers =
Progression 6

" Sum of cubes of nnatural numbersSr(n+1S

If the terms of a
sequence are written Types of
under specific
conditions, then the Progression
sequence is called
progression. " 12+2-3+..+nn +)= M+1)(n4 2)
3

Arithmetic Progression (A.P) Geometric Progression (G.P)

A sequence whose terms increases or Asequence of non-zero numbers for which the ratio of a term to its just preceding term
decreases by a fixed number. is always constant.
nth term:T, =a+ (n - 1)d nterm:T =ar,where rcommon ratio) = T/T, . a= first tem
where d (common difference)
=T-Td= first term, nterm fromend : T= i , l= last term
Sum of n terms
nth term from end
T'=|-(n - 1)d, where
I=last term
a-1),l Means
Sum of n terms Arithmetic mean (A.M.)
For two numbers a and b, A.M. is
S,=2a +(n-)d]=la+]| |-r
ral
a+b
Note 2
" 3 terms in an A.Pa-d,a, a + d.a + 2dote3terms in G.P. alr, a, ar, A, =a+rV=l, 2,..n
"4 terms in an A.P a- 2dad n+1
a+d,a +2d . 4 terms in G.P. alr, alr, a, ar.
Basic Properties
where A, -. A, are n arithmetic
Basic Properties means inserted between two
" If a,, a, a, .. a, are in A.P. with " Ifa,,a,a, .. a are in G.P, with common numbersa and b.
common difference d, then ratio r then
Geometric mean (G.M.)
-a, tx, a, t x, , a, tx are also in also in GP, with Eor two numbers a and b, G.M. is
A.P. where x is constant.
ka,, ka,,.., ka, are also in A.P. with common ratio l/r, Wab
common difference kd.
ka,, ka,, ka, a, or
R a r e also in HVk=l,2,3,...n
(k0) also in G.P, with common ratio r
4,, a,, a', . . a also in G.P. with where G,, . G are n geometric
A.P. with common difference,
common ratio . means inserted between two
ke0. aa =a, 4,.,k= 1,2, 3, .. -1 numbersa and b.
CONCEPT RELATIONS AND
MAP, FUNCTIONS
Class XI / XI,
Name of Function Definition Domain Range Grapb
ldentity The function f: R-’Rdefincd by R
Function fx)xtxcR

2. Constant The functionf: R-R defined by

Function f)=cre R

Polynonial The function f: R-R defined by

Function PPP
and foP P R
VIeR
1 Rational The function f defined by
Function J)where P(x) and Q()
are polynomial functions, Q) = 0
5. Modulus The function f: R’ Rdefined by R (0,)
Function x20
xs R
x<0

Signum The function f: R’R defined by R |-1,0, 1)

Function -1, x<0
f)= *>0

7. Greatest The function f. RR defincd by R 7

Integer
Function r less than
egual loX,xEZ
qua

8. Lincar The function f: RR defincd by

Function f)nx+GxE Rwhere nt and e
are conslants
 Types ef Functiens
RELATIONS
One-one (injective) Function
Notwo clementsofA have same image in B
Risarlation fromA to B(shere A, Be0)
ifRCAx Be RC (( b):acA.bc H) ))=s)
B Dom (R) ={a:(a, b)e R)
Range (R)b:(a, b)e RV ae Al
Onto (Surjecttve) Function
All the elements ofB have atleast one
Cartenian Prodact ef Sets pre-image in A.
(0 nA)2n(B)
() RangeCodomain
Cartesian product of hwo sets A&Bis denoted Bijective Function
and defined as, AxB ((a. b):ae Aand be B) Afunctjon whichisboth one one&onta
Cartesian product of two sets is not commu
tative
() Range =Codomain
Note:
IfntA)=a=n(B). na.ofbijections=a's.
) tntA)p,n(B)=q. then n(Ax B)=px4
() (ab) =(p.q) c>a=p&b=q Composition of Functions
A
functiongof, defined on the
Dyps ef Relatioms
range of function f, is known as
composition of functions. of: A-C

Empty(Void) Relation:RRisvoid. Vg)(x)=

Universal Relation: R-AxBms Ris univeral.
Reflexive Relation : Every clement is related to
itsdfic. Risreflexivein A e>(a, a)e RVaeA.
Symmetric Reation:Ris symmetric in A i (-g0 Algebra of
(a. b)e Ra (ha)e RVa,be A. xe XAis
Transitive Relation : Ris transitive in A constant
(a.b)e R,(hde Ra(4,c)e RVa, b,ce A.
Equivalence Relation : 1f R is reflexive.
symmetric and transitive then Risequivalence.
D Antisymmetric Relation: Ris antisymmetric it
(a,b)e R. (h,a)e Ra=k xeX xeX.gx) 0
ldentity Relation : R= (a, a) Vae A] is an
identity relation in A.
Inverse Relation:Risthe inverse relation ofR ceXs an
if(a, b)e Res (ha)e R identity element it

Note:Dom (R)= Range (R A

Range (R) -Dom (Ry
A binary
Associative: operation Commatative:
(ab)c= on a set Ais
FUNCTIONS a(bec)Va,
function from
ab=ba

ceA VabeA
AxA+A

Ardation (E ) where every element of set A

ae Aisinvertible
has only one image in set B for if3be Ast.
Dom()=(a:(a,b) ef) abuezb ta
B Range ()b:(a, b)efVac A) Va.be A