Proving the particular case of change of basis theorem over two matrix without using canonical basis.












0














Let $A in M_{m times n}(mathbb{F})$, and let $beta$ and $gamma$ ordinated basis for $mathbb{F}^n$ and $mathbb{F}^{m}$ respectively. Let $B=[L_{A}]_{beta} ^{gamma}$ . Show $B=P^{-1}AQ$ where $P in M_{m times m}$ is a matrix such their $j$-th column is the $j$-th vector of $gamma$ and $Q in M_{n times n}$ is a matrix such their $j$-th column is the $j$-th vector of $beta$.



I know $L_{A}:mathbb{F}^n to mathbb{F}^m$ where $L_{A}(v)=Av$ for every $v in mathbb{F}^n$. Then having $beta= lbrace beta_{1}, beta_{2},...,beta_{n} rbrace$ where $beta_{i} in mathbb{F}^{n}$ for each $1 leq i leq n$. We can think each vector $beta_{i}$ as $beta_{i}=(beta_{i_{1}},beta_{i_{2}},...,beta_{i_{n}})$ for every $1 leq i leq n$.



Then as $Q=begin{pmatrix} beta_{1}, beta_{2},....,beta_{n} end{pmatrix}$ thinking the vectors $beta_{i}$ vertically. Calculating $AQ$ we have $AQ=(aq)_{ij}$ where $$aq_{ij}=a_{i_{1}}beta_{j_{1}}+a_{i_{2}}beta_{j_{2}}+...+a_{i_{n}}beta_{j_{n}}$$ where $1 leq i leq m$ and $1 leq j leq n$ Now Im struggled to end up the proof. I wold aprecciate any help proving the statement.










share|cite|improve this question






















  • I might start by expanding $v$ in terms of $beta$ and $L_A(v)$ in terms of $gamma$ and then regrouping.
    – amd
    Nov 22 '18 at 0:07










  • I´ve already tried but I only go in circles trying to prove the equality! @amd
    – Cos
    Nov 22 '18 at 1:01
















0














Let $A in M_{m times n}(mathbb{F})$, and let $beta$ and $gamma$ ordinated basis for $mathbb{F}^n$ and $mathbb{F}^{m}$ respectively. Let $B=[L_{A}]_{beta} ^{gamma}$ . Show $B=P^{-1}AQ$ where $P in M_{m times m}$ is a matrix such their $j$-th column is the $j$-th vector of $gamma$ and $Q in M_{n times n}$ is a matrix such their $j$-th column is the $j$-th vector of $beta$.



I know $L_{A}:mathbb{F}^n to mathbb{F}^m$ where $L_{A}(v)=Av$ for every $v in mathbb{F}^n$. Then having $beta= lbrace beta_{1}, beta_{2},...,beta_{n} rbrace$ where $beta_{i} in mathbb{F}^{n}$ for each $1 leq i leq n$. We can think each vector $beta_{i}$ as $beta_{i}=(beta_{i_{1}},beta_{i_{2}},...,beta_{i_{n}})$ for every $1 leq i leq n$.



Then as $Q=begin{pmatrix} beta_{1}, beta_{2},....,beta_{n} end{pmatrix}$ thinking the vectors $beta_{i}$ vertically. Calculating $AQ$ we have $AQ=(aq)_{ij}$ where $$aq_{ij}=a_{i_{1}}beta_{j_{1}}+a_{i_{2}}beta_{j_{2}}+...+a_{i_{n}}beta_{j_{n}}$$ where $1 leq i leq m$ and $1 leq j leq n$ Now Im struggled to end up the proof. I wold aprecciate any help proving the statement.










share|cite|improve this question






















  • I might start by expanding $v$ in terms of $beta$ and $L_A(v)$ in terms of $gamma$ and then regrouping.
    – amd
    Nov 22 '18 at 0:07










  • I´ve already tried but I only go in circles trying to prove the equality! @amd
    – Cos
    Nov 22 '18 at 1:01














0












0








0







