I have a pivot in every row, but it is still not linearly independent

Click For Summary

Homework Help Overview

The discussion revolves around the linear independence of vectors represented in a matrix context, specifically focusing on a matrix A whose reduced row echelon form (rref) is provided. The original poster is questioning why having a pivot in every row does not imply linear independence of the associated vectors.

Discussion Character

  • Conceptual clarification, Assumption checking

Approaches and Questions Raised

  • Participants explore the distinction between row and column vectors, with some noting that the column vectors are linearly dependent due to the presence of more vectors than dimensions. Others emphasize the need for clarity in the original question regarding what is being referred to as independent or dependent.

Discussion Status

The discussion is ongoing, with participants providing observations and clarifications about the nature of linear dependence and independence in the context of the matrix. Some guidance has been offered regarding the interpretation of rows versus columns, but no consensus has been reached on the original poster's question.

Contextual Notes

There is a noted confusion regarding the definitions of row and column vectors, which may be impacting the understanding of the linear independence concept. The original poster has expressed a desire to avoid certain counterarguments and seeks a more focused explanation.

flyingpig
Messages
2,574
Reaction score
1

Homework Statement



I need to argue this properly

Let's say I have a matrix A and rref(A) is given as

\begin{bmatrix}<br /> 1 &amp; 0&amp;-1 \\ <br /> 0&amp; 1 &amp; -1<br /> \end{bmatrix}

Since I have a pivot in every row, why isn't this linearly independent? Don't give me other arguments like "because there are more vectors than entires", "it's not a good basis for R^2".
 
Physics news on Phys.org
the column vectors are clearly linearly dependent as the 3rd can be written as a linear combo of the first 2
c3 = -c1 -c2
 
Last edited:
I don't need other counterarguments. I want to know why pivots in every row does not mean linear indepedence
 
Why isn't what linearly independent? You need to be more specific about what you're describing as linearly independent/dependent. The rows, taken as vectors in R3, are clearly linearly independent (neither one is a multiple of the other). The column vectors, taken as vectors in R2, are clearly linearly dependent, since there are three of them.

Let's call your matrix A. If your matrix represents the equation Ax = 0, where x is a vector in R3, then there are nontrivial solutions for x. This is the same as saying that the nullspace of A is not just the zero vector.
 
flyingpig said:
I don't need other counterarguments. I want to know why pivots in every row does not mean linear indepedence

it wasn't a counter-argument, it was an observation of the linear dependence of the column vectors

As Marks says, you need to be clear about what you are actually asking, as your question does not seem well formed.

The row vectors are clearly linearly independent.

If you are trying to solve for a point in R^3, as in the solution Ax=0 , then each row acts as a constraint (geometrically it represents a plane of allowable solutions in R^3)

as you have two non-parallel planes, their intersection is a line of points that satisfy both constraints - giving infinite solutions...
 
Last edited:
I got mixed up with row vectors and column vectors, that's the answer I was looking for.

I still don't understand what is a row vector, I still think the columns are defined as x, y, z, and so on continuously on the vertical
 
If you don't know the difference between rows and columns in a matrix you need to talk to your teacher!

You start of by asking "Why isn't this independent" without any clear statement of what "this" is. Grammatically, you would be referring to the matrix, but "independent" applies to a set of vectors, not a matrix.

If you are referring to the columns of the matrix as vectors,
\begin{bmatrix}1 \\ 0\end{bmatrix}\begin{bmatrix}0 \\ 1\end{bmatrix}\begin{bmatrix}-1 \\ -1 \end{bmatrix}
They are dependent because any set of 3 2-dimensional vectors (any set of more than n n-dimensional vectors) must be dependent. The pivots have nothing to do with that!

If you are talking about the rows of the matrix as vectors,
\begin{bmatrix}1 &amp; 0 &amp; -1\end{bmatrix}, \begin{bmatrix}0 &amp; 1 &amp; -1\end{bmatrix}
then they are independent.
 

Similar threads

  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 10 ·
Replies
10
Views
3K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 4 ·
Replies
4
Views
3K
  • · Replies 6 ·
Replies
6
Views
2K
Replies
19
Views
1K
  • · Replies 3 ·
Replies
3
Views
3K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 4 ·
Replies
4
Views
2K
Replies
1
Views
2K