Reduced row echelon of Z/2Z












0












$begingroup$


enter image description here



I've gotten (1 0 1 0 1 0; 0 1 1 0 0 1; 0 0 0 0 0 0), which looks like it is of row reduced form, but would I not also be able to simplify this further to (1 0 0 0 1 0; 0 1 0 0 0 1; 0 0 0 0 0 0), this is confusing me since I thought rref was unique?










share|cite|improve this question











$endgroup$












  • $begingroup$
    The matrix after "I've gotten" is the same as that after "would I not also be able to simplify this further to". Did you mistype something?
    $endgroup$
    – coffeemath
    Jan 27 at 20:17










  • $begingroup$
    Yes, I've corrected it now.
    $endgroup$
    – 4M4D3U5 M0Z4RT
    Jan 27 at 20:21










  • $begingroup$
    Could you show in question the steps how you got to the second matrix?
    $endgroup$
    – coffeemath
    Jan 27 at 20:24
















0












$begingroup$


enter image description here



I've gotten (1 0 1 0 1 0; 0 1 1 0 0 1; 0 0 0 0 0 0), which looks like it is of row reduced form, but would I not also be able to simplify this further to (1 0 0 0 1 0; 0 1 0 0 0 1; 0 0 0 0 0 0), this is confusing me since I thought rref was unique?










share|cite|improve this question











$endgroup$












  • $begingroup$
    The matrix after "I've gotten" is the same as that after "would I not also be able to simplify this further to". Did you mistype something?
    $endgroup$
    – coffeemath
    Jan 27 at 20:17










  • $begingroup$
    Yes, I've corrected it now.
    $endgroup$
    – 4M4D3U5 M0Z4RT
    Jan 27 at 20:21










  • $begingroup$
    Could you show in question the steps how you got to the second matrix?
    $endgroup$
    – coffeemath
    Jan 27 at 20:24














0












0








0


0



$begingroup$


enter image description here



I've gotten (1 0 1 0 1 0; 0 1 1 0 0 1; 0 0 0 0 0 0), which looks like it is of row reduced form, but would I not also be able to simplify this further to (1 0 0 0 1 0; 0 1 0 0 0 1; 0 0 0 0 0 0), this is confusing me since I thought rref was unique?










share|cite|improve this question











$endgroup$




enter image description here



I've gotten (1 0 1 0 1 0; 0 1 1 0 0 1; 0 0 0 0 0 0), which looks like it is of row reduced form, but would I not also be able to simplify this further to (1 0 0 0 1 0; 0 1 0 0 0 1; 0 0 0 0 0 0), this is confusing me since I thought rref was unique?







linear-algebra






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Jan 27 at 20:21







4M4D3U5 M0Z4RT

















asked Jan 27 at 20:12









4M4D3U5 M0Z4RT4M4D3U5 M0Z4RT

386




386












  • $begingroup$
    The matrix after "I've gotten" is the same as that after "would I not also be able to simplify this further to". Did you mistype something?
    $endgroup$
    – coffeemath
    Jan 27 at 20:17










  • $begingroup$
    Yes, I've corrected it now.
    $endgroup$
    – 4M4D3U5 M0Z4RT
    Jan 27 at 20:21










  • $begingroup$
    Could you show in question the steps how you got to the second matrix?
    $endgroup$
    – coffeemath
    Jan 27 at 20:24


















  • $begingroup$
    The matrix after "I've gotten" is the same as that after "would I not also be able to simplify this further to". Did you mistype something?
    $endgroup$
    – coffeemath
    Jan 27 at 20:17










  • $begingroup$
    Yes, I've corrected it now.
    $endgroup$
    – 4M4D3U5 M0Z4RT
    Jan 27 at 20:21










  • $begingroup$
    Could you show in question the steps how you got to the second matrix?
    $endgroup$
    – coffeemath
    Jan 27 at 20:24
















$begingroup$
The matrix after "I've gotten" is the same as that after "would I not also be able to simplify this further to". Did you mistype something?
$endgroup$
– coffeemath
Jan 27 at 20:17




