Rank, nullity and consistency for two matrices
$begingroup$
I have this question here which says the following.
Let $A$,$B$ be $3 times 6$ matrices with the following properties.
$(i)$ For every b$epsilon mathbb{R}^3$, rank$(A)$ $=$ rank$([A|b])$
$(ii)$ dim$($Row$(B)$$)$$=2$.
Answer the following questions.
$(a)$ What is rank$(A)$?
My reasoning: I know that rank$(A)leq min(m,n)$ but I am not sure if that justifies in me saying that rank$(A)=3$. I want to say yes, but I am not certain.
$(b)$ What is nullity$(B)$?
My reasoning: rank$(B)+{}$nullity$(B)=$ # of columns.
Therefore, $2$+nullity$(B)$ $=6$
nullity$(B)$ $=6-2$
nullity$(B)$ $=4$
$(c)$ Is there a vector b$epsilon mathbb{R}^3$ such that $A$x=b is consistent?
My reasoning: Yes there is. Since rank$(A)$ $=$ rank$([A|b])$, there must be a consistent solution.
$(d)$ Is there a vector b$epsilon mathbb{R}^3$ such that $B$x=b is consistent?
My reasoning: Yes there is. Since rank$(B)$ $=2$, this means that rank$(B)$ $<6$ so the system is not only consistent, but has infinitely many solutions.
$(e)$ Is there a non-zero vector x $epsilon mathbb{R}^6$ such that Ax=$0$ and Bx=$0$ simultaneously?
I'm not sure about this one... Any guidance would be much appreciated!
Are my other answers reasonable? Thanks!
linear-algebra matrices systems-of-equations matrix-rank
edited Dec 12 '18 at 0:08
Bernard
121k740116
asked Dec 12 '18 at 0:02
Future Math personFuture Math person
972817
$endgroup$
add a comment |
$begingroup$
I have this question here which says the following.
Let $A$,$B$ be $3 times 6$ matrices with the following properties.
$(i)$ For every b$epsilon mathbb{R}^3$, rank$(A)$ $=$ rank$([A|b])$
$(ii)$ dim$($Row$(B)$$)$$=2$.
Answer the following questions.
$(a)$ What is rank$(A)$?
My reasoning: I know that rank$(A)leq min(m,n)$ but I am not sure if that justifies in me saying that rank$(A)=3$. I want to say yes, but I am not certain.
$(b)$ What is nullity$(B)$?
My reasoning: rank$(B)+{}$nullity$(B)=$ # of columns.
Therefore, $2$+nullity$(B)$ $=6$
nullity$(B)$ $=6-2$
nullity$(B)$ $=4$
$(c)$ Is there a vector b$epsilon mathbb{R}^3$ such that $A$x=b is consistent?
My reasoning: Yes there is. Since rank$(A)$ $=$ rank$([A|b])$, there must be a consistent solution.
$(d)$ Is there a vector b$epsilon mathbb{R}^3$ such that $B$x=b is consistent?
My reasoning: Yes there is. Since rank$(B)$ $=2$, this means that rank$(B)$ $<6$ so the system is not only consistent, but has infinitely many solutions.
$(e)$ Is there a non-zero vector x $epsilon mathbb{R}^6$ such that Ax=$0$ and Bx=$0$ simultaneously?
I'm not sure about this one... Any guidance would be much appreciated!
Are my other answers reasonable? Thanks!
linear-algebra matrices systems-of-equations matrix-rank
edited Dec 12 '18 at 0:08
Bernard
121k740116
asked Dec 12 '18 at 0:02
Future Math personFuture Math person
972817
$endgroup$
add a comment |
$begingroup$
I have this question here which says the following.
Let $A$,$B$ be $3 times 6$ matrices with the following properties.
$(i)$ For every b$epsilon mathbb{R}^3$, rank$(A)$ $=$ rank$([A|b])$
$(ii)$ dim$($Row$(B)$$)$$=2$.
Answer the following questions.
$(a)$ What is rank$(A)$?
My reasoning: I know that rank$(A)leq min(m,n)$ but I am not sure if that justifies in me saying that rank$(A)=3$. I want to say yes, but I am not certain.
$(b)$ What is nullity$(B)$?
My reasoning: rank$(B)+{}$nullity$(B)=$ # of columns.
Therefore, $2$+nullity$(B)$ $=6$
nullity$(B)$ $=6-2$
nullity$(B)$ $=4$
$(c)$ Is there a vector b$epsilon mathbb{R}^3$ such that $A$x=b is consistent?
My reasoning: Yes there is. Since rank$(A)$ $=$ rank$([A|b])$, there must be a consistent solution.
$(d)$ Is there a vector b$epsilon mathbb{R}^3$ such that $B$x=b is consistent?
My reasoning: Yes there is. Since rank$(B)$ $=2$, this means that rank$(B)$ $<6$ so the system is not only consistent, but has infinitely many solutions.
$(e)$ Is there a non-zero vector x $epsilon mathbb{R}^6$ such that Ax=$0$ and Bx=$0$ simultaneously?
I'm not sure about this one... Any guidance would be much appreciated!
Are my other answers reasonable? Thanks!
linear-algebra matrices systems-of-equations matrix-rank
edited Dec 12 '18 at 0:08
Bernard
121k740116
asked Dec 12 '18 at 0:02
Future Math personFuture Math person
972817
$endgroup$
I have this question here which says the following.
Let $A$,$B$ be $3 times 6$ matrices with the following properties.
$(i)$ For every b$epsilon mathbb{R}^3$, rank$(A)$ $=$ rank$([A|b])$
$(ii)$ dim$($Row$(B)$$)$$=2$.
Answer the following questions.
$(a)$ What is rank$(A)$?
My reasoning: I know that rank$(A)leq min(m,n)$ but I am not sure if that justifies in me saying that rank$(A)=3$. I want to say yes, but I am not certain.
$(b)$ What is nullity$(B)$?
My reasoning: rank$(B)+{}$nullity$(B)=$ # of columns.
Therefore, $2$+nullity$(B)$ $=6$
nullity$(B)$ $=6-2$
nullity$(B)$ $=4$
$(c)$ Is there a vector b$epsilon mathbb{R}^3$ such that $A$x=b is consistent?
My reasoning: Yes there is. Since rank$(A)$ $=$ rank$([A|b])$, there must be a consistent solution.
$(d)$ Is there a vector b$epsilon mathbb{R}^3$ such that $B$x=b is consistent?
My reasoning: Yes there is. Since rank$(B)$ $=2$, this means that rank$(B)$ $<6$ so the system is not only consistent, but has infinitely many solutions.
$(e)$ Is there a non-zero vector x $epsilon mathbb{R}^6$ such that Ax=$0$ and Bx=$0$ simultaneously?
I'm not sure about this one... Any guidance would be much appreciated!
Are my other answers reasonable? Thanks!
linear-algebra matrices systems-of-equations matrix-rank
linear-algebra matrices systems-of-equations matrix-rank
edited Dec 12 '18 at 0:08
Bernard
121k740116
asked Dec 12 '18 at 0:02
Future Math personFuture Math person
972817
edited Dec 12 '18 at 0:08
Bernard
121k740116
asked Dec 12 '18 at 0:02
Future Math personFuture Math person
972817
edited Dec 12 '18 at 0:08
Bernard
121k740116
edited Dec 12 '18 at 0:08
Bernard
121k740116
edited Dec 12 '18 at 0:08
Bernard
121k740116
121k740116
asked Dec 12 '18 at 0:02
Future Math personFuture Math person
972817
asked Dec 12 '18 at 0:02
Future Math personFuture Math person
972817
asked Dec 12 '18 at 0:02
Future Math personFuture Math person
972817
972817
add a comment |
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
(a) The answer is correct but the argument is not quite there. From the given information we can say that every $bin mathbb{R}^3$ is in the column space of $mathbb{R}^3$. Why we can conclude that the rank of $A$ is 3 from this fact?
(b) It is ok.
(c) The argument needs to be more precise.
(d) You need to connect the relationship between the rank and the consistency of system of equations.
(e) Use the fact that $text{dim}(U+V)=text{dim}(U)+text{dim}(V)-text{dim}(Ucap V)$.
For part (e) try this way. From the previous part we know that $text{nullity}(A)=3$ and $text{nullity}(B)=4$. Let $X={x_1,x_2,x_3}$ and $Y={y_1,y_2,y_3,y_4}$ be respectively be the basis of nullspace of $A$ and $b$.
We want to show that $text{null}(A)cap text{null}{B}neq emptyset$. Assume otherwise and show that the assumption leads to the conclusion that $ Xcup Y$ is linearly independent, which is impossible (why?)
answered Dec 12 '18 at 0:36
user9077user9077
1,239612
$endgroup$
$begingroup$
Okay so I fixed almost all of it. For part d, I know the rank is 2, which means after row reduction, there are two leading ones. Since it is a 3x6 matrix, that means there is 1 free variable and the system is consistent and there are infinitely many solutions. Is that right? I still can't get part e. I've never seen that theorem before.
$endgroup$
– Future Math person
Dec 12 '18 at 1:17
$begingroup$
Ah ok if you want to argue that way you need to say that you pick $b=0$. Since $B$ has rank 2, then $Bx=0$ has infinitely many solutions. Let me think if there is another way to solve it without that theorem.
$endgroup$
– user9077
Dec 12 '18 at 1:21
$begingroup$
I add something for part (e) above.
$endgroup$
– user9077
Dec 12 '18 at 1:30
$begingroup$
I get what you mostly did I am not sure what to do for the contradiction portion. When I took linear algebra 6 years ago, I don't think I ever covered the intersection of dimensions in any way. Can you elaborate on why that's needed?
$endgroup$
– Future Math person
Dec 12 '18 at 2:49
$begingroup$
$Xcup Y$ has 7 elements. So they must be linearly dependent. Hence there are $alpha_i,beta_iin mathbb{R}$ not all zero such that $$alpha_1x_1+cdots +alpha_3x_3+beta_1y_1+cdots beta_3y_3=0.$$ So $$alpha_1x_1+cdots+alpha_3x_3=-(beta_1y_1+cdots+beta_4y_4)in text{null}(A)cap text{null}(B)$$
$endgroup$
– user9077
Dec 12 '18 at 2:53
|
show 1 more 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%2f3036040%2frank-nullity-and-consistency-for-two-matrices%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$
(a) The answer is correct but the argument is not quite there. From the given information we can say that every $bin mathbb{R}^3$ is in the column space of $mathbb{R}^3$. Why we can conclude that the rank of $A$ is 3 from this fact?
(b) It is ok.
(c) The argument needs to be more precise.
(d) You need to connect the relationship between the rank and the consistency of system of equations.
(e) Use the fact that $text{dim}(U+V)=text{dim}(U)+text{dim}(V)-text{dim}(Ucap V)$.
For part (e) try this way. From the previous part we know that $text{nullity}(A)=3$ and $text{nullity}(B)=4$. Let $X={x_1,x_2,x_3}$ and $Y={y_1,y_2,y_3,y_4}$ be respectively be the basis of nullspace of $A$ and $b$.
We want to show that $text{null}(A)cap text{null}{B}neq emptyset$. Assume otherwise and show that the assumption leads to the conclusion that $ Xcup Y$ is linearly independent, which is impossible (why?)
answered Dec 12 '18 at 0:36
user9077user9077
1,239612
$endgroup$
$begingroup$
Okay so I fixed almost all of it. For part d, I know the rank is 2, which means after row reduction, there are two leading ones. Since it is a 3x6 matrix, that means there is 1 free variable and the system is consistent and there are infinitely many solutions. Is that right? I still can't get part e. I've never seen that theorem before.
$endgroup$
– Future Math person
Dec 12 '18 at 1:17
$begingroup$
Ah ok if you want to argue that way you need to say that you pick $b=0$. Since $B$ has rank 2, then $Bx=0$ has infinitely many solutions. Let me think if there is another way to solve it without that theorem.
$endgroup$
– user9077
Dec 12 '18 at 1:21
$begingroup$
I add something for part (e) above.
$endgroup$
– user9077
Dec 12 '18 at 1:30
$begingroup$
I get what you mostly did I am not sure what to do for the contradiction portion. When I took linear algebra 6 years ago, I don't think I ever covered the intersection of dimensions in any way. Can you elaborate on why that's needed?
$endgroup$
– Future Math person
Dec 12 '18 at 2:49
$begingroup$
$Xcup Y$ has 7 elements. So they must be linearly dependent. Hence there are $alpha_i,beta_iin mathbb{R}$ not all zero such that $$alpha_1x_1+cdots +alpha_3x_3+beta_1y_1+cdots beta_3y_3=0.$$ So $$alpha_1x_1+cdots+alpha_3x_3=-(beta_1y_1+cdots+beta_4y_4)in text{null}(A)cap text{null}(B)$$
$endgroup$
– user9077
Dec 12 '18 at 2:53
|
show 1 more comment
$begingroup$
(a) The answer is correct but the argument is not quite there. From the given information we can say that every $bin mathbb{R}^3$ is in the column space of $mathbb{R}^3$. Why we can conclude that the rank of $A$ is 3 from this fact?
(b) It is ok.
(c) The argument needs to be more precise.
(d) You need to connect the relationship between the rank and the consistency of system of equations.
(e) Use the fact that $text{dim}(U+V)=text{dim}(U)+text{dim}(V)-text{dim}(Ucap V)$.
For part (e) try this way. From the previous part we know that $text{nullity}(A)=3$ and $text{nullity}(B)=4$. Let $X={x_1,x_2,x_3}$ and $Y={y_1,y_2,y_3,y_4}$ be respectively be the basis of nullspace of $A$ and $b$.
We want to show that $text{null}(A)cap text{null}{B}neq emptyset$. Assume otherwise and show that the assumption leads to the conclusion that $ Xcup Y$ is linearly independent, which is impossible (why?)
answered Dec 12 '18 at 0:36
user9077user9077
1,239612
$endgroup$
$begingroup$
Okay so I fixed almost all of it. For part d, I know the rank is 2, which means after row reduction, there are two leading ones. Since it is a 3x6 matrix, that means there is 1 free variable and the system is consistent and there are infinitely many solutions. Is that right? I still can't get part e. I've never seen that theorem before.
$endgroup$
– Future Math person
Dec 12 '18 at 1:17
$begingroup$
Ah ok if you want to argue that way you need to say that you pick $b=0$. Since $B$ has rank 2, then $Bx=0$ has infinitely many solutions. Let me think if there is another way to solve it without that theorem.
$endgroup$
– user9077
Dec 12 '18 at 1:21
$begingroup$
I add something for part (e) above.
$endgroup$
– user9077
Dec 12 '18 at 1:30
$begingroup$
I get what you mostly did I am not sure what to do for the contradiction portion. When I took linear algebra 6 years ago, I don't think I ever covered the intersection of dimensions in any way. Can you elaborate on why that's needed?
$endgroup$
– Future Math person
Dec 12 '18 at 2:49
$begingroup$
$Xcup Y$ has 7 elements. So they must be linearly dependent. Hence there are $alpha_i,beta_iin mathbb{R}$ not all zero such that $$alpha_1x_1+cdots +alpha_3x_3+beta_1y_1+cdots beta_3y_3=0.$$ So $$alpha_1x_1+cdots+alpha_3x_3=-(beta_1y_1+cdots+beta_4y_4)in text{null}(A)cap text{null}(B)$$
$endgroup$
– user9077
Dec 12 '18 at 2:53
|
show 1 more comment
$begingroup$
(a) The answer is correct but the argument is not quite there. From the given information we can say that every $bin mathbb{R}^3$ is in the column space of $mathbb{R}^3$. Why we can conclude that the rank of $A$ is 3 from this fact?
(b) It is ok.
(c) The argument needs to be more precise.
(d) You need to connect the relationship between the rank and the consistency of system of equations.
(e) Use the fact that $text{dim}(U+V)=text{dim}(U)+text{dim}(V)-text{dim}(Ucap V)$.
For part (e) try this way. From the previous part we know that $text{nullity}(A)=3$ and $text{nullity}(B)=4$. Let $X={x_1,x_2,x_3}$ and $Y={y_1,y_2,y_3,y_4}$ be respectively be the basis of nullspace of $A$ and $b$.
We want to show that $text{null}(A)cap text{null}{B}neq emptyset$. Assume otherwise and show that the assumption leads to the conclusion that $ Xcup Y$ is linearly independent, which is impossible (why?)
answered Dec 12 '18 at 0:36
user9077user9077
1,239612
$endgroup$
(a) The answer is correct but the argument is not quite there. From the given information we can say that every $bin mathbb{R}^3$ is in the column space of $mathbb{R}^3$. Why we can conclude that the rank of $A$ is 3 from this fact?
(b) It is ok.
(c) The argument needs to be more precise.
(d) You need to connect the relationship between the rank and the consistency of system of equations.
(e) Use the fact that $text{dim}(U+V)=text{dim}(U)+text{dim}(V)-text{dim}(Ucap V)$.
For part (e) try this way. From the previous part we know that $text{nullity}(A)=3$ and $text{nullity}(B)=4$. Let $X={x_1,x_2,x_3}$ and $Y={y_1,y_2,y_3,y_4}$ be respectively be the basis of nullspace of $A$ and $b$.
We want to show that $text{null}(A)cap text{null}{B}neq emptyset$. Assume otherwise and show that the assumption leads to the conclusion that $ Xcup Y$ is linearly independent, which is impossible (why?)
answered Dec 12 '18 at 0:36
user9077user9077
1,239612
edited Dec 12 '18 at 1:29
answered Dec 12 '18 at 0:36
user9077user9077
1,239612
answered Dec 12 '18 at 0:36
user9077user9077
1,239612
answered Dec 12 '18 at 0:36
user9077user9077
1,239612
1,239612
$begingroup$
Okay so I fixed almost all of it. For part d, I know the rank is 2, which means after row reduction, there are two leading ones. Since it is a 3x6 matrix, that means there is 1 free variable and the system is consistent and there are infinitely many solutions. Is that right? I still can't get part e. I've never seen that theorem before.
$endgroup$
– Future Math person
Dec 12 '18 at 1:17
$begingroup$
Ah ok if you want to argue that way you need to say that you pick $b=0$. Since $B$ has rank 2, then $Bx=0$ has infinitely many solutions. Let me think if there is another way to solve it without that theorem.
$endgroup$
– user9077
Dec 12 '18 at 1:21
$begingroup$
I add something for part (e) above.
$endgroup$
– user9077
Dec 12 '18 at 1:30
$begingroup$
I get what you mostly did I am not sure what to do for the contradiction portion. When I took linear algebra 6 years ago, I don't think I ever covered the intersection of dimensions in any way. Can you elaborate on why that's needed?
$endgroup$
– Future Math person
Dec 12 '18 at 2:49
$begingroup$
$Xcup Y$ has 7 elements. So they must be linearly dependent. Hence there are $alpha_i,beta_iin mathbb{R}$ not all zero such that $$alpha_1x_1+cdots +alpha_3x_3+beta_1y_1+cdots beta_3y_3=0.$$ So $$alpha_1x_1+cdots+alpha_3x_3=-(beta_1y_1+cdots+beta_4y_4)in text{null}(A)cap text{null}(B)$$
$endgroup$
– user9077
Dec 12 '18 at 2:53
|
show 1 more comment
$begingroup$
Okay so I fixed almost all of it. For part d, I know the rank is 2, which means after row reduction, there are two leading ones. Since it is a 3x6 matrix, that means there is 1 free variable and the system is consistent and there are infinitely many solutions. Is that right? I still can't get part e. I've never seen that theorem before.
$endgroup$
– Future Math person
Dec 12 '18 at 1:17
$begingroup$
Ah ok if you want to argue that way you need to say that you pick $b=0$. Since $B$ has rank 2, then $Bx=0$ has infinitely many solutions. Let me think if there is another way to solve it without that theorem.
$endgroup$
– user9077
Dec 12 '18 at 1:21
$begingroup$
I add something for part (e) above.
$endgroup$
– user9077
Dec 12 '18 at 1:30
$begingroup$
I get what you mostly did I am not sure what to do for the contradiction portion. When I took linear algebra 6 years ago, I don't think I ever covered the intersection of dimensions in any way. Can you elaborate on why that's needed?
$endgroup$
– Future Math person
Dec 12 '18 at 2:49
$begingroup$
$Xcup Y$ has 7 elements. So they must be linearly dependent. Hence there are $alpha_i,beta_iin mathbb{R}$ not all zero such that $$alpha_1x_1+cdots +alpha_3x_3+beta_1y_1+cdots beta_3y_3=0.$$ So $$alpha_1x_1+cdots+alpha_3x_3=-(beta_1y_1+cdots+beta_4y_4)in text{null}(A)cap text{null}(B)$$
$endgroup$
– user9077
Dec 12 '18 at 2:53
$begingroup$
Okay so I fixed almost all of it. For part d, I know the rank is 2, which means after row reduction, there are two leading ones. Since it is a 3x6 matrix, that means there is 1 free variable and the system is consistent and there are infinitely many solutions. Is that right? I still can't get part e. I've never seen that theorem before.
$endgroup$
– Future Math person
Dec 12 '18 at 1:17
$begingroup$
Okay so I fixed almost all of it. For part d, I know the rank is 2, which means after row reduction, there are two leading ones. Since it is a 3x6 matrix, that means there is 1 free variable and the system is consistent and there are infinitely many solutions. Is that right? I still can't get part e. I've never seen that theorem before.
$endgroup$
– Future Math person
Dec 12 '18 at 1:17
$begingroup$
Ah ok if you want to argue that way you need to say that you pick $b=0$. Since $B$ has rank 2, then $Bx=0$ has infinitely many solutions. Let me think if there is another way to solve it without that theorem.
$endgroup$
– user9077
Dec 12 '18 at 1:21
$begingroup$
Ah ok if you want to argue that way you need to say that you pick $b=0$. Since $B$ has rank 2, then $Bx=0$ has infinitely many solutions. Let me think if there is another way to solve it without that theorem.
$endgroup$
– user9077
Dec 12 '18 at 1:21
$begingroup$
I add something for part (e) above.
$endgroup$
– user9077
Dec 12 '18 at 1:30
$begingroup$
I add something for part (e) above.
$endgroup$
– user9077
Dec 12 '18 at 1:30
$begingroup$
I get what you mostly did I am not sure what to do for the contradiction portion. When I took linear algebra 6 years ago, I don't think I ever covered the intersection of dimensions in any way. Can you elaborate on why that's needed?
$endgroup$
– Future Math person
Dec 12 '18 at 2:49
$begingroup$
I get what you mostly did I am not sure what to do for the contradiction portion. When I took linear algebra 6 years ago, I don't think I ever covered the intersection of dimensions in any way. Can you elaborate on why that's needed?
$endgroup$
– Future Math person
Dec 12 '18 at 2:49
$begingroup$
$Xcup Y$ has 7 elements. So they must be linearly dependent. Hence there are $alpha_i,beta_iin mathbb{R}$ not all zero such that $$alpha_1x_1+cdots +alpha_3x_3+beta_1y_1+cdots beta_3y_3=0.$$ So $$alpha_1x_1+cdots+alpha_3x_3=-(beta_1y_1+cdots+beta_4y_4)in text{null}(A)cap text{null}(B)$$
$endgroup$
– user9077
Dec 12 '18 at 2:53
$begingroup$
$Xcup Y$ has 7 elements. So they must be linearly dependent. Hence there are $alpha_i,beta_iin mathbb{R}$ not all zero such that $$alpha_1x_1+cdots +alpha_3x_3+beta_1y_1+cdots beta_3y_3=0.$$ So $$alpha_1x_1+cdots+alpha_3x_3=-(beta_1y_1+cdots+beta_4y_4)in text{null}(A)cap text{null}(B)$$
$endgroup$
– user9077
Dec 12 '18 at 2:53
|
show 1 more 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%2f3036040%2frank-nullity-and-consistency-for-two-matrices%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
