Scribd
Upload
173 views

Proof Proof 1: Every Hyper Plane Is Convex: Homework 3

1) The document discusses two proofs regarding hyperplanes and subspaces. It proves that every hyperplane is convex by showing that the convex combination of two points in the hyperplane is also in the hyperplane. It also proves that any subspace is a convex cone by showing it contains the origin and is closed under scalar multiplication and vector addition. 2) Several examples are given to test linear dependence and independence of vectors. It is shown that three given vectors are linearly dependent, so they do not span R3. 3) The conditions for a set of vectors to form a basis in Rn are defined. An example checks that three vectors form a basis in R3.

Uploaded by

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

Proof Proof 1: Every Hyper Plane Is Convex: Homework 3

1) The document discusses two proofs regarding hyperplanes and subspaces. It proves that every hyperplane is convex by showing that the convex combination of two points in the hyperplane is also in the hyperplane. It also proves that any subspace is a convex cone by showing it contains the origin and is closed under scalar multiplication and vector addition. 2) Several examples are given to test linear dependence and independence of vectors. It is shown that three given vectors are linearly dependent, so they do not span R3. 3) The conditions for a set of vectors to form a basis in Rn are defined. An example checks that three vectors form a basis in R3.

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/ 8

HOMEWORK 3 PART 1 PROOF Proof 1: Every hyper plane is convex Definition of hyper plane: and k is a scalar.

. Definition of convex set: Pick x1 and x2 ;( 1 combination of x and x2. * +is a hyper plane, where p is a non-zero vector ( ) ( , - for all , x3 is a convex

is a convex set when

and )

and

). Lets say that

If we prove that x3 is in hyper plane, then we can prove that hyper plane is a convex set.

) and

) from the definition of Hyper Plane.

We know that Then we can re-write

as:

and this equals to

So we have proved that Therefore x3 which is the convex combination of x1 and x2, is in hyper plane. So every hyper plane is convex. Proof 2: Any subspace is a convex cone Definition of subspace: Definition of cone: A set of : cone must contain the origin. is a subspace when is a cone when and for all and . Any

which implies

Definition of convex cone: A cone S is a convex cone when S is convex. Definition of convex set: is a convex set when ( ) and , - for all

From the definition of subspace; If I choose origin is always in subspace.

from R; , -);

so

From the definition of convex set If we give the values of s endpoints to If ( ) = y and we know

( ) = x and we know If ( ) So we have proved that and all subspaces includes (0,0), then all subspace is a convex cone. 1

HOMEWORK 3 PART 2 2.2 [ ] [ ] [ ]

[ 1) 2) 3)

So by solving three equations we get: So, we can tell that all can have infinitive values. So there exists a non-trivial solution which implies linear dependence. [ ][ ] [ ]

Since these vectors (a1,a2,a3) are linearly dependent; b=(b1,b2,b3) cannot be written as a linear combination of these 3 vectors. So there is at least one vector from R3 that is not contained in span(a1,a2,a3) and so the span of these 3 vectors will not be all of R3. They dont span in R3 2.4 Definition of basis: A collection of vectors a1, a2,..,ak forms a basis of Rn if k=n and a1, a2,..,ak are linearly independent. [ ] [ ] [ ]

[ 1) 2) 3)

So by solving three equations we get: implies linear independence. 2

. So there exists a trivial solution which

HOMEWORK 3

We now know these vectors are linearly independent, and k=3, n=3 so k=n. This implies that these vectors form a basis in R3. If a2 is replaced by the vector [ independent [ 1) 2) 3) So by solving three equations we get: . So there exists a trivial solution which implies linear independence. Since they are still linearly independent, and there is no chance on k=n, so we can say that they still form a basis in R3. 2.9 ] [ ] [ ] [ ] ] we should check whether these vectors are still linearly

] To tell if the inverse of this matrix exists, we should look to the

determinant of this matrix. (a11=1 , n=2) | | ( ) | | | ( ) | | | | | | | | ( | | | ) | | | | | | | | ( ) | | | | | |

Since det A is different then 0, then this matrix has an inverse. I will take the inverse of this matrix by elementary row operations:

HOMEWORK 3

nd

row : 2

nd

row 2x4 row

th

4 row : 4 row 1 row

th

th

st

1 row : 1 row 2

st

st

nd

row

nd

row :1 x 2

nd

row

3 row :2 x 2

rd

nd

row + 3 row

rd

4 row :4 x 2

th

nd

row + 4 row

th

1 row :1 row + 3 row

st

st

rd

HOMEWORK 3
2
nd

row : 3 row + 2

rd

nd

row

rd

row : -1/4 x 3 row

rd

4 row : 9 x 3 row + 4 row

th

rd

th

rd

row : 3 row - 4 row

rd

th

4 row : 4/5 x 4 row

th

th

1 row : 2 x 4 row + 1 row

st

th

st

nd

row : -1/2 x 4 row + 2

th

nd

row

HOMEWORK 3 2.18 a) [ ( ) ] detA=? | | ( ) | | ( ) | |

b)

] detA=?

(a11=1 , n=2) | ( ) | | | | ( ( ) ) | | | | | | | ( ) | | | | | | | | | ( ) | | | | | | | | |

c)

[ ( ( ) ) (

] detA=? | ) | ( ) | | ( ) | |

HOMEWORK 3 2.27

[
st st rd

| ] I want to reduce this matrix to find the solution.

1 row : 1 row 3 row

[
1 row : 1 row -2
st st nd

| ]
row

[
2
nd

| ]
row : 2x1 row +2
st nd

row

[ 1) 2) 3)

| ]

By solving these 2 equations we get:

So there are infinitively many solutions.

HOMEWORK 3 2.33 [ ] [ ] [ ] [ ] [ ]

You might also like