$begingroup$
The matrix after "I've gotten" is the same as that after "would I not also be able to simplify this further to". Did you mistype something?
$endgroup$
– coffeemath
Jan 27 at 20:17












$begingroup$
Yes, I've corrected it now.
$endgroup$
– 4M4D3U5 M0Z4RT
Jan 27 at 20:21




$begingroup$
Yes, I've corrected it now.
$endgroup$
– 4M4D3U5 M0Z4RT
Jan 27 at 20:21












$begingroup$
Could you show in question the steps how you got to the second matrix?
$endgroup$
– coffeemath
Jan 27 at 20:24




$begingroup$
Could you show in question the steps how you got to the second matrix?
$endgroup$
– coffeemath
Jan 27 at 20:24










1 Answer
1






active

oldest

votes


















1












$begingroup$

begin{align}
begin{bmatrix}
0 & 1 & 1 & 0 & 0 & 1 \
1 & 0 & 1 & 0 & 1 & 0 \
1 & 1 & 0 & 0 & 1 & 1
end{bmatrix}
&to
begin{bmatrix}
1 & 0 & 1 & 0 & 1 & 0 \
0 & 1 & 1 & 0 & 0 & 1 \
1 & 1 & 0 & 0 & 1 & 1
end{bmatrix}
&& R_1 leftrightarrow R_2
\[6px]
&to
begin{bmatrix}
1 & 0 & 1 & 0 & 1 & 0 \
0 & 1 & 1 & 0 & 0 & 1 \
0 & 1 & 1 & 0 & 0 & 1
end{bmatrix}
&& R_3gets R_3+R_1
\[6px]
&to
begin{bmatrix}
1 & 0 & 1 & 0 & 1 & 0 \
0 & 1 & 1 & 0 & 0 & 1 \
0 & 0 & 0 & 0 & 0 & 0
end{bmatrix}
&& R_3gets R_3+R_2
end{align}



The RREF is unique. The matrix
begin{bmatrix}
1 & 0 & 0 & 0 & 1 & 0 \
0 & 1 & 0 & 0 & 0 & 1 \
0 & 0 & 0 & 0 & 0 & 0
end{bmatrix}

is not row-equivalent, because the third column is not the sum of the first and second columns like in the matrix we started with. Row-equivalence doesn't change linear relations among columns.






share|cite|improve this answer









$endgroup$













  • $begingroup$
    Could I not just add rows 1 and 2 together and get a different matrix?
    $endgroup$
    – 4M4D3U5 M0Z4RT
    Jan 27 at 21:19










  • $begingroup$
    @4M4D3U5M0Z4RT But it wouldn't be the RREF any longer.
    $endgroup$
    – egreg
    Jan 27 at 21:29










  • $begingroup$
    is that not the same operation you used to, for example do R3 <-- R3+R1, what I meant gives, [1 0 1 0 1 0; 0 1 0 0 0 1; 0 0 0 0 0 0]
    $endgroup$
    – 4M4D3U5 M0Z4RT
    Jan 27 at 21:32












  • $begingroup$
    @4M4D3U5M0Z4RT If you perform a nontrivial row operation on the RREF, you get a matrix which is not RREF. Anyway, you don't get the matrix you wish to get. It's impossible, because the matrix you'd like to reduce to is not row-equivalent to the given matrix.
    $endgroup$
    – egreg
    Jan 27 at 21:35











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
});


}
});














draft saved

draft discarded


















StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3090058%2freduced-row-echelon-of-z-2z%23new-answer', 'question_page');
}
);

Post as a guest















Required, but never shown

























1 Answer
1






active

oldest

votes








1 Answer
1






active

oldest

votes









active

oldest

votes






active

oldest

votes









1












$begingroup$

