A question on linear independence and dependence












2












$begingroup$


I have been trying to solve the second half of the following problem but so far I have not succeeded so far:




Let $alpha_{1},ldots,alpha_{n}$ be $n$ elements in a vector space
$V$ over $mathbb{F}$. If they are linearly dependent and if any $n-1$
vectors among them are linearly dependent then there exists
$c_1,c_2,ldots,c_ninmathbb{F}$ , none of which is $0$, such that
$sum_{i=1}^{n}c_{i}alpha_{i}=0$. If $d_1,ldots,d_{n}inmathbb{F}$
satisfy the same requirements then there is a $kne 0inmathbb{F}$
such that $d_{i}=kc_{i}, 1le ile n$.




Here's my attempt:



If $alpha_{1},ldots,alpha_{n}$ are linearly dependent then there are $c_1,c_2,ldots,c_ninmathbb{F}$, not all zero, such that
$$sum_{i=1}^{n} c_{i}alpha_{i} =0$$
If some $c_j=0$ we can assume after rearranging the indices that $c_1=0$ thus
$$sum_{i=2}^{n} c_{i}alpha_{i} =0$$
Since any $n-1$ vectors are independent we must have $c_1=c_2=ldots c_{n}=0$.
Thus $alpha_{1},ldots,alpha_{n}$ are linearly independent which is a contradiction thus all of $c_i$'s are nonzero. This completes the first half of the proof.



Suppose that there are some $d_{1},ldots,d_{n} inmathbb{F}$ where none of which are zero such that
$$sum_{i=1}^{n}d_{i}alpha_{i}=0$$



Then we can write
$$sum_{i=1}^{n}d_{i}alpha_{i}=0=sum_{i=1}^{n}c_{i}alpha_{i}$$
that is
$sum_{i=1}^{n}(d_{i}-c_{i})alpha_{i}=0$.



I'm not sure what can follow from here; How do I bring out the existence of such a $k$? Hints would be appreciated.



UPDATE: Suppose that there are some $d_{1},ldots,d_{n} inmathbb{F}$ where none of which are zero such that
$$sum_{i=1}^{n}d_{i}alpha_{i}=0$$



Since $d_1 ne 0$ we can write
$$sum_{i=1}^{n}d_{i}d_{1}^{-1}alpha_{i}=0$$



And thus like previously,



$$sum_{i=1}^{n}(d_{i}d_{1}^{-1}-c_{i}c_{1}^{-1})alpha_{i}=0$$
i.e.
$$sum_{i=2}^{n}(d_{i}d_{1}^{-1}-c_{i}c_{1}^{-1})alpha_{i}=0$$
Since any $(n-1)$ vectors are independent, we have that $d_{i}=frac{d_1}{c_1} c_{i}$ for all $2le ile n$. This completes the second part.










share|cite|improve this question











$endgroup$












  • $begingroup$
    Indirect hint: you are given that $c_j, d_j$'s are all nonzero. Then could you do something to reduce the "degree of freedom"? Also note that we are working on a field.
    $endgroup$
    – xbh
    Jan 20 at 9:02












  • $begingroup$
    @xbh hey I am not sure if I follow you; can you break it down even more?
    $endgroup$
    – Ashish K
    Jan 20 at 9:13












  • $begingroup$
    Okay, my apologies. Directly, I claim that we could assume $c_1 = 1$, is it correct? If it is, then the unknown coefficients are only $c_2$ thru $c_n$, i.e. we reduce "# of free variables" from $n$ to $n-1$, then we might be easier to proceed.
    $endgroup$
    – xbh
    Jan 20 at 9:23










  • $begingroup$
    @xbh thanks for the hint! I completed the proof. Can you please check it?
    $endgroup$
    – Ashish K
    Jan 20 at 9:32






  • 1




    $begingroup$
    Yeah, that's pretty much of it. Well done!
    $endgroup$
    – xbh
    Jan 20 at 9:34


















2












$begingroup$


I have been trying to solve the second half of the following problem but so far I have not succeeded so far:




Let $alpha_{1},ldots,alpha_{n}$ be $n$ elements in a vector space
$V$ over $mathbb{F}$. If they are linearly dependent and if any $n-1$
vectors among them are linearly dependent then there exists
$c_1,c_2,ldots,c_ninmathbb{F}$ , none of which is $0$, such that
$sum_{i=1}^{n}c_{i}alpha_{i}=0$. If $d_1,ldots,d_{n}inmathbb{F}$
satisfy the same requirements then there is a $kne 0inmathbb{F}$
such that $d_{i}=kc_{i}, 1le ile n$.