Let $A in M_{m times n}(mathbb{F})$, and let $beta$ and $gamma$ ordinated basis for $mathbb{F}^n$ and $mathbb{F}^{m}$ respectively. Let $B=[L_{A}]_{beta} ^{gamma}$ . Show $B=P^{-1}AQ$ where $P in M_{m times m}$ is a matrix such their $j$-th column is the $j$-th vector of $gamma$ and $Q in M_{n times n}$ is a matrix such their $j$-th column is the $j$-th vector of $beta$.



I know $L_{A}:mathbb{F}^n to mathbb{F}^m$ where $L_{A}(v)=Av$ for every $v in mathbb{F}^n$. Then having $beta= lbrace beta_{1}, beta_{2},...,beta_{n} rbrace$ where $beta_{i} in mathbb{F}^{n}$ for each $1 leq i leq n$. We can think each vector $beta_{i}$ as $beta_{i}=(beta_{i_{1}},beta_{i_{2}},...,beta_{i_{n}})$ for every $1 leq i leq n$.



Then as $Q=begin{pmatrix} beta_{1}, beta_{2},....,beta_{n} end{pmatrix}$ thinking the vectors $beta_{i}$ vertically. Calculating $AQ$ we have $AQ=(aq)_{ij}$ where $$aq_{ij}=a_{i_{1}}beta_{j_{1}}+a_{i_{2}}beta_{j_{2}}+...+a_{i_{n}}beta_{j_{n}}$$ where $1 leq i leq m$ and $1 leq j leq n$ Now Im struggled to end up the proof. I wold aprecciate any help proving the statement.










share|cite|improve this question













Let $A in M_{m times n}(mathbb{F})$, and let $beta$ and $gamma$ ordinated basis for $mathbb{F}^n$ and $mathbb{F}^{m}$ respectively. Let $B=[L_{A}]_{beta} ^{gamma}$ . Show $B=P^{-1}AQ$ where $P in M_{m times m}$ is a matrix such their $j$-th column is the $j$-th vector of $gamma$ and $Q in M_{n times n}$ is a matrix such their $j$-th column is the $j$-th vector of $beta$.



I know $L_{A}:mathbb{F}^n to mathbb{F}^m$ where $L_{A}(v)=Av$ for every $v in mathbb{F}^n$. Then having $beta= lbrace beta_{1}, beta_{2},...,beta_{n} rbrace$ where $beta_{i} in mathbb{F}^{n}$ for each $1 leq i leq n$. We can think each vector $beta_{i}$ as $beta_{i}=(beta_{i_{1}},beta_{i_{2}},...,beta_{i_{n}})$ for every $1 leq i leq n$.



Then as $Q=begin{pmatrix} beta_{1}, beta_{2},....,beta_{n} end{pmatrix}$ thinking the vectors $beta_{i}$ vertically. Calculating $AQ$ we have $AQ=(aq)_{ij}$ where $$aq_{ij}=a_{i_{1}}beta_{j_{1}}+a_{i_{2}}beta_{j_{2}}+...+a_{i_{n}}beta_{j_{n}}$$ where $1 leq i leq m$ and $1 leq j leq n$ Now Im struggled to end up the proof. I wold aprecciate any help proving the statement.







linear-algebra abstract-algebra matrices vector-spaces representation-theory






share|cite|improve this question













share|cite|improve this question











share|cite|improve this question




share|cite|improve this question










asked Nov 21 '18 at 22:52









CosCos

1126




1126












  • I might start by expanding $v$ in terms of $beta$ and $L_A(v)$ in terms of $gamma$ and then regrouping.
    – amd
    Nov 22 '18 at 0:07










  • I´ve already tried but I only go in circles trying to prove the equality! @amd
    – Cos
    Nov 22 '18 at 1:01


















  • I might start by expanding $v$ in terms of $beta$ and $L_A(v)$ in terms of $gamma$ and then regrouping.
    – amd
    Nov 22 '18 at 0:07










  • I´ve already tried but I only go in circles trying to prove the equality! @amd
    – Cos
    Nov 22 '18 at 1:01
















I might start by expanding $v$ in terms of $beta$ and $L_A(v)$ in terms of $gamma$ and then regrouping.
– amd
Nov 22 '18 at 0:07




