Linear Algebra Important Points

The determinant is only valid for the square matrix.

i.
ii.
iii.

iv. , here is the matrix.

v. If two rows (or two columns) of a determinant are
interchanged, the sign of the value of the determinant
changes.
vi. If in determinant any row or column is completely zero, the
value of the determinant is zero.
vii. If two rows (or two columns) of a determinant are identical,
the value of the determinant is zero.

It is valid for both square and non-square matrix.

Let and are two matrices then, the resultant matrix is


, has

i. Number of elements
ii. Number of multiplication
iii. Number of addition

______________________________________________________

i.
ii.
iii.
iv.
v.
vi.
vii.
viii.
ix.
x.
xi.

______________________________________________________

i. Minimum number of zeros in a diagonal matrix of order is

ii.

iii. For diagonal and triangular matrix (upper triangular or lower

triangular) the determinant is equal to product of leading
diagonal elements.
iv. The matrix which is both symmetric and skew-symmetric
must be a null matrix.
v. All the diagonal elements of the Skew Hermitian matrix are
either zero or pure imaginary.
vi. All the diagonal elements of the Hermitian matrix are real.
vii. The determinant of Idempotent matrix is either or
viii. Determinant and Trace of the nilpotent matrix is zero.
ix. The inverse of the nilpotent matrix does not exist.
x. A square matrix whose all eigenvalues are zero is a
nilpotent matrix

In linear algebra, a nilpotent matrix is a square matrix

such that for some positive integer The smallest
such is sometimes called the index of

Example the matrix is nilpotent with index since

The number is an eigenvalue of if and only if

is singular:

This “characteristic equation” involves only , not

When is the equation has degree Then has
eigenvalues and each leads to For each solve
or to find an eigenvector

Eigenvalue and Eigenvector are only valid for square matrix.

i. The sum of eigen values of a matrix is equal to the trace of

the matrix, where the sum of the elements of principal
diagonal of a matrix is called the trace of the matrix.

ii. The product of eigen values of a matrix is equal to the

determinant of matrix

iii. For Hermitian matrix every eigen value is real.

iv. The eigenvalues of a skew-Hermitian matrix are all purely
imaginary or zero.
v. Every eigenvalue of a Unitary matrix has absolute value. i.e.

vi. Any square matrix and its transpose have same

eigenvalues.
vii. If are eigenvalues of matrix , then eigenvalues
of

are

are

are

are

i. If is an eigenvalue of an Orthogonal matrix , then is

also an eigenvalue of matrix
ii. The eigenvalue of a symmetric matrix are purely real.
iii. The eigenvalue of a skew-symmetric matrix is either purely
imaginary or zero.
iv. Zero is an eigenvalue of a matrix iff matrix is singular.
v. If all the eigenvalues are distinct then the corresponding
eigenvectors are independent.
vi. The set of eigenvalues is called the spectrum of and the
largest eigenvalue in magnitude is called the spectral radius
of Where is the given matrix.

i. For every eigenvalue there exist at-least one eigenvectors.

ii. If is an eigenvalue of a matrix then the corresponding
eigenvector is not unique.i.e., we have infinites number of
eigenvectors corresponding to a single eigenvalue.
iii. If be distinct eigen values of a matrix, then
corresponding eigen vectors form a linearly
independent set.
iv. If two or more eigenvalues are equal then eigenvectors are
linearly dependent.
v. Two eigenvectors and are called orthogonal vectors if

vi. A normalized eigenvector is an eigen

vector of length one. Consider an eigen vector ,
then length of this eigen vector is Normalized

eigenvector is

vii. Length of the normalized eigenvector is always unity.

The eigenvectors corresponding to distinct eigenvalues of a

real symmetric matrix are orthogonal.

The rank of a matrix is the maximum number of linearly

independent rows or columns. A matrix is full rank matrix, if all
the rows and columns are linearly independent. Rank of the
matrix is denoted by

i. The rank of the matrix does not change by elementary

transformation, we can calculate the rank by elementary
transformation by changing the matrix into echelon form. In
echelon form, the rank of matrix is number of non-zero row
of matrix.
ii. The rank of the matrix is zero, only when the matrix is a null
matrix.
iii.
iv.
v.

vi. If and are matrices of same order, then

and
vii. If is the conjugate transpose of then

viii. The rank of the skew-symmetric matrix cannot be one.

ix. If and are two -rowed square matrices, then

x. Rank of iff eigenvalues are zero.

There are two types of linear simultaneous equations:

i. Linear homogeneous equation

ii. Linear non-homogeneous equation

Steps to investigate the consistency of the system of linear

equations.

a. First represent the equation in the matrix form as

b. System equation is checked for consistency as to
make Augmented matrix

i. inconsistent
ii. consistent

______________________________________________________

Linear homogeneous equation is always consistent.

If is a square matrix of order and

, then the rows and columns are and

system has a

, then the rows and columns are and

system has a

______________________________________________________

According to Cayley-Hamilton
Theorem, “Every square matrix satisfies it’s own characteristic
equation.”