begin{align}
begin{bmatrix}
0 & 1 & 1 & 0 & 0 & 1 \
1 & 0 & 1 & 0 & 1 & 0 \
1 & 1 & 0 & 0 & 1 & 1
end{bmatrix}
&to
begin{bmatrix}
1 & 0 & 1 & 0 & 1 & 0 \
0 & 1 & 1 & 0 & 0 & 1 \
1 & 1 & 0 & 0 & 1 & 1
end{bmatrix}
&& R_1 leftrightarrow R_2
\[6px]
&to
begin{bmatrix}
1 & 0 & 1 & 0 & 1 & 0 \
0 & 1 & 1 & 0 & 0 & 1 \
0 & 1 & 1 & 0 & 0 & 1
end{bmatrix}
&& R_3gets R_3+R_1
\[6px]
&to
begin{bmatrix}
1 & 0 & 1 & 0 & 1 & 0 \
0 & 1 & 1 & 0 & 0 & 1 \
0 & 0 & 0 & 0 & 0 & 0
end{bmatrix}
&& R_3gets R_3+R_2
end{align}



The RREF is unique. The matrix
begin{bmatrix}
1 & 0 & 0 & 0 & 1 & 0 \
0 & 1 & 0 & 0 & 0 & 1 \
0 & 0 & 0 & 0 & 0 & 0
end{bmatrix}

is not row-equivalent, because the third column is not the sum of the first and second columns like in the matrix we started with. Row-equivalence doesn't change linear relations among columns.






share|cite|improve this answer









$endgroup$













  • $begingroup$
    Could I not just add rows 1 and 2 together and get a different matrix?
    $endgroup$
    – 4M4D3U5 M0Z4RT
    Jan 27 at 21:19










  • $begingroup$
    @4M4D3U5M0Z4RT But it wouldn't be the RREF any longer.
    $endgroup$
    – egreg
    Jan 27 at 21:29










  • $begingroup$
    is that not the same operation you used to, for example do R3 <-- R3+R1, what I meant gives, [1 0 1 0 1 0; 0 1 0 0 0 1; 0 0 0 0 0 0]
    $endgroup$
    – 4M4D3U5 M0Z4RT
    Jan 27 at 21:32












  • $begingroup$
    @4M4D3U5M0Z4RT If you perform a nontrivial row operation on the RREF, you get a matrix which is not RREF. Anyway, you don't get the matrix you wish to get. It's impossible, because the matrix you'd like to reduce to is not row-equivalent to the given matrix.
    $endgroup$
    – egreg
    Jan 27 at 21:35
















1












$begingroup$

begin{align}
begin{bmatrix}
0 & 1 & 1 & 0 & 0 & 1 \
1 & 0 & 1 & 0 & 1 & 0 \
1 & 1 & 0 & 0 & 1 & 1
end{bmatrix}
&to
begin{bmatrix}
1 & 0 & 1 & 0 & 1 & 0 \
0 & 1 & 1 & 0 & 0 & 1 \
1 & 1 & 0 & 0 & 1 & 1
end{bmatrix}
&& R_1 leftrightarrow R_2
\[6px]
&to
begin{bmatrix}
1 & 0 & 1 & 0 & 1 & 0 \
0 & 1 & 1 & 0 & 0 & 1 \
0 & 1 & 1 & 0 & 0 & 1
end{bmatrix}
&& R_3gets R_3+R_1
\[6px]
&to
begin{bmatrix}
1 & 0 & 1 & 0 & 1 & 0 \
0 & 1 & 1 & 0 & 0 & 1 \
0 & 0 & 0 & 0 & 0 & 0
end{bmatrix}
&& R_3gets R_3+R_2
end{align}



The RREF is unique. The matrix
begin{bmatrix}
1 & 0 & 0 & 0 & 1 & 0 \
0 & 1 & 0 & 0 & 0 & 1 \
0 & 0 & 0 & 0 & 0 & 0
end{bmatrix}

is not row-equivalent, because the third column is not the sum of the first and second columns like in the matrix we started with. Row-equivalence doesn't change linear relations among columns.






share|cite|improve this answer









