Checking a Linear Algebra result

Click For Summary

Homework Help Overview

The discussion revolves around identifying the possible echelon forms of a nonzero 3x2 matrix in the context of linear algebra. Participants explore the definitions and characteristics of echelon forms, particularly focusing on the arrangement of leading entries.

Discussion Character

  • Conceptual clarification, Assumption checking

Approaches and Questions Raised

  • Participants discuss various matrix configurations that meet echelon form criteria, questioning the validity of certain examples. They also consider the implications of having leading entries and the conditions under which a matrix can be classified as in echelon form.

Discussion Status

The conversation has progressed with participants providing feedback on the original poster's attempts. Some guidance has been offered regarding the rules of echelon forms, and there is an acknowledgment of the need to reconsider certain configurations. Multiple interpretations of the problem are being explored.

Contextual Notes

There is a specific focus on nonzero matrices as per the problem statement, which has led to discussions about the relevance of an all-zero matrix in this context.

Char. Limit
Gold Member
Messages
1,222
Reaction score
23

Homework Statement


Yeah, so I'm just starting LinAlg, and I wanted to check my answer on a certain question. The question reads:

"Describe the possible echelon forms of a nonzero 3x2 matrix. Use the symbols \diamond, *, and 0, as in the first part of example 1."

Now, here, the \diamond indicates a nonzero entry, the * indicates an entry that can be any value, and the 0 indicates, well, a zero entry.

The Attempt at a Solution



So I got four matrices:

\left[ \begin{array}{cc}<br /> \diamond &amp; 0 \\<br /> 0 &amp; 0 \\<br /> 0 &amp; 0 \\<br /> \end{array} \right]

\left[ \begin{array}{cc}<br /> \diamond &amp; * \\<br /> 0 &amp; \diamond \\<br /> 0 &amp; 0 \\<br /> \end{array} \right]

\left[ \begin{array}{cc}<br /> \diamond &amp; * \\<br /> 0 &amp; * \\<br /> 0 &amp; \diamond \\<br /> \end{array} \right]

\left[ \begin{array}{cc}<br /> \diamond &amp; * \\<br /> 0 &amp; * \\<br /> 0 &amp; * \\<br /> \end{array} \right]

However, I feel like I'm missing some. Can you help me with which ones?
 
Physics news on Phys.org
In echelon form, the leading entry in a row has to be strictly to the right of the leading entry of the row above it, so your third and fourth matrices wouldn't generally be in echelon form.

Another case you might consider is when the first column has no leading entry.
 
Do you mean that the next leading entry can't be two rows down from the previous one? I... didn't honestly remember that.

And I'll take a look at the cases of "no leading entry in the first row". Thanks, I knew I had forgotten something.
 
No, it's more that you can't have two rows where the first non-zero element is in the same column. The matrix

\begin{bmatrix} 1 &amp; 1 \\ 0 &amp; 2 \\ 0 &amp; 3 \end{bmatrix}

is not in echelon form though the matrix would qualify as your fourth type.
 
So, I have this as my answer now:

\left[ \begin{array}{cc}<br /> \diamond &amp; 0 \\<br /> 0 &amp; 0 \\<br /> 0 &amp; 0 \\<br /> \end{array} \right]

\left[ \begin{array}{cc}<br /> \diamond &amp; * \\<br /> 0 &amp; \diamond \\<br /> 0 &amp; 0 \\<br /> \end{array} \right]

\left[ \begin{array}{cc}<br /> 0 &amp; \diamond \\<br /> 0 &amp; 0 \\<br /> 0 &amp; 0 \\<br /> \end{array} \right]

I do wonder though, is an all-zero matrix in echelon form?
 
Looks good.

An all-zero matrix is in echelon form. It satisfies all the requirements. There are no leading entries, so there's nothing to worry about there. And all the zero rows are at the bottom.
 
I'd better add it then. Thanks for the help.
 
The problem specified non-zero matrices, so you don't need the 0 matrix.
 
Oh, of course. How foolish of me.

I guess I need to read the problem more carefully...
 

Similar threads

  • · Replies 4 ·
Replies
4
Views
1K
  • · Replies 9 ·
Replies
9
Views
2K
  • · Replies 1 ·
Replies
1
Views
3K
  • · Replies 11 ·
Replies
11
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 7 ·
Replies
7
Views
3K
  • · Replies 5 ·
Replies
5
Views
3K
  • · Replies 4 ·
Replies
4
Views
10K
Replies
1
Views
2K
  • · Replies 46 ·
2
Replies
46
Views
9K