Independence of Rows and Columns in Matrices

Click For Summary
SUMMARY

The discussion focuses on the independence of rows and columns in matrices, specifically addressing 3x4 and 4x3 matrices. A 3x4 matrix cannot have independent columns due to its maximum rank of 3, which limits the number of linearly independent rows to 3. For a 4x3 matrix with a rank of 2, it can have at most 2 independent rows and 2 independent columns. The conversation also touches on the implications of non-square matrices regarding row and column independence.

PREREQUISITES
  • Understanding of matrix rank and its implications
  • Familiarity with row echelon form and leading 1s
  • Knowledge of linear independence in the context of matrices
  • Basic concepts of null space and column space
NEXT STEPS
  • Study the concept of matrix rank in detail, including its calculation and significance
  • Learn about row echelon form and how to convert matrices to this form
  • Explore linear independence and dependence in vector spaces
  • Investigate the relationship between null space and column space in linear algebra
USEFUL FOR

Students and professionals in mathematics, particularly those studying linear algebra, matrix theory, and anyone involved in data analysis or computational mathematics.

stunner5000pt
Messages
1,447
Reaction score
5
a few questions
a) can a 3x4 matrix have independent columns? rows? Explain
if i were to reduce to row echelon form then i could potentially have 4 leading 1s. I m not quite sure about this.
if i were to reduce this 3 x 4 matrix into row echelon form then the number of rows is less than the number of variables. SO the answer is no.

b) if A is a 4 x3 matrix and rank A = 2, can A have independent columns? rows? Explain
ok rank A means that out of the 4 rows only 2 are non zero when A is in row echelon form. Potentially 3 leading 1s in the columns so at least 2 of the columns may be independent on each other. So independent columns are not possible.
Indepednat rows not possible.

c) Can a non square matrix has its rows indepedant and its columns independent?
im not sure about this. If A (MxN) then for m rows A has n unknowns so it is not possible to have indepdnatn rows. As for the columns i ahve no idea.

If A is m x n and B is n x m show taht AB = 0 iff [itex]col B \subseteq null A[/itex]
suppose AB = 0
let columns of B = [itex]C_{i}[/itex]
rows of A = [itex]R_{i}[/itex]
for all i
then [tex]R_{i} C_{i} = 0 [/itex] if Ci = 0 for all i. Thus Ci belongs to null A<br /> Suppose [tex]col B \subseteq null A[/tex]<br /> then anything times a column of B is zero. Thus AB = 0 <br /> Is this proof adequate?<br /> <br /> your input is greatly appreciated![/tex]
 
Physics news on Phys.org
Remember that a rank of a matrix is equal to the ranks of its transpose, this allows you to intechange rows & columns for your explanation.

A 3x4 matrix can have at most a rank 3, so what does that tell you about the maximum number of linearly indepedant rows/columns?
For the second, the rank is now given - what does this tell you again?
You can use the same argument again for a non-square m x n. Suppose m > n, then the maximal possible ranks is n.
 
for a 3x4 matrix\
the rank can be at most 3
that means it can have at most 3 linearly independent rows
4 linear independent columns

for hte second
for rank A = 2
then there are 2 indpendant rows
so at most only 2 indpendant columns?
 

Similar threads

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