System of equations has no solution
If the system of linear equations,
begin{cases}
x &+ ay &+ z &= 3\
x &+ 2y &+ 2z &= 6\
x &+ 5y &+ 3z &= b\
end{cases}
has no solution, then:
- $a=-1,b=9$
- $a=-1,b ne 9$
- $ane-1,b = 9$
- $a=1,b ne 9$
I really fail to understand why the answer cannot be option (1).
Here's my method:
For $a = -1$, the coefficient determinant determinant is 0. And if we create $Delta_z$, the determinant in which coefficients of $z$ are replaced by $3,6,b$, (b= 9), that determinant is non zero.
My book says that if coefficient determinant is $0$ and at least one of $Delta_y, Delta_z, Delta_x$ is non $0$ then the system has no solution.
But the answer given is $(2)$. What's wrong with my method? What's the best way to tackle such problems?
linear-algebra matrices systems-of-equations determinant
add a comment |
If the system of linear equations,
begin{cases}
x &+ ay &+ z &= 3\
x &+ 2y &+ 2z &= 6\
x &+ 5y &+ 3z &= b\
end{cases}
has no solution, then:
- $a=-1,b=9$
- $a=-1,b ne 9$
- $ane-1,b = 9$
- $a=1,b ne 9$
I really fail to understand why the answer cannot be option (1).
Here's my method:
For $a = -1$, the coefficient determinant determinant is 0. And if we create $Delta_z$, the determinant in which coefficients of $z$ are replaced by $3,6,b$, (b= 9), that determinant is non zero.
My book says that if coefficient determinant is $0$ and at least one of $Delta_y, Delta_z, Delta_x$ is non $0$ then the system has no solution.
But the answer given is $(2)$. What's wrong with my method? What's the best way to tackle such problems?
linear-algebra matrices systems-of-equations determinant
For choice (1), isn't (x, y, z) = (4, 1, 0) a solution?
– Gaffney
Jan 2 at 22:07
add a comment |
If the system of linear equations,
begin{cases}
x &+ ay &+ z &= 3\
x &+ 2y &+ 2z &= 6\
x &+ 5y &+ 3z &= b\
end{cases}
has no solution, then:
- $a=-1,b=9$
- $a=-1,b ne 9$
- $ane-1,b = 9$
- $a=1,b ne 9$
I really fail to understand why the answer cannot be option (1).
Here's my method:
For $a = -1$, the coefficient determinant determinant is 0. And if we create $Delta_z$, the determinant in which coefficients of $z$ are replaced by $3,6,b$, (b= 9), that determinant is non zero.
My book says that if coefficient determinant is $0$ and at least one of $Delta_y, Delta_z, Delta_x$ is non $0$ then the system has no solution.
But the answer given is $(2)$. What's wrong with my method? What's the best way to tackle such problems?
linear-algebra matrices systems-of-equations determinant
If the system of linear equations,
begin{cases}
x &+ ay &+ z &= 3\
x &+ 2y &+ 2z &= 6\
x &+ 5y &+ 3z &= b\
end{cases}
has no solution, then:
- $a=-1,b=9$
- $a=-1,b ne 9$
- $ane-1,b = 9$
- $a=1,b ne 9$
I really fail to understand why the answer cannot be option (1).
Here's my method:
For $a = -1$, the coefficient determinant determinant is 0. And if we create $Delta_z$, the determinant in which coefficients of $z$ are replaced by $3,6,b$, (b= 9), that determinant is non zero.
My book says that if coefficient determinant is $0$ and at least one of $Delta_y, Delta_z, Delta_x$ is non $0$ then the system has no solution.
But the answer given is $(2)$. What's wrong with my method? What's the best way to tackle such problems?
linear-algebra matrices systems-of-equations determinant
linear-algebra matrices systems-of-equations determinant
edited 2 days ago
gt6989b
33.1k22452
33.1k22452
asked Jan 2 at 21:57
Abcd
3,02021134
3,02021134
For choice (1), isn't (x, y, z) = (4, 1, 0) a solution?
– Gaffney
Jan 2 at 22:07
add a comment |
For choice (1), isn't (x, y, z) = (4, 1, 0) a solution?
– Gaffney
Jan 2 at 22:07
For choice (1), isn't (x, y, z) = (4, 1, 0) a solution?
– Gaffney
Jan 2 at 22:07
For choice (1), isn't (x, y, z) = (4, 1, 0) a solution?
– Gaffney
Jan 2 at 22:07
add a comment |
4 Answers
4
active
oldest
votes
You miscalculated $Delta_z$. The book solution is correct.
In order to have no solution, it is necessary that the determinant of the matrix of coefficients be zero: this indeed yields $a=-1$. The rank of the matrix is $2$ in this case, and up to a constant multiple, the only nontrivial "dependence" of the equations can be $1cdot (1)-2cdot (2) +1cdot (3) = 0$.
So under the $a=-1$ assumption, there are infinitely many solutions iff this generalizes to the right hand sides, that is, iff $3-2cdot 6 + b =0$, i.e., $b=9$.
Hence, the answer is $a=-1, bneq 9$.
add a comment |
I suppose the best way to tackle is to row-reduce the matrix and see what happens. You have to eliminate the third and the first columns:
$$
begin{pmatrix}
1 & a & 1 & 3\
1 & 2 & 2 & 6 \
1 & 5 & 3 & b
end{pmatrix}
to
begin{pmatrix}
1 & a & 1 & 3\
0 & 2-a & 1 & 3 \
0 & 5-a & 2 & b-3
end{pmatrix}
to
begin{pmatrix}
1 & 2a-2 & 0 & 0\
0 & 2-a & 1 & 3 \
0 & 1+a & 0 & b-9
end{pmatrix}
$$
so if $a=-1$ the last equation reads $0=b-9$, thus having $b=9$ you have $0=0$, which eliminates the equation, and now you have 2 equations in 3 unknowns, hence an infinite number of solutions. Thus (i) cannot be the answer.
The condition for no solutions would require that $a=-1$ (forcing the last equation to read $0=b-9$) and $b ne 9$ (forcing it to be false).
UPDATE
In retrospect, as you say, if $a=-1$ then $Delta = 0$, so there will not be a unique solution. However, if $b = 9$, the last column of $Delta_z$ is $(3,6,9) = 3 times (1,2,3)$, so exactly $3$ times the last column of $Delta$, hence, $Delta_z = 3Delta = 0$, and the idea in your book is correct.
Question asks the condition for no solution...
– Abcd
Jan 2 at 22:16
@Abcd see update
– gt6989b
Jan 2 at 22:18
"you have to eliminate the third and the first columns"- why?
– Abcd
Jan 2 at 22:22
@Abcd because they have no variables, much easier to eliminate these than pivoting on column with $a$ in. You can still do it, but it is more arithmetic. BTW method of your book is correct, see another update
– gt6989b
Jan 2 at 22:25
Thanks for your time. I understand that you have applied transformations to the determinant. But I am unable to follow after that... What is the new determinant supposed to indicate?
– Abcd
Jan 2 at 22:27
|
show 3 more comments
I would do it this way, using row reduction. The criterion for a non-homogeneous linear system to have solutions is that the matrix of the linear system (l.h.s.) and the augmented matrix have the same rank.
From this criterion we deduce readily that if this system has no solution, the matrix of the l.h.s. cannot have rank $3$, hence its determinant, which is equal to $-(a+1)$ is zero, whence $a=-1$. Computing the determinant by row reduction shows this matrix has rank $2$.
Now, if $a=-1$, the augmented matrix reduces as follows:
$$begin{bmatrix}1&-1&1&3\1&2&2&6\1&5&3&bend{bmatrix}rightsquigarrow
begin{bmatrix}1&-1&1&3\0&3&1&3\0&3&1&b-6end{bmatrix}rightsquigarrow
begin{bmatrix}1&-1&1&3\0&3&1&3\0&0&0&b-9end{bmatrix} $$
Thus, for $a=-1$, the augmented matrix has rank $3$ if and only if $b-9ne 0$.
add a comment |
Rewrite the system as:
$$
AX=B
$$
where $X=(x,y,z)^t$, $B=(3,6,b)^t$ and
$$A = begin{bmatrix}
1 & a & 1 \
1 & 2 & 2 \
1 & 5 & 3
end{bmatrix}$$
First you must have $det(A)=0$ which after calculations give $a=-1$.
So the system becomes:
$$A = begin{bmatrix}
1 & -1 & 1 \
1 & 2 & 2 \
1 & 5 & 3
end{bmatrix}$$
Now, row 3 becomes all zero when $r_3rightarrow r_3-2r_2+r_1$. Applying this to the augmented matrix $[A|B]$ gives the $(3,4)$ entry to be:
$$
b-9
$$
It is required that this entry is nonzero in order to have an inconsistent matrix.
Thus, $a=-1, bneq 9$.
add a comment |
Your Answer
StackExchange.ifUsing("editor", function () {
return StackExchange.using("mathjaxEditing", function () {
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
});
});
}, "mathjax-editing");
StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "69"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});
function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});
}
});
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3060025%2fsystem-of-equations-has-no-solution%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
4 Answers
4
active
oldest
votes
4 Answers
4
active
oldest
votes
active
oldest
votes
active
oldest
votes
You miscalculated $Delta_z$. The book solution is correct.
In order to have no solution, it is necessary that the determinant of the matrix of coefficients be zero: this indeed yields $a=-1$. The rank of the matrix is $2$ in this case, and up to a constant multiple, the only nontrivial "dependence" of the equations can be $1cdot (1)-2cdot (2) +1cdot (3) = 0$.
So under the $a=-1$ assumption, there are infinitely many solutions iff this generalizes to the right hand sides, that is, iff $3-2cdot 6 + b =0$, i.e., $b=9$.
Hence, the answer is $a=-1, bneq 9$.
add a comment |
You miscalculated $Delta_z$. The book solution is correct.
In order to have no solution, it is necessary that the determinant of the matrix of coefficients be zero: this indeed yields $a=-1$. The rank of the matrix is $2$ in this case, and up to a constant multiple, the only nontrivial "dependence" of the equations can be $1cdot (1)-2cdot (2) +1cdot (3) = 0$.
So under the $a=-1$ assumption, there are infinitely many solutions iff this generalizes to the right hand sides, that is, iff $3-2cdot 6 + b =0$, i.e., $b=9$.
Hence, the answer is $a=-1, bneq 9$.
add a comment |
You miscalculated $Delta_z$. The book solution is correct.
In order to have no solution, it is necessary that the determinant of the matrix of coefficients be zero: this indeed yields $a=-1$. The rank of the matrix is $2$ in this case, and up to a constant multiple, the only nontrivial "dependence" of the equations can be $1cdot (1)-2cdot (2) +1cdot (3) = 0$.
So under the $a=-1$ assumption, there are infinitely many solutions iff this generalizes to the right hand sides, that is, iff $3-2cdot 6 + b =0$, i.e., $b=9$.
Hence, the answer is $a=-1, bneq 9$.
You miscalculated $Delta_z$. The book solution is correct.
In order to have no solution, it is necessary that the determinant of the matrix of coefficients be zero: this indeed yields $a=-1$. The rank of the matrix is $2$ in this case, and up to a constant multiple, the only nontrivial "dependence" of the equations can be $1cdot (1)-2cdot (2) +1cdot (3) = 0$.
So under the $a=-1$ assumption, there are infinitely many solutions iff this generalizes to the right hand sides, that is, iff $3-2cdot 6 + b =0$, i.e., $b=9$.
Hence, the answer is $a=-1, bneq 9$.
answered Jan 2 at 22:16
A. Pongrácz
5,4251827
5,4251827
add a comment |
add a comment |
I suppose the best way to tackle is to row-reduce the matrix and see what happens. You have to eliminate the third and the first columns:
$$
begin{pmatrix}
1 & a & 1 & 3\
1 & 2 & 2 & 6 \
1 & 5 & 3 & b
end{pmatrix}
to
begin{pmatrix}
1 & a & 1 & 3\
0 & 2-a & 1 & 3 \
0 & 5-a & 2 & b-3
end{pmatrix}
to
begin{pmatrix}
1 & 2a-2 & 0 & 0\
0 & 2-a & 1 & 3 \
0 & 1+a & 0 & b-9
end{pmatrix}
$$
so if $a=-1$ the last equation reads $0=b-9$, thus having $b=9$ you have $0=0$, which eliminates the equation, and now you have 2 equations in 3 unknowns, hence an infinite number of solutions. Thus (i) cannot be the answer.
The condition for no solutions would require that $a=-1$ (forcing the last equation to read $0=b-9$) and $b ne 9$ (forcing it to be false).
UPDATE
In retrospect, as you say, if $a=-1$ then $Delta = 0$, so there will not be a unique solution. However, if $b = 9$, the last column of $Delta_z$ is $(3,6,9) = 3 times (1,2,3)$, so exactly $3$ times the last column of $Delta$, hence, $Delta_z = 3Delta = 0$, and the idea in your book is correct.
Question asks the condition for no solution...
– Abcd
Jan 2 at 22:16
@Abcd see update
– gt6989b
Jan 2 at 22:18
"you have to eliminate the third and the first columns"- why?
– Abcd
Jan 2 at 22:22
@Abcd because they have no variables, much easier to eliminate these than pivoting on column with $a$ in. You can still do it, but it is more arithmetic. BTW method of your book is correct, see another update
– gt6989b
Jan 2 at 22:25
Thanks for your time. I understand that you have applied transformations to the determinant. But I am unable to follow after that... What is the new determinant supposed to indicate?
– Abcd
Jan 2 at 22:27
|
show 3 more comments
I suppose the best way to tackle is to row-reduce the matrix and see what happens. You have to eliminate the third and the first columns:
$$
begin{pmatrix}
1 & a & 1 & 3\
1 & 2 & 2 & 6 \
1 & 5 & 3 & b
end{pmatrix}
to
begin{pmatrix}
1 & a & 1 & 3\
0 & 2-a & 1 & 3 \
0 & 5-a & 2 & b-3
end{pmatrix}
to
begin{pmatrix}
1 & 2a-2 & 0 & 0\
0 & 2-a & 1 & 3 \
0 & 1+a & 0 & b-9
end{pmatrix}
$$
so if $a=-1$ the last equation reads $0=b-9$, thus having $b=9$ you have $0=0$, which eliminates the equation, and now you have 2 equations in 3 unknowns, hence an infinite number of solutions. Thus (i) cannot be the answer.
The condition for no solutions would require that $a=-1$ (forcing the last equation to read $0=b-9$) and $b ne 9$ (forcing it to be false).
UPDATE
In retrospect, as you say, if $a=-1$ then $Delta = 0$, so there will not be a unique solution. However, if $b = 9$, the last column of $Delta_z$ is $(3,6,9) = 3 times (1,2,3)$, so exactly $3$ times the last column of $Delta$, hence, $Delta_z = 3Delta = 0$, and the idea in your book is correct.
Question asks the condition for no solution...
– Abcd
Jan 2 at 22:16
@Abcd see update
– gt6989b
Jan 2 at 22:18
"you have to eliminate the third and the first columns"- why?
– Abcd
Jan 2 at 22:22
@Abcd because they have no variables, much easier to eliminate these than pivoting on column with $a$ in. You can still do it, but it is more arithmetic. BTW method of your book is correct, see another update
– gt6989b
Jan 2 at 22:25
Thanks for your time. I understand that you have applied transformations to the determinant. But I am unable to follow after that... What is the new determinant supposed to indicate?
– Abcd
Jan 2 at 22:27
|
show 3 more comments
I suppose the best way to tackle is to row-reduce the matrix and see what happens. You have to eliminate the third and the first columns:
$$
begin{pmatrix}
1 & a & 1 & 3\
1 & 2 & 2 & 6 \
1 & 5 & 3 & b
end{pmatrix}
to
begin{pmatrix}
1 & a & 1 & 3\
0 & 2-a & 1 & 3 \
0 & 5-a & 2 & b-3
end{pmatrix}
to
begin{pmatrix}
1 & 2a-2 & 0 & 0\
0 & 2-a & 1 & 3 \
0 & 1+a & 0 & b-9
end{pmatrix}
$$
so if $a=-1$ the last equation reads $0=b-9$, thus having $b=9$ you have $0=0$, which eliminates the equation, and now you have 2 equations in 3 unknowns, hence an infinite number of solutions. Thus (i) cannot be the answer.
The condition for no solutions would require that $a=-1$ (forcing the last equation to read $0=b-9$) and $b ne 9$ (forcing it to be false).
UPDATE
In retrospect, as you say, if $a=-1$ then $Delta = 0$, so there will not be a unique solution. However, if $b = 9$, the last column of $Delta_z$ is $(3,6,9) = 3 times (1,2,3)$, so exactly $3$ times the last column of $Delta$, hence, $Delta_z = 3Delta = 0$, and the idea in your book is correct.
I suppose the best way to tackle is to row-reduce the matrix and see what happens. You have to eliminate the third and the first columns:
$$
begin{pmatrix}
1 & a & 1 & 3\
1 & 2 & 2 & 6 \
1 & 5 & 3 & b
end{pmatrix}
to
begin{pmatrix}
1 & a & 1 & 3\
0 & 2-a & 1 & 3 \
0 & 5-a & 2 & b-3
end{pmatrix}
to
begin{pmatrix}
1 & 2a-2 & 0 & 0\
0 & 2-a & 1 & 3 \
0 & 1+a & 0 & b-9
end{pmatrix}
$$
so if $a=-1$ the last equation reads $0=b-9$, thus having $b=9$ you have $0=0$, which eliminates the equation, and now you have 2 equations in 3 unknowns, hence an infinite number of solutions. Thus (i) cannot be the answer.
The condition for no solutions would require that $a=-1$ (forcing the last equation to read $0=b-9$) and $b ne 9$ (forcing it to be false).
UPDATE
In retrospect, as you say, if $a=-1$ then $Delta = 0$, so there will not be a unique solution. However, if $b = 9$, the last column of $Delta_z$ is $(3,6,9) = 3 times (1,2,3)$, so exactly $3$ times the last column of $Delta$, hence, $Delta_z = 3Delta = 0$, and the idea in your book is correct.
edited Jan 2 at 22:24
answered Jan 2 at 22:15
gt6989b
33.1k22452
33.1k22452
Question asks the condition for no solution...
– Abcd
Jan 2 at 22:16
@Abcd see update
– gt6989b
Jan 2 at 22:18
"you have to eliminate the third and the first columns"- why?
– Abcd
Jan 2 at 22:22
@Abcd because they have no variables, much easier to eliminate these than pivoting on column with $a$ in. You can still do it, but it is more arithmetic. BTW method of your book is correct, see another update
– gt6989b
Jan 2 at 22:25
Thanks for your time. I understand that you have applied transformations to the determinant. But I am unable to follow after that... What is the new determinant supposed to indicate?
– Abcd
Jan 2 at 22:27
|
show 3 more comments
Question asks the condition for no solution...
– Abcd
Jan 2 at 22:16
@Abcd see update
– gt6989b
Jan 2 at 22:18
"you have to eliminate the third and the first columns"- why?
– Abcd
Jan 2 at 22:22
@Abcd because they have no variables, much easier to eliminate these than pivoting on column with $a$ in. You can still do it, but it is more arithmetic. BTW method of your book is correct, see another update
– gt6989b
Jan 2 at 22:25
Thanks for your time. I understand that you have applied transformations to the determinant. But I am unable to follow after that... What is the new determinant supposed to indicate?
– Abcd
Jan 2 at 22:27
Question asks the condition for no solution...
– Abcd
Jan 2 at 22:16
Question asks the condition for no solution...
– Abcd
Jan 2 at 22:16
@Abcd see update
– gt6989b
Jan 2 at 22:18
@Abcd see update
– gt6989b
Jan 2 at 22:18
"you have to eliminate the third and the first columns"- why?
– Abcd
Jan 2 at 22:22
"you have to eliminate the third and the first columns"- why?
– Abcd
Jan 2 at 22:22
@Abcd because they have no variables, much easier to eliminate these than pivoting on column with $a$ in. You can still do it, but it is more arithmetic. BTW method of your book is correct, see another update
– gt6989b
Jan 2 at 22:25
@Abcd because they have no variables, much easier to eliminate these than pivoting on column with $a$ in. You can still do it, but it is more arithmetic. BTW method of your book is correct, see another update
– gt6989b
Jan 2 at 22:25
Thanks for your time. I understand that you have applied transformations to the determinant. But I am unable to follow after that... What is the new determinant supposed to indicate?
– Abcd
Jan 2 at 22:27
Thanks for your time. I understand that you have applied transformations to the determinant. But I am unable to follow after that... What is the new determinant supposed to indicate?
– Abcd
Jan 2 at 22:27
|
show 3 more comments
I would do it this way, using row reduction. The criterion for a non-homogeneous linear system to have solutions is that the matrix of the linear system (l.h.s.) and the augmented matrix have the same rank.
From this criterion we deduce readily that if this system has no solution, the matrix of the l.h.s. cannot have rank $3$, hence its determinant, which is equal to $-(a+1)$ is zero, whence $a=-1$. Computing the determinant by row reduction shows this matrix has rank $2$.
Now, if $a=-1$, the augmented matrix reduces as follows:
$$begin{bmatrix}1&-1&1&3\1&2&2&6\1&5&3&bend{bmatrix}rightsquigarrow
begin{bmatrix}1&-1&1&3\0&3&1&3\0&3&1&b-6end{bmatrix}rightsquigarrow
begin{bmatrix}1&-1&1&3\0&3&1&3\0&0&0&b-9end{bmatrix} $$
Thus, for $a=-1$, the augmented matrix has rank $3$ if and only if $b-9ne 0$.
add a comment |
I would do it this way, using row reduction. The criterion for a non-homogeneous linear system to have solutions is that the matrix of the linear system (l.h.s.) and the augmented matrix have the same rank.
From this criterion we deduce readily that if this system has no solution, the matrix of the l.h.s. cannot have rank $3$, hence its determinant, which is equal to $-(a+1)$ is zero, whence $a=-1$. Computing the determinant by row reduction shows this matrix has rank $2$.
Now, if $a=-1$, the augmented matrix reduces as follows:
$$begin{bmatrix}1&-1&1&3\1&2&2&6\1&5&3&bend{bmatrix}rightsquigarrow
begin{bmatrix}1&-1&1&3\0&3&1&3\0&3&1&b-6end{bmatrix}rightsquigarrow
begin{bmatrix}1&-1&1&3\0&3&1&3\0&0&0&b-9end{bmatrix} $$
Thus, for $a=-1$, the augmented matrix has rank $3$ if and only if $b-9ne 0$.
add a comment |
I would do it this way, using row reduction. The criterion for a non-homogeneous linear system to have solutions is that the matrix of the linear system (l.h.s.) and the augmented matrix have the same rank.
From this criterion we deduce readily that if this system has no solution, the matrix of the l.h.s. cannot have rank $3$, hence its determinant, which is equal to $-(a+1)$ is zero, whence $a=-1$. Computing the determinant by row reduction shows this matrix has rank $2$.
Now, if $a=-1$, the augmented matrix reduces as follows:
$$begin{bmatrix}1&-1&1&3\1&2&2&6\1&5&3&bend{bmatrix}rightsquigarrow
begin{bmatrix}1&-1&1&3\0&3&1&3\0&3&1&b-6end{bmatrix}rightsquigarrow
begin{bmatrix}1&-1&1&3\0&3&1&3\0&0&0&b-9end{bmatrix} $$
Thus, for $a=-1$, the augmented matrix has rank $3$ if and only if $b-9ne 0$.
I would do it this way, using row reduction. The criterion for a non-homogeneous linear system to have solutions is that the matrix of the linear system (l.h.s.) and the augmented matrix have the same rank.
From this criterion we deduce readily that if this system has no solution, the matrix of the l.h.s. cannot have rank $3$, hence its determinant, which is equal to $-(a+1)$ is zero, whence $a=-1$. Computing the determinant by row reduction shows this matrix has rank $2$.
Now, if $a=-1$, the augmented matrix reduces as follows:
$$begin{bmatrix}1&-1&1&3\1&2&2&6\1&5&3&bend{bmatrix}rightsquigarrow
begin{bmatrix}1&-1&1&3\0&3&1&3\0&3&1&b-6end{bmatrix}rightsquigarrow
begin{bmatrix}1&-1&1&3\0&3&1&3\0&0&0&b-9end{bmatrix} $$
Thus, for $a=-1$, the augmented matrix has rank $3$ if and only if $b-9ne 0$.
answered Jan 2 at 22:24
Bernard
118k639112
118k639112
add a comment |
add a comment |
Rewrite the system as:
$$
AX=B
$$
where $X=(x,y,z)^t$, $B=(3,6,b)^t$ and
$$A = begin{bmatrix}
1 & a & 1 \
1 & 2 & 2 \
1 & 5 & 3
end{bmatrix}$$
First you must have $det(A)=0$ which after calculations give $a=-1$.
So the system becomes:
$$A = begin{bmatrix}
1 & -1 & 1 \
1 & 2 & 2 \
1 & 5 & 3
end{bmatrix}$$
Now, row 3 becomes all zero when $r_3rightarrow r_3-2r_2+r_1$. Applying this to the augmented matrix $[A|B]$ gives the $(3,4)$ entry to be:
$$
b-9
$$
It is required that this entry is nonzero in order to have an inconsistent matrix.
Thus, $a=-1, bneq 9$.
add a comment |
Rewrite the system as:
$$
AX=B
$$
where $X=(x,y,z)^t$, $B=(3,6,b)^t$ and
$$A = begin{bmatrix}
1 & a & 1 \
1 & 2 & 2 \
1 & 5 & 3
end{bmatrix}$$
First you must have $det(A)=0$ which after calculations give $a=-1$.
So the system becomes:
$$A = begin{bmatrix}
1 & -1 & 1 \
1 & 2 & 2 \
1 & 5 & 3
end{bmatrix}$$
Now, row 3 becomes all zero when $r_3rightarrow r_3-2r_2+r_1$. Applying this to the augmented matrix $[A|B]$ gives the $(3,4)$ entry to be:
$$
b-9
$$
It is required that this entry is nonzero in order to have an inconsistent matrix.
Thus, $a=-1, bneq 9$.
add a comment |
Rewrite the system as:
$$
AX=B
$$
where $X=(x,y,z)^t$, $B=(3,6,b)^t$ and
$$A = begin{bmatrix}
1 & a & 1 \
1 & 2 & 2 \
1 & 5 & 3
end{bmatrix}$$
First you must have $det(A)=0$ which after calculations give $a=-1$.
So the system becomes:
$$A = begin{bmatrix}
1 & -1 & 1 \
1 & 2 & 2 \
1 & 5 & 3
end{bmatrix}$$
Now, row 3 becomes all zero when $r_3rightarrow r_3-2r_2+r_1$. Applying this to the augmented matrix $[A|B]$ gives the $(3,4)$ entry to be:
$$
b-9
$$
It is required that this entry is nonzero in order to have an inconsistent matrix.
Thus, $a=-1, bneq 9$.
Rewrite the system as:
$$
AX=B
$$
where $X=(x,y,z)^t$, $B=(3,6,b)^t$ and
$$A = begin{bmatrix}
1 & a & 1 \
1 & 2 & 2 \
1 & 5 & 3
end{bmatrix}$$
First you must have $det(A)=0$ which after calculations give $a=-1$.
So the system becomes:
$$A = begin{bmatrix}
1 & -1 & 1 \
1 & 2 & 2 \
1 & 5 & 3
end{bmatrix}$$
Now, row 3 becomes all zero when $r_3rightarrow r_3-2r_2+r_1$. Applying this to the augmented matrix $[A|B]$ gives the $(3,4)$ entry to be:
$$
b-9
$$
It is required that this entry is nonzero in order to have an inconsistent matrix.
Thus, $a=-1, bneq 9$.
answered Jan 2 at 22:27
Test123
2,762828
2,762828
add a comment |
add a comment |
Thanks for contributing an answer to Mathematics Stack Exchange!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
Use MathJax to format equations. MathJax reference.
To learn more, see our tips on writing great answers.
Some of your past answers have not been well-received, and you're in danger of being blocked from answering.
Please pay close attention to the following guidance:
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3060025%2fsystem-of-equations-has-no-solution%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
For choice (1), isn't (x, y, z) = (4, 1, 0) a solution?
– Gaffney
Jan 2 at 22:07