Here's my attempt:



If $alpha_{1},ldots,alpha_{n}$ are linearly dependent then there are $c_1,c_2,ldots,c_ninmathbb{F}$, not all zero, such that
$$sum_{i=1}^{n} c_{i}alpha_{i} =0$$
If some $c_j=0$ we can assume after rearranging the indices that $c_1=0$ thus
$$sum_{i=2}^{n} c_{i}alpha_{i} =0$$
Since any $n-1$ vectors are independent we must have $c_1=c_2=ldots c_{n}=0$.
Thus $alpha_{1},ldots,alpha_{n}$ are linearly independent which is a contradiction thus all of $c_i$'s are nonzero. This completes the first half of the proof.



Suppose that there are some $d_{1},ldots,d_{n} inmathbb{F}$ where none of which are zero such that
$$sum_{i=1}^{n}d_{i}alpha_{i}=0$$



Then we can write
$$sum_{i=1}^{n}d_{i}alpha_{i}=0=sum_{i=1}^{n}c_{i}alpha_{i}$$
that is
$sum_{i=1}^{n}(d_{i}-c_{i})alpha_{i}=0$.



I'm not sure what can follow from here; How do I bring out the existence of such a $k$? Hints would be appreciated.



UPDATE: Suppose that there are some $d_{1},ldots,d_{n} inmathbb{F}$ where none of which are zero such that
$$sum_{i=1}^{n}d_{i}alpha_{i}=0$$



Since $d_1 ne 0$ we can write
$$sum_{i=1}^{n}d_{i}d_{1}^{-1}alpha_{i}=0$$



And thus like previously,



$$sum_{i=1}^{n}(d_{i}d_{1}^{-1}-c_{i}c_{1}^{-1})alpha_{i}=0$$
i.e.
$$sum_{i=2}^{n}(d_{i}d_{1}^{-1}-c_{i}c_{1}^{-1})alpha_{i}=0$$
Since any $(n-1)$ vectors are independent, we have that $d_{i}=frac{d_1}{c_1} c_{i}$ for all $2le ile n$. This completes the second part.










share|cite|improve this question











$endgroup$












  • $begingroup$
    Indirect hint: you are given that $c_j, d_j$'s are all nonzero. Then could you do something to reduce the "degree of freedom"? Also note that we are working on a field.
    $endgroup$
    – xbh
    Jan 20 at 9:02












  • $begingroup$
    @xbh hey I am not sure if I follow you; can you break it down even more?
    $endgroup$
    – Ashish K
    Jan 20 at 9:13












  • $begingroup$
    Okay, my apologies. Directly, I claim that we could assume $c_1 = 1$, is it correct? If it is, then the unknown coefficients are only $c_2$ thru $c_n$, i.e. we reduce "# of free variables" from $n$ to $n-1$, then we might be easier to proceed.
    $endgroup$
    – xbh
    Jan 20 at 9:23










  • $begingroup$
    @xbh thanks for the hint! I completed the proof. Can you please check it?
    $endgroup$
    – Ashish K
    Jan 20 at 9:32






  • 1




    $begingroup$
    Yeah, that's pretty much of it. Well done!
    $endgroup$
    – xbh
    Jan 20 at 9:34
















2












2








2


1



$begingroup$


I have been trying to solve the second half of the following problem but so far I have not succeeded so far:




Let $alpha_{1},ldots,alpha_{n}$ be $n$ elements in a vector space
$V$ over $mathbb{F}$. If they are linearly dependent and if any $n-1$
vectors among them are linearly dependent then there exists
$c_1,c_2,ldots,c_ninmathbb{F}$ , none of which is $0$, such that
$sum_{i=1}^{n}c_{i}alpha_{i}=0$. If $d_1,ldots,d_{n}inmathbb{F}$
satisfy the same requirements then there is a $kne 0inmathbb{F}$
such that $d_{i}=kc_{i}, 1le ile n$.




Here's my attempt:



If $alpha_{1},ldots,alpha_{n}$ are linearly dependent then there are $c_1,c_2,ldots,c_ninmathbb{F}$, not all zero, such that
$$sum_{i=1}^{n} c_{i}alpha_{i} =0$$
If some $c_j=0$ we can assume after rearranging the indices that $c_1=0$ thus
$$sum_{i=2}^{n} c_{i}alpha_{i} =0$$
Since any $n-1$ vectors are independent we must have $c_1=c_2=ldots c_{n}=0$.
Thus $alpha_{1},ldots,alpha_{n}$ are linearly independent which is a contradiction thus all of $c_i$'s are nonzero. This completes the first half of the proof.



