[Linear Algebra] Subspace Proof

In summary, to show that a subspace of a matrix exists, you need to show that it holds under addition, scalar multiplication, and that the zero vector is present.
  • #1
Highway
349
1

Homework Statement



I have a matrix and need to show that it is a subspace of ℝn using the eigenspace identity of: Ax = λx, where x is the eigenvector.

Homework Equations





The Attempt at a Solution



I know that for a subspace, you need to show that it holds under addition, scalar multiplication, and that the zero vector is present. But I don't know how to get started on this... any hints? Thanks!
 
Physics news on Phys.org
  • #2
Highway said:

Homework Statement



I have a matrix and need to show that it is a subspace of ℝn using the eigenspace identity of: Ax = λx, where x is the eigenvector.

Homework Equations





The Attempt at a Solution



I know that for a subspace, you need to show that it holds under addition, scalar multiplication, and that the zero vector is present. But I don't know how to get started on this... any hints? Thanks!

I don't believe that your problem description is an accurate depiction of what you're supposed to do. Here's what I think that problem actually is:

For a given n x n matrix A, with a given eigenvalue λ, show that the solutions of the equation Ax = λx form a subspace of Rn. In other words, show that the eigenvectors associated with the eigenvalue λ form a subspace of Rn.​
 
  • #3
Highway said:
I know that for a subspace, you need to show that it holds under addition, scalar multiplication, and that the zero vector is present. But I don't know how to get started on this... any hints? Thanks!
"it" = what? Math students should never use the word "it" unless the antecedent is obvious to the most casual observer.
 
  • #4
Mark44 said:
I don't believe that your problem description is an accurate depiction of what you're supposed to do. Here's what I think that problem actually is:

For a given n x n matrix A, with a given eigenvalue λ, show that the solutions of the equation Ax = λx form a subspace of Rn. In other words, show that the eigenvectors associated with the eigenvalue λ form a subspace of Rn.​

yes this is correct. . .
 
  • #5
Mark44 said:
"it" = what? Math students should never use the word "it" unless the antecedent is obvious to the most casual observer.

i think what I am trying to say is that the set of nxn matricies is a subset. . .
 
  • #6
See? Even you're confused. This really has almost nothing to do with any set of n x n matrices - just one particular matrix, and the set of vectors that are the eigenvectors associated with one eigenvalue of that matrix.

Your sentence with "it" removed is:
I know that to show that this set of vectors is a subspace, you need to show that [STRIKE]it holds under addition[/STRIKE] this set is closed under vector addition and scalar multiplication, and that the zero vector is present.

So you need to check 3 things.
1) Is the 0 vector in this set? I.e., is A0 = λ0 a true statement.
2) Is the set closed under vector addition?
3) Is the set closed under scalar multiplication?
 
  • #7
Mark44 said:
See? Even you're confused. This really has almost nothing to do with any set of n x n matrices - just one particular matrix, and the set of vectors that are the eigenvectors associated with one eigenvalue of that matrix.

Your sentence with "it" removed is:
I know that to show that this set of vectors is a subspace, you need to show that [STRIKE]it holds under addition[/STRIKE] this set is closed under vector addition and scalar multiplication, and that the zero vector is present.

So you need to check 3 things.
1) Is the 0 vector in this set? I.e., is A0 = λ0 a true statement.
2) Is the set closed under vector addition?
3) Is the set closed under scalar multiplication?

i am confused, and this is a lot more clear to me. . .

when i go to show these, do i pick arbitrary real values and show that they hold?
 
  • #8
The first item is easy to show, so I'll skip it.
For #2, take arbitrary vectors that belong to the set and show that their sum is also in the set.
For #3, take an arbitrary vector u and an arbitrary real number c, and show that cx is in the set.

You don't get to choose vectors or scalars. What you are showing is that no matter which vectors are chosen, and which scalar, u + v is in the set and cu is in the set.

"in the set" - what is it that defines every vector in the set you're working with? How can you tell if a vector is in the set or not?
 
  • #9
thanks! this really helped a lot to make sense of things. . .
 

FAQ: [Linear Algebra] Subspace Proof

What is a subspace in linear algebra?

In linear algebra, a subspace is a subset of a vector space that satisfies the properties of a vector space. This means that it is closed under addition and scalar multiplication, and contains the zero vector.

How do you prove that a set is a subspace?

To prove that a set is a subspace, you must show that it satisfies the three properties of a vector space: closure under addition, closure under scalar multiplication, and containing the zero vector. This can be done by showing that any two vectors in the set can be added to give another vector in the set, and that any scalar multiple of a vector in the set is also in the set.

What is the difference between a subspace and a span?

A subspace is a subset of a vector space that satisfies the properties of a vector space, while a span is the set of all possible linear combinations of a given set of vectors. A subspace must contain the zero vector and be closed under addition and scalar multiplication, while a span does not necessarily have to satisfy these properties.

Can a subspace contain just one vector?

No, a subspace must contain at least two vectors. This is because a subspace must be closed under addition, and if it only contains one vector, there is no other vector that can be added to it to give another vector in the subspace.

How do you prove that a set of matrices is a subspace?

To prove that a set of matrices is a subspace, you must show that it satisfies the three properties of a vector space: closure under addition, closure under scalar multiplication, and containing the zero vector. This can be done by showing that any two matrices in the set can be added to give another matrix in the set, and that any scalar multiple of a matrix in the set is also in the set.

Similar threads

Replies
15
Views
2K
Replies
10
Views
2K
Replies
1
Views
872
Replies
15
Views
1K
Replies
4
Views
2K
Back
Top