Prove $dim(V)=dim(ker L)+dim(operatornameImL)$Prove $operatornameRank (T) +operatornameNullity (T) = dim V$Intuitive explanation of why $dimoperatornameIm T + dimoperatornameKer T = dim V$Linear Algebra: If A spans B, does B necessarily span A if dim A = dim B?Problem proving: $V = ker T oplus operatornameimT$$dim (f^-1(K cap operatornameim f))= dim (ker f)+ dim(K cap operatornameim f)$Prove $operatornameRank (T) +operatornameNullity (T) = dim V$$renewcommandImtextIm$Prove that $dim(ker(T))=dim(ker(T^2))$ if $dim(Im(T))=dim(Im(T^2))$Proving $dim E=dim ker f + dim operatorname*Imf$Show that $dim(operatornameIm S+operatornameIm T)leq7$How to show that $dimker(AB) le dim ker A + dim ker B $?Show $T$ is an invertible linear map iff $operatornamerank T = dim V$

Sound waves in different octaves

Alignment of six matrices

Origin of pigs as a species

SOQL query causes internal Salesforce error

Animation: customize bounce interpolation

Identifying "long and narrow" polygons in with PostGIS

Why can't the Brexit deadlock in the UK parliament be solved with a plurality vote?

Is there a RAID 0 Equivalent for RAM?

What does "tick" mean in this sentence?

Check if object is null and return null

Sigmoid with a slope but no asymptotes?

Possible Eco thriller, man invents a device to remove rain from glass

"Oh no!" in Latin

Are Captain Marvel's powers affected by Thanos breaking the Tesseract and claiming the stone?

Grepping string, but include all non-blank lines following each grep match

Do you waste sorcery points if you try to apply metamagic to a spell from a scroll but fail to cast it?

What's the name of the logical fallacy where a debater extends a statement far beyond the original statement to make it true?

Do I have to take mana from my deck or hand when tapping a dual land?

How were servants to the Kaiser of Imperial Germany treated and where may I find more information on them

Review your own paper in Mathematics

Storage of electrolytic capacitors - how long?

Why does the Persian emissary display a string of crowned skulls?

Does the Crossbow Expert feat's extra crossbow attack work with the reaction attack from a Hunter ranger's Giant Killer feature?

Would a primitive species be able to learn English from reading books alone?



Prove $dim(V)=dim(ker L)+dim(operatornameImL)$


Prove $operatornameRank (T) +operatornameNullity (T) = dim V$Intuitive explanation of why $dimoperatornameIm T + dimoperatornameKer T = dim V$Linear Algebra: If A spans B, does B necessarily span A if dim A = dim B?Problem proving: $V = ker T oplus operatornameimT$$dim (f^-1(K cap operatornameim f))= dim (ker f)+ dim(K cap operatornameim f)$Prove $operatornameRank (T) +operatornameNullity (T) = dim V$$renewcommandImtextIm$Prove that $dim(ker(T))=dim(ker(T^2))$ if $dim(Im(T))=dim(Im(T^2))$Proving $dim E=dim ker f + dim operatorname*Imf$Show that $dim(operatornameIm S+operatornameIm T)leq7$How to show that $dimker(AB) le dim ker A + dim ker B $?Show $T$ is an invertible linear map iff $operatornamerank T = dim V$













0












$begingroup$


I'm trying to prove the following theorem:




Let $V$ and $U$ be vector spaces and assume $V$ has a finite dimension. Let $L: V to U$ be a linear transformation. Now $dim(V) =dim(ker L)+dim(operatornameImL)$.




My attempt so far:



Let $(barv_1, ldots, barv_k)$ be the base of the subspace $ker L$. Since $(barv_1, ldots, barv_k)$ is linearly independent, we can add vectors to it to be the vector space $V$ 's base $(barv_1, ldots, barv_k, baru_k+1, ldots,baru_n)$. Now $dim(ker L)=k$ and $dim(V)=n$ and I think if I go on proving that $(L(baru_k+1), ldots, L(baru_n))$ is the base of the subspace $operatornameImL$, I'm going to end up with $dim(operatornameImL)=n-k$, which would prove the theorem.



