Similar Invertible Matrices
$begingroup$
If $B$ is similar to $A$, show that there exists an invertible matrix $S$ and another marix $T$ such that $A=ST$ and $B=TS$.
So I know that $B$ being similar to $A$ implies $M^{-1}AM=B$. Can I just say let $A$ be a product of 2 invertible matrices $S$ and $T$ then manipulate $M$ to be either $S$ or $T$?
linear-algebra matrices proof-verification
$endgroup$
add a comment |
$begingroup$
If $B$ is similar to $A$, show that there exists an invertible matrix $S$ and another marix $T$ such that $A=ST$ and $B=TS$.
So I know that $B$ being similar to $A$ implies $M^{-1}AM=B$. Can I just say let $A$ be a product of 2 invertible matrices $S$ and $T$ then manipulate $M$ to be either $S$ or $T$?
linear-algebra matrices proof-verification
$endgroup$
$begingroup$
You can do this to get an idea of what you must get, but it's not a valid proof. You must show a construction without this supposition.
$endgroup$
– Lucas Henrique
Dec 13 '18 at 21:55
add a comment |
$begingroup$
If $B$ is similar to $A$, show that there exists an invertible matrix $S$ and another marix $T$ such that $A=ST$ and $B=TS$.
So I know that $B$ being similar to $A$ implies $M^{-1}AM=B$. Can I just say let $A$ be a product of 2 invertible matrices $S$ and $T$ then manipulate $M$ to be either $S$ or $T$?
linear-algebra matrices proof-verification
$endgroup$
If $B$ is similar to $A$, show that there exists an invertible matrix $S$ and another marix $T$ such that $A=ST$ and $B=TS$.
So I know that $B$ being similar to $A$ implies $M^{-1}AM=B$. Can I just say let $A$ be a product of 2 invertible matrices $S$ and $T$ then manipulate $M$ to be either $S$ or $T$?
linear-algebra matrices proof-verification
linear-algebra matrices proof-verification
asked Dec 13 '18 at 21:48
FundementalJTheoremFundementalJTheorem
424
424
$begingroup$
You can do this to get an idea of what you must get, but it's not a valid proof. You must show a construction without this supposition.
$endgroup$
– Lucas Henrique
Dec 13 '18 at 21:55
add a comment |
$begingroup$
You can do this to get an idea of what you must get, but it's not a valid proof. You must show a construction without this supposition.
$endgroup$
– Lucas Henrique
Dec 13 '18 at 21:55
$begingroup$
You can do this to get an idea of what you must get, but it's not a valid proof. You must show a construction without this supposition.
$endgroup$
– Lucas Henrique
Dec 13 '18 at 21:55
$begingroup$
You can do this to get an idea of what you must get, but it's not a valid proof. You must show a construction without this supposition.
$endgroup$
– Lucas Henrique
Dec 13 '18 at 21:55
add a comment |
2 Answers
2
active
oldest
votes
$begingroup$
Let $A$ and $B$ be similar. Then we have $A=S(BS^{-1})=ST$ with $T=BS^{-1}$. It follows that
$$
TS=BS^{-1}S=B.
$$
$endgroup$
add a comment |
$begingroup$
Write the similarity condition as $AM=MB$.
Can you see, that you are quite close to the wanted product presentation?
$endgroup$
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%2f3038610%2fsimilar-invertible-matrices%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
2 Answers
2
active
oldest
votes
2 Answers
2
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
Let $A$ and $B$ be similar. Then we have $A=S(BS^{-1})=ST$ with $T=BS^{-1}$. It follows that
$$
TS=BS^{-1}S=B.
$$
$endgroup$
add a comment |
$begingroup$
Let $A$ and $B$ be similar. Then we have $A=S(BS^{-1})=ST$ with $T=BS^{-1}$. It follows that
$$
TS=BS^{-1}S=B.
$$
$endgroup$
add a comment |
$begingroup$
Let $A$ and $B$ be similar. Then we have $A=S(BS^{-1})=ST$ with $T=BS^{-1}$. It follows that
$$
TS=BS^{-1}S=B.
$$
$endgroup$
Let $A$ and $B$ be similar. Then we have $A=S(BS^{-1})=ST$ with $T=BS^{-1}$. It follows that
$$
TS=BS^{-1}S=B.
$$
answered Dec 13 '18 at 21:56
Dietrich BurdeDietrich Burde
79.2k647103
79.2k647103
add a comment |
add a comment |
$begingroup$
Write the similarity condition as $AM=MB$.
Can you see, that you are quite close to the wanted product presentation?
$endgroup$
add a comment |
$begingroup$
Write the similarity condition as $AM=MB$.
Can you see, that you are quite close to the wanted product presentation?
$endgroup$
add a comment |
$begingroup$
Write the similarity condition as $AM=MB$.
Can you see, that you are quite close to the wanted product presentation?
$endgroup$
Write the similarity condition as $AM=MB$.
Can you see, that you are quite close to the wanted product presentation?
edited Dec 14 '18 at 11:49
answered Dec 13 '18 at 21:56
HannoHanno
2,223428
2,223428
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.
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%2f3038610%2fsimilar-invertible-matrices%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
$begingroup$
You can do this to get an idea of what you must get, but it's not a valid proof. You must show a construction without this supposition.
$endgroup$
– Lucas Henrique
Dec 13 '18 at 21:55