I might start by expanding $v$ in terms of $beta$ and $L_A(v)$ in terms of $gamma$ and then regrouping.
– amd
Nov 22 '18 at 0:07












I´ve already tried but I only go in circles trying to prove the equality! @amd
– Cos
Nov 22 '18 at 1:01




I´ve already tried but I only go in circles trying to prove the equality! @amd
– Cos
Nov 22 '18 at 1:01










1 Answer
1






active

oldest

votes


















0














Expanding in terms of $beta$, we have $$v = sum_{k=1}^n v_kbeta_k = Qbegin{bmatrix}v_1\vdots\v_nend{bmatrix} = Q[v]_beta$$ so $$L_A(v) = Av = AQ[v]_beta.$$ On the other hand, we can expand $L_A(v)$ in terms of $gamma$: $$L_A(v) = sum_{k=1}^m w_kgamma_k = Pbegin{bmatrix}w_1\vdots\w_mend{bmatrix} = P[L_A(v)]_gamma.$$ Equating and multiplying both sides by $P^{-1}$ we get $$[L_A(v)]_gamma = P^{-1}AQ[v]_beta,$$ therefore $[L_A]_beta^gamma = P^{-1}AQ$.






share|cite|improve this answer





















  • BTW, I prefer to put the “input” basis to a matrix as the superscript so that it “cancels” with the subscript to the right. E.g., the change-of-basis matrix from $beta$ to $gamma$ is $[operatorname{id}]_gamma^beta$ so that $[v]_gamma = [operatorname{id}]_gamma^beta [v]_beta$.
    – amd
    Nov 22 '18 at 1:19










  • Thank you so much! Very well explained.
    – Cos
    Nov 22 '18 at 4:36











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%2f3008493%2fproving-the-particular-case-of-change-of-basis-theorem-over-two-matrix-without-u%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









0














Expanding in terms of $beta$, we have $$v = sum_{k=1}^n v_kbeta_k = Qbegin{bmatrix}v_1\vdots\v_nend{bmatrix} = Q[v]_beta$$ so $$L_A(v) = Av = AQ[v]_beta.$$ On the other hand, we can expand $L_A(v)$ in terms of $gamma$: $$L_A(v) = sum_{k=1}^m w_kgamma_k = Pbegin{bmatrix}w_1\vdots\w_mend{bmatrix} = P[L_A(v)]_gamma.$$ Equating and multiplying both sides by $P^{-1}$ we get $$[L_A(v)]_gamma = P^{-1}AQ[v]_beta,$$ therefore $[L_A]_beta^gamma = P^{-1}AQ$.






share|cite|improve this answer





















  • BTW, I prefer to put the “input” basis to a matrix as the superscript so that it “cancels” with the subscript to the right. E.g., the change-of-basis matrix from $beta$ to $gamma$ is $[operatorname{id}]_gamma^beta$ so that $[v]_gamma = [operatorname{id}]_gamma^beta [v]_beta$.
    – amd
    Nov 22 '18 at 1:19










  • Thank you so much! Very well explained.
    – Cos
    Nov 22 '18 at 4:36
















0














Expanding in terms of $beta$, we have $$v = sum_{k=1}^n v_kbeta_k = Qbegin{bmatrix}v_1\vdots\v_nend{bmatrix} = Q[v]_beta$$ so $$L_A(v) = Av = AQ[v]_beta.$$ On the other hand, we can expand $L_A(v)$ in terms of $gamma$: $$L_A(v) = sum_{k=1}^m w_kgamma_k = Pbegin{bmatrix}w_1\vdots\w_mend{bmatrix} = P[L_A(v)]_gamma.$$ Equating and multiplying both sides by $P^{-1}$ we get $$[L_A(v)]_gamma = P^{-1}AQ[v]_beta,$$ therefore $[L_A]_beta^gamma = P^{-1}AQ$.