First I'm going to prove that $(L(baru_k+1), ldots, L(baru_n))$ is a spanning set of the subspace $operatornameImL$. Let $barwin operatornameImL$, which means that there's a $barvin V$ for which $barw =L(barv)$. We know that $(barv_1, ldots, barv_k, baru_k+1, ldots, baru_n)$ is the base of $V$ so $$barv =a_1barv_1 +ldots +a_kbarv_k +a_k+1baru_k+1 +ldots +a_nbaru_n$$ for some $a_1, ldots, a_nin mathbbR$. Now
beginalign
barw &= L(barv) = L(a_1barv_1 +ldots +a_kbarv_k +a_k+1baru_k+1 +ldots +a_nbaru_n) \
&= a_1L(barv_1) +ldots +a_kL(barv_k) +a_k+1L(baru_k+1) +ldots +a_nL(baru_n) \
&= bar0 +ldots +bar0 +a_k+1L(baru_k+1) +ldots +a_nL(baru_n)
endalign

since $L(barv_1), ldots, L(barv_k)in ker L$. Now $operatornameImL =operatornamespan(L(baru_k+1), ldots, L(baru_n))$.



Next I'm trying to prove that $(L(baru_k+1), ldots, L(baru_n))$ is linearly independent. Assume
$$c_k+1L(baru_k+1) +ldots +c_nL(baru_n) =bar0$$
for some $c_k+1baru_k+1, ldots, c_nbaru_nin ker L$. Now
$$L(c_k+1baru_k+1 +ldots +c_nbaru_n) =bar0$$
which means that $c_k+1baru_k+1 +ldots +c_nbaru_nin ker L.$ This is the part that I'm getting stuck at and I don't know how I should go on with proving the linear independence. Since I've now figured $c_k+1baru_k+1 +ldots +c_nbaru_nin ker L$, doesn't this mean that $c_k+1baru_k+1 +ldots +c_nbaru_n$ is a linear combination of $ker L$'s base vectors? I feel like if it is true then I should use that information to move on but I don't know how to.










share|cite|improve this question











$endgroup$







  • 1




    $begingroup$
    Getting close. if $c_k+1baru_k+1+ldots+c_nbaru_n=b_1barv_1+ldots+b_kbarv_k$, then you have a linear combination of the basis vectors of $V$ that is equal to $0$.
    $endgroup$
    – Callus
    Nov 28 '17 at 12:50










  • $begingroup$
    You should consider the case $k=n$.
    $endgroup$
    – Michael Hoppe
    Nov 28 '17 at 13:01










  • $begingroup$
    I think you would find commands like operatornameKer helpful, because it makes your math much clearer, as in $operatornameKerL$ as opposed to the run-together string $KerL$
    $endgroup$
    – Chase Ryan Taylor
    Nov 28 '17 at 13:43










  • $begingroup$
    @Callus: Thank you. Things that are intuitively clear aren't always mathematically correct. After thinking about how to modify my own proof, it ends up almost coinciding with what's usually done.
    $endgroup$
    – Faraad Armwood
    Nov 28 '17 at 13:56











  • $begingroup$
    See math.stackexchange.com/a/1581722/265466 in a related question in the handy list at right.
    $endgroup$
    – amd
    Nov 28 '17 at 21:04















0












$begingroup$


I'm trying to prove the following theorem:




Let $V$ and $U$ be vector spaces and assume $V$ has a finite dimension. Let $L: V to U$ be a linear transformation. Now $dim(V) =dim(ker L)+dim(operatornameImL)$.




My attempt so far:



