Proof: If k ≠ 0, Then A and kA Have Same Rank

  • Thread starter Thread starter georgeh
  • Start date Start date
  • Tags Tags
    Proof
Click For Summary

Homework Help Overview

The discussion revolves around the proof that if \( k \neq 0 \), then a matrix \( A \) and the matrix \( kA \) have the same rank. The subject area includes linear algebra concepts, particularly focusing on matrix rank and properties of linear independence.

Discussion Character

  • Conceptual clarification, Mathematical reasoning, Problem interpretation

Approaches and Questions Raised

  • Participants explore definitions of rank and the implications of multiplying matrices by non-zero scalars. Questions arise regarding the assumptions made, such as the condition \( m < n \) and the meaning of "leading variables." There is also a discussion about the implications of linear independence and dependence when scaling vectors.

Discussion Status

The discussion is active, with participants questioning assumptions and definitions. Some guidance has been provided regarding the properties of linear independence and the requirements for proving that a span is a subspace. However, there is no explicit consensus on the proof structure or definitions being used.

Contextual Notes

There are constraints regarding the definitions of rank and linear independence being discussed, as well as the specific conditions under which the proof is being approached. Participants are also addressing the need to show closure under addition and scalar multiplication for subspaces.

georgeh
Messages
67
Reaction score
0
Prove: If k !=0, then A and kA have the same rank.
Given:
k is in the set of all Reals.

proof:
WOLOG let A be an M X N matrix
Assume m < n
=> the max rank(A) can be is m. (i.e. the row space and the column space)
=> the max the rank(kA) can be is also m, because multiplying a matrix by a constant does not change the dimensions of the matrix
=>
# of leading variables stays the same for A and KA
=>
Rank(A)=Rank(KA)..
 
Last edited:
Physics news on Phys.org
How can you say that m < n WOLOG? Also, what are the "leading variables"? Anyways, there are a number of ways to define rank. What definition do you have? Some hints: If you have a set of vectors that are linearly independent, when you multiply them each by the scalar k (non-zero), aren't they still linearly independent? Same for if you have a set of linearly DEpendent vectors? Also, if you have a subspace of some vector space, and you multiply each vector in that subspace by a non-zero scalar, don't you get the same subspace?
 
By leading variables i meant the leading 1's. Also i edited, i meant to assume m < n.
How does stating it is L.I. help?
 
Last edited:
I have a problem.
Suppose that {u1,u2,...,um} are vectors in R^n. Prove, directly that span{u1,u2,...,um} is a subspace of R^n.
How do I go about doing this. Thanks.
 
To address georgeh's question to AKG, the rank of a matrix is the number of linearly independent vectors it contains. So let's say you have an MxN matrix of rank R. Then it contains R linearly independent columns (or rows), and the rest, if any, are dependent on that set. All you have to show is that multiplying a set of linearly independent vectors by a constant doesn't make them linearly dependent, and that multiplying a vector dependent on that set by the same constant doesn't make it independent.

To squenshl: you need to show four things:
- that span {u1, u2,...um} is a subset of R^n
- that that subset contains the zero vector
- that that subset is closed under addition (if u and v are elements of the span, then u+v is an element)
- and that it is closed under scalar multiplication (if u is an element of the span, than k*u is an element).
 
Okay.
I've done the first 2 but how do I show that it is closed under addition & multplication.
 

Similar threads

  • · Replies 4 ·
Replies
4
Views
3K
  • · Replies 8 ·
Replies
8
Views
1K
  • · Replies 14 ·
Replies
14
Views
4K
  • · Replies 3 ·
Replies
3
Views
2K
Replies
7
Views
2K
  • · Replies 7 ·
Replies
7
Views
1K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 1 ·
Replies
1
Views
8K
  • · Replies 13 ·
Replies
13
Views
2K