Gaussian elimination for a singular square matrix

Click For Summary

Discussion Overview

The discussion revolves around the application of Gaussian elimination to a singular square matrix in the context of a homogeneous linear system represented by ##Ax=0##. Participants explore the implications of singularity on the resulting matrix form, specifically whether it can achieve upper triangular or row echelon form.

Discussion Character

  • Technical explanation
  • Debate/contested
  • Mathematical reasoning

Main Points Raised

  • Some participants assert that Gaussian elimination applied to a singular matrix will lead to at least one row being zeroed out due to linearly dependent rows.
  • Others propose that a raw echelon form is also upper triangular, but question whether a singular matrix can achieve this form without skipping columns during elimination.
  • A participant mentions that the kernel of the matrix, ##K##, has a dimension greater than zero, which influences the number of zero rows in the resulting matrix.
  • Some participants discuss specific cases where the first column is zero and how that affects the ability to achieve row echelon form.
  • There is a suggestion that skipping columns may be necessary in certain configurations to achieve a row echelon matrix.
  • One participant provides an example of a matrix and discusses the steps of Gaussian elimination, noting that it can be transformed into row echelon form.
  • Another participant challenges the relevance of certain conditions in the elimination process, emphasizing that any matrix can be transformed to reduced row echelon form.

Areas of Agreement / Disagreement

Participants express differing views on whether Gaussian elimination can achieve row echelon form for singular matrices, with some asserting it is possible while others highlight conditions under which it may not be achievable. The discussion remains unresolved with multiple competing perspectives.

Contextual Notes

Participants note that the regularity of the matrix does not necessarily affect the ability to achieve row echelon form, but specific configurations of the matrix may complicate the elimination process.

cianfa72
Messages
3,011
Reaction score
313
TL;DR
Gauss elimination applied to a singular square matrix
Hi,

I've the following doubt: consider an homogeneous linear system ##Ax=0## with ##A## a singular square matrix.

The resulting matrix attained through Gaussian elimination will be in upper triangular or raw echelon form ?

Thanks.
 
Physics news on Phys.org
I see no trouble with obtaining upper/lower triangular echelon form. You have linearly dependent rows, so at least one row will be zeroed out.
 
cianfa72 said:
Summary: Gauss elimination applied to a singular square matrix

Hi,

I've the following doubt: consider an homogeneous linear system ##Ax=0## with ##A## a singular square matrix.

The resulting matrix attained through Gaussian elimination will be in upper triangular or raw echelon form ?

Thanks.
Vectors ##x## with ##Ax=0## build a subspace ##K##, the kernel of ##A##. Singular only means that ##\dim K > 0##. Say we have ##\dim K =m##, then Gauß elimination will lead to ##m## rows of zeroes.
 
fresh_42 said:
Vectors ##x## with ##Ax=0## build a subspace ##K##, the kernel of ##A##. Singular only means that ##\dim K > 0##. Say we have ##\dim K =m##, then Gauss elimination will lead to ##m## rows of zeroes.
Sure...but my point is: a raw echelon square matrix is also upper triangular; for non-singular matrices the reverse is also true: a non-singular upper triangular square matrix is also raw echelon.

Now in case of singular square matrix ##A# , Gauss elimination will lead to just an upper triangular or even a raw echelon ?
 
Last edited:
Is a zero matrix in row echelon form?
 
nuuskur said:
Is a zero matrix in row echelon form?
Yes, from its definition I believe...
 
Regularity does not play a role in whether you will be able to achieve row echelon form. Start with
<br /> \left (\begin{array}{cccccc}<br /> a_{11} &amp; a_{12} &amp; a_{13} &amp; \ldots &amp; a_{1n} &amp; 0 \\<br /> a_{21} &amp; a_{22} &amp; a_{23} &amp; \ldots &amp; a_{2n} &amp; 0 \\<br /> \vdots \\<br /> a_{n1} &amp; a_{n2} &amp; a_{n3} &amp; \ldots &amp; a_{nn} &amp; 0<br /> \end{array}\right )<br />
Re-arrange such that ## a_{11} \neq 0##. Then zero first column under ##a_{11}##. Otherwise, the first column is zero. Leave first row fixed from now on. Then re-arrange rows ##2\ldots n##, if necessary, such that ##a_{22} \neq 0## and zero the second column under ##a_{22}##. Proceed analogously with subsequent rows. The result will be of row exchelon form.
 
Last edited:
nuuskur said:
Regularity does not play a role in whether you will be able to achieve row echelon form. Start with
<br /> \left (\begin{array}{cccccc}<br /> a_{11} &amp; a_{12} &amp; a_{13} &amp; \ldots &amp; a_{1n} &amp; 0 \\<br /> a_{21} &amp; a_{22} &amp; a_{23} &amp; \ldots &amp; a_{2n} &amp; 0 \\<br /> \vdots \\<br /> a_{n1} &amp; a_{n2} &amp; a_{n3} &amp; \ldots &amp; a_{nn} &amp; 0<br /> \end{array}\right )<br />
Re-arrange such that ## a_{11} \neq 0##. Then zero first column under ##a_{11}##. Otherwise, the first column is zero. Leave first row fixed from now on. Then re-arrange rows ##2\ldots n##, if necessary, such that ##a_{22} \neq 0## and zero the second column under ##a_{22}##. Proceed analogously. The result will be of row exchelon form.
Consider the following case: first column zero, ## a_{12} = 0##, ## a_{22} \neq 0##, ## a_{13} \neq 0##.
In this case the result would not be of raw echelon form, I believe...
 
Last edited:
cianfa72 said:
Consider the following case: first column zero, ## a_{12} = 0##, ## a_{22} \neq 0##, ## a_{13} \neq 0##.
In this case the result would not be of raw echelon form, I believe...
Thinking about it, I believe a column skip is needed in order to get a raw echelon matrix in that case. By the way I found the following into "Elementary Linear Algebra" book

Occasionally when we progress to a new column, the pivot entry as well as all lower
entries in that column are zero. Here,a type (III) operation cannot help. In such cases,
we skip over the current column and advance to the next column to the right. Hence,
the new pivot entry is located horizontally to the right from where we would normally
expect it


Do you think it make sense ?
 
  • #10
It makes sense, but I don't see how it pertains to our discussion.
cianfa72 said:
Consider the following case: first column zero, ## a_{12} = 0##, ## a_{22} \neq 0##, ## a_{13} \neq 0##.
I considered it, I don't see any problems. ##a_{13}\neq 0## is irrelevant. Let's work through an example, maybe that'll clear something up. I'll just work with some matrix ##A## without augmenting it. Per your specifications:
<br /> \left (\begin{array}{ccc}0 &amp; 1 &amp; 2 &amp; 0 \\<br /> 0 &amp; -1 &amp; 1 &amp; 1 \\<br /> 0 &amp; 1 &amp; 0 &amp; 1 \\<br /> 0 &amp; 1 &amp; 1 &amp; 1 \end{array}\right ) \to<br /> \left (\begin{array}{ccc}0 &amp; 1 &amp; 2 &amp; 0 \\<br /> 0 &amp; -1 &amp; 1 &amp; 1 \\<br /> 0 &amp; 0 &amp; 1 &amp; 2 \\<br /> 0 &amp; 0 &amp; 2 &amp; 2 \end{array}\right ) \to<br /> \left (\begin{array}{ccc}0 &amp; 1 &amp; 2 &amp; 0 \\<br /> 0 &amp; -1 &amp; 1 &amp; 1 \\<br /> 0 &amp; 0 &amp; 1 &amp; 2 \\<br /> 0 &amp; 0 &amp; 0 &amp; -2 \end{array}\right )<br />
which can be further transformed to row echelon form. You can further transform it into reduced row echelon form, too.
 
  • #11
nuuskur said:
I considered it, I don't see any problems. ##a_{13}\neq 0## is irrelevant. Let's work through an example, maybe that'll clear something up. I'll just work with some matrix ##A## without augmenting it.
In your example ##a_{12}## was not zero; take instead the following matrix

<br /> \left (\begin{array}{ccc}0 &amp; 0 &amp; 2 &amp; 0 \\<br /> 0 &amp; -1 &amp; 1 &amp; 1 \\<br /> 0 &amp; 1 &amp; 0 &amp; 1 \\<br /> 0 &amp; 1 &amp; 1 &amp; 1 \end{array}\right )<br />
 
  • #12
Oh, well, regardless, it has no effect. For the record: any matrix can be transformed to reduced row echelon form.
 
  • #13
nuuskur said:
Oh, well, regardless, it has no effect.
anyway if the first column is not skipped (starting elimination at ##a_{12}##) we are not able to transform it in raw echelon form, don't you ?
 
Last edited:
  • #14
cianfa72 said:
anyway if the first column is not skipped (starting elimination at ##a_{12}##) ) we are not able to transform it in raw echelon form, don't you ?
I don't understand what you mean. Choose a column at random and a nonzero element in it, then zero the rest of the column. If the column is already zero you don't have to touch that column.
 
  • #15
nuuskur said:
I don't understand what you mean. Choose a column at random and a nonzero element in it, then zero the rest of the column. If the column is already zero you don't have to touch that column.
ok, maybe this point was not clear to me.
 

Similar threads

  • · Replies 26 ·
Replies
26
Views
5K
  • · Replies 14 ·
Replies
14
Views
4K
  • · Replies 6 ·
Replies
6
Views
2K
  • · Replies 13 ·
Replies
13
Views
8K
  • · Replies 3 ·
Replies
3
Views
3K
  • · Replies 1 ·
Replies
1
Views
3K
  • · Replies 1 ·
Replies
1
Views
5K
  • · Replies 10 ·
Replies
10
Views
2K
  • · Replies 4 ·
Replies
4
Views
1K
Replies
1
Views
4K