$endgroup$













  • $begingroup$
    Could I not just add rows 1 and 2 together and get a different matrix?
    $endgroup$
    – 4M4D3U5 M0Z4RT
    Jan 27 at 21:19










  • $begingroup$
    @4M4D3U5M0Z4RT But it wouldn't be the RREF any longer.
    $endgroup$
    – egreg
    Jan 27 at 21:29










  • $begingroup$
    is that not the same operation you used to, for example do R3 <-- R3+R1, what I meant gives, [1 0 1 0 1 0; 0 1 0 0 0 1; 0 0 0 0 0 0]
    $endgroup$
    – 4M4D3U5 M0Z4RT
    Jan 27 at 21:32












  • $begingroup$
    @4M4D3U5M0Z4RT If you perform a nontrivial row operation on the RREF, you get a matrix which is not RREF. Anyway, you don't get the matrix you wish to get. It's impossible, because the matrix you'd like to reduce to is not row-equivalent to the given matrix.
    $endgroup$
    – egreg
    Jan 27 at 21:35














1












1








1





$begingroup$

begin{align}
begin{bmatrix}
0 & 1 & 1 & 0 & 0 & 1 \
1 & 0 & 1 & 0 & 1 & 0 \
1 & 1 & 0 & 0 & 1 & 1
end{bmatrix}
&to
begin{bmatrix}
1 & 0 & 1 & 0 & 1 & 0 \
0 & 1 & 1 & 0 & 0 & 1 \
1 & 1 & 0 & 0 & 1 & 1
end{bmatrix}
&& R_1 leftrightarrow R_2
\[6px]
&to
begin{bmatrix}
1 & 0 & 1 & 0 & 1 & 0 \
0 & 1 & 1 & 0 & 0 & 1 \
0 & 1 & 1 & 0 & 0 & 1
end{bmatrix}
&& R_3gets R_3+R_1
\[6px]
&to
begin{bmatrix}
1 & 0 & 1 & 0 & 1 & 0 \
0 & 1 & 1 & 0 & 0 & 1 \
0 & 0 & 0 & 0 & 0 & 0
end{bmatrix}
&& R_3gets R_3+R_2
end{align}



The RREF is unique. The matrix
begin{bmatrix}
1 & 0 & 0 & 0 & 1 & 0 \
0 & 1 & 0 & 0 & 0 & 1 \
0 & 0 & 0 & 0 & 0 & 0
end{bmatrix}

is not row-equivalent, because the third column is not the sum of the first and second columns like in the matrix we started with. Row-equivalence doesn't change linear relations among columns.






share|cite|improve this answer









$endgroup$



begin{align}
begin{bmatrix}
0 & 1 & 1 & 0 & 0 & 1 \
1 & 0 & 1 & 0 & 1 & 0 \
1 & 1 & 0 & 0 & 1 & 1
end{bmatrix}
&to
begin{bmatrix}
1 & 0 & 1 & 0 & 1 & 0 \
0 & 1 & 1 & 0 & 0 & 1 \
1 & 1 & 0 & 0 & 1 & 1
end{bmatrix}
&& R_1 leftrightarrow R_2
\[6px]
&to
begin{bmatrix}
1 & 0 & 1 & 0 & 1 & 0 \
0 & 1 & 1 & 0 & 0 & 1 \
0 & 1 & 1 & 0 & 0 & 1
end{bmatrix}
&& R_3gets R_3+R_1
\[6px]
&to
begin{bmatrix}
1 & 0 & 1 & 0 & 1 & 0 \
0 & 1 & 1 & 0 & 0 & 1 \
0 & 0 & 0 & 0 & 0 & 0
end{bmatrix}
&& R_3gets R_3+R_2
end{align}



The RREF is unique. The matrix
begin{bmatrix}
1 & 0 & 0 & 0 & 1 & 0 \
0 & 1 & 0 & 0 & 0 & 1 \
0 & 0 & 0 & 0 & 0 & 0
end{bmatrix}

is not row-equivalent, because the third column is not the sum of the first and second columns like in the matrix we started with. Row-equivalence doesn't change linear relations among columns.







share|cite|improve this answer












share|cite|improve this answer



share|cite|improve this answer










answered Jan 27 at 20:31









egregegreg

185k1486206




