Find Condition for Unique Solution to Row Reduction Homework Problem

  • Thread starter Thread starter rock.freak667
  • Start date Start date
  • Tags Tags
    Reduction Row
Click For Summary

Homework Help Overview

The problem involves determining the conditions on the parameter k for a system of three linear equations to have a unique solution, infinitely many solutions, or no solution. The equations are presented in augmented matrix form, and the discussion revolves around the implications of row reduction on the solutions.

Discussion Character

  • Exploratory, Assumption checking, Mathematical reasoning

Approaches and Questions Raised

  • Participants discuss the row reduction process and the resulting forms of the augmented matrix. They question the accuracy of the row operations performed and the implications of specific values of k on the existence and uniqueness of solutions.

Discussion Status

The discussion is ongoing, with participants providing feedback on each other's row reduction steps and exploring the implications of different values of k. There is an acknowledgment of potential mistakes in the row reduction process and a focus on clarifying the conditions under which the system behaves differently.

Contextual Notes

Participants note that certain values of k lead to identical equations or contradictions in the system, affecting the solution set. The conversation highlights the importance of careful row operations and the interpretation of the resulting matrix forms.

rock.freak667
Homework Helper
Messages
6,221
Reaction score
31

Homework Statement


Find the condition of k such that the set of equations x+y-z=1, x+2y+kz=-1, x+ky-z=1,
has a unique soltuion,infinite sol'n or no solution.


Homework Equations





The Attempt at a Solution



In the augemented matrix form

[1 1 -1 1]
[1 2 k -1]
[1 k -1 -1]

R2-R1,R3-R1

[1 1 -1 1]
[0 1 (k+1) -2]
[0 (k-2) -(k+1) -2]

R3-(k-2)R2

[1 1 -1 1]
[0 1 (k+1) -2]
[0 0 -(k+1)(k+3) (2k-6)]

For a unique solution.

[itex]-(k+1)(k+3) \neq 0[/itex] so that [itex]k \neq 1,3[/itex]


For infinite soltutions -(k+1)(k+3)=0 AND 2k-6=0
so that k=-1,-3 AND k=3

This doesn't make sense to me, as k can only be on value at a time, and if k=3, there will be no solution as the ranks of the augmented matrix and the initial matrix won't be the same.

SO where in my row reduction did I go wrong?
 
Last edited:
Physics news on Phys.org
You made a mistake in your second matrix. You have this:
[1 1 -1 1]
[0 1 (k+1) -2]
[0 (k-2) -(k+1) -2]
You should have this:
[1 1 -1 1]
[0 1 (k+1) -2]
[0 (k-1) 0 -2]

To get the new 3rd row, you added (-1) times R1 to R3. I think you misread the entries in the 3rd row of your first matrix as 1 (k -1) ?? 1, when they actually are 1 k (-1) 1.
 
I got the 2nd matrix you put, and then interchanged row2 and row3.

Then did (k-1)R3-R2 to get

[1 1 -1 |-1]
[0 (k-1) 0 |-2]
[0 0 (k+1)(k-1)| -2(k-1)+1]

which would make no sense to me when I try to give the set of infinite solutions with paramters as it would mean that k should be either 1 or -1 AND -2(k-1)+1=0 at the same time,which can't occur.
 
So, clearly there's something going on if k = 1 or if k = -1.
If k = 1, the original system is:
x + y - z = 1
x + 2y + z = -1
x + y - z = 1

Notice that the 1st and 3rd equations are identical.
The augmented matrix is:

[1 1 -1 | 1]
[1 2 1 | -1]
[1 1 -1 | 1]

This row-reduces to
[1 0 -3 | 3]
[0 1 0 | -2]
[0 0 0 | 0]
Infinite number of solutions. Geometrically the two planes intersect in a line. What went wrong on your row-reduction is that when you multiplied R3 by (k - 1), you were multiplying by 0.

If k = -1, the original system looks like this:
x + y - z = 1
x + 2y - z = -1
x - y - z = 1

And the augmented matrix is like so:

[1 1 -1 | 1]
[1 2 -1 | -1]
[1 -1 -1 | 1]

This reduces to
[1 1 -1 | 1]
[0 1 0 | -2]
[0 0 0 | -4]

From the 3rd row, you can see that 0x + 0y + 0z = -4, which is impossible, so there are no solutions. Geometrically, the three planes don't intersect.

Finally, if k is any value other than 1 or -1, you get a unique solution for (x, y, z), with a different set of values for each value of k. Geometrically, for each value of k other than 1 or -1, the three planes intersect at a single point.
 
If there is no one value of k that makes all numbers in the last row 0, then there is no value of k that will give infinite solutions. Values of k that make all except the last number in the last row 0 give no solution. Values of k that make the next to last number in the last rwo non-zero give a unique solution.
 

Similar threads

  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 7 ·
Replies
7
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 6 ·
Replies
6
Views
2K
  • · Replies 2 ·
Replies
2
Views
1K
  • · Replies 3 ·
Replies
3
Views
3K
  • · Replies 21 ·
Replies
21
Views
3K
Replies
3
Views
3K
Replies
9
Views
2K
  • · Replies 1 ·
Replies
1
Views
1K