Let $(barv_1, ldots, barv_k)$ be the base of the subspace $ker L$. Since $(barv_1, ldots, barv_k)$ is linearly independent, we can add vectors to it to be the vector space $V$ 's base $(barv_1, ldots, barv_k, baru_k+1, ldots,baru_n)$. Now $dim(ker L)=k$ and $dim(V)=n$ and I think if I go on proving that $(L(baru_k+1), ldots, L(baru_n))$ is the base of the subspace $operatornameImL$, I'm going to end up with $dim(operatornameImL)=n-k$, which would prove the theorem.



First I'm going to prove that $(L(baru_k+1), ldots, L(baru_n))$ is a spanning set of the subspace $operatornameImL$. Let $barwin operatornameImL$, which means that there's a $barvin V$ for which $barw =L(barv)$. We know that $(barv_1, ldots, barv_k, baru_k+1, ldots, baru_n)$ is the base of $V$ so $$barv =a_1barv_1 +ldots +a_kbarv_k +a_k+1baru_k+1 +ldots +a_nbaru_n$$ for some $a_1, ldots, a_nin mathbbR$. Now
beginalign
barw &= L(barv) = L(a_1barv_1 +ldots +a_kbarv_k +a_k+1baru_k+1 +ldots +a_nbaru_n) \
&= a_1L(barv_1) +ldots +a_kL(barv_k) +a_k+1L(baru_k+1) +ldots +a_nL(baru_n) \
&= bar0 +ldots +bar0 +a_k+1L(baru_k+1) +ldots +a_nL(baru_n)
endalign

since $L(barv_1), ldots, L(barv_k)in ker L$. Now $operatornameImL =operatornamespan(L(baru_k+1), ldots, L(baru_n))$.



Next I'm trying to prove that $(L(baru_k+1), ldots, L(baru_n))$ is linearly independent. Assume
$$c_k+1L(baru_k+1) +ldots +c_nL(baru_n) =bar0$$
for some $c_k+1baru_k+1, ldots, c_nbaru_nin ker L$. Now
$$L(c_k+1baru_k+1 +ldots +c_nbaru_n) =bar0$$
which means that $c_k+1baru_k+1 +ldots +c_nbaru_nin ker L.$ This is the part that I'm getting stuck at and I don't know how I should go on with proving the linear independence. Since I've now figured $c_k+1baru_k+1 +ldots +c_nbaru_nin ker L$, doesn't this mean that $c_k+1baru_k+1 +ldots +c_nbaru_n$ is a linear combination of $ker L$'s base vectors? I feel like if it is true then I should use that information to move on but I don't know how to.










share|cite|improve this question











$endgroup$







  • 1




    $begingroup$
    Getting close. if $c_k+1baru_k+1+ldots+c_nbaru_n=b_1barv_1+ldots+b_kbarv_k$, then you have a linear combination of the basis vectors of $V$ that is equal to $0$.
    $endgroup$
    – Callus
    Nov 28 '17 at 12:50










  • $begingroup$
    You should consider the case $k=n$.
    $endgroup$
    – Michael Hoppe
    Nov 28 '17 at 13:01










  • $begingroup$
    I think you would find commands like operatornameKer helpful, because it makes your math much clearer, as in $operatornameKerL$ as opposed to the run-together string $KerL$
    $endgroup$
    – Chase Ryan Taylor
    Nov 28 '17 at 13:43










  • $begingroup$
    @Callus: Thank you. Things that are intuitively clear aren't always mathematically correct. After thinking about how to modify my own proof, it ends up almost coinciding with what's usually done.
    $endgroup$
    – Faraad Armwood
    Nov 28 '17 at 13:56











  • $begingroup$
    See math.stackexchange.com/a/1581722/265466 in a related question in the handy list at right.
    $endgroup$
    – amd
    Nov 28 '17 at 21:04













0












0








0





$begingroup$


I'm trying to prove the following theorem:




Let $V$ and $U$ be vector spaces and assume $V$ has a finite dimension. Let $L: V to U$ be a linear transformation. Now $dim(V) =dim(ker L)+dim(operatornameImL)$.




My attempt so far:



Let $(barv_1, ldots, barv_k)$ be the base of the subspace $ker L$. Since $(barv_1, ldots, barv_k)$ is linearly independent, we can add vectors to it to be the vector space $V$ 's base $(barv_1, ldots, barv_k, baru_k+1, ldots,baru_n)$. Now $dim(ker L)=k$ and $dim(V)=n$ and I think if I go on proving that $(L(baru_k+1), ldots, L(baru_n))$ is the base of the subspace $operatornameImL$, I'm going to end up with $dim(operatornameImL)=n-k$, which would prove the theorem.



First I'm going to prove that $(L(baru_k+1), ldots, L(baru_n))$ is a spanning set of the subspace $operatornameImL$. Let $barwin operatornameImL$, which means that there's a $barvin V$ for which $barw =L(barv)$. We know that $(barv_1, ldots, barv_k, baru_k+1, ldots, baru_n)$ is the base of $V$ so $$barv =a_1barv_1 +ldots +a_kbarv_k +a_k+1baru_k+1 +ldots +a_nbaru_n$$ for some $a_1, ldots, a_nin mathbbR$. Now
beginalign
barw &= L(barv) = L(a_1barv_1 +ldots +a_kbarv_k +a_k+1baru_k+1 +ldots +a_nbaru_n) \
&= a_1L(barv_1) +ldots +a_kL(barv_k) +a_k+1L(baru_k+1) +ldots +a_nL(baru_n) \
&= bar0 +ldots +bar0 +a_k+1L(baru_k+1) +ldots +a_nL(baru_n)
endalign

since $L(barv_1), ldots, L(barv_k)in ker L$. Now $operatornameImL =operatornamespan(L(baru_k+1), ldots, L(baru_n))$.



Next I'm trying to prove that $(L(baru_k+1), ldots, L(baru_n))$ is linearly independent. Assume
$$c_k+1L(baru_k+1) +ldots +c_nL(baru_n) =bar0$$
for some $c_k+1baru_k+1, ldots, c_nbaru_nin ker L$. Now
$$L(c_k+1baru_k+1 +ldots +c_nbaru_n) =bar0$$
which means that $c_k+1baru_k+1 +ldots +c_nbaru_nin ker L.$ This is the part that I'm getting stuck at and I don't know how I should go on with proving the linear independence. Since I've now figured $c_k+1baru_k+1 +ldots +c_nbaru_nin ker L$, doesn't this mean that $c_k+1baru_k+1 +ldots +c_nbaru_n$ is a linear combination of $ker L$'s base vectors? I feel like if it is true then I should use that information to move on but I don't know how to.










share|cite|improve this question











$endgroup$




I'm trying to prove the following theorem:




Let $V$ and $U$ be vector spaces and assume $V$ has a finite dimension. Let $L: V to U$ be a linear transformation. Now $dim(V) =dim(ker L)+dim(operatornameImL)$.




My attempt so far:



Let $(barv_1, ldots, barv_k)$ be the base of the subspace $ker L$. Since $(barv_1, ldots, barv_k)$ is linearly independent, we can add vectors to it to be the vector space $V$ 's base $(barv_1, ldots, barv_k, baru_k+1, ldots,baru_n)$. Now $dim(ker L)=k$ and $dim(V)=n$ and I think if I go on proving that $(L(baru_k+1), ldots, L(baru_n))$ is the base of the subspace $operatornameImL$, I'm going to end up with $dim(operatornameImL)=n-k$, which would prove the theorem.



