LOVELY PROFESSIONAL UNIVERSITY

Term Paper
Of
ENGINEERING MATHEMATICS-1
MTH101

Topic: - Explain the Gaussian elimination method and

Gauss-Jordan method for the solution of system of linear
equations giving examples.

DATE OF ALLOTMENT: 01/09/10

DATE OF REVIEW : 25/09/10

DATE OS SUBMISSION : 15/11/10

Submitted To Submitted By
Ms Gurpreet Kaur Parkash Basak
Deptt. Of Mathematics Roll. No. RK6002B33
Reg. No. 11001345
B.Tech -MBA (Dual Degree) - ECE 
 ACKNOWLEDGEMENT

My Debt for assistance in producing this report are more numerous that can be identified as to the shape
the content of the term paper. I dare say no individual credit is claimed. Therefore I can do better to
quote Montaigne. Every word applies fully to the originality or otherwise of this book.

I would like to express my profound gratitude.’’Ms. GURPREET KAUR” for the immense help
during the project development. No words can adequately express my debt of guidance to my parents
and friends for getting me invaluable encouragement and help.

Last but not least my outmost marks to all faculties to whom I

owe whatever I have learnt and always showing great concern and providing cordial atmosphere.

Of course other will share credit for virtues of this report. But I myself blame me for
faults and errors contained within

We are thankful to our parents and lovely professional university who have been the main guiding and
motivating force in our lives.

Parkash Basak (11001345)

LINEAR INDEPENDENCE
n linear algebra, a family of vectors is linearly independent if none of them can be written as a linear
combination of finitely many other vectors in the collection. A family of vectors which is not linearly
independent is called linearly dependent. For instance, in the three-dimensional real vector space we have
the following example.
Here the first three vectors are linearly independent; but the fourth vector equals 9 times the first plus 5 times
the second plus 4 times the third, so the four vectors together are linearly dependent. Linear dependence is a
property of the family, not of any particular vector; for example in this case we could just as well write the first
vector as a linear combination of the last three.

In probability theory and statistics there is an unrelated measure of linear dependence between random
variables.

DEFINITION

A finite subset of n vectors, v1, v2, ..., vn, from the vector space V, is linearly dependent if there exists a set of n
scalars, a1, a2, ..., an, not all zero, such that

Note that the zero on the right is the zero vector, not the number zero.

If such scalars do not exist, then the vectors are said to be linearly independent.

Alternatively, linear independence can be directly defined as follows: a set of vectors is linearly independent if
and only if the only representations of the zero vector as linear combinations of its elements are trivial solution
solutions i.e. whenever a1, a2, ..., an are scalars such that

then ai = 0 for i = 1, 2, ..., n.

A set of vectors is then said to be linearly dependent if it is not linearly independent.

More generally, let V be a vector space over a field K, and let {vi | i∈I} be a family of elements of V. The family
is linearly dependent over K if there exists a family {aj | j∈J} of elements of K, not all zero, such that

where the index set J is a nonempty, finite subset of I.

A set X of elements of V is linearly independent if the corresponding family {x}x∈X is linearly independent.

Equivalently, a family is dependent if a member is in the linear span of the rest of the family, i.e., a member is a
linear combination of the rest of the family.

A set of vectors which is linearly independent and spans some vector space, forms a basis for that vector space.
For example, the vector space of all polynomials in x over the reals has for a basis the (infinite) subset {1, x,
x2, ...}.
GEOMETRIC MEANING
A geographic example may help to clarify the concept of linear independence. A person describing the location
of a certain place might say, "It is 5 miles north and 6 miles east of here." This is sufficient information to
describe the location, because the geographic coordinate system may be considered a 2-dimensional vector
space (ignoring altitude). The person might add, "The place is 7.81 miles northeast of here." Although this last
statement is true, it is not necessary.

In this example the "5 miles north" vector and the "6 miles east" vector are linearly independent. That is to
say, the north vector cannot be described in terms of the east vector, and vice versa. The third "7.81 miles
northeast" vector is a linear combination of the other two vectors, and it makes the set of vectors linearly
dependent, that is, one of the three vectors is unnecessary.

Also note that if altitude is not ignored, it becomes necessary to add a third vector to the linearly independent
set. In general, n linearly independent vectors are required to describe any location in n-dimensional space.

Example I

The vectors (1, 1) and (−3, 2) in R2 are linearly independent.

Proof

Let λ1 and λ2 be two real numbers such that

Taking each coordinate alone, this means

Solving for λ1 and λ2, we find that λ1 = 0 and λ2 = 0.

Alternative method using determinants

An alternative method uses the fact that n vectors in are linearly dependent if and only if the determinant
of the matrix formed by taking the vectors as its columns is zero.

In this case, the matrix formed by the vectors is

We may write a linear combination of the columns as

We are interested in whether AΛ = 0 for some nonzero vector Λ. This depends on the determinant of A, which
is

Since the determinant is non-zero, the vectors (1, 1) and (−3, 2) are linearly independent.

Otherwise, suppose we have m vectors of n coordinates, with m < n. Then A is an n×m matrix and Λ is a
column vector with m entries, and we are again interested in AΛ = 0. As we saw previously, this is equivalent
to a list of n equations. Consider the first m rows of A, the first m equations; any solution of the full list of
equations must also be true of the reduced list. In fact, if 〈i1,...,im〉 is any list of m rows, then the equation
must be true for those rows.

Furthermore, the reverse is true. That is, we can test whether the m vectors are linearly dependent by testing
whether

for all possible lists of m rows. (In case m = n, this requires only one determinant, as above. If m > n, then it is a
theorem that the vectors must be linearly dependent.) This fact is valuable for theory; in practical calculations
more efficient methods are available.

[edit] Example II

Let V = Rn and consider the following elements in V:

Then e1, e2, ..., en are linearly independent.

[edit] Proof

Suppose that a1, a2, ..., an are elements of R such that

Since

then ai = 0 for all i in {1, ..., n}.

Projective space of linear dependences

A linear dependence among vectors v1, ..., vn is a tuple (a1, ..., an) with n scalar components, not all zero, such
that

If such a linear dependence exists, then the n vectors are linearly dependent. It makes sense to identify two
linear dependences if one arises as a non-zero multiple of the other, because in this case the two describe the
same linear relationship among the vectors. Under this identification, the set of all linear dependences among v1,
...., vn is a projective space.

Linear dependence between random variables

The covariance is sometimes called a measure of "linear dependence" between two random variables. That does
not mean the same thing as in the context of linear algebra. When the covariance is normalized, one obtains the
correlation matrix. From it, one can obtain the Pearson coefficient, which gives us the goodness of the fit for the
best possible linear function describing the relation between the variables. In this sense covariance is a linear
gauge of dependence.