Suppose that there are some $d_{1},ldots,d_{n} inmathbb{F}$ where none of which are zero such that
$$sum_{i=1}^{n}d_{i}alpha_{i}=0$$



Then we can write
$$sum_{i=1}^{n}d_{i}alpha_{i}=0=sum_{i=1}^{n}c_{i}alpha_{i}$$
that is
$sum_{i=1}^{n}(d_{i}-c_{i})alpha_{i}=0$.



I'm not sure what can follow from here; How do I bring out the existence of such a $k$? Hints would be appreciated.



UPDATE: Suppose that there are some $d_{1},ldots,d_{n} inmathbb{F}$ where none of which are zero such that
$$sum_{i=1}^{n}d_{i}alpha_{i}=0$$



Since $d_1 ne 0$ we can write
$$sum_{i=1}^{n}d_{i}d_{1}^{-1}alpha_{i}=0$$



And thus like previously,



$$sum_{i=1}^{n}(d_{i}d_{1}^{-1}-c_{i}c_{1}^{-1})alpha_{i}=0$$
i.e.
$$sum_{i=2}^{n}(d_{i}d_{1}^{-1}-c_{i}c_{1}^{-1})alpha_{i}=0$$
Since any $(n-1)$ vectors are independent, we have that $d_{i}=frac{d_1}{c_1} c_{i}$ for all $2le ile n$. This completes the second part.










share|cite|improve this question











$endgroup$




I have been trying to solve the second half of the following problem but so far I have not succeeded so far:




Let $alpha_{1},ldots,alpha_{n}$ be $n$ elements in a vector space
$V$ over $mathbb{F}$. If they are linearly dependent and if any $n-1$
vectors among them are linearly dependent then there exists
$c_1,c_2,ldots,c_ninmathbb{F}$ , none of which is $0$, such that
$sum_{i=1}^{n}c_{i}alpha_{i}=0$. If $d_1,ldots,d_{n}inmathbb{F}$
satisfy the same requirements then there is a $kne 0inmathbb{F}$
such that $d_{i}=kc_{i}, 1le ile n$.




Here's my attempt:



If $alpha_{1},ldots,alpha_{n}$ are linearly dependent then there are $c_1,c_2,ldots,c_ninmathbb{F}$, not all zero, such that
$$sum_{i=1}^{n} c_{i}alpha_{i} =0$$
If some $c_j=0$ we can assume after rearranging the indices that $c_1=0$ thus
$$sum_{i=2}^{n} c_{i}alpha_{i} =0$$
Since any $n-1$ vectors are independent we must have $c_1=c_2=ldots c_{n}=0$.
Thus $alpha_{1},ldots,alpha_{n}$ are linearly independent which is a contradiction thus all of $c_i$'s are nonzero. This completes the first half of the proof.



Suppose that there are some $d_{1},ldots,d_{n} inmathbb{F}$ where none of which are zero such that
$$sum_{i=1}^{n}d_{i}alpha_{i}=0$$



Then we can write
$$sum_{i=1}^{n}d_{i}alpha_{i}=0=sum_{i=1}^{n}c_{i}alpha_{i}$$
that is
$sum_{i=1}^{n}(d_{i}-c_{i})alpha_{i}=0$.



I'm not sure what can follow from here; How do I bring out the existence of such a $k$? Hints would be appreciated.



UPDATE: Suppose that there are some $d_{1},ldots,d_{n} inmathbb{F}$ where none of which are zero such that
$$sum_{i=1}^{n}d_{i}alpha_{i}=0$$



Since $d_1 ne 0$ we can write
$$sum_{i=1}^{n}d_{i}d_{1}^{-1}alpha_{i}=0$$



And thus like previously,



$$sum_{i=1}^{n}(d_{i}d_{1}^{-1}-c_{i}c_{1}^{-1})alpha_{i}=0$$
i.e.
$$sum_{i=2}^{n}(d_{i}d_{1}^{-1}-c_{i}c_{1}^{-1})alpha_{i}=0$$
Since any $(n-1)$ vectors are independent, we have that $d_{i}=frac{d_1}{c_1} c_{i}$ for all $2le ile n$. This completes the second part.







linear-algebra vector-spaces






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Jan 20 at 9:39







Ashish K

















asked Jan 20 at 8:53









Ashish KAshish K

910613