share|cite|improve this answer





















  • BTW, I prefer to put the “input” basis to a matrix as the superscript so that it “cancels” with the subscript to the right. E.g., the change-of-basis matrix from $beta$ to $gamma$ is $[operatorname{id}]_gamma^beta$ so that $[v]_gamma = [operatorname{id}]_gamma^beta [v]_beta$.
    – amd
    Nov 22 '18 at 1:19










  • Thank you so much! Very well explained.
    – Cos
    Nov 22 '18 at 4:36














0












0








0






Expanding in terms of $beta$, we have $$v = sum_{k=1}^n v_kbeta_k = Qbegin{bmatrix}v_1\vdots\v_nend{bmatrix} = Q[v]_beta$$ so $$L_A(v) = Av = AQ[v]_beta.$$ On the other hand, we can expand $L_A(v)$ in terms of $gamma$: $$L_A(v) = sum_{k=1}^m w_kgamma_k = Pbegin{bmatrix}w_1\vdots\w_mend{bmatrix} = P[L_A(v)]_gamma.$$ Equating and multiplying both sides by $P^{-1}$ we get $$[L_A(v)]_gamma = P^{-1}AQ[v]_beta,$$ therefore $[L_A]_beta^gamma = P^{-1}AQ$.






share|cite|improve this answer












Expanding in terms of $beta$, we have $$v = sum_{k=1}^n v_kbeta_k = Qbegin{bmatrix}v_1\vdots\v_nend{bmatrix} = Q[v]_beta$$ so $$L_A(v) = Av = AQ[v]_beta.$$ On the other hand, we can expand $L_A(v)$ in terms of $gamma$: $$L_A(v) = sum_{k=1}^m w_kgamma_k = Pbegin{bmatrix}w_1\vdots\w_mend{bmatrix} = P[L_A(v)]_gamma.$$ Equating and multiplying both sides by $P^{-1}$ we get $$[L_A(v)]_gamma = P^{-1}AQ[v]_beta,$$ therefore $[L_A]_beta^gamma = P^{-1}AQ$.







share|cite|improve this answer












share|cite|improve this answer



share|cite|improve this answer










answered Nov 22 '18 at 1:17









amdamd

29.3k21050




29.3k21050












  • BTW, I prefer to put the “input” basis to a matrix as the superscript so that it “cancels” with the subscript to the right. E.g., the change-of-basis matrix from $beta$ to $gamma$ is $[operatorname{id}]_gamma^beta$ so that $[v]_gamma = [operatorname{id}]_gamma^beta [v]_beta$.
    – amd
    Nov 22 '18 at 1:19










  • Thank you so much! Very well explained.
    – Cos
    Nov 22 '18 at 4:36


















  • BTW, I prefer to put the “input” basis to a matrix as the superscript so that it “cancels” with the subscript to the right. E.g., the change-of-basis matrix from $beta$ to $gamma$ is $[operatorname{id}]_gamma^beta$ so that $[v]_gamma = [operatorname{id}]_gamma^beta [v]_beta$.
    – amd
    Nov 22 '18 at 1:19










  • Thank you so much! Very well explained.
    – Cos
    Nov 22 '18 at 4:36
















BTW, I prefer to put the “input” basis to a matrix as the superscript so that it “cancels” with the subscript to the right. E.g., the change-of-basis matrix from $beta$ to $gamma$ is $[operatorname{id}]_gamma^beta$ so that $[v]_gamma = [operatorname{id}]_gamma^beta [v]_beta$.
– amd
Nov 22 '18 at 1:19




BTW, I prefer to put the “input” basis to a matrix as the superscript so that it “cancels” with the subscript to the right. E.g., the change-of-basis matrix from $beta$ to $gamma$ is $[operatorname{id}]_gamma^beta$ so that $[v]_gamma = [operatorname{id}]_gamma^beta [v]_beta$.
– amd
Nov 22 '18 at 1:19












Thank you so much! Very well explained.
– Cos
Nov 22 '18 at 4:36




Thank you so much! Very well explained.
– Cos
Nov 22 '18 at 4:36


















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.





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.




draft saved


draft discarded














StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3008493%2fproving-the-particular-case-of-change-of-basis-theorem-over-two-matrix-without-u%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