Proof that $ operatorname{rank }(A) le 4$
$begingroup$
Let $A in mathbb R^{10,10}$, $x_{1},x_{2},...,x_{7}in mathbb R^{10}$ which are linearly independent vectors and $Ax_{1}=Ax_{2}=...=Ax_{7}$. Proof that $ operatorname{rank} (A) le 4$
I know that it is truth because if I have seven linearly independent vectors and I multiply a matrix with these vectors I must have at least $6$ zero rows because I have $Ax_{1}=Ax_{2}=...=Ax_{7}$. For example if I have $5$ zero rows then this vectors are not linearly independent.
However I don't know how to prove it in an elegant way.
linear-algebra
$endgroup$
add a comment |
$begingroup$
Let $A in mathbb R^{10,10}$, $x_{1},x_{2},...,x_{7}in mathbb R^{10}$ which are linearly independent vectors and $Ax_{1}=Ax_{2}=...=Ax_{7}$. Proof that $ operatorname{rank} (A) le 4$
I know that it is truth because if I have seven linearly independent vectors and I multiply a matrix with these vectors I must have at least $6$ zero rows because I have $Ax_{1}=Ax_{2}=...=Ax_{7}$. For example if I have $5$ zero rows then this vectors are not linearly independent.
However I don't know how to prove it in an elegant way.
linear-algebra
$endgroup$
1
$begingroup$
Rank nullity theorem. Think about $dim (mathrm {Ker}(A))$.
$endgroup$
– xbh
Feb 1 at 16:42
add a comment |
$begingroup$
Let $A in mathbb R^{10,10}$, $x_{1},x_{2},...,x_{7}in mathbb R^{10}$ which are linearly independent vectors and $Ax_{1}=Ax_{2}=...=Ax_{7}$. Proof that $ operatorname{rank} (A) le 4$
I know that it is truth because if I have seven linearly independent vectors and I multiply a matrix with these vectors I must have at least $6$ zero rows because I have $Ax_{1}=Ax_{2}=...=Ax_{7}$. For example if I have $5$ zero rows then this vectors are not linearly independent.
However I don't know how to prove it in an elegant way.
linear-algebra
$endgroup$
Let $A in mathbb R^{10,10}$, $x_{1},x_{2},...,x_{7}in mathbb R^{10}$ which are linearly independent vectors and $Ax_{1}=Ax_{2}=...=Ax_{7}$. Proof that $ operatorname{rank} (A) le 4$
I know that it is truth because if I have seven linearly independent vectors and I multiply a matrix with these vectors I must have at least $6$ zero rows because I have $Ax_{1}=Ax_{2}=...=Ax_{7}$. For example if I have $5$ zero rows then this vectors are not linearly independent.
However I don't know how to prove it in an elegant way.
linear-algebra
linear-algebra
edited Feb 1 at 17:18
Bernard
124k741117
124k741117
asked Feb 1 at 16:40
MP3129MP3129
792211
792211
1
$begingroup$
Rank nullity theorem. Think about $dim (mathrm {Ker}(A))$.
$endgroup$
– xbh
Feb 1 at 16:42
add a comment |
1
$begingroup$
Rank nullity theorem. Think about $dim (mathrm {Ker}(A))$.
$endgroup$
– xbh
Feb 1 at 16:42
1
1
$begingroup$
Rank nullity theorem. Think about $dim (mathrm {Ker}(A))$.
$endgroup$
– xbh
Feb 1 at 16:42
$begingroup$
Rank nullity theorem. Think about $dim (mathrm {Ker}(A))$.
$endgroup$
– xbh
Feb 1 at 16:42
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
You can find 6 linearly-independent vectors in the kernel of $A$ by considering
$y_1=x_2-x_1$, $y_2=x_3-x_1$,...,$y_6=x_7-x_1$. Indeed, you can check that $Ay_i=0$ for all $1geq i geq 6$.
So $dim Ker(A) geq 6$.
By the Rank-Nullity Theorem, $$rank(T) = 10 - dim Ker(T) leq 10-6=4$$
$endgroup$
$begingroup$
Ok, you have right, but have you got an idea how to describe nicely? I think your words are insufficient
$endgroup$
– MP3129
Feb 1 at 16:55
1
$begingroup$
OK I added some more details.
$endgroup$
– Stefan Lafon
Feb 1 at 17:04
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%2f3096457%2fproof-that-operatornamerank-a-le-4%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
$begingroup$
You can find 6 linearly-independent vectors in the kernel of $A$ by considering
$y_1=x_2-x_1$, $y_2=x_3-x_1$,...,$y_6=x_7-x_1$. Indeed, you can check that $Ay_i=0$ for all $1geq i geq 6$.
So $dim Ker(A) geq 6$.
By the Rank-Nullity Theorem, $$rank(T) = 10 - dim Ker(T) leq 10-6=4$$
$endgroup$
$begingroup$
Ok, you have right, but have you got an idea how to describe nicely? I think your words are insufficient
$endgroup$
– MP3129
Feb 1 at 16:55
1
$begingroup$
OK I added some more details.
$endgroup$
– Stefan Lafon
Feb 1 at 17:04
add a comment |
$begingroup$
You can find 6 linearly-independent vectors in the kernel of $A$ by considering
$y_1=x_2-x_1$, $y_2=x_3-x_1$,...,$y_6=x_7-x_1$. Indeed, you can check that $Ay_i=0$ for all $1geq i geq 6$.
So $dim Ker(A) geq 6$.
By the Rank-Nullity Theorem, $$rank(T) = 10 - dim Ker(T) leq 10-6=4$$
$endgroup$
$begingroup$
Ok, you have right, but have you got an idea how to describe nicely? I think your words are insufficient
$endgroup$
– MP3129
Feb 1 at 16:55
1
$begingroup$
OK I added some more details.
$endgroup$
– Stefan Lafon
Feb 1 at 17:04
add a comment |
$begingroup$
You can find 6 linearly-independent vectors in the kernel of $A$ by considering
$y_1=x_2-x_1$, $y_2=x_3-x_1$,...,$y_6=x_7-x_1$. Indeed, you can check that $Ay_i=0$ for all $1geq i geq 6$.
So $dim Ker(A) geq 6$.
By the Rank-Nullity Theorem, $$rank(T) = 10 - dim Ker(T) leq 10-6=4$$
$endgroup$
You can find 6 linearly-independent vectors in the kernel of $A$ by considering
$y_1=x_2-x_1$, $y_2=x_3-x_1$,...,$y_6=x_7-x_1$. Indeed, you can check that $Ay_i=0$ for all $1geq i geq 6$.
So $dim Ker(A) geq 6$.
By the Rank-Nullity Theorem, $$rank(T) = 10 - dim Ker(T) leq 10-6=4$$
edited Feb 1 at 17:03
answered Feb 1 at 16:43


