Cbse Xii Volume 1 - Formulae and Concepts
Cbse Xii Volume 1 - Formulae and Concepts
Cbse Xii Volume 1 - Formulae and Concepts
VOLUME 1
FORMULAE AND CONCEPTS
-2-
1. Relation in Mathematics means the connection between the elements of one set to the
elements of another set.
2. The relation is defined from one set which is Domain to another set which is Range.
3. To define any relation, we need three things: Domain set, Range set and the rule of the
Relation.
4. Examples of few Relations are : Greater than, Equal to, Parallel to, square of.
-3-
5. If a Relation is expressed as an ordered pair, the set of all first elements are called
Domain and the set of all second elements are called Range.
Example : Let R be { ( 2, 4 ), ( 2, 6 ), ( 2, 8 ), ( 3, 6 )}
Domain is { 2, 3 } Range is { 4, 6, 8 }
The Relation is ‘factor of’
7. Types of Relations :
a. Reflexive Relation :
b. Identity Relation :
[ Note : All Identity Relations are Reflexive Relations but all Reflexive Relations need
not be Identity Relations.]
c. Symmetric Relation :
-5-
If an element ‘a’ related to another element ‘b’ ⇒ ‘b’ is related to ‘a’ then R is
symmetric. 𝐼𝑓 𝑎 𝑅 𝑏 ⇒ 𝑏 𝑅 𝑎 𝑡ℎ𝑒𝑛 𝑅 𝑖𝑠 𝑠𝑦𝑚𝑚𝑒𝑡𝑟𝑖𝑐.
Ex : If a line AB is perpendicular to line CD, then line CD will be perpendicular to line AB.
Hence the Relation ‘perpendicular to ‘ is symmetric in a set of lines in a plane.
d. Transitive Relation :
If in a Relation, a R b and b R c ⇒ a R c , then R is Transitive.
Ex : Consider the Relation “ greater than “ . 8 > 5 and 5 > 3 ⇒ 8 > 3 . R is Transitive.
[ NOTE on TRANSITIVITY of a Relation :
A Relation is not transitive only if (𝒂, 𝒃) ∈ 𝑹 𝒂𝒏𝒅 (𝒃, 𝒄) ∈ 𝑹 , 𝒃𝒖𝒕 (𝒂, 𝒄) ∉ 𝑹. If in a
Relation (𝒂, 𝒃 ) ∈ 𝑹 𝒃𝒖𝒕 𝒕𝒉𝒆𝒓𝒆 𝒊𝒔 𝒏𝒐 𝒆𝒍𝒆𝒎𝒆𝒏𝒕 (𝒃, 𝒄 )𝒊𝒏 𝑹 𝒕𝒉𝒆𝒏 𝒂𝒍𝒔𝒐 𝑹 is transitive. ]
f. Universal Relation :
[Note : Void Relation and Universal Relations are sometimes called as trivial Relations ]
1. Equivalence relation of any set A to A with minimum possible elements will be the set
containing only reflexive pairs of elements.
2. Equivalence relation of any set A to A with maximum possible elements will be the set
containing all elements of A X A.
3. Other possible equivalence relations of any set A to A will be the set containing
reflexive pairs of elements and one symmetric pair.
𝑹𝟒 = { (𝒂, 𝒂), (𝒃, 𝒃), (𝒄, 𝒄), (𝒃, 𝒄), (𝒄, 𝒃)}
𝑹𝟓 = { (𝒂, 𝒂), (𝒃, 𝒃), (𝒄, 𝒄), (𝒂, 𝒃), (𝒃, 𝒂), (𝒃, 𝒄), (𝒄, 𝒃), (𝒂, 𝒄), (𝒄, 𝒂)}
There are 5 possible equivalence relations.
Point to be remembered :
1. Total number of relations possible from a set of ‘m’ elements to a set of ‘n’ elements is
𝟐𝒎𝒏 .
-9-
If a set A consists of ‘m ‘ elements and set B consists of ‘n’ elements and the relation R is
from A to B, then the total number of relations possible from A to B is 2𝑚𝑛 .
2
2. Number of Relations from A to A if A has ‘n’ elements -- 2𝑛
𝟐 −𝒏
3. Number of Reflexive Relations possible in a set A which has ‘n’ elements -- 𝟐𝒏
𝟐 +𝒏)/𝟐
4. Number if symmetric Relations possible in a set A which has ‘n’ elements – 𝟐(𝒏
FUNCTIONS
Consider the following ordered pairs: Notice the 𝑥- coordinates (First element alone)
1. {(1, 5), (3, 6), ( -4, 7)} – No first Element is repeated. So, this Relation is a Function.
2. {(2, 5), (3, 7), (6, 7)}—No First Element is repeated. So, this Relation is a Function. The
repetition of the second element will not affect whether a relation is a function or not.
3. {(2, 0), (5, 4), (2, 5)} The first element ‘2’ is repeated in two ordered pairs. So, this
Relation is not a function.
You can find whether a given graph is a function or not, using vertical line test easily.
If you draw vertical lines parallel to Y-axis, corresponding to each X, and if each X has
only one y value the graph is a function. Otherwise it is not a function.
- 12 -
Do you understand the vertical line test to find whether a given graph is a function or not?
TYPES OF FUNCTIONS :
There is no element in the Codomain , [image set / second set ] for which there is no
pre-image. Codomain and range are the same.
The range of ‘ f ’ ≠ the co-domain of ‘ f ’. [At least one extra element in the co-domain
which doesn’t have pre – image. Co-domain will be > Range.]
Every mathematical function, from the simplest to the most complex, has an inverse. In
mathematics, inverse usually means opposite.
For addition, the inverse is subtraction. For multiplication, it is division. And for
trigonometric functions, it is the inverse trigonometric functions.
Trigonometric functions are the functions of an angle.
The inverse trigonometric functions are used to determine the angle measure.
𝜋 1 1 𝜋
Example : sin 6 = sin−1 2 =
2 6
The value of an inverse trigonometric functions which lies in its principal value branch is
called the principal value of the inverse trigonometric functions.
- 23 -
Range
Function Domain ( Principal value
branches)
𝛑
10. 𝐬𝐢𝐧−𝟏 𝐱 + 𝐜𝐨𝐬 −𝟏 𝐱 = , 𝐱 ∈ [ −𝟏, 𝟏]
𝟐
𝛑
11. 𝐭𝐚𝐧−𝟏 𝐱 + 𝐜𝐨𝐭 −𝟏 𝐱 = , 𝐱 ∈𝐑
𝟐
𝛑
12. 𝐜𝐨𝐬𝐞𝐜 −𝟏 𝐱 + 𝐬𝐞𝐜 −𝟏 𝐱 = , | 𝐱| ≥ 𝟏
𝟐
𝐱+𝐲
13. 𝐭𝐚𝐧−𝟏 𝐱 + 𝐭𝐚𝐧−𝟏 𝐲 = 𝐭𝐚𝐧−𝟏 𝟏−𝐱 𝐲 , 𝐱 𝐲 < 𝟏
𝐱−𝐲
14. 𝐭𝐚𝐧−𝟏 𝐱 − 𝐭𝐚𝐧−𝟏 𝐲 = 𝐭𝐚𝐧−𝟏 𝟏 + 𝐱 𝐲 , 𝐱 𝐲 > 𝟏
𝟐𝐱
15. 2 𝐭𝐚𝐧−𝟏 𝐱 = 𝐬𝐢𝐧−𝟏 𝟏+ 𝐱𝟐 , |𝐱| ≤ 𝟏
𝟐
−𝟏 −𝟏 𝟏−𝐱
16. 2 𝐭𝐚𝐧 𝐱 = 𝐜𝐨𝐬 , x≥0
𝟏+ 𝐱 𝟐
𝟐𝐱
17. 2 𝐭𝐚𝐧−𝟏 𝐱 = 𝐭𝐚𝐧−𝟏 𝟏− 𝐱𝟐 , − 1 < x<1
- 26 -
𝐬𝐢 𝐧 𝜽 = 𝒙 𝜽 = 𝒔𝒊𝒏−𝟏 𝒙 ------------------ ①
𝒄𝒐𝒔 𝜽 = √𝟏 − 𝒙𝟐 𝜽 = 𝒄𝒐𝒔−𝟏 √𝟏 − 𝒙𝟐 ----------②
𝒙 𝒙
𝒕𝒂𝒏 𝜽 = 𝜽 = 𝒕𝒂𝒏−𝟏 -----------③
√𝟏−𝒙𝟐 √𝟏−𝒙𝟐
Similarly you can express in terms of other inverse trigonometric ratios also.
- 27 -
• Two matrices are equal only when they are of the same order and their corresponding
elements are equal.
• Matrix addition and subtraction is possible only when the matrices are of the same
order.
• To multiply a matrix by a scalar, multiply each element of the matrix by that scalar.
• Matrix multiplication is defined when the number of columns of the first matrix =
number of rows of the second matrix.
• Matrix multiplication is not commutative but is associative. [ 𝐴 𝐵 ≠ 𝐵𝐴 .
𝐴(𝐵𝐶 ) = (𝐴𝐵)𝐶 .
• Identity matrix is a square matrix in which the main diagonal elements are ‘1’ and all
other elements are ‘0’.
1 0
• Identity matrix of order 2 is [ ] and is referred as 𝐼2 .
0 1
- 29 -
1 0 0
• Identity matrix of order 3 is [0 1 0] and is referred as 𝐼3 .
0 0 1
• Identity matrix is called as the multiplicative identity of matrix, since 𝐴𝐼 = 𝐼𝐴 = 𝐴.
• If the rows and columns of a matrix A are interchanged then the resulting matrix is the
Transpose Matrix of A and is represented as 𝑨𝑻 𝒐𝒓 𝑨′ .
• (𝑨𝑻 )𝑻 = 𝑨
• (𝑨 ± 𝑩 )𝑻 = (𝑨𝑻 ± 𝑩𝑻 )
• (𝑨𝑩)𝑻 = 𝑩𝑻 𝑨𝑻 Reversal Law
• (𝑨𝑩𝑪)𝑻 = 𝑪𝑻 𝑩𝑻 𝑨𝑻 Reversal Law
• (𝑲𝑨)𝑻 = 𝑲 (𝑨)𝑻 𝒘𝒉𝒆𝒓𝒆 𝑲 𝒊𝒔 𝒂 𝒔𝒄𝒂𝒍𝒂𝒓.
• 𝑨𝑨−𝟏 = 𝑨−𝟏 𝑨 = 𝑰
• If 𝑨 𝑩 = 𝑰 then A is invertible and B is the inverse of A and A will be the inverse of B.
• A rectangular matrix does not possess an inverse Matrix.
• (𝑨𝑩)−𝟏 = 𝑩−𝟏 𝑨−𝟏
DETERMINANTS
• Every square matrix A can be associated with a number which is called determinant of the
square matrix A.
- 32 -
𝑴𝒊𝒋 𝒊𝒇 𝒊 + 𝒋 𝒊𝒔 𝒆𝒗𝒆𝒏
• 𝑨𝒊𝒋 = {
−𝑴𝒊𝒋 𝒊𝒇 𝒊 + 𝒋 𝒊𝒔 𝒐𝒅𝒅
• If the elements of a row or column are multiplied with the co-factors of any other row
or column, then their sum is ‘0’.
𝑬𝒙 ∶ 𝒂𝟏𝟏 𝑨𝟐𝟏 + 𝒂𝟏𝟐 𝑨𝟐𝟐 + 𝒂𝟏𝟑 𝑨𝟐𝟑 = 𝟎 ; [ 𝒂𝟏𝟏 , 𝒂𝟏𝟐 , 𝒂𝟏𝟑 are first row elements. They
are multiplied with the co-factors of second row elements. Hence their sum is zero.
Similar results will hold good for elements of other rows and columns.]
• If the elements of a row or column are multiplied with the co-factors of its own
elements, then their sum is equal to the determinant value.
𝑬𝒙 ∶ 𝒂𝟏𝟏 𝑨𝟏𝟏 + 𝒂𝟏𝟐 𝑨𝟏𝟐 + 𝒂𝟏𝟑 𝑨𝟏𝟑 = ∆ ( 𝒅𝒆𝒕𝒆𝒓𝒎𝒊𝒏𝒂𝒏𝒕 𝒗𝒂𝒍𝒖𝒆) [ You can write similar
results for other 2 rows and the 3 columns ]
- 34 -
𝟏
• Inverse of a matrix A is A-1 = |𝑨| Adj A ; ( Adj A = ( Ai j ) T Transpose of the Co-factor
Matrix.)
• A square matrix is singular if the determinant value = 0 .
• If |𝐴| = 0, ( singular matrix ) then A-1 does not exist.
A-1 will exist only if the matrix is non-singular.
• Area of a triangle with vertices (𝒙𝟏 , 𝒚𝟏 ), (𝒙𝟐 , 𝒚𝟐 ) 𝒂𝒏𝒅 (𝒙𝟑 , 𝒚𝟑 ) using determinants is
𝒙𝟏 𝒚𝟏 𝟏
𝟏
𝑨 = 𝟐 |𝒙𝟐 𝒚𝟐 𝟏|.
𝒙𝟑 𝒚𝟑 𝟏
• The condition that three points (𝒙𝟏 , 𝒚𝟏 ), (𝒙𝟐 , 𝒚𝟐 ) 𝒂𝒏𝒅 (𝒙𝟑 , 𝒚𝟑 ) are collinear is the area
𝒙𝟏 𝒚𝟏 𝟏
of the triangle formed by the three points = 0 ⇒ |𝒙𝟐 𝒚𝟐 𝟏| = 𝟎
𝒙𝟑 𝒚𝟑 𝟏
• |𝒌 𝑨| = 𝑲𝒏 | 𝑨| where ‘n’ is the order of the matrix A.
- 35 -
• A A-1 = A-1 A = 𝑰
• 𝑰A==AI=A
𝑻
• (𝑨−𝟏 ) = (𝑨𝑻 )−𝟏
• (𝑨 𝑩)−𝟏 = 𝑩−𝟏 𝑨−𝟏
𝟏 𝟏
• |𝑨−𝟏 | = |𝑨|
[ A 𝑨−𝟏 = 𝑰 ⇒ |𝑨| |𝑨−𝟏 | = |𝑰| = 𝟏 ∴ |𝑨−𝟏 | = |𝑨|
]
• |𝑨 𝑩| = |𝑨| |𝑩|
• 𝒂𝒅𝒋 (𝑨𝑩) = (𝒂𝒅𝒋 𝑩) (𝒂𝒅𝒋 𝑨)
• A ( Adj A) = ( Adj A ) A = |𝑨| 𝑰
• Adj ( ( 𝑨𝑻 ) = ( Adj A )T
• |𝑨𝒅𝒋 (𝑨)| = |𝑨|𝒏−𝟏
• 𝒂𝒅𝒋 (𝒂𝒅𝒋 𝑨) = |𝑨|𝒏−𝟐 𝑨
𝟐
• |𝒂𝒅𝒋 (𝒂𝒅𝒋 𝑨)| = |𝑨|(𝒏−𝟏)
- 36 -
• (𝑨−𝟏 ) ─ 1 = A
• 𝑰𝒇 𝑨 = [𝒂𝒊𝒋 ] 𝒊𝒔 𝒂 𝒅𝒊𝒂𝒈𝒐𝒏𝒂𝒍 𝒎𝒂𝒕𝒓𝒊𝒙 𝒐𝒇 𝒐𝒓𝒅𝒆𝒓 𝒏, 𝒕𝒉𝒆𝒏 |𝑨| = 𝒂𝟏𝟏 . 𝒂𝟐𝟐 . 𝒂𝟑𝟑 − −𝒂𝒏𝒏
• 𝑰𝒇 𝑨 = [𝒂𝒊𝒋 ] 𝒊𝒔 𝒂 𝒕𝒓𝒊𝒂𝒏𝒈𝒖𝒍𝒂𝒓 𝒎𝒂𝒕𝒓𝒊𝒙 𝒐𝒇 𝒐𝒓𝒅𝒆𝒓 𝒏, 𝒕𝒉𝒆𝒏 |𝑨| = 𝒂𝟏𝟏 . 𝒂𝟐𝟐 . 𝒂𝟑𝟑 − −𝒂𝒏𝒏
• 𝑰𝒇 𝑨 𝒊𝒔 𝒔𝒌𝒆𝒘 − 𝒔𝒚𝒎𝒎𝒆𝒕𝒓𝒊𝒄 𝒎𝒂𝒕𝒓𝒊𝒙 𝒐𝒇 𝒐𝒅𝒅 𝒐𝒓𝒅𝒆𝒓, 𝒕𝒉𝒆𝒏 |𝑨| = 𝟎
• 𝑰𝒇 𝑨 𝒊𝒔 𝒔𝒌𝒆𝒘 − 𝒔𝒚𝒎𝒎𝒆𝒕𝒓𝒊𝒄 𝒎𝒂𝒕𝒓𝒊𝒙 𝒐𝒇 𝒆𝒗𝒆𝒏 𝒐𝒓𝒅𝒆𝒓, 𝒕𝒉𝒆𝒏 the determinant value is a
perfect square.
- 37 -
DIFFERENTIATION
𝒅𝒚
Sl. No Y 𝒅𝒙
1. 𝒙𝒏 𝒏 𝒙𝒏−𝟏
2. 𝒆𝒙 𝒆𝒙
3. log 𝒙 𝟏/𝒙
4. ‘c’ – constant 0
5. Sin𝒙 𝒄𝒐𝒔 𝒙
6. 𝒄𝒐𝒔 𝒙 − 𝒔𝒊𝒏 𝒙
7. 𝒕𝒂𝒏 𝒙 𝒔𝒆𝒄𝟐 𝒙
8. 𝒄𝒐𝒔𝒆𝒄 𝒙 − 𝒄𝒐𝒔𝒆𝒄 𝒙 𝒄𝒐𝒕 𝒙
- 38 -
21. Function of a function (or) Chain Rule dy/dx = (dy/du ) (du/dv) (dv/dx)
APPLICATION OF DERIVATIVES
( a ) If f ′(𝑥) > 0 for each 𝑥 ∈ (a, b) then f is strictly increasing in the interval (a, b).
( b ) If f ′(𝑥) < 0 for each 𝑥 ∈ (a, b) then f is strictly decreasing in the interval (a, b).
𝐝𝐲
at (𝒙𝟏 , 𝒚𝟏 ) = m
𝐝𝐱
𝐝𝐲
• If the tangent is parallel to x axis, =0
𝐝𝐱
𝐝𝐲 𝐝𝐱
• If the tangent is parallel to y axis, 𝐝𝐱 = ∝ or 𝐝𝐲 = 0
• If two lines are parallel then their slopes are equal. m1 = m2
• If the angle between two curves ( angle between the two tangents at the point of
intersection) is 900 , then they are said to cut orthogonally.
• If the Tangent or normal to the curve at ( x1, y1 ) makes equal intercepts with the
coordinate axes , then slope of the tangent or normal = ± 1
• If the tangents are equally inclined with the axes, then slope of the tangents m = ± 1 .
- 43 -
MENSURATION FORMULAE
- 44 -
6. A wire of length 28 m is to be cut into two pieces. One of the piece is to be made into a
square and the other into a circle.
Let the lengths of the two pieces be 𝒙 𝒎 𝒂𝒏𝒅 𝟐𝟖 − 𝒙 𝒎.
Let 𝒙 𝒎 be made into a circle and 𝟐𝟖 − 𝒙 𝒎 be made into a square.
𝒙 𝒎 = 𝒑𝒆𝒓𝒊𝒎𝒆𝒕𝒆𝒓 𝒐𝒇 𝒕𝒉𝒆 𝒔𝒒𝒖𝒂𝒓𝒆 𝒂𝒏𝒅 𝟐𝟖 − 𝒙 𝒎 = 𝒑𝒆𝒓𝒊𝒎𝒆𝒕𝒆𝒓 𝒐𝒇 𝒄𝒊𝒓𝒄𝒍𝒆.
- 47 -