910613












  • $begingroup$
    Indirect hint: you are given that $c_j, d_j$'s are all nonzero. Then could you do something to reduce the "degree of freedom"? Also note that we are working on a field.
    $endgroup$
    – xbh
    Jan 20 at 9:02












  • $begingroup$
    @xbh hey I am not sure if I follow you; can you break it down even more?
    $endgroup$
    – Ashish K
    Jan 20 at 9:13












  • $begingroup$
    Okay, my apologies. Directly, I claim that we could assume $c_1 = 1$, is it correct? If it is, then the unknown coefficients are only $c_2$ thru $c_n$, i.e. we reduce "# of free variables" from $n$ to $n-1$, then we might be easier to proceed.
    $endgroup$
    – xbh
    Jan 20 at 9:23










  • $begingroup$
    @xbh thanks for the hint! I completed the proof. Can you please check it?
    $endgroup$
    – Ashish K
    Jan 20 at 9:32






  • 1




    $begingroup$
    Yeah, that's pretty much of it. Well done!
    $endgroup$
    – xbh
    Jan 20 at 9:34




















  • $begingroup$
    Indirect hint: you are given that $c_j, d_j$'s are all nonzero. Then could you do something to reduce the "degree of freedom"? Also note that we are working on a field.
    $endgroup$
    – xbh
    Jan 20 at 9:02












  • $begingroup$
    @xbh hey I am not sure if I follow you; can you break it down even more?
    $endgroup$
    – Ashish K
    Jan 20 at 9:13












  • $begingroup$
    Okay, my apologies. Directly, I claim that we could assume $c_1 = 1$, is it correct? If it is, then the unknown coefficients are only $c_2$ thru $c_n$, i.e. we reduce "# of free variables" from $n$ to $n-1$, then we might be easier to proceed.
    $endgroup$
    – xbh
    Jan 20 at 9:23










  • $begingroup$
    @xbh thanks for the hint! I completed the proof. Can you please check it?
    $endgroup$
    – Ashish K
    Jan 20 at 9:32






  • 1




    $begingroup$
    Yeah, that's pretty much of it. Well done!
    $endgroup$
    – xbh
    Jan 20 at 9:34


















$begingroup$
Indirect hint: you are given that $c_j, d_j$'s are all nonzero. Then could you do something to reduce the "degree of freedom"? Also note that we are working on a field.
$endgroup$
– xbh
Jan 20 at 9:02






$begingroup$
Indirect hint: you are given that $c_j, d_j$'s are all nonzero. Then could you do something to reduce the "degree of freedom"? Also note that we are working on a field.
$endgroup$
– xbh
Jan 20 at 9:02














$begingroup$
@xbh hey I am not sure if I follow you; can you break it down even more?
$endgroup$
– Ashish K
Jan 20 at 9:13






$begingroup$
@xbh hey I am not sure if I follow you; can you break it down even more?
$endgroup$
– Ashish K
Jan 20 at 9:13














$begingroup$
Okay, my apologies. Directly, I claim that we could assume $c_1 = 1$, is it correct? If it is, then the unknown coefficients are only $c_2$ thru $c_n$, i.e. we reduce "# of free variables" from $n$ to $n-1$, then we might be easier to proceed.
$endgroup$
– xbh
Jan 20 at 9:23




$begingroup$
Okay, my apologies. Directly, I claim that we could assume $c_1 = 1$, is it correct? If it is, then the unknown coefficients are only $c_2$ thru $c_n$, i.e. we reduce "# of free variables" from $n$ to $n-1$, then we might be easier to proceed.
$endgroup$
– xbh
Jan 20 at 9:23












$begingroup$
@xbh thanks for the hint! I completed the proof. Can you please check it?
$endgroup$
– Ashish K
Jan 20 at 9:32




$begingroup$
@xbh thanks for the hint! I completed the proof. Can you please check it?
$endgroup$
– Ashish K
Jan 20 at 9:32




1




1




$begingroup$
Yeah, that's pretty much of it. Well done!
$endgroup$
– xbh
Jan 20 at 9:34






$begingroup$
Yeah, that's pretty much of it. Well done!
$endgroup$
– xbh
Jan 20 at 9:34












0






active

oldest

votes











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%2f3080333%2fa-question-on-linear-independence-and-dependence%23new-answer', 'question_page');
}
);

Post as a guest















Required, but never shown

























0






active

oldest

votes








0






active

oldest

votes









active

oldest

votes






active

oldest

votes
















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%2f3080333%2fa-question-on-linear-independence-and-dependence%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

Mario Kart Wii

The Binding of Isaac: Rebirth/Afterbirth

What does “Dominus providebit” mean?