Scribd
Upload
58 views

Linear Programming 1

The document discusses linear dependence and independence of vectors. It proves two propositions: 1) Vectors are affinely dependent if and only if one vector is an affine combination of the others. 2) Vectors are affinely independent if and only if the matrix of the vectors has full rank. It does so by defining key terms like affine combination, rank of a matrix, and linear (in)dependence and showing how they relate to affine (in)dependence.

Uploaded by

Özlem Yurtsever
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
58 views

Linear Programming 1

The document discusses linear dependence and independence of vectors. It proves two propositions: 1) Vectors are affinely dependent if and only if one vector is an affine combination of the others. 2) Vectors are affinely independent if and only if the matrix of the vectors has full rank. It does so by defining key terms like affine combination, rank of a matrix, and linear (in)dependence and showing how they relate to affine (in)dependence.

Uploaded by

Özlem Yurtsever
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 5

HOMEWORK 2 PART 1 [ ] [ ] [ ]

[ 1) 2) 3) From 1 and 2 we get: From 1 and 3 we get:

So by solving three equations we get: From the equation, we can tell that all can have infinitive values. So there exists a nontrivial solution which implies linear dependence.

HOMEWORK 2 PART 2 Proof of the Propositions Proposition 1: are affinely dependent if and only if for some is an affine combination of { } Proving IF part: Given: Wanted to be proven: are affinely dependent is an affine combination of { } for some * + * +

Definition of affinely dependent: (i) (ii) (iii) From the definition of affinely dependent; (i) We can separately write If we assume as; we get; as;

are affinely dependent if

(ii)

We can separately write If we assume

we get;

And the definition of affine combination is ; combination of We have proved that an affine combination of { }

and

=1 is an affine

are affinely dependent if for some

is

Proving IFF part: Given: is an affine combination of { } for some * +

Wanted to be proven:

are affinely dependent

HOMEWORK 2

Definition of affine combination: (i) (ii) =1 is an affine combination of

From the definition of affine combination; (i) (ii) know = so ; ( )

and we can re-write this equation as; we know from the definition that = 1 -1 = 0 and from (i) we

* We have proved that for some are affinely dependent. Proposition 2: has a rank of p. Proving IF part: Given:

is an affine combination of { }

are affinely independent if and only if the matrix [

are affinely independent ] has a rank of p. are affinely dependent if

Wanted to be proven: the matrix [ Definition of affinely dependent: (i) (ii) (iii)

So from the definition of affinely dependent, if we re-write (iii) as that they are not affinely dependent, this implies affinely independence. We can make the definition of affinely independent as below: 3

we can say

HOMEWORK 2 are affinely independent if (i) (ii) (iii) From this definition we can tell that if they are affinely independent, they are also linearly independent. Definition of linearly independent: A set of vectors independent if implies that for all j=1,,p. is called linearly

Definition of rank of a matrix: Amxn row(column) rank of A, rank(A), is equal to the max # of * + ( ) linearly independent rows(columns) of A ; row rank = column rank We can write the matrix [ ] as below;

..

We know from the definition of linearly independent that since And we know from the definition of affinely independent that So we can tell that ; since

.. =0 This implies that, there are p affinely independent row, which means, the rank of the matrix [ ] is P. 4

HOMEWORK 2

So we have proved that rank of p. Proving IFF part: Given: the matrix [ Wanted to be proven:

are affinely independent if matrix [

] has a

] has a rank of p. are affinely independent

Definition of rank of a matrix: Amxn row (column) rank of A, rank (A), is equal to the max # of * + ( ) linearly independent rows(columns) of A ; row rank = column rank So, if the matrix has a rank of p, this means that the max # of linearly independent row of the matrix is p. Definition of linearly independent: A set of vectors independent if implies that for all j=1,,p. Since all the is called linearly

equals to 0, this implies that these vectors are also affinely independent. ] is P, there are p linearly independent row. So we can write

If the rank of the matrix [ the equations as below;

.. =0 We know that all t tell . If

So;

=0

from the definition of linearly independence. If all t then .

we can

So we have proved that if matrix [ independent.

] has a rank of p ;

are affinely

You might also like