Professional Documents
Culture Documents
Summary of
various chapters
1|Page
Contents
2|Page
Ch. 1: Relations and Functions- Summary
Cartesian product:
Types of Relations
3|Page
3. Reflexive relation, if (a,a) ∈ R, for all a ∈ A.
4. Symmetric, if (a1, a2) ∈ R implies that (a2, a1) ∈ R, for all a1, a2 ∈
A.
5. Transitive, if (a1, a2) ∈ R and if (a2, a3) ∈ R, implies (a1, a3) ∈ R,
for all a1, a2, a3 ∈ A.
6. A relation R in a set A is said to be an equivalent relation if R is
reflexive, symmetric and transitive.
Types of Functions
4|Page
For a one to one and onto function f from A to B, then function h which
associates each element y ∈ B to only one element x ∈ A such
that y=f(x), then x=h(y) and h is the inverse function of f.
h=f−1
5|Page
Formulae
6|Page
Ch.3: Matrices- Summary
7|Page
Matrix: A matrix is an ordered rectangular array of numbers or
functions. The numbers or functions are called the elements or the
entries of the matrix.
The horizontal lines of elements are said to rows of the matrix and the
vertical lines of elements are said to columns of the matrix.
Order of a matrix: A matrix having m rows and n columns are called a
matrix of order m×n
Addition of matrices:
The sum of two matrices is a matrix obtained by adding the
corresponding elements of the given matrices. Furthermore, the two
matrices have to be of the same order.
8|Page
If A is a matrix and k is a scalar, then kA is another matrix which is
obtained by multiplying each element of A with the scalar k.
Symmetric Matrix
A square matrix A = [aij] is said to be symmetric if A′ = A,i.e.,[aij] =[aji] for
all possible values of i and j.
9|Page
Inverse of a Matrix:
10 | P a g e
Ch. 4: Determinants- Summary
11 | P a g e