185k1486206












  • $begingroup$
    Could I not just add rows 1 and 2 together and get a different matrix?
    $endgroup$
    – 4M4D3U5 M0Z4RT
    Jan 27 at 21:19










  • $begingroup$
    @4M4D3U5M0Z4RT But it wouldn't be the RREF any longer.
    $endgroup$
    – egreg
    Jan 27 at 21:29










  • $begingroup$
    is that not the same operation you used to, for example do R3 <-- R3+R1, what I meant gives, [1 0 1 0 1 0; 0 1 0 0 0 1; 0 0 0 0 0 0]
    $endgroup$
    – 4M4D3U5 M0Z4RT
    Jan 27 at 21:32












  • $begingroup$
    @4M4D3U5M0Z4RT If you perform a nontrivial row operation on the RREF, you get a matrix which is not RREF. Anyway, you don't get the matrix you wish to get. It's impossible, because the matrix you'd like to reduce to is not row-equivalent to the given matrix.
    $endgroup$
    – egreg
    Jan 27 at 21:35


















  • $begingroup$
    Could I not just add rows 1 and 2 together and get a different matrix?
    $endgroup$
    – 4M4D3U5 M0Z4RT
    Jan 27 at 21:19










  • $begingroup$
    @4M4D3U5M0Z4RT But it wouldn't be the RREF any longer.
    $endgroup$
    – egreg
    Jan 27 at 21:29










  • $begingroup$
    is that not the same operation you used to, for example do R3 <-- R3+R1, what I meant gives, [1 0 1 0 1 0; 0 1 0 0 0 1; 0 0 0 0 0 0]
    $endgroup$
    – 4M4D3U5 M0Z4RT
    Jan 27 at 21:32












  • $begingroup$
    @4M4D3U5M0Z4RT If you perform a nontrivial row operation on the RREF, you get a matrix which is not RREF. Anyway, you don't get the matrix you wish to get. It's impossible, because the matrix you'd like to reduce to is not row-equivalent to the given matrix.
    $endgroup$
    – egreg
    Jan 27 at 21:35
















$begingroup$
Could I not just add rows 1 and 2 together and get a different matrix?
$endgroup$
– 4M4D3U5 M0Z4RT
Jan 27 at 21:19




$begingroup$
Could I not just add rows 1 and 2 together and get a different matrix?
$endgroup$
– 4M4D3U5 M0Z4RT
Jan 27 at 21:19












$begingroup$
@4M4D3U5M0Z4RT But it wouldn't be the RREF any longer.
$endgroup$
– egreg
Jan 27 at 21:29




$begingroup$
@4M4D3U5M0Z4RT But it wouldn't be the RREF any longer.
$endgroup$
– egreg
Jan 27 at 21:29












$begingroup$
is that not the same operation you used to, for example do R3 <-- R3+R1, what I meant gives, [1 0 1 0 1 0; 0 1 0 0 0 1; 0 0 0 0 0 0]
$endgroup$
– 4M4D3U5 M0Z4RT
Jan 27 at 21:32






$begingroup$
is that not the same operation you used to, for example do R3 <-- R3+R1, what I meant gives, [1 0 1 0 1 0; 0 1 0 0 0 1; 0 0 0 0 0 0]
$endgroup$
– 4M4D3U5 M0Z4RT
Jan 27 at 21:32














$begingroup$
@4M4D3U5M0Z4RT If you perform a nontrivial row operation on the RREF, you get a matrix which is not RREF. Anyway, you don't get the matrix you wish to get. It's impossible, because the matrix you'd like to reduce to is not row-equivalent to the given matrix.
$endgroup$
– egreg
Jan 27 at 21:35




$begingroup$
@4M4D3U5M0Z4RT If you perform a nontrivial row operation on the RREF, you get a matrix which is not RREF. Anyway, you don't get the matrix you wish to get. It's impossible, because the matrix you'd like to reduce to is not row-equivalent to the given matrix.
$endgroup$
– egreg
Jan 27 at 21:35


















draft saved

draft discarded




















































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.




draft saved


draft discarded














StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3090058%2freduced-row-echelon-of-z-2z%23new-answer', 'question_page');
}
);

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







Popular posts from this blog

MongoDB - Not Authorized To Execute Command

How to fix TextFormField cause rebuild widget in Flutter

in spring boot 2.1 many test slices are not allowed anymore due to multiple @BootstrapWith