|Feb17-12, 02:47 PM||#1|
What does it mean to not have a pivot in every row
I am trying to fully understand this theorem
Theorem: Let A be an m x n matrix. The following are all true or all false.
1. For each b in Rm, the equation Ax has a solution
2. Each b in Rm is a linear combination of the columns of A.
3. The columns of A span Rm
4. A has a pivot position in every row.
So when A does not have a pivot in every row, it disproves (1) because each b will not have a solution.
How would you disprove (2) with (4)?
|Feb17-12, 05:21 PM||#2|
If A does not have a pivot in every row, then its determinant is 0 and A is not invertible.
When you say "disprove (2) with (4)" do you mean disprove (2) assuming (4) is NOT true?
If A does not have a pivot in every row, then A maps R[sup]n[/itex] into a propersubspace of Rm so there exist b in Rm not in that subspace.
|Similar Threads for: What does it mean to not have a pivot in every row|
|Pivot Problem||Introductory Physics Homework||6|
|What is a pivot column?||Calculus & Beyond Homework||8|
|rotating at a pivot||Introductory Physics Homework||1|
|Friction of a pivot||Mechanical Engineering||2|
|Pivot.||Introductory Physics Homework||3|