Stefan LafonStefan Lafon
3,005212
3,005212
$begingroup$
Ok, you have right, but have you got an idea how to describe nicely? I think your words are insufficient
$endgroup$
– MP3129
Feb 1 at 16:55
1
$begingroup$
OK I added some more details.
$endgroup$
– Stefan Lafon
Feb 1 at 17:04
add a comment |
$begingroup$
Ok, you have right, but have you got an idea how to describe nicely? I think your words are insufficient
$endgroup$
– MP3129
Feb 1 at 16:55
1
$begingroup$
OK I added some more details.
$endgroup$
– Stefan Lafon
Feb 1 at 17:04
$begingroup$
Ok, you have right, but have you got an idea how to describe nicely? I think your words are insufficient
$endgroup$
– MP3129
Feb 1 at 16:55
$begingroup$
Ok, you have right, but have you got an idea how to describe nicely? I think your words are insufficient
$endgroup$
– MP3129
Feb 1 at 16:55
1
1
$begingroup$
OK I added some more details.
$endgroup$
– Stefan Lafon
Feb 1 at 17:04
$begingroup$
OK I added some more details.
$endgroup$
– Stefan Lafon
Feb 1 at 17:04
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%2f3096457%2fproof-that-operatornamerank-a-le-4%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
1
$begingroup$
Rank nullity theorem. Think about $dim (mathrm {Ker}(A))$.
$endgroup$
– xbh
Feb 1 at 16:42