Rank-Nullity Theorem: Struggling to Reconcile $rm Rank(A) +rm Nul(A) = n$ and $dim(V) = dim(rm Im(f)) +dim(rm ker(f))$.Question about an application of the Rank-Nullity theoremDetermining Rank and NullityWhy does $operatornamerank(mathbfX)$ equal $operatornamerank(mathbfX^TX)$? What is $dim(mathbfX^TX)$?Linear maps, matrices, nullity and rank.rank-nullity theorem clarificationproblem of rank-nullity theorem with a given setRank-Nullity TheoremFinding rank-nullity of a given maticesDetermine $ker(T), operatornamerange(T), operatornamenullity(T)$ and $operatornamerank(T) $ for $T(A) = A^T$Show $T$ is an invertible linear map iff $operatornamerank T = dim V$
Is there anyway, I can have two passwords for my wi-fi
Has the laser at Magurele, Romania reached a tenth of the Sun's power?
Proving an identity involving cross products and coplanar vectors
El Dorado Word Puzzle II: Videogame Edition
Why is the Sun approximated as a black body at ~ 5800 K?
Do you waste sorcery points if you try to apply metamagic to a spell from a scroll but fail to cast it?
Grepping string, but include all non-blank lines following each grep match
What is the smallest number n> 5 so that 5 ^ n ends with "3125"?
Why do Radio Buttons not fill the entire outer circle?
Possible Eco thriller, man invents a device to remove rain from glass
Why does a 97 / 92 key piano exist by Bösendorfer?
Why can't the Brexit deadlock in the UK parliament be solved with a plurality vote?
Personal or impersonal in a technical resume
Review your own paper in Mathematics
If the only attacker is removed from combat, is a creature still counted as having attacked this turn?
What should be the ideal length of sentences in a blog post for ease of reading?
Can I run 125kHz RF circuit on a breadboard?
The Digit Triangles
How to reduce predictors the right way for a logistic regression model
Air travel with refrigerated insulin
What's the name of the logical fallacy where a debater extends a statement far beyond the original statement to make it true?
How do I prevent inappropriate ads from appearing in my game?
Language involving irrational number is not a CFL
Pre-Employment Background Check With Consent For Future Checks
Rank-Nullity Theorem: Struggling to Reconcile $rm Rank(A) +rm Nul(A) = n$ and $dim(V) = dim(rm Im(f)) +dim(rm ker(f))$.
Question about an application of the Rank-Nullity theoremDetermining Rank and NullityWhy does $operatornamerank(mathbfX)$ equal $operatornamerank(mathbfX^TX)$? What is $dim(mathbfX^TX)$?Linear maps, matrices, nullity and rank.rank-nullity theorem clarificationproblem of rank-nullity theorem with a given setRank-Nullity TheoremFinding rank-nullity of a given maticesDetermine $ker(T), operatornamerange(T), operatornamenullity(T)$ and $operatornamerank(T) $ for $T(A) = A^T$Show $T$ is an invertible linear map iff $operatornamerank T = dim V$
$begingroup$
I am struggling to reconcile the two forms of the rank-nullity theorem:
- $operatornameRank(mathbfA) + operatornameNull(mathbfA) = n$,
- $dim(mathbfV) = dim(operatornameIm(f)) + dim(operatornameKer(f))$
In attempting to reconcile these, I have collected the following facts:
- If we have $mathbfAmathbfx = mathbfb$, then $mathbfAmathbfx = f(mathbfx)$ when thinking about it from the perspective of linear transformations. This means that the image of $f$ is $mathbfb$, so we have $operatornameIm(f) = mathbfb$.
- The rank of a matrix is equal to the dimension of its column space. Therefore, the rank of a matrix is equal to the number of leading ones in the matrix in reduced row echelon form. This is the $operatornameRank(A)$ part.
- Dimension represents the number of elements in a basis.
- Therefore, we have that $dim(operatornameIm(f)) = dim(mathbfb)$.
I do not see how $operatornameRank(mathbfA) = dim(operatornameIm(f))$. In fact, I not even see how a statement like $dim(operatornameIm(f))$ even makes any sense? $operatornameRank(mathbfA)$ makes sense, since we can calculate this by getting $mathbfA$ into RREF, but how does $dim(operatornameIm(f)) = dim(mathbfb)$ make any sense? I do not see the connection here.
I would greatly appreciate it if people could please take the time to clarify this.
linear-algebra vector-spaces linear-transformations matrix-rank
edited Mar 14 at 5:33
Rócherz
2,9863821
asked Nov 15 '17 at 7:23
The PointerThe Pointer
2,65221638
$endgroup$
add a comment |
$begingroup$
I am struggling to reconcile the two forms of the rank-nullity theorem:
- $operatornameRank(mathbfA) + operatornameNull(mathbfA) = n$,
- $dim(mathbfV) = dim(operatornameIm(f)) + dim(operatornameKer(f))$
In attempting to reconcile these, I have collected the following facts:
- If we have $mathbfAmathbfx = mathbfb$, then $mathbfAmathbfx = f(mathbfx)$ when thinking about it from the perspective of linear transformations. This means that the image of $f$ is $mathbfb$, so we have $operatornameIm(f) = mathbfb$.
- The rank of a matrix is equal to the dimension of its column space. Therefore, the rank of a matrix is equal to the number of leading ones in the matrix in reduced row echelon form. This is the $operatornameRank(A)$ part.
- Dimension represents the number of elements in a basis.
- Therefore, we have that $dim(operatornameIm(f)) = dim(mathbfb)$.
I do not see how $operatornameRank(mathbfA) = dim(operatornameIm(f))$. In fact, I not even see how a statement like $dim(operatornameIm(f))$ even makes any sense? $operatornameRank(mathbfA)$ makes sense, since we can calculate this by getting $mathbfA$ into RREF, but how does $dim(operatornameIm(f)) = dim(mathbfb)$ make any sense? I do not see the connection here.
I would greatly appreciate it if people could please take the time to clarify this.
linear-algebra vector-spaces linear-transformations matrix-rank
edited Mar 14 at 5:33
Rócherz
2,9863821
asked Nov 15 '17 at 7:23
The PointerThe Pointer
2,65221638
$endgroup$
$begingroup$
Hint: if $A=(mathbfv_1;v_2;ldots; v_n)$, then $mathrmDim(mathrmIm( A))$ is just the number of linearly independent vectors among $mathbfv_i$s. Or in other words, $bf v_i$ spans $mathrmIm (A)$ (why?).
$endgroup$
– BAI
Nov 15 '17 at 7:46
add a comment |
$begingroup$
I am struggling to reconcile the two forms of the rank-nullity theorem:
- $operatornameRank(mathbfA) + operatornameNull(mathbfA) = n$,
- $dim(mathbfV) = dim(operatornameIm(f)) + dim(operatornameKer(f))$
In attempting to reconcile these, I have collected the following facts:
- If we have $mathbfAmathbfx = mathbfb$, then $mathbfAmathbfx = f(mathbfx)$ when thinking about it from the perspective of linear transformations. This means that the image of $f$ is $mathbfb$, so we have $operatornameIm(f) = mathbfb$.
- The rank of a matrix is equal to the dimension of its column space. Therefore, the rank of a matrix is equal to the number of leading ones in the matrix in reduced row echelon form. This is the $operatornameRank(A)$ part.
- Dimension represents the number of elements in a basis.
- Therefore, we have that $dim(operatornameIm(f)) = dim(mathbfb)$.
I do not see how $operatornameRank(mathbfA) = dim(operatornameIm(f))$. In fact, I not even see how a statement like $dim(operatornameIm(f))$ even makes any sense? $operatornameRank(mathbfA)$ makes sense, since we can calculate this by getting $mathbfA$ into RREF, but how does $dim(operatornameIm(f)) = dim(mathbfb)$ make any sense? I do not see the connection here.
I would greatly appreciate it if people could please take the time to clarify this.
linear-algebra vector-spaces linear-transformations matrix-rank
edited Mar 14 at 5:33
Rócherz
2,9863821
asked Nov 15 '17 at 7:23
The PointerThe Pointer
2,65221638
$endgroup$
I am struggling to reconcile the two forms of the rank-nullity theorem:
- $operatornameRank(mathbfA) + operatornameNull(mathbfA) = n$,
- $dim(mathbfV) = dim(operatornameIm(f)) + dim(operatornameKer(f))$
In attempting to reconcile these, I have collected the following facts:
- If we have $mathbfAmathbfx = mathbfb$, then $mathbfAmathbfx = f(mathbfx)$ when thinking about it from the perspective of linear transformations. This means that the image of $f$ is $mathbfb$, so we have $operatornameIm(f) = mathbfb$.
- The rank of a matrix is equal to the dimension of its column space. Therefore, the rank of a matrix is equal to the number of leading ones in the matrix in reduced row echelon form. This is the $operatornameRank(A)$ part.
- Dimension represents the number of elements in a basis.
- Therefore, we have that $dim(operatornameIm(f)) = dim(mathbfb)$.
I do not see how $operatornameRank(mathbfA) = dim(operatornameIm(f))$. In fact, I not even see how a statement like $dim(operatornameIm(f))$ even makes any sense? $operatornameRank(mathbfA)$ makes sense, since we can calculate this by getting $mathbfA$ into RREF, but how does $dim(operatornameIm(f)) = dim(mathbfb)$ make any sense? I do not see the connection here.
I would greatly appreciate it if people could please take the time to clarify this.
linear-algebra vector-spaces linear-transformations matrix-rank
linear-algebra vector-spaces linear-transformations matrix-rank
edited Mar 14 at 5:33
Rócherz
2,9863821
asked Nov 15 '17 at 7:23
The PointerThe Pointer
2,65221638
edited Mar 14 at 5:33
Rócherz
2,9863821
asked Nov 15 '17 at 7:23
The PointerThe Pointer
2,65221638
edited Mar 14 at 5:33
Rócherz
2,9863821
edited Mar 14 at 5:33
Rócherz
2,9863821
edited Mar 14 at 5:33
Rócherz
2,9863821
2,9863821
asked Nov 15 '17 at 7:23
The PointerThe Pointer
2,65221638
asked Nov 15 '17 at 7:23
The PointerThe Pointer
2,65221638
asked Nov 15 '17 at 7:23
The PointerThe Pointer
2,65221638
2,65221638
$begingroup$
Hint: if $A=(mathbfv_1;v_2;ldots; v_n)$, then $mathrmDim(mathrmIm( A))$ is just the number of linearly independent vectors among $mathbfv_i$s. Or in other words, $bf v_i$ spans $mathrmIm (A)$ (why?).
$endgroup$
– BAI
Nov 15 '17 at 7:46
add a comment |
$begingroup$
Hint: if $A=(mathbfv_1;v_2;ldots; v_n)$, then $mathrmDim(mathrmIm( A))$ is just the number of linearly independent vectors among $mathbfv_i$s. Or in other words, $bf v_i$ spans $mathrmIm (A)$ (why?).
$endgroup$
– BAI
Nov 15 '17 at 7:46
$begingroup$
Hint: if $A=(mathbfv_1;v_2;ldots; v_n)$, then $mathrmDim(mathrmIm( A))$ is just the number of linearly independent vectors among $mathbfv_i$s. Or in other words, $bf v_i$ spans $mathrmIm (A)$ (why?).
$endgroup$
– BAI
Nov 15 '17 at 7:46
$begingroup$
Hint: if $A=(mathbfv_1;v_2;ldots; v_n)$, then $mathrmDim(mathrmIm( A))$ is just the number of linearly independent vectors among $mathbfv_i$s. Or in other words, $bf v_i$ spans $mathrmIm (A)$ (why?).
$endgroup$
– BAI
Nov 15 '17 at 7:46
add a comment |
2 Answers
2
active
oldest
votes
$begingroup$
The image of $f$ isn't $b$. You don't seem to know the definition of the image of a function.
The image is the set of all possible outputs of the function $f$ as $x$ ranges over all vectors in the domain.
Edit, to address the question in the comments below my answer.
The image of $f$ is the span of the columns of $A$. The rank of $A$ is the number of linearly independent columns of $A$. Hence the rank is the size of a basis of the image, namely the basis consisting of the linearly independent columns of $A$. Since the rank is equal to the cardinality of a basis of the image, the rank is equal to the dimension of the image.
answered Nov 15 '17 at 7:26
symplectomorphicsymplectomorphic
12.6k22041
$endgroup$
$begingroup$
Thanks for the response. But how does this explain the relation between the $Rank(A)$ and $dim(Im(f))$? Can you please demonstrate why these are equal?
$endgroup$
– The Pointer
Nov 15 '17 at 7:29
$begingroup$
That is one definition of rank. Another definition, the one you seem to be using, is the number of pivots in the rref form of $A$. The number of pivots tells you how many linearly independent columns $A$ has. You can prove this is equal to the dimension of the image, as soon as you learn what the image really is. (Hint: the image is spanned by the columns of $A$.)
$endgroup$
– symplectomorphic
Nov 15 '17 at 7:30
$begingroup$
I added more details.
$endgroup$
– symplectomorphic
Nov 15 '17 at 7:41
$begingroup$
You are confusing the image of a function, period, and the image of a point under a function. This is an incredibly elementary distinction. The image of the function $f(x)=x^2$ is the set of all nonnegative real numbers, but the image of $3$ under $f$ is $9$. I don't see how you've asked questions about complex analysis and PDEs without understanding this.
$endgroup$
– symplectomorphic
Nov 15 '17 at 8:02
$begingroup$
en.wikipedia.org/wiki/Image_(mathematics)#Definition You're right. I've confused myself by reading through multiple different sources.
$endgroup$
– The Pointer
Nov 15 '17 at 8:06
add a comment |
$begingroup$
For the part you do not understand: since there is an isomorphism
$$overlinevarphi : V/textKer(varphi) stackrelsim=
varphi(V)$$ we have: beginequation textdimV/textKer(varphi)
= textdimvarphi(V) endequation By consequence of first isomorphism theorem, we have beginequation textdimV =
textdimtextKer(varphi) + textdimV/textKer(varphi)
endequation
So it follows that, $$dim V = dim Ker(varphi)+dim varphi(V)$$
And the above $varphi$ is a linear transformation and of course $varphi(V) = textIm(V)$
Well, i am not sure if you have learnt the first isomorphism theorem or not, but this is the proper understanding of how the so called rank nullity is derived. So first things first, remember this theorem.
The next is easy to understand, we have well known mapping which is $$T_A: mathbbR^n to mathbbR^n$$ which maps $$x mapsto Ax$$ in which $x$ is a column vector in the $mathbbR^n$ space and $A$ is THE matrix that is in question. Now : i hope you can easily verify the fact that in this linear transformation, we have dimension of kernel $T$ is merely the dimension of the nullspace of $A$ and the dimension of the image of $T$ is merely the dimension of the column space of $A$. And hence we see that indeed $$textrankA = dim textImT_A$$
My answer is still slightly vague and does not provide any intuition, but to piece it all together requires you to understand the fundamentals and of course the first isomorphism theorem.
answered Nov 15 '17 at 7:50
nannan
939419
$endgroup$
$begingroup$
The post didn't ask for a proof of the theorem. Your answer doesn't answer the question.
$endgroup$
– symplectomorphic
Nov 15 '17 at 8:04
$begingroup$
My comment (not yet proof) is to complement his understanding since he got an answer from you? It doesnt hurt to know something relevant.
$endgroup$
– nan
Nov 15 '17 at 8:08
$begingroup$
Answers here are supposed to give answers to the questions. Nowhere does the OP ask for a proof of the theorem. The question is about why the two statements of the theorem are equivalent. Your post is not relevant to that issue.
$endgroup$
– symplectomorphic
Nov 15 '17 at 8:10
$begingroup$
In my interpretation, he has some understanding of linear transformations and capable of understanding some abstract meaning of the theorem. And yes, i can definitely use my "proof" here to show these two statements are indeed equivalent if that is what you are worried about.
$endgroup$
– nan
Nov 15 '17 at 8:18
$begingroup$
I'm not worried about anything. I'm telling you how to improve your answers. Don't give irrelevant information. Answer the question directly and simply. I'll leave it there.
$endgroup$
– symplectomorphic
Nov 15 '17 at 8:19
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%2f2521120%2frank-nullity-theorem-struggling-to-reconcile-rm-ranka-rm-nula-n%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$
The image of $f$ isn't $b$. You don't seem to know the definition of the image of a function.
The image is the set of all possible outputs of the function $f$ as $x$ ranges over all vectors in the domain.
Edit, to address the question in the comments below my answer.
The image of $f$ is the span of the columns of $A$. The rank of $A$ is the number of linearly independent columns of $A$. Hence the rank is the size of a basis of the image, namely the basis consisting of the linearly independent columns of $A$. Since the rank is equal to the cardinality of a basis of the image, the rank is equal to the dimension of the image.
answered Nov 15 '17 at 7:26
symplectomorphicsymplectomorphic
12.6k22041
$endgroup$
$begingroup$
Thanks for the response. But how does this explain the relation between the $Rank(A)$ and $dim(Im(f))$? Can you please demonstrate why these are equal?
$endgroup$
– The Pointer
Nov 15 '17 at 7:29
$begingroup$
That is one definition of rank. Another definition, the one you seem to be using, is the number of pivots in the rref form of $A$. The number of pivots tells you how many linearly independent columns $A$ has. You can prove this is equal to the dimension of the image, as soon as you learn what the image really is. (Hint: the image is spanned by the columns of $A$.)
$endgroup$
– symplectomorphic
Nov 15 '17 at 7:30
$begingroup$
I added more details.
$endgroup$
– symplectomorphic
Nov 15 '17 at 7:41
$begingroup$
You are confusing the image of a function, period, and the image of a point under a function. This is an incredibly elementary distinction. The image of the function $f(x)=x^2$ is the set of all nonnegative real numbers, but the image of $3$ under $f$ is $9$. I don't see how you've asked questions about complex analysis and PDEs without understanding this.
$endgroup$
– symplectomorphic
Nov 15 '17 at 8:02
$begingroup$
en.wikipedia.org/wiki/Image_(mathematics)#Definition You're right. I've confused myself by reading through multiple different sources.
$endgroup$
– The Pointer
Nov 15 '17 at 8:06
add a comment |
$begingroup$
The image of $f$ isn't $b$. You don't seem to know the definition of the image of a function.
The image is the set of all possible outputs of the function $f$ as $x$ ranges over all vectors in the domain.
Edit, to address the question in the comments below my answer.
The image of $f$ is the span of the columns of $A$. The rank of $A$ is the number of linearly independent columns of $A$. Hence the rank is the size of a basis of the image, namely the basis consisting of the linearly independent columns of $A$. Since the rank is equal to the cardinality of a basis of the image, the rank is equal to the dimension of the image.
answered Nov 15 '17 at 7:26
symplectomorphicsymplectomorphic
12.6k22041
$endgroup$
$begingroup$
Thanks for the response. But how does this explain the relation between the $Rank(A)$ and $dim(Im(f))$? Can you please demonstrate why these are equal?
$endgroup$
– The Pointer
Nov 15 '17 at 7:29
$begingroup$
That is one definition of rank. Another definition, the one you seem to be using, is the number of pivots in the rref form of $A$. The number of pivots tells you how many linearly independent columns $A$ has. You can prove this is equal to the dimension of the image, as soon as you learn what the image really is. (Hint: the image is spanned by the columns of $A$.)
$endgroup$
– symplectomorphic
Nov 15 '17 at 7:30
$begingroup$
I added more details.
$endgroup$
– symplectomorphic
Nov 15 '17 at 7:41
$begingroup$
You are confusing the image of a function, period, and the image of a point under a function. This is an incredibly elementary distinction. The image of the function $f(x)=x^2$ is the set of all nonnegative real numbers, but the image of $3$ under $f$ is $9$. I don't see how you've asked questions about complex analysis and PDEs without understanding this.
$endgroup$
– symplectomorphic
Nov 15 '17 at 8:02
$begingroup$
en.wikipedia.org/wiki/Image_(mathematics)#Definition You're right. I've confused myself by reading through multiple different sources.
$endgroup$
– The Pointer
Nov 15 '17 at 8:06
add a comment |
$begingroup$
The image of $f$ isn't $b$. You don't seem to know the definition of the image of a function.
The image is the set of all possible outputs of the function $f$ as $x$ ranges over all vectors in the domain.
Edit, to address the question in the comments below my answer.
The image of $f$ is the span of the columns of $A$. The rank of $A$ is the number of linearly independent columns of $A$. Hence the rank is the size of a basis of the image, namely the basis consisting of the linearly independent columns of $A$. Since the rank is equal to the cardinality of a basis of the image, the rank is equal to the dimension of the image.
answered Nov 15 '17 at 7:26
symplectomorphicsymplectomorphic
12.6k22041
$endgroup$
The image of $f$ isn't $b$. You don't seem to know the definition of the image of a function.
The image is the set of all possible outputs of the function $f$ as $x$ ranges over all vectors in the domain.
Edit, to address the question in the comments below my answer.
The image of $f$ is the span of the columns of $A$. The rank of $A$ is the number of linearly independent columns of $A$. Hence the rank is the size of a basis of the image, namely the basis consisting of the linearly independent columns of $A$. Since the rank is equal to the cardinality of a basis of the image, the rank is equal to the dimension of the image.
answered Nov 15 '17 at 7:26
symplectomorphicsymplectomorphic
12.6k22041
edited Nov 15 '17 at 7:40
answered Nov 15 '17 at 7:26
symplectomorphicsymplectomorphic
12.6k22041
answered Nov 15 '17 at 7:26
symplectomorphicsymplectomorphic
12.6k22041
answered Nov 15 '17 at 7:26
symplectomorphicsymplectomorphic
12.6k22041
12.6k22041
$begingroup$
Thanks for the response. But how does this explain the relation between the $Rank(A)$ and $dim(Im(f))$? Can you please demonstrate why these are equal?
$endgroup$
– The Pointer
Nov 15 '17 at 7:29
$begingroup$
That is one definition of rank. Another definition, the one you seem to be using, is the number of pivots in the rref form of $A$. The number of pivots tells you how many linearly independent columns $A$ has. You can prove this is equal to the dimension of the image, as soon as you learn what the image really is. (Hint: the image is spanned by the columns of $A$.)
$endgroup$
– symplectomorphic
Nov 15 '17 at 7:30
$begingroup$
I added more details.
$endgroup$
– symplectomorphic
Nov 15 '17 at 7:41
$begingroup$
You are confusing the image of a function, period, and the image of a point under a function. This is an incredibly elementary distinction. The image of the function $f(x)=x^2$ is the set of all nonnegative real numbers, but the image of $3$ under $f$ is $9$. I don't see how you've asked questions about complex analysis and PDEs without understanding this.
$endgroup$
– symplectomorphic
Nov 15 '17 at 8:02
$begingroup$
en.wikipedia.org/wiki/Image_(mathematics)#Definition You're right. I've confused myself by reading through multiple different sources.
$endgroup$
– The Pointer
Nov 15 '17 at 8:06
add a comment |
$begingroup$
Thanks for the response. But how does this explain the relation between the $Rank(A)$ and $dim(Im(f))$? Can you please demonstrate why these are equal?
$endgroup$
– The Pointer
Nov 15 '17 at 7:29
$begingroup$
That is one definition of rank. Another definition, the one you seem to be using, is the number of pivots in the rref form of $A$. The number of pivots tells you how many linearly independent columns $A$ has. You can prove this is equal to the dimension of the image, as soon as you learn what the image really is. (Hint: the image is spanned by the columns of $A$.)
$endgroup$
– symplectomorphic
Nov 15 '17 at 7:30
$begingroup$
I added more details.
$endgroup$
– symplectomorphic
Nov 15 '17 at 7:41
$begingroup$
You are confusing the image of a function, period, and the image of a point under a function. This is an incredibly elementary distinction. The image of the function $f(x)=x^2$ is the set of all nonnegative real numbers, but the image of $3$ under $f$ is $9$. I don't see how you've asked questions about complex analysis and PDEs without understanding this.
$endgroup$
– symplectomorphic
Nov 15 '17 at 8:02
$begingroup$
en.wikipedia.org/wiki/Image_(mathematics)#Definition You're right. I've confused myself by reading through multiple different sources.
$endgroup$
– The Pointer
Nov 15 '17 at 8:06
$begingroup$
Thanks for the response. But how does this explain the relation between the $Rank(A)$ and $dim(Im(f))$? Can you please demonstrate why these are equal?
$endgroup$
– The Pointer
Nov 15 '17 at 7:29
$begingroup$
Thanks for the response. But how does this explain the relation between the $Rank(A)$ and $dim(Im(f))$? Can you please demonstrate why these are equal?
$endgroup$
– The Pointer
Nov 15 '17 at 7:29
$begingroup$
That is one definition of rank. Another definition, the one you seem to be using, is the number of pivots in the rref form of $A$. The number of pivots tells you how many linearly independent columns $A$ has. You can prove this is equal to the dimension of the image, as soon as you learn what the image really is. (Hint: the image is spanned by the columns of $A$.)
$endgroup$
– symplectomorphic
Nov 15 '17 at 7:30
$begingroup$
That is one definition of rank. Another definition, the one you seem to be using, is the number of pivots in the rref form of $A$. The number of pivots tells you how many linearly independent columns $A$ has. You can prove this is equal to the dimension of the image, as soon as you learn what the image really is. (Hint: the image is spanned by the columns of $A$.)
$endgroup$
– symplectomorphic
Nov 15 '17 at 7:30
$begingroup$
I added more details.
$endgroup$
– symplectomorphic
Nov 15 '17 at 7:41
$begingroup$
I added more details.
$endgroup$
– symplectomorphic
Nov 15 '17 at 7:41
$begingroup$
You are confusing the image of a function, period, and the image of a point under a function. This is an incredibly elementary distinction. The image of the function $f(x)=x^2$ is the set of all nonnegative real numbers, but the image of $3$ under $f$ is $9$. I don't see how you've asked questions about complex analysis and PDEs without understanding this.
$endgroup$
– symplectomorphic
Nov 15 '17 at 8:02
$begingroup$
You are confusing the image of a function, period, and the image of a point under a function. This is an incredibly elementary distinction. The image of the function $f(x)=x^2$ is the set of all nonnegative real numbers, but the image of $3$ under $f$ is $9$. I don't see how you've asked questions about complex analysis and PDEs without understanding this.
$endgroup$
– symplectomorphic
Nov 15 '17 at 8:02
$begingroup$
en.wikipedia.org/wiki/Image_(mathematics)#Definition You're right. I've confused myself by reading through multiple different sources.
$endgroup$
– The Pointer
Nov 15 '17 at 8:06
$begingroup$
en.wikipedia.org/wiki/Image_(mathematics)#Definition You're right. I've confused myself by reading through multiple different sources.
$endgroup$
– The Pointer
Nov 15 '17 at 8:06
add a comment |
$begingroup$
For the part you do not understand: since there is an isomorphism
$$overlinevarphi : V/textKer(varphi) stackrelsim=
varphi(V)$$ we have: beginequation textdimV/textKer(varphi)
= textdimvarphi(V) endequation By consequence of first isomorphism theorem, we have beginequation textdimV =
textdimtextKer(varphi) + textdimV/textKer(varphi)
endequation
So it follows that, $$dim V = dim Ker(varphi)+dim varphi(V)$$
And the above $varphi$ is a linear transformation and of course $varphi(V) = textIm(V)$
Well, i am not sure if you have learnt the first isomorphism theorem or not, but this is the proper understanding of how the so called rank nullity is derived. So first things first, remember this theorem.
The next is easy to understand, we have well known mapping which is $$T_A: mathbbR^n to mathbbR^n$$ which maps $$x mapsto Ax$$ in which $x$ is a column vector in the $mathbbR^n$ space and $A$ is THE matrix that is in question. Now : i hope you can easily verify the fact that in this linear transformation, we have dimension of kernel $T$ is merely the dimension of the nullspace of $A$ and the dimension of the image of $T$ is merely the dimension of the column space of $A$. And hence we see that indeed $$textrankA = dim textImT_A$$
My answer is still slightly vague and does not provide any intuition, but to piece it all together requires you to understand the fundamentals and of course the first isomorphism theorem.
answered Nov 15 '17 at 7:50
nannan
939419
$endgroup$
$begingroup$
The post didn't ask for a proof of the theorem. Your answer doesn't answer the question.
$endgroup$
– symplectomorphic
Nov 15 '17 at 8:04
$begingroup$
My comment (not yet proof) is to complement his understanding since he got an answer from you? It doesnt hurt to know something relevant.
$endgroup$
– nan
Nov 15 '17 at 8:08
$begingroup$
Answers here are supposed to give answers to the questions. Nowhere does the OP ask for a proof of the theorem. The question is about why the two statements of the theorem are equivalent. Your post is not relevant to that issue.
$endgroup$
– symplectomorphic
Nov 15 '17 at 8:10
$begingroup$
In my interpretation, he has some understanding of linear transformations and capable of understanding some abstract meaning of the theorem. And yes, i can definitely use my "proof" here to show these two statements are indeed equivalent if that is what you are worried about.
$endgroup$
– nan
Nov 15 '17 at 8:18
$begingroup$
I'm not worried about anything. I'm telling you how to improve your answers. Don't give irrelevant information. Answer the question directly and simply. I'll leave it there.
$endgroup$
– symplectomorphic
Nov 15 '17 at 8:19
add a comment |
$begingroup$
For the part you do not understand: since there is an isomorphism
$$overlinevarphi : V/textKer(varphi) stackrelsim=
varphi(V)$$ we have: beginequation textdimV/textKer(varphi)
= textdimvarphi(V) endequation By consequence of first isomorphism theorem, we have beginequation textdimV =
textdimtextKer(varphi) + textdimV/textKer(varphi)
endequation
So it follows that, $$dim V = dim Ker(varphi)+dim varphi(V)$$
And the above $varphi$ is a linear transformation and of course $varphi(V) = textIm(V)$
Well, i am not sure if you have learnt the first isomorphism theorem or not, but this is the proper understanding of how the so called rank nullity is derived. So first things first, remember this theorem.
The next is easy to understand, we have well known mapping which is $$T_A: mathbbR^n to mathbbR^n$$ which maps $$x mapsto Ax$$ in which $x$ is a column vector in the $mathbbR^n$ space and $A$ is THE matrix that is in question. Now : i hope you can easily verify the fact that in this linear transformation, we have dimension of kernel $T$ is merely the dimension of the nullspace of $A$ and the dimension of the image of $T$ is merely the dimension of the column space of $A$. And hence we see that indeed $$textrankA = dim textImT_A$$
My answer is still slightly vague and does not provide any intuition, but to piece it all together requires you to understand the fundamentals and of course the first isomorphism theorem.
answered Nov 15 '17 at 7:50
nannan
939419
$endgroup$
$begingroup$
The post didn't ask for a proof of the theorem. Your answer doesn't answer the question.
$endgroup$
– symplectomorphic
Nov 15 '17 at 8:04
$begingroup$
My comment (not yet proof) is to complement his understanding since he got an answer from you? It doesnt hurt to know something relevant.
$endgroup$
– nan
Nov 15 '17 at 8:08
$begingroup$
Answers here are supposed to give answers to the questions. Nowhere does the OP ask for a proof of the theorem. The question is about why the two statements of the theorem are equivalent. Your post is not relevant to that issue.
$endgroup$
– symplectomorphic
Nov 15 '17 at 8:10
$begingroup$
In my interpretation, he has some understanding of linear transformations and capable of understanding some abstract meaning of the theorem. And yes, i can definitely use my "proof" here to show these two statements are indeed equivalent if that is what you are worried about.
$endgroup$
– nan
Nov 15 '17 at 8:18
$begingroup$
I'm not worried about anything. I'm telling you how to improve your answers. Don't give irrelevant information. Answer the question directly and simply. I'll leave it there.
$endgroup$
– symplectomorphic
Nov 15 '17 at 8:19
add a comment |
$begingroup$
For the part you do not understand: since there is an isomorphism
$$overlinevarphi : V/textKer(varphi) stackrelsim=
varphi(V)$$ we have: beginequation textdimV/textKer(varphi)
= textdimvarphi(V) endequation By consequence of first isomorphism theorem, we have beginequation textdimV =
textdimtextKer(varphi) + textdimV/textKer(varphi)
endequation
So it follows that, $$dim V = dim Ker(varphi)+dim varphi(V)$$
And the above $varphi$ is a linear transformation and of course $varphi(V) = textIm(V)$
Well, i am not sure if you have learnt the first isomorphism theorem or not, but this is the proper understanding of how the so called rank nullity is derived. So first things first, remember this theorem.
The next is easy to understand, we have well known mapping which is $$T_A: mathbbR^n to mathbbR^n$$ which maps $$x mapsto Ax$$ in which $x$ is a column vector in the $mathbbR^n$ space and $A$ is THE matrix that is in question. Now : i hope you can easily verify the fact that in this linear transformation, we have dimension of kernel $T$ is merely the dimension of the nullspace of $A$ and the dimension of the image of $T$ is merely the dimension of the column space of $A$. And hence we see that indeed $$textrankA = dim textImT_A$$
My answer is still slightly vague and does not provide any intuition, but to piece it all together requires you to understand the fundamentals and of course the first isomorphism theorem.
answered Nov 15 '17 at 7:50
nannan
939419
$endgroup$
For the part you do not understand: since there is an isomorphism
$$overlinevarphi : V/textKer(varphi) stackrelsim=
varphi(V)$$ we have: beginequation textdimV/textKer(varphi)
= textdimvarphi(V) endequation By consequence of first isomorphism theorem, we have beginequation textdimV =
textdimtextKer(varphi) + textdimV/textKer(varphi)
endequation
So it follows that, $$dim V = dim Ker(varphi)+dim varphi(V)$$
And the above $varphi$ is a linear transformation and of course $varphi(V) = textIm(V)$
Well, i am not sure if you have learnt the first isomorphism theorem or not, but this is the proper understanding of how the so called rank nullity is derived. So first things first, remember this theorem.
The next is easy to understand, we have well known mapping which is $$T_A: mathbbR^n to mathbbR^n$$ which maps $$x mapsto Ax$$ in which $x$ is a column vector in the $mathbbR^n$ space and $A$ is THE matrix that is in question. Now : i hope you can easily verify the fact that in this linear transformation, we have dimension of kernel $T$ is merely the dimension of the nullspace of $A$ and the dimension of the image of $T$ is merely the dimension of the column space of $A$. And hence we see that indeed $$textrankA = dim textImT_A$$
My answer is still slightly vague and does not provide any intuition, but to piece it all together requires you to understand the fundamentals and of course the first isomorphism theorem.
answered Nov 15 '17 at 7:50
nannan
939419
answered Nov 15 '17 at 7:50
nannan
939419
answered Nov 15 '17 at 7:50
nannan
939419
answered Nov 15 '17 at 7:50
nannan
939419
939419
$begingroup$
The post didn't ask for a proof of the theorem. Your answer doesn't answer the question.
$endgroup$
– symplectomorphic
Nov 15 '17 at 8:04
$begingroup$
My comment (not yet proof) is to complement his understanding since he got an answer from you? It doesnt hurt to know something relevant.
$endgroup$
– nan
Nov 15 '17 at 8:08
$begingroup$
Answers here are supposed to give answers to the questions. Nowhere does the OP ask for a proof of the theorem. The question is about why the two statements of the theorem are equivalent. Your post is not relevant to that issue.
$endgroup$
– symplectomorphic
Nov 15 '17 at 8:10
$begingroup$
In my interpretation, he has some understanding of linear transformations and capable of understanding some abstract meaning of the theorem. And yes, i can definitely use my "proof" here to show these two statements are indeed equivalent if that is what you are worried about.
$endgroup$
– nan
Nov 15 '17 at 8:18
$begingroup$
I'm not worried about anything. I'm telling you how to improve your answers. Don't give irrelevant information. Answer the question directly and simply. I'll leave it there.
$endgroup$
– symplectomorphic
Nov 15 '17 at 8:19
add a comment |
$begingroup$
The post didn't ask for a proof of the theorem. Your answer doesn't answer the question.
$endgroup$
– symplectomorphic
Nov 15 '17 at 8:04
$begingroup$
My comment (not yet proof) is to complement his understanding since he got an answer from you? It doesnt hurt to know something relevant.
$endgroup$
– nan
Nov 15 '17 at 8:08
$begingroup$
Answers here are supposed to give answers to the questions. Nowhere does the OP ask for a proof of the theorem. The question is about why the two statements of the theorem are equivalent. Your post is not relevant to that issue.
$endgroup$
– symplectomorphic
Nov 15 '17 at 8:10
$begingroup$
In my interpretation, he has some understanding of linear transformations and capable of understanding some abstract meaning of the theorem. And yes, i can definitely use my "proof" here to show these two statements are indeed equivalent if that is what you are worried about.
$endgroup$
– nan
Nov 15 '17 at 8:18
$begingroup$
I'm not worried about anything. I'm telling you how to improve your answers. Don't give irrelevant information. Answer the question directly and simply. I'll leave it there.
$endgroup$
– symplectomorphic
Nov 15 '17 at 8:19
$begingroup$
The post didn't ask for a proof of the theorem. Your answer doesn't answer the question.
$endgroup$
– symplectomorphic
Nov 15 '17 at 8:04
$begingroup$
The post didn't ask for a proof of the theorem. Your answer doesn't answer the question.
$endgroup$
– symplectomorphic
Nov 15 '17 at 8:04
$begingroup$
My comment (not yet proof) is to complement his understanding since he got an answer from you? It doesnt hurt to know something relevant.
$endgroup$
– nan
Nov 15 '17 at 8:08
$begingroup$
My comment (not yet proof) is to complement his understanding since he got an answer from you? It doesnt hurt to know something relevant.
$endgroup$
– nan
Nov 15 '17 at 8:08
$begingroup$
Answers here are supposed to give answers to the questions. Nowhere does the OP ask for a proof of the theorem. The question is about why the two statements of the theorem are equivalent. Your post is not relevant to that issue.
$endgroup$
– symplectomorphic
Nov 15 '17 at 8:10
$begingroup$
Answers here are supposed to give answers to the questions. Nowhere does the OP ask for a proof of the theorem. The question is about why the two statements of the theorem are equivalent. Your post is not relevant to that issue.
$endgroup$
– symplectomorphic
Nov 15 '17 at 8:10
$begingroup$
In my interpretation, he has some understanding of linear transformations and capable of understanding some abstract meaning of the theorem. And yes, i can definitely use my "proof" here to show these two statements are indeed equivalent if that is what you are worried about.
$endgroup$
– nan
Nov 15 '17 at 8:18
$begingroup$
In my interpretation, he has some understanding of linear transformations and capable of understanding some abstract meaning of the theorem. And yes, i can definitely use my "proof" here to show these two statements are indeed equivalent if that is what you are worried about.
$endgroup$
– nan
Nov 15 '17 at 8:18
$begingroup$
I'm not worried about anything. I'm telling you how to improve your answers. Don't give irrelevant information. Answer the question directly and simply. I'll leave it there.
$endgroup$
– symplectomorphic
Nov 15 '17 at 8:19
$begingroup$
I'm not worried about anything. I'm telling you how to improve your answers. Don't give irrelevant information. Answer the question directly and simply. I'll leave it there.
$endgroup$
– symplectomorphic
Nov 15 '17 at 8:19
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%2f2521120%2frank-nullity-theorem-struggling-to-reconcile-rm-ranka-rm-nula-n%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$
Hint: if $A=(mathbfv_1;v_2;ldots; v_n)$, then $mathrmDim(mathrmIm( A))$ is just the number of linearly independent vectors among $mathbfv_i$s. Or in other words, $bf v_i$ spans $mathrmIm (A)$ (why?).
$endgroup$
– BAI
Nov 15 '17 at 7:46