BS Mathematics

Linear Algebra

Israr Masood Lecturer

Govt, Graduate College Bhalwal.

0314-3920610

Israr3920@gmail.com
Important Definitions.

 Linearly Independent:-

If S={v1,v2,…..vn} is a set of twoor more vectors in a vector Space V, then S is

said to be a linearly independent set it no vector in S can be expressed as a
linear combination of the other:

 Vector Space:-

It the following axioms are satisfied by all objects u,v,w in V and all scalars
k and m , then we call V a Vector Space and we call the objects in V vectors

 If u and v are objects in v, then u+v is in v

 u+v=v+u

 u+(v+w)=(u+v)+ w

 There is an object 0 in V , called a zero vector for v.s.t. 0+u = u+0=u

 For each u in v, there is an object ,-u in v called negative of u s.t,

u+(-u)=(-u)+u=0

 If k is any scalar and u is any object in v, then ku is in v

 K(u+v)=ku+kv

 (k+m)u=ku+mu

 K(mu) = (km) u

 1u = u

 Characteristic Equation:-

If A is an nxnmatrix , then λ is an eigenvalue of A if and

only if it satisfies the equation

Det(λI-A)=0
This is called the characteristic equation of ‘’A”

 Linear Span of V:

‘If S ={w1,w2,…..wn }Is anon empty set of vectors in a vector space V,then the
subspace w of V that consist of all possible Linear combination of the
vectors in S is called subspace of V and we say that the vectors w1,w2,…..wn
Span W.

W=Span (S)

Zero Subspace:

“If V is any vector space and if w= {0} is the Subset of V that

consists of the zero vector only , then w is closed under addition and scalar
multiplication since:

0+0=0 and k0=0

For any scalar k, we call w the Zero Subspace of V.

 Orthogonal vector:

“let S ={v1,v2,…..vn} be asubset of non-zero vectors in an inner product space

. then “ S” is called orthogonal set of vectors if:

<vi,vj > = 0 Ɐi≠j

OR

Two vectors u and v in an inner product Space v called orthogonal if

<u,v>=0”

 ORTHONORMAL Set of V:

A set of two or more vectors to be orthonormal if all pairs of distinct

vectors in the set are orthogonal .An orthogonal set in which each vector
has norm 1 is said to be orthonormal.

 Inner product:

An inner product on a real vector space v is a function that

associate a real number <u,v> with each pair of vectors in v in such a
way that the following axioms are satisfied:

 <u,v> = <v,u>

 <u+v,w> = <u,w> + <v,w>

 <ku,v> = k<u,v>

 <v,v>≥ 0 and <v,v> = 0 iff v=0

 Rank of Linear Transformation:

“Let T:v→ w be Linear transformation and if the range of T is

finite

dimensional,then its dimension is called rank of Linear

transformation T.

 Nullity of a vector space:

“The dimension of anull space of A is called the nullity of A , it is denoted by

nullity (A).

 Non-trivial Subspace of v:

A non - trivial subspace of v is a subset of v containing the 0

vector and at least one non zero vector that is closed under addition
and is closed under scalar multiplication.

 Basis:-

If S={v1,v2,…..,vn} is a set of vector in finite dimensional vector

space V then S is called a basis for V if S span V and S is linearly
 independent.

 Linear combination of v

If Wis a vector in a vector space v, then w is said to be a

linear combination of the vectors {v1,v2,…..vn}in V if w can be
expressed in the form. W= k1v1,k2v ,…..,knvn , k1,k2,…..,kn
2

 Linear system

“A finite set of linear equations is called a system of linear equations

or more briefly a linear system.”

 Unknown

The variables in linear system is called unknowns in linear system.

 Dilation operator

If v is a vector spaceand k is any Scalar, then the mapping T:v → v

given by T(x)=kx is a is Linear operator on v , for if c is any is scalar
and if u and v are any vectors in v .

T(cu) = k(cu) = c(ku) = cT(u)