This theorem is only applicable for square matrix. This theorem

is used to find the inverse of the matrix in the form of matrix
polynomial.

If be matrix and it’s characteristic equation is,

, then according to Cayley-Hamilton
Theorem,

______________________________________________________

Rows and columns are all together said to be the dimensions of

the matrix, according to the dimensions there are two types of
matrix, rectangular matrix and square matrix.

A matrix in which the number of rows is

not equal to the number of columns is known as a rectangular
matrix

A matrix in which the number of rows are

equal to the number of columns is known as a square matrix

A square matrix in which all the elements

except leading diagonal elements are zero is known a a
diagonal matrix.

(or)

Minimum number of zeros in a diagonal matrix of order

is

A diagonal matrix in which all the diagonal

elements are equal, is known as a scalar matrix.

(or)

A diagonal matrix in which all the diagonal

elements are unity is known as unit matrix or identity matrix. The
matrix of order is denoted by

A square matrix is said to be

upper triangular matrix if whenever

A square matrix is said to be

upper triangular matrix if whenever

For diagonal and triangular matrix (upper triangular or lower

triangular) the determinant is equal to product of leading
diagonal elements.

A square matrix is said to be symmetric , if

where or is transpose of matrix In transpose of
matrix th rows and columns are interchanged.

A square matrix is said to be symmetric ,

if where or is transpose of matrix In transpose of
matrix th rows and columns are interchanged.

i. If is a square matrix then are symmetric

matrices, while are skew symmetric matrix.
ii. If is a symmetric matrix, any real scalar, any integer,
square matrix of order that of , then
are also symmetric matrices. All positive integral power of a
symmetric matrix are symmetric.
iii. If are two symmetric matrices, then

are also symmetric matrices.

are skew-symmetric matrices.

is a symmetric matrix when otherwise

or may not be symmetric.

are also symmetric

matrices.

If is a skew symmetric matrix, then

is a symmetric matrix for positive integer.

is a skew symmetric matrix for positive integer.
is also a skew symmetric matrix, where is a real scalar.
is also skew symmetric matrix where is a square
matrix of order that of
All positive odd integral power of a skew symmetric matrix are
skew symmetric matrix and positive even integral powers of a
skew symmetric matrix are symmetric matrix.

If are two skew symmetric matrices, then

are skew symmetric matrices.

is symmetric matrix.
If is a skew symmetric matrix and is a column matrix then
is a zero matrix.

If is any square matrix then is symmetric matrix and

is a skew symmetric matrix.

The matrix which is both symmetric and skew symmetric must

be a null matrix.

If is symmetric and is skew symmetric, then

Any real square matrix may be expressed as the sum of a

symmetric matrix and a skew symmetric matrix

The determinantof an Skew-Symmetric matrix is zero if is

odd.

is skew-symmetric means . Taking determinant

both sides

A singular matrix is a
square matrix that is not invertible i.e., it does not have an
inverse. A matrix is singular (or) degenerate if and only if (or) iff
its determinant is zero.

A square matrix is non

– singular (or) invertible if its determinant is non – zero.

A non - singular matrix has a matrix inverse.

A square matrix is said to be orthogonal if

In other words the transpose of orthogonal matrix is
equal to the inverse of the matrix, i.e.

and

If matrix is orthogonal then,

Its inverse and transpose are also orthogonal.

Its determinant is unity, i.e.

A square matrix is said to be hermitian if

Where is the transpose of conjugate of matrix i.e.

A square matrix is said to be skew

hermitian if

All the diagonal elements of Skew Hermitian matrix are

either zero (or) pure imaginary.

All the diagonal elements of Hermitian matrix are real.

In Hermitian matrix upper and lower diagonal elements

should be complex conjugate pair.

In Skew Hermitian matrix upper and lower diagonal

elements should be same but real value

sign are opposite.

A square matrix is said to be unitary if

where is transpose of conjugate matrix i.e.

If is unitary matrix then,

Its inverse and transpose is also unitary.

Its determinant is also unity, i.e.

A square matrix is said to be a periodic if

where is positive integer. is also known as period of
the matrix.

A matrix is said to be involutory if

An idempotent matrix is a square matrix

which, when multiplied by itself i.e.

A periodic matrix is said to be idempotent when the positive

integer is unity, i.e.

A square matrix is called a nilpotent matrix if

there exists a positive integer such that

The least positive value of is called the index of nilpotent

matrix

Determinant of Idempotent matrix is either (or)

Determinant and Trace of nilpotent matrix is zero.

Inverse of nilpotent matrix does not exist.

A matrix is said to be invertible (or) non-

singular (or) non-degenerate if there exists a matrix such that

If matrix is invertible, then the inverse is unique.

If matrix is invertible, then cannot have a row (or) column

consisting of only zeros.

A rotation matrix in – dimensions is a

special orthogonal matrix, that is an orthogonal matrix whose
determinant is i.e.

A matrix is normal if it commutes with its

conjugate transpose.

A complex square matrix is normal if

A real square matrix is normal if since a

real matrix satisfies