First I'm going to prove that $(L(baru_k+1), ldots, L(baru_n))$ is a spanning set of the subspace $operatornameImL$. Let $barwin operatornameImL$, which means that there's a $barvin V$ for which $barw =L(barv)$. We know that $(barv_1, ldots, barv_k, baru_k+1, ldots, baru_n)$ is the base of $V$ so $$barv =a_1barv_1 +ldots +a_kbarv_k +a_k+1baru_k+1 +ldots +a_nbaru_n$$ for some $a_1, ldots, a_nin mathbbR$. Now
beginalign
barw &= L(barv) = L(a_1barv_1 +ldots +a_kbarv_k +a_k+1baru_k+1 +ldots +a_nbaru_n) \
&= a_1L(barv_1) +ldots +a_kL(barv_k) +a_k+1L(baru_k+1) +ldots +a_nL(baru_n) \
&= bar0 +ldots +bar0 +a_k+1L(baru_k+1) +ldots +a_nL(baru_n)
endalign

since $L(barv_1), ldots, L(barv_k)in ker L$. Now $operatornameImL =operatornamespan(L(baru_k+1), ldots, L(baru_n))$.



Next I'm trying to prove that $(L(baru_k+1), ldots, L(baru_n))$ is linearly independent. Assume
$$c_k+1L(baru_k+1) +ldots +c_nL(baru_n) =bar0$$
for some $c_k+1baru_k+1, ldots, c_nbaru_nin ker L$. Now
$$L(c_k+1baru_k+1 +ldots +c_nbaru_n) =bar0$$
which means that $c_k+1baru_k+1 +ldots +c_nbaru_nin ker L.$ This is the part that I'm getting stuck at and I don't know how I should go on with proving the linear independence. Since I've now figured $c_k+1baru_k+1 +ldots +c_nbaru_nin ker L$, doesn't this mean that $c_k+1baru_k+1 +ldots +c_nbaru_n$ is a linear combination of $ker L$'s base vectors? I feel like if it is true then I should use that information to move on but I don't know how to.







linear-algebra proof-verification






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Mar 14 at 6:00









Rócherz

2,9863821




2,9863821










asked Nov 28 '17 at 12:39









JoeJoe

1795




1795







  • 1




    $begingroup$
    Getting close. if $c_k+1baru_k+1+ldots+c_nbaru_n=b_1barv_1+ldots+b_kbarv_k$, then you have a linear combination of the basis vectors of $V$ that is equal to $0$.
    $endgroup$
    – Callus
    Nov 28 '17 at 12:50










  • $begingroup$
    You should consider the case $k=n$.
    $endgroup$
    – Michael Hoppe
    Nov 28 '17 at 13:01










  • $begingroup$
    I think you would find commands like operatornameKer helpful, because it makes your math much clearer, as in $operatornameKerL$ as opposed to the run-together string $KerL$
    $endgroup$
    – Chase Ryan Taylor
    Nov 28 '17 at 13:43










  • $begingroup$
    @Callus: Thank you. Things that are intuitively clear aren't always mathematically correct. After thinking about how to modify my own proof, it ends up almost coinciding with what's usually done.
    $endgroup$
    – Faraad Armwood
    Nov 28 '17 at 13:56











  • $begingroup$
    See math.stackexchange.com/a/1581722/265466 in a related question in the handy list at right.
    $endgroup$
    – amd
    Nov 28 '17 at 21:04












  • 1




    $begingroup$
    Getting close. if $c_k+1baru_k+1+ldots+c_nbaru_n=b_1barv_1+ldots+b_kbarv_k$, then you have a linear combination of the basis vectors of $V$ that is equal to $0$.
    $endgroup$
    – Callus
    Nov 28 '17 at 12:50










  • $begingroup$
    You should consider the case $k=n$.
    $endgroup$
    – Michael Hoppe
    Nov 28 '17 at 13:01










  • $begingroup$
    I think you would find commands like operatornameKer helpful, because it makes your math much clearer, as in $operatornameKerL$ as opposed to the run-together string $KerL$
    $endgroup$
    – Chase Ryan Taylor
    Nov 28 '17 at 13:43










  • $begingroup$
    @Callus: Thank you. Things that are intuitively clear aren't always mathematically correct. After thinking about how to modify my own proof, it ends up almost coinciding with what's usually done.
    $endgroup$
    – Faraad Armwood
    Nov 28 '17 at 13:56











  • $begingroup$
    See math.stackexchange.com/a/1581722/265466 in a related question in the handy list at right.
    $endgroup$
    – amd
    Nov 28 '17 at 21:04