T(u+v) = k(u+v) = ku+kv = T(u) + T(v)

If 0<k<1 then T is called contraction of v with factor k, and if k>1, it is

called

Dilation of v with factor k.

Linear transformation

if T: v → w is a mapping from a vector space v to a vector

 space w, T is called a linear transformation from v to w if the
following two properties hold for all vectors u and v and for all
scalars k.

 T(ku) = kT(u)

 T(u+v) = T(u)+T(v)

 Nullity of T

Let T:v → w be a linear transformation if the kernel of T is finite

dimensional , then its dimension is called the nullity of T. It is
denoted by

nullity (T)

 Orthogonal Complement:-

If W is a subspace of a real inner product Space V then the set

of all vectors in v that areOrthogonal to every vector in w is
called the

OrthogonalComplement of W.

It is denoted by W┘ .

 Transpose of m matrix:-

If A is any mxn matrix then thetranspose of A is defined to be the

nxmmatrix that results by interchangining the rows and columns of A, that
is the first column of Aᵗ is the first row ofA and so forth. it is denoted by Aᵗ.

 Wronskian Method
 If f1 = f1(x), f2 = f2(x),…,fn = fn(x),are functions that are n-1
times differentiable on the interval (-∞,∞),then the determent:

| |
f1(x) f2(x).. ..fn(x)

w(x) = f1'(x) f2'(x) ..fn'(x)

. . .
(n-1) (n-1) (n-1)
f1 (x) f2 (x) ..fn (x)

is called the Wronskian of f1 ,f2, ….fn .

 Norm of a vector
n
If v={v1,v2,…..vn} is a vector in R then the norm of v is denoted by
‖v‖ and is defined by the formula:-
2 2 2
‖v‖= v1 +v2 ….+vn

 Gauss- Jordan Method:-

I. In this method we reduce the augmented Matrix into

reduced echelon form

II. Then by backward substitution the values of remaining

unknown can be calculated.

 Gram Smith process

“To convert a basis{u1,u2,…..ur}into an orthogonal basis

{v1,v2,…..vr}perform the following computations:

Step 1v1 = u1
 <u2,v1>
Step 2v2 = u2 - v
‖v1‖2 1

<u3,v1> <u3,v2>
Step 3v3 = u3 - 2 v1 - 2 v2
‖ 1‖
v ‖ 2‖
v

 Direct sum:

A direct sum is short hand way to describe the relationship

between a vector space and two or more of its subspaces”

Example:

plane space is the directed sum of two lines.

 Linear equations:

In two dimension a line in a rectangular xy co-ordinate system

can be represented by an equation of the form

ax + by = c

 Diagonal matrix :

A square matrix in which all the entries of the main diagonal are
zero is called the diagonal matrix.

e.g[20 -50 ]
 Symmetric matrix:

“A square matrix A is said to be a Symmetric if

A=Aᵗ

 Subspace of v:

A Subset w of a vector space V is called a subspace of V if w is

itself a vector space under the addition and scalar
multiplication defined on V.

 Lineary dependent:
n
Let S={v1,v2,…..vr } be a set of vectors in if R , ifr>n , then S is a
linearly dependent.

 Dimension of vector space:

The dimension of a finite dimensional vector space v denoted

by dim(v) and it is defined to be the number of vectors in a
basis for v.

 Eigen value and Eigen vector:

n
If A is annxnmatrix , then a non zero vector X in R , is called an
eigen vector of A if AX is a scalar multiple of X , that is,

AX = λX

The scalar λ is called an eigenvalue of A and X is eigenvector of

A.
 Hermitian matrix:

A square matrix A is said to be hermitianif :-

*
A= A

 Positive –Definite matrix:

A Positive definite matrix is a symmetric matrix with all positive

and real eigenvalues.

 Inconsistence linear system:

A system of linear equations that has no solution is called

inconsistence system.

 Pivot column:

If a matrix is in row-echelon form, then the first nonzero entry of

each row is called a pivot , and the columns in which pivots
appear are called pivot column.