Finding a basis of an infinite dimensional vector space with a given vector
$begingroup$
If $K$ is a field and $V=K^n$ a finite dimensional $K$-vector space with basis $A={e_1,dots,e_n}$, then, given a vector $vin V$ we can find a new basis $E$ of $V$ such that $vin E$; this is done as follows:
First we form the set ${v}cup A$ and observe that it has $n+1$ elements, therefore it spans all of $V$. Now we start the following process: We set $E_0={v}$. If $e_1notintext{span}(E_0)$, then we set $E_1={v}cup{e_1}$. Otherwise, $E_1=E_0$. Then, if $e_2notintext{span}(E_1)$, we set $E_2=E_1cup{e_2}$; otherwise, $E_2=E_1$. We go on until we eliminate every element of $A$; the set $E_n$ is our basis $E$; obviously it is linearly independent and note that it is impossible to "rule out" two elements of $A$, since if $e,e'$ were ruled out, that would mean that there are not-all-zero scalars $lambda_i,mu_i$ such that $e=v+sumlambda_ie_i$, $e'=v+summu_ie_i$, then $e=e'+sum(lambda_i-mu_i)e_i$, which is impossible, therefore $E$ has $n$ elements.
My question is, can we do the same for infinite dimensional vector spaces? That is, given a vector $v$ on an infinite dimensional $K$-vector space $V$, can we construct (feels like it is too much to ask)/ can we prove the existence of a basis $E$ such that $vin E$?
P.S: I live in a world where the axiom of choice is true, so $V$ does have a basis.
linear-algebra set-theory axiom-of-choice
$endgroup$
add a comment |
$begingroup$
If $K$ is a field and $V=K^n$ a finite dimensional $K$-vector space with basis $A={e_1,dots,e_n}$, then, given a vector $vin V$ we can find a new basis $E$ of $V$ such that $vin E$; this is done as follows:
First we form the set ${v}cup A$ and observe that it has $n+1$ elements, therefore it spans all of $V$. Now we start the following process: We set $E_0={v}$. If $e_1notintext{span}(E_0)$, then we set $E_1={v}cup{e_1}$. Otherwise, $E_1=E_0$. Then, if $e_2notintext{span}(E_1)$, we set $E_2=E_1cup{e_2}$; otherwise, $E_2=E_1$. We go on until we eliminate every element of $A$; the set $E_n$ is our basis $E$; obviously it is linearly independent and note that it is impossible to "rule out" two elements of $A$, since if $e,e'$ were ruled out, that would mean that there are not-all-zero scalars $lambda_i,mu_i$ such that $e=v+sumlambda_ie_i$, $e'=v+summu_ie_i$, then $e=e'+sum(lambda_i-mu_i)e_i$, which is impossible, therefore $E$ has $n$ elements.
My question is, can we do the same for infinite dimensional vector spaces? That is, given a vector $v$ on an infinite dimensional $K$-vector space $V$, can we construct (feels like it is too much to ask)/ can we prove the existence of a basis $E$ such that $vin E$?
P.S: I live in a world where the axiom of choice is true, so $V$ does have a basis.
linear-algebra set-theory axiom-of-choice
$endgroup$
add a comment |
$begingroup$
If $K$ is a field and $V=K^n$ a finite dimensional $K$-vector space with basis $A={e_1,dots,e_n}$, then, given a vector $vin V$ we can find a new basis $E$ of $V$ such that $vin E$; this is done as follows:
First we form the set ${v}cup A$ and observe that it has $n+1$ elements, therefore it spans all of $V$. Now we start the following process: We set $E_0={v}$. If $e_1notintext{span}(E_0)$, then we set $E_1={v}cup{e_1}$. Otherwise, $E_1=E_0$. Then, if $e_2notintext{span}(E_1)$, we set $E_2=E_1cup{e_2}$; otherwise, $E_2=E_1$. We go on until we eliminate every element of $A$; the set $E_n$ is our basis $E$; obviously it is linearly independent and note that it is impossible to "rule out" two elements of $A$, since if $e,e'$ were ruled out, that would mean that there are not-all-zero scalars $lambda_i,mu_i$ such that $e=v+sumlambda_ie_i$, $e'=v+summu_ie_i$, then $e=e'+sum(lambda_i-mu_i)e_i$, which is impossible, therefore $E$ has $n$ elements.
My question is, can we do the same for infinite dimensional vector spaces? That is, given a vector $v$ on an infinite dimensional $K$-vector space $V$, can we construct (feels like it is too much to ask)/ can we prove the existence of a basis $E$ such that $vin E$?
P.S: I live in a world where the axiom of choice is true, so $V$ does have a basis.
linear-algebra set-theory axiom-of-choice
$endgroup$
If $K$ is a field and $V=K^n$ a finite dimensional $K$-vector space with basis $A={e_1,dots,e_n}$, then, given a vector $vin V$ we can find a new basis $E$ of $V$ such that $vin E$; this is done as follows:
First we form the set ${v}cup A$ and observe that it has $n+1$ elements, therefore it spans all of $V$. Now we start the following process: We set $E_0={v}$. If $e_1notintext{span}(E_0)$, then we set $E_1={v}cup{e_1}$. Otherwise, $E_1=E_0$. Then, if $e_2notintext{span}(E_1)$, we set $E_2=E_1cup{e_2}$; otherwise, $E_2=E_1$. We go on until we eliminate every element of $A$; the set $E_n$ is our basis $E$; obviously it is linearly independent and note that it is impossible to "rule out" two elements of $A$, since if $e,e'$ were ruled out, that would mean that there are not-all-zero scalars $lambda_i,mu_i$ such that $e=v+sumlambda_ie_i$, $e'=v+summu_ie_i$, then $e=e'+sum(lambda_i-mu_i)e_i$, which is impossible, therefore $E$ has $n$ elements.
My question is, can we do the same for infinite dimensional vector spaces? That is, given a vector $v$ on an infinite dimensional $K$-vector space $V$, can we construct (feels like it is too much to ask)/ can we prove the existence of a basis $E$ such that $vin E$?
P.S: I live in a world where the axiom of choice is true, so $V$ does have a basis.
linear-algebra set-theory axiom-of-choice
linear-algebra set-theory axiom-of-choice
edited 2 hours ago
Robert Shore
1,32815
1,32815
asked 2 hours ago
JustDroppedInJustDroppedIn
2,054420
2,054420
add a comment |
add a comment |
2 Answers
2
active
oldest
votes
$begingroup$
Yes (as long as $v neq 0$). You prove that a basis exists via Zorn's Lemma, proving that a maximal element (which must exist by Zorn's Lemma) in the collection of linearly independent subsets of $V$ (partially ordered by inclusion) is a basis. This proof shows that any linearly independent set can be extended to a basis -- just take a maximal element that extends the linearly independent set. But the proof necessarily uses the Axiom of Choice so it won't be constructive.
$endgroup$
add a comment |
$begingroup$
Let $A$ be a basis of $V$ (using AC) and $v in V$. Then $v$ is a finite linear combination of elements of $A$. wlog assume that combination is
$$
v = a + k_2a_2 + cdots + k_na_n .
$$
Then $B = A/{a} cup {v}$ is a basis: it spans, and any finite subset is linearly independent.
$endgroup$
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%2f3119673%2ffinding-a-basis-of-an-infinite-dimensional-vector-space-with-a-given-vector%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$
Yes (as long as $v neq 0$). You prove that a basis exists via Zorn's Lemma, proving that a maximal element (which must exist by Zorn's Lemma) in the collection of linearly independent subsets of $V$ (partially ordered by inclusion) is a basis. This proof shows that any linearly independent set can be extended to a basis -- just take a maximal element that extends the linearly independent set. But the proof necessarily uses the Axiom of Choice so it won't be constructive.
$endgroup$
add a comment |
$begingroup$
Yes (as long as $v neq 0$). You prove that a basis exists via Zorn's Lemma, proving that a maximal element (which must exist by Zorn's Lemma) in the collection of linearly independent subsets of $V$ (partially ordered by inclusion) is a basis. This proof shows that any linearly independent set can be extended to a basis -- just take a maximal element that extends the linearly independent set. But the proof necessarily uses the Axiom of Choice so it won't be constructive.
$endgroup$
add a comment |
$begingroup$
Yes (as long as $v neq 0$). You prove that a basis exists via Zorn's Lemma, proving that a maximal element (which must exist by Zorn's Lemma) in the collection of linearly independent subsets of $V$ (partially ordered by inclusion) is a basis. This proof shows that any linearly independent set can be extended to a basis -- just take a maximal element that extends the linearly independent set. But the proof necessarily uses the Axiom of Choice so it won't be constructive.
$endgroup$
Yes (as long as $v neq 0$). You prove that a basis exists via Zorn's Lemma, proving that a maximal element (which must exist by Zorn's Lemma) in the collection of linearly independent subsets of $V$ (partially ordered by inclusion) is a basis. This proof shows that any linearly independent set can be extended to a basis -- just take a maximal element that extends the linearly independent set. But the proof necessarily uses the Axiom of Choice so it won't be constructive.
edited 1 hour ago
answered 2 hours ago
Robert ShoreRobert Shore
1,32815
1,32815
add a comment |
add a comment |
$begingroup$
Let $A$ be a basis of $V$ (using AC) and $v in V$. Then $v$ is a finite linear combination of elements of $A$. wlog assume that combination is
$$
v = a + k_2a_2 + cdots + k_na_n .
$$
Then $B = A/{a} cup {v}$ is a basis: it spans, and any finite subset is linearly independent.
$endgroup$
add a comment |
$begingroup$
Let $A$ be a basis of $V$ (using AC) and $v in V$. Then $v$ is a finite linear combination of elements of $A$. wlog assume that combination is
$$
v = a + k_2a_2 + cdots + k_na_n .
$$
Then $B = A/{a} cup {v}$ is a basis: it spans, and any finite subset is linearly independent.
$endgroup$
add a comment |
$begingroup$
Let $A$ be a basis of $V$ (using AC) and $v in V$. Then $v$ is a finite linear combination of elements of $A$. wlog assume that combination is
$$
v = a + k_2a_2 + cdots + k_na_n .
$$
Then $B = A/{a} cup {v}$ is a basis: it spans, and any finite subset is linearly independent.
$endgroup$
Let $A$ be a basis of $V$ (using AC) and $v in V$. Then $v$ is a finite linear combination of elements of $A$. wlog assume that combination is
$$
v = a + k_2a_2 + cdots + k_na_n .
$$
Then $B = A/{a} cup {v}$ is a basis: it spans, and any finite subset is linearly independent.
answered 2 hours ago
Ethan BolkerEthan Bolker
43.5k551116
43.5k551116
add a comment |
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%2f3119673%2ffinding-a-basis-of-an-infinite-dimensional-vector-space-with-a-given-vector%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