1




1




$begingroup$
Getting close. if $c_k+1baru_k+1+ldots+c_nbaru_n=b_1barv_1+ldots+b_kbarv_k$, then you have a linear combination of the basis vectors of $V$ that is equal to $0$.
$endgroup$
– Callus
Nov 28 '17 at 12:50




$begingroup$
Getting close. if $c_k+1baru_k+1+ldots+c_nbaru_n=b_1barv_1+ldots+b_kbarv_k$, then you have a linear combination of the basis vectors of $V$ that is equal to $0$.
$endgroup$
– Callus
Nov 28 '17 at 12:50












$begingroup$
You should consider the case $k=n$.
$endgroup$
– Michael Hoppe
Nov 28 '17 at 13:01




$begingroup$
You should consider the case $k=n$.
$endgroup$
– Michael Hoppe
Nov 28 '17 at 13:01












$begingroup$
I think you would find commands like operatornameKer helpful, because it makes your math much clearer, as in $operatornameKerL$ as opposed to the run-together string $KerL$
$endgroup$
– Chase Ryan Taylor
Nov 28 '17 at 13:43




$begingroup$
I think you would find commands like operatornameKer helpful, because it makes your math much clearer, as in $operatornameKerL$ as opposed to the run-together string $KerL$
$endgroup$
– Chase Ryan Taylor
Nov 28 '17 at 13:43












$begingroup$
@Callus: Thank you. Things that are intuitively clear aren't always mathematically correct. After thinking about how to modify my own proof, it ends up almost coinciding with what's usually done.
$endgroup$
– Faraad Armwood
Nov 28 '17 at 13:56





$begingroup$
@Callus: Thank you. Things that are intuitively clear aren't always mathematically correct. After thinking about how to modify my own proof, it ends up almost coinciding with what's usually done.
$endgroup$
– Faraad Armwood
Nov 28 '17 at 13:56













$begingroup$
See math.stackexchange.com/a/1581722/265466 in a related question in the handy list at right.
$endgroup$
– amd
Nov 28 '17 at 21:04




$begingroup$
See math.stackexchange.com/a/1581722/265466 in a related question in the handy list at right.
$endgroup$
– amd
Nov 28 '17 at 21:04










1 Answer
1






active

oldest

votes


















1












$begingroup$

Since this is old but not properly answered, I'll knock it out. (See also the comment by Callus, which I didn't notice until I was done writing this)




Now
$$L(c_k+1overlineu_k+1+cdots+c_noverlineu_n) = overline0$$
which means that $c_k+1overlineu_k+1+cdots+c_noverlineu_ninoperatornameKer(L)$. This is the part that I'm getting stuck at and I don't know how I should go on with proving the linear independence.




Since $overlineu_1,overlineu_2,dots,overlineu_k$ are a basis for the kernel, there are constants $c_1,c_2,dots,c_k$ so that
$$c_k+1overlineu_k+1+cdots+c_noverlineu_n = -c_1overlineu_1-cdots-c_koverlineu_k$$
$$c_1overlineu_1+cdots+c_koverlineu_k+c_k+1overlineu_k+1+cdots+c_noverlineu_n = 0$$
Now we use the linear independence of the $u_i$ to conclude that all of the $c_i$ are zero. That includes $c_k+1$ through $c_n$, so $L(overlineu_k+1),dots,L(overlineu_n)$ are linearly independent.



The proof that $L(overlineu_k+1),dots,L(overlineu_n)$ span the image was good all along, and this completes the the proof of the theorem.






share|cite|improve this answer









$endgroup$












    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%2f2541091%2fprove-dimv-dim-ker-l-dim-operatornameiml%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$

    Since this is old but not properly answered, I'll knock it out. (See also the comment by Callus, which I didn't notice until I was done writing this)




    Now
    $$L(c_k+1overlineu_k+1+cdots+c_noverlineu_n) = overline0$$
    which means that $c_k+1overlineu_k+1+cdots+c_noverlineu_ninoperatornameKer(L)$. This is the part that I'm getting stuck at and I don't know how I should go on with proving the linear independence.




    Since $overlineu_1,overlineu_2,dots,overlineu_k$ are a basis for the kernel, there are constants $c_1,c_2,dots,c_k$ so that
    $$c_k+1overlineu_k+1+cdots+c_noverlineu_n = -c_1overlineu_1-cdots-c_koverlineu_k$$
    $$c_1overlineu_1+cdots+c_koverlineu_k+c_k+1overlineu_k+1+cdots+c_noverlineu_n = 0$$
    Now we use the linear independence of the $u_i$ to conclude that all of the $c_i$ are zero. That includes $c_k+1$ through $c_n$, so $L(overlineu_k+1),dots,L(overlineu_n)$ are linearly independent.



    The proof that $L(overlineu_k+1),dots,L(overlineu_n)$ span the image was good all along, and this completes the the proof of the theorem.






    share|cite|improve this answer









    $endgroup$

















      1












      $begingroup$

      Since this is old but not properly answered, I'll knock it out. (See also the comment by Callus, which I didn't notice until I was done writing this)




      Now
      $$L(c_k+1overlineu_k+1+cdots+c_noverlineu_n) = overline0$$
      which means that $c_k+1overlineu_k+1+cdots+c_noverlineu_ninoperatornameKer(L)$. This is the part that I'm getting stuck at and I don't know how I should go on with proving the linear independence.




      Since $overlineu_1,overlineu_2,dots,overlineu_k$ are a basis for the kernel, there are constants $c_1,c_2,dots,c_k$ so that
      $$c_k+1overlineu_k+1+cdots+c_noverlineu_n = -c_1overlineu_1-cdots-c_koverlineu_k$$
      $$c_1overlineu_1+cdots+c_koverlineu_k+c_k+1overlineu_k+1+cdots+c_noverlineu_n = 0$$
      Now we use the linear independence of the $u_i$ to conclude that all of the $c_i$ are zero. That includes $c_k+1$ through $c_n$, so $L(overlineu_k+1),dots,L(overlineu_n)$ are linearly independent.



      The proof that $L(overlineu_k+1),dots,L(overlineu_n)$ span the image was good all along, and this completes the the proof of the theorem.






      share|cite|improve this answer









      $endgroup$















        1












        1








        1





        $begingroup$

        Since this is old but not properly answered, I'll knock it out. (See also the comment by Callus, which I didn't notice until I was done writing this)




        Now
        $$L(c_k+1overlineu_k+1+cdots+c_noverlineu_n) = overline0$$
        which means that $c_k+1overlineu_k+1+cdots+c_noverlineu_ninoperatornameKer(L)$. This is the part that I'm getting stuck at and I don't know how I should go on with proving the linear independence.




        Since $overlineu_1,overlineu_2,dots,overlineu_k$ are a basis for the kernel, there are constants $c_1,c_2,dots,c_k$ so that
        $$c_k+1overlineu_k+1+cdots+c_noverlineu_n = -c_1overlineu_1-cdots-c_koverlineu_k$$
        $$c_1overlineu_1+cdots+c_koverlineu_k+c_k+1overlineu_k+1+cdots+c_noverlineu_n = 0$$
        Now we use the linear independence of the $u_i$ to conclude that all of the $c_i$ are zero. That includes $c_k+1$ through $c_n$, so $L(overlineu_k+1),dots,L(overlineu_n)$ are linearly independent.



        The proof that $L(overlineu_k+1),dots,L(overlineu_n)$ span the image was good all along, and this completes the the proof of the theorem.






        share|cite|improve this answer









        $endgroup$



        Since this is old but not properly answered, I'll knock it out. (See also the comment by Callus, which I didn't notice until I was done writing this)




        Now
        $$L(c_k+1overlineu_k+1+cdots+c_noverlineu_n) = overline0$$
        which means that $c_k+1overlineu_k+1+cdots+c_noverlineu_ninoperatornameKer(L)$. This is the part that I'm getting stuck at and I don't know how I should go on with proving the linear independence.




        Since $overlineu_1,overlineu_2,dots,overlineu_k$ are a basis for the kernel, there are constants $c_1,c_2,dots,c_k$ so that
        $$c_k+1overlineu_k+1+cdots+c_noverlineu_n = -c_1overlineu_1-cdots-c_koverlineu_k$$
        $$c_1overlineu_1+cdots+c_koverlineu_k+c_k+1overlineu_k+1+cdots+c_noverlineu_n = 0$$
        Now we use the linear independence of the $u_i$ to conclude that all of the $c_i$ are zero. That includes $c_k+1$ through $c_n$, so $L(overlineu_k+1),dots,L(overlineu_n)$ are linearly independent.



        The proof that $L(overlineu_k+1),dots,L(overlineu_n)$ span the image was good all along, and this completes the the proof of the theorem.







        share|cite|improve this answer












        share|cite|improve this answer



        share|cite|improve this answer










        answered Mar 14 at 6:32









        jmerryjmerry

        15.3k1632




        15.3k1632



























            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%2f2541091%2fprove-dimv-dim-ker-l-dim-operatornameiml%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

            Lowndes Grove History Architecture References Navigation menu32°48′6″N 79°57′58″W / 32.80167°N 79.96611°W / 32.80167; -79.9661132°48′6″N 79°57′58″W / 32.80167°N 79.96611°W / 32.80167; -79.9661178002500"National Register Information System"Historic houses of South Carolina"Lowndes Grove""+32° 48' 6.00", −79° 57' 58.00""Lowndes Grove, Charleston County (260 St. Margaret St., Charleston)""Lowndes Grove"The Charleston ExpositionIt Happened in South Carolina"Lowndes Grove (House), Saint Margaret Street & Sixth Avenue, Charleston, Charleston County, SC(Photographs)"Plantations of the Carolina Low Countrye

            random experiment with two different functions on unit interval Announcing the arrival of Valued Associate #679: Cesar Manara Planned maintenance scheduled April 23, 2019 at 00:00UTC (8:00pm US/Eastern)Random variable and probability space notionsRandom Walk with EdgesFinding functions where the increase over a random interval is Poisson distributedNumber of days until dayCan an observed event in fact be of zero probability?Unit random processmodels of coins and uniform distributionHow to get the number of successes given $n$ trials , probability $P$ and a random variable $X$Absorbing Markov chain in a computer. Is “almost every” turned into always convergence in computer executions?Stopped random walk is not uniformly integrable

            How should I support this large drywall patch? Planned maintenance scheduled April 23, 2019 at 00:00UTC (8:00pm US/Eastern) Announcing the arrival of Valued Associate #679: Cesar Manara Unicorn Meta Zoo #1: Why another podcast?How do I cover large gaps in drywall?How do I keep drywall around a patch from crumbling?Can I glue a second layer of drywall?How to patch long strip on drywall?Large drywall patch: how to avoid bulging seams?Drywall Mesh Patch vs. Bulge? To remove or not to remove?How to fix this drywall job?Prep drywall before backsplashWhat's the best way to fix this horrible drywall patch job?Drywall patching using 3M Patch Plus Primer