Matrix Solutions and Gaussian Reduction: An Introduction to Linear Algebra

  • Context: Undergrad 
  • Thread starter Thread starter Gunni
  • Start date Start date
  • Tags Tags
    Matrices
Click For Summary

Discussion Overview

The discussion revolves around the conditions under which a matrix has solutions in the context of linear algebra, particularly focusing on the implications of the number of rows (m) and columns (n) in a matrix. Participants explore concepts related to Gaussian elimination, the geometric interpretation of systems of equations, and the nature of solutions (unique, infinite, or none).

Discussion Character

  • Exploratory
  • Technical explanation
  • Conceptual clarification
  • Debate/contested
  • Mathematical reasoning

Main Points Raised

  • One participant expresses confusion about whether a matrix has a solution only if the number of rows equals the number of columns, noting that the book suggests infinite solutions when m < n but does not clarify the case when m > n.
  • Another participant provides a worked example using Gaussian elimination, concluding that the specific system of equations presented has no solutions due to a conflict between derived equations.
  • A geometric interpretation is introduced, suggesting that adding more equations than variables can lead to inconsistencies, where some pairs of equations may yield solutions while others do not.
  • Clarification is sought regarding the notation used for m and n, with one participant acknowledging a misunderstanding and confirming that they refer to the rows and columns of the matrix.
  • There is a discussion about the nature of solutions, with one participant suggesting that a matrix may only have a unique solution when the number of rows equals the number of columns, but this is conditional on the equations being independent.
  • Participants question whether "the matrix" refers to the coefficient matrix or the augmented matrix in the context of discussing solutions.

Areas of Agreement / Disagreement

Participants do not reach a consensus on the conditions for a matrix to have solutions, with multiple competing views on the implications of the number of rows and columns, as well as the nature of the solutions (unique, infinite, or none).

Contextual Notes

There are limitations in the discussion regarding the assumptions made about the relationships between the equations and the definitions of solutions. The conversation also reflects uncertainty about the application of Gaussian elimination and the interpretation of results.

Gunni
Messages
39
Reaction score
0
I'm trying to learn linear algebra by myself from a book called "Introduction to linear algebra" by A.D. Martin and V.J. Mizel. One point I'm so far pretty confused about is whether a matix has a solution only if m equals n? I think the book says that if m < n the matrix has infinite solutions, which makes sense, but it doesn't say anything about when m > n. In that case, is there a solution?

The book has problems for you to solve, but no answers. That doesn't matter if a matrix has a solution you can verify, but I'm getting a suspicious number of matrices that have no solutions. I think I don't understand the Gaussian reduction algorithm well enough, at least I find that the following matrix has no solutions, when according to the book it should since m = n.

I'll write it as an equation, I have no idea how to do it properly in latex.

2x + 3y + z = 5
x + 0y - z = 1
2x - 9y - 11z = -5
 
Last edited:
Physics news on Phys.org
m? n? You might want to clarify what you mean by those variables...

I'll "do" your example.

2x + 3y + z = 5
x + 0y - z = 1
2x - 9y - 11z = -5

Matrix form:

Code:
2 3 1 | 5
1 0 -1 | 1
2 -9 -11 | -5

Move the middle row:

Code:
1 0 -1 | 1
2 3 1 | 5
2 -9 -11 | -5

Add the (new) first row to the middle row:

Code:
1 0 -1 | 1
3 3 0 | 6
2 -9 -11 | -5

Add -11 times the first rwo to the last row:

Code:
1 0 -1 | 1
3 3 0 | 6
-9 -9 0 | -16

Divide the middle row by 3, and the last row by -9:

Code:
1 0 -1 | 1
1 1 0 | 2
1 1 0 | 16/9

Do you see the conflict between the middle and last row? You want x + y = 2 /and/ x + y = 16/9, and surely no such numbers can exist, hence the system has no solutions. The book must be mistaken.
 
Last edited:
Originally posted by Gunni
...when m > n. In that case, is there a solution?

Think about it geometrically. Say, with two variables, each equation corresponds to a straight line. With only two equations, the only point where they intersect is the solution. If you add one extra equation, it is possible that the extra line also contains that point (in which case the common intersection point is the overall solution), but it may not pass through it; if so, the system can be said to be inconsistent: If you choose two out of the three equations, you'll have a solution, but they will be different for each pair.
 


Originally posted by ahrkron
Think about it geometrically. Say, with two variables, each equation corresponds to a straight line. With only two equations, the only point where they intersect is the solution. If you add one extra equation, it is possible that the extra line also contains that point (in which case the common intersection point is the overall solution), but it may not pass through it; if so, the system can be said to be inconsistent: If you choose two out of the three equations, you'll have a solution, but they will be different for each pair.
I see, that makes sense. Thanks.

Muzza, I'm sorry, I should have said what I mean by m and n. I mean the rows and columns of the matrix. Mathworld.com uses the same notation so I assumed it was universal. But I also got that the matrix had no solutions, I just thought I didn't understand the algorithm enough and had made a mistake somewhere. Thanks for the help.

This stuff is way deeper than I thought. If I understand this stuff correctly a matrix only has a solution if the number of rows equal the number of columns, but even then it might not.
 
If I understand this stuff correctly a matrix only has a solution if the number of rows equal the number of columns, but even then it might not.

By "a solution", do you mean "a unique solution"? If so, you're basically correct. The "might not" scenario (I believe) happens when one (or more) of the equations is a linear combination of the others, then it has an infinitude of solutions (or when the system "has a contradiction" in it, such as your example, then it has no solutions).

I think the book says that if m < n the matrix has infinite solutions

Btw, by "the matrix", do you mean just the coefficient matrix or the augmented matrix?
 
Last edited:

Similar threads

  • · Replies 8 ·
Replies
8
Views
3K
  • · Replies 4 ·
Replies
4
Views
4K
  • · Replies 4 ·
Replies
4
Views
4K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 3 ·
Replies
3
Views
3K
  • · Replies 8 ·
Replies
8
Views
3K
  • · Replies 34 ·
2
Replies
34
Views
4K
  • · Replies 44 ·
2
Replies
44
Views
6K
  • · Replies 1 ·
Replies
1
Views
3K
  • · Replies 2 ·
Replies
2
Views
2K