Is echelon form a requirement to show a matrix has no solutions?
Do I need to get a matrix into echelon form to prove that it has no solutions, or do I only need a pivot in the last column. For example, would the following row operation show that there are no solutions to the linear system represented that by the augmented matrix below?
$begin{bmatrix}1&-3&0&5\-1&1&5&2\-1&1&5&3end{bmatrix}$ $Rightarrow$ $begin{bmatrix}1&-3&0&5\-1&1&5&2\0&0&0&1end{bmatrix}$
linear-algebra matrices
New contributor
add a comment |
Do I need to get a matrix into echelon form to prove that it has no solutions, or do I only need a pivot in the last column. For example, would the following row operation show that there are no solutions to the linear system represented that by the augmented matrix below?
$begin{bmatrix}1&-3&0&5\-1&1&5&2\-1&1&5&3end{bmatrix}$ $Rightarrow$ $begin{bmatrix}1&-3&0&5\-1&1&5&2\0&0&0&1end{bmatrix}$
linear-algebra matrices
New contributor
What entry did you pivot on?
– coffeemath
Dec 25 at 22:21
I'm not sure what definition of pivot you are using. By pivot, I mean the "leading entry in a row".
– Gaussian Elimination
Dec 25 at 22:24
add a comment |
Do I need to get a matrix into echelon form to prove that it has no solutions, or do I only need a pivot in the last column. For example, would the following row operation show that there are no solutions to the linear system represented that by the augmented matrix below?
$begin{bmatrix}1&-3&0&5\-1&1&5&2\-1&1&5&3end{bmatrix}$ $Rightarrow$ $begin{bmatrix}1&-3&0&5\-1&1&5&2\0&0&0&1end{bmatrix}$
linear-algebra matrices
New contributor
Do I need to get a matrix into echelon form to prove that it has no solutions, or do I only need a pivot in the last column. For example, would the following row operation show that there are no solutions to the linear system represented that by the augmented matrix below?
$begin{bmatrix}1&-3&0&5\-1&1&5&2\-1&1&5&3end{bmatrix}$ $Rightarrow$ $begin{bmatrix}1&-3&0&5\-1&1&5&2\0&0&0&1end{bmatrix}$
linear-algebra matrices
linear-algebra matrices
New contributor
New contributor
New contributor
asked Dec 25 at 22:17
Gaussian Elimination
204
204
New contributor
New contributor
What entry did you pivot on?
– coffeemath
Dec 25 at 22:21
I'm not sure what definition of pivot you are using. By pivot, I mean the "leading entry in a row".
– Gaussian Elimination
Dec 25 at 22:24
add a comment |
What entry did you pivot on?
– coffeemath
Dec 25 at 22:21
I'm not sure what definition of pivot you are using. By pivot, I mean the "leading entry in a row".
– Gaussian Elimination
Dec 25 at 22:24
What entry did you pivot on?
– coffeemath
Dec 25 at 22:21
What entry did you pivot on?
– coffeemath
Dec 25 at 22:21
I'm not sure what definition of pivot you are using. By pivot, I mean the "leading entry in a row".
– Gaussian Elimination
Dec 25 at 22:24
I'm not sure what definition of pivot you are using. By pivot, I mean the "leading entry in a row".
– Gaussian Elimination
Dec 25 at 22:24
add a comment |
3 Answers
3
active
oldest
votes
Your transformation suffices; if you translate your matrix back into a system of linear equations, the last row gives the equation $0 cdot x + 0 cdot y + 0 cdot z = 1$.
This is indeed the beauty of the representation of systems of linear equations as matrices: you perform simple operations on the rows of the matrix but preserve the solution set of the original system. At the end, you just read off the solutions.
add a comment |
No, it's not required. Once you've performed row operations (as you have) to a point where you reach an inconsistency, you can conclude the system has no solutions. Going all the way to echelon form, or rref, won't change that.
add a comment |
You only have to prove the matrix of the homogeneous part and the augmented matrix do not have the same rank. In the present case, what you've done is enough: the matrix of the homogeneous part (first $3$ columns) has rank $2$ and the augmented matrix has rank $3$.
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
});
}
});
Gaussian Elimination is a new contributor. Be nice, and check out our Code of Conduct.
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%2f3052473%2fis-echelon-form-a-requirement-to-show-a-matrix-has-no-solutions%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
3 Answers
3
active
oldest
votes
3 Answers
3
active
oldest
votes
active
oldest
votes
active
oldest
votes
Your transformation suffices; if you translate your matrix back into a system of linear equations, the last row gives the equation $0 cdot x + 0 cdot y + 0 cdot z = 1$.
This is indeed the beauty of the representation of systems of linear equations as matrices: you perform simple operations on the rows of the matrix but preserve the solution set of the original system. At the end, you just read off the solutions.
add a comment |
Your transformation suffices; if you translate your matrix back into a system of linear equations, the last row gives the equation $0 cdot x + 0 cdot y + 0 cdot z = 1$.
This is indeed the beauty of the representation of systems of linear equations as matrices: you perform simple operations on the rows of the matrix but preserve the solution set of the original system. At the end, you just read off the solutions.
add a comment |
Your transformation suffices; if you translate your matrix back into a system of linear equations, the last row gives the equation $0 cdot x + 0 cdot y + 0 cdot z = 1$.
This is indeed the beauty of the representation of systems of linear equations as matrices: you perform simple operations on the rows of the matrix but preserve the solution set of the original system. At the end, you just read off the solutions.
Your transformation suffices; if you translate your matrix back into a system of linear equations, the last row gives the equation $0 cdot x + 0 cdot y + 0 cdot z = 1$.
This is indeed the beauty of the representation of systems of linear equations as matrices: you perform simple operations on the rows of the matrix but preserve the solution set of the original system. At the end, you just read off the solutions.
answered Dec 25 at 22:24
MacRance
1206
1206
add a comment |
add a comment |
No, it's not required. Once you've performed row operations (as you have) to a point where you reach an inconsistency, you can conclude the system has no solutions. Going all the way to echelon form, or rref, won't change that.
add a comment |
No, it's not required. Once you've performed row operations (as you have) to a point where you reach an inconsistency, you can conclude the system has no solutions. Going all the way to echelon form, or rref, won't change that.
add a comment |
No, it's not required. Once you've performed row operations (as you have) to a point where you reach an inconsistency, you can conclude the system has no solutions. Going all the way to echelon form, or rref, won't change that.
No, it's not required. Once you've performed row operations (as you have) to a point where you reach an inconsistency, you can conclude the system has no solutions. Going all the way to echelon form, or rref, won't change that.
answered Dec 25 at 22:25
pwerth
1,618411
1,618411
add a comment |
add a comment |
You only have to prove the matrix of the homogeneous part and the augmented matrix do not have the same rank. In the present case, what you've done is enough: the matrix of the homogeneous part (first $3$ columns) has rank $2$ and the augmented matrix has rank $3$.
add a comment |
You only have to prove the matrix of the homogeneous part and the augmented matrix do not have the same rank. In the present case, what you've done is enough: the matrix of the homogeneous part (first $3$ columns) has rank $2$ and the augmented matrix has rank $3$.
add a comment |
You only have to prove the matrix of the homogeneous part and the augmented matrix do not have the same rank. In the present case, what you've done is enough: the matrix of the homogeneous part (first $3$ columns) has rank $2$ and the augmented matrix has rank $3$.
You only have to prove the matrix of the homogeneous part and the augmented matrix do not have the same rank. In the present case, what you've done is enough: the matrix of the homogeneous part (first $3$ columns) has rank $2$ and the augmented matrix has rank $3$.
edited Dec 26 at 9:27
answered Dec 25 at 22:26
Bernard
118k639112
118k639112
add a comment |
add a comment |
Gaussian Elimination is a new contributor. Be nice, and check out our Code of Conduct.
Gaussian Elimination is a new contributor. Be nice, and check out our Code of Conduct.
Gaussian Elimination is a new contributor. Be nice, and check out our Code of Conduct.
Gaussian Elimination is a new contributor. Be nice, and check out our Code of Conduct.
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%2f3052473%2fis-echelon-form-a-requirement-to-show-a-matrix-has-no-solutions%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
What entry did you pivot on?
– coffeemath
Dec 25 at 22:21
I'm not sure what definition of pivot you are using. By pivot, I mean the "leading entry in a row".
– Gaussian Elimination
Dec 25 at 22:24