Uniqueness of dimension in the infinite-dimensional case.
$begingroup$
Say $V$ is a vector space over some field.
Lemma Suppose $A,B,Csubset V$, $Acup B$ spans $V$ and $Bcup C$ is independent. For every $cin C$ there exists $ain A$ such that if $A'=Asetminus{a}$ and $B'=Bcup{c}$ then $A'cup B'$ spans $V$.
(Write $c$ as a linear combination of elements of $Acup B$ and note that some element of $A$ must appear with a non-zero coefficient, since $Bcup C$ is independent...)
Cor Suppose $A$ spans $V$ and $C$ is independent. If $A$ is finite then $|A|ge|C|$.
Proof: Let $A_0=A$, $B_0=emptyset$, $C_0=C$. Apply the lemma repeatedly, setting $A_{n+1}=A_n'$, $B_{n+1}=B_n'$, $C_{n+1}=C_n'=C_nsetminus {c}$. If $|A|<|C|$ then there exists $n$ so that $A_n=emptyset$ and $C_nneemptyset$; hence $B_n$ is a proper subset of the independent set $C$ and $B_n$ spans $V$, contradiction.
Question: Is there a way to get the Corollary from the Lemma if $A$ is infinite?
"My work so far:" The obvious transfinite recursion. The problem is if $alpha$ is a limit ordinal: I can't imagine what' $A_alpha$ and $B_alpha$ could be other than $bigcap_{beta<alpha}A_beta$ and $bigcup_{beta<alpha}B_beta$, but in that case I see no reason that $A_alphacup B_alpha$ should span $V$.
The reason I suspect I may just be missing something is that in Finite Dimensional Vector Spaces Halmos comments that he tends to give proofs that can be generalized to the infinite-dimensional case.
Edit: It seems likely the answer is no, since nobody's come up with a yes. This raises the question "ok, how do you prove the corollary for infinite $A$?" In fact there's a very simple proof of the corollary for infinite $A$ on Wikipedia; see the Answer below for a paraphrase.
For anyone missing the point:
Exercise. (i) Show that "maximal independent set" is equivalent to "minimal spanning set". (ii) Explain why nonetheless the first phrase always comes up in a proof that every vector space has a basis, never the second..
linear-algebra transfinite-induction
$endgroup$
|
show 2 more comments
$begingroup$
Say $V$ is a vector space over some field.
Lemma Suppose $A,B,Csubset V$, $Acup B$ spans $V$ and $Bcup C$ is independent. For every $cin C$ there exists $ain A$ such that if $A'=Asetminus{a}$ and $B'=Bcup{c}$ then $A'cup B'$ spans $V$.
(Write $c$ as a linear combination of elements of $Acup B$ and note that some element of $A$ must appear with a non-zero coefficient, since $Bcup C$ is independent...)
Cor Suppose $A$ spans $V$ and $C$ is independent. If $A$ is finite then $|A|ge|C|$.
Proof: Let $A_0=A$, $B_0=emptyset$, $C_0=C$. Apply the lemma repeatedly, setting $A_{n+1}=A_n'$, $B_{n+1}=B_n'$, $C_{n+1}=C_n'=C_nsetminus {c}$. If $|A|<|C|$ then there exists $n$ so that $A_n=emptyset$ and $C_nneemptyset$; hence $B_n$ is a proper subset of the independent set $C$ and $B_n$ spans $V$, contradiction.
Question: Is there a way to get the Corollary from the Lemma if $A$ is infinite?
"My work so far:" The obvious transfinite recursion. The problem is if $alpha$ is a limit ordinal: I can't imagine what' $A_alpha$ and $B_alpha$ could be other than $bigcap_{beta<alpha}A_beta$ and $bigcup_{beta<alpha}B_beta$, but in that case I see no reason that $A_alphacup B_alpha$ should span $V$.
The reason I suspect I may just be missing something is that in Finite Dimensional Vector Spaces Halmos comments that he tends to give proofs that can be generalized to the infinite-dimensional case.
Edit: It seems likely the answer is no, since nobody's come up with a yes. This raises the question "ok, how do you prove the corollary for infinite $A$?" In fact there's a very simple proof of the corollary for infinite $A$ on Wikipedia; see the Answer below for a paraphrase.
For anyone missing the point:
Exercise. (i) Show that "maximal independent set" is equivalent to "minimal spanning set". (ii) Explain why nonetheless the first phrase always comes up in a proof that every vector space has a basis, never the second..
linear-algebra transfinite-induction
$endgroup$
$begingroup$
I believe you want to do this with Zorn's lemma, instead of transfinite induction. If you want clarification I can write a complete answer.
$endgroup$
– SmileyCraft
Dec 14 '18 at 15:15
$begingroup$
@SmileyCraft Please do write that complete answer! The problem with Zorn's lemma is the same, as far as I can see: The intersection of a (decreasing) chain of spanning sets need not be a spanning set. (Hence part (ii) of the exercise...)
$endgroup$
– David C. Ullrich
Dec 14 '18 at 15:21
$begingroup$
I'll admit that I underestimated the difficulty here. Do you know an example of a decreasing chain of spanning sets of which the intersection is not a spanning set?
$endgroup$
– SmileyCraft
Dec 14 '18 at 15:43
$begingroup$
Nevermind, I found one myself: $A_n:={1/k:k>n}subsetmathbb{R}$.
$endgroup$
– SmileyCraft
Dec 14 '18 at 15:46
$begingroup$
I think that the question exactly as it is stated would be a definite "no". You an't get the infinite-dimensional case from the lemma. That lemma will not get you past a limit ordinal as you've noticed. Of course, that doesn't mean there aren't other ways to handle it.
$endgroup$
– Paul Sinclair
Dec 14 '18 at 23:42
|
show 2 more comments
$begingroup$
Say $V$ is a vector space over some field.
Lemma Suppose $A,B,Csubset V$, $Acup B$ spans $V$ and $Bcup C$ is independent. For every $cin C$ there exists $ain A$ such that if $A'=Asetminus{a}$ and $B'=Bcup{c}$ then $A'cup B'$ spans $V$.
(Write $c$ as a linear combination of elements of $Acup B$ and note that some element of $A$ must appear with a non-zero coefficient, since $Bcup C$ is independent...)
Cor Suppose $A$ spans $V$ and $C$ is independent. If $A$ is finite then $|A|ge|C|$.
Proof: Let $A_0=A$, $B_0=emptyset$, $C_0=C$. Apply the lemma repeatedly, setting $A_{n+1}=A_n'$, $B_{n+1}=B_n'$, $C_{n+1}=C_n'=C_nsetminus {c}$. If $|A|<|C|$ then there exists $n$ so that $A_n=emptyset$ and $C_nneemptyset$; hence $B_n$ is a proper subset of the independent set $C$ and $B_n$ spans $V$, contradiction.
Question: Is there a way to get the Corollary from the Lemma if $A$ is infinite?
"My work so far:" The obvious transfinite recursion. The problem is if $alpha$ is a limit ordinal: I can't imagine what' $A_alpha$ and $B_alpha$ could be other than $bigcap_{beta<alpha}A_beta$ and $bigcup_{beta<alpha}B_beta$, but in that case I see no reason that $A_alphacup B_alpha$ should span $V$.
The reason I suspect I may just be missing something is that in Finite Dimensional Vector Spaces Halmos comments that he tends to give proofs that can be generalized to the infinite-dimensional case.
Edit: It seems likely the answer is no, since nobody's come up with a yes. This raises the question "ok, how do you prove the corollary for infinite $A$?" In fact there's a very simple proof of the corollary for infinite $A$ on Wikipedia; see the Answer below for a paraphrase.
For anyone missing the point:
Exercise. (i) Show that "maximal independent set" is equivalent to "minimal spanning set". (ii) Explain why nonetheless the first phrase always comes up in a proof that every vector space has a basis, never the second..
linear-algebra transfinite-induction
$endgroup$
Say $V$ is a vector space over some field.
Lemma Suppose $A,B,Csubset V$, $Acup B$ spans $V$ and $Bcup C$ is independent. For every $cin C$ there exists $ain A$ such that if $A'=Asetminus{a}$ and $B'=Bcup{c}$ then $A'cup B'$ spans $V$.
(Write $c$ as a linear combination of elements of $Acup B$ and note that some element of $A$ must appear with a non-zero coefficient, since $Bcup C$ is independent...)
Cor Suppose $A$ spans $V$ and $C$ is independent. If $A$ is finite then $|A|ge|C|$.
Proof: Let $A_0=A$, $B_0=emptyset$, $C_0=C$. Apply the lemma repeatedly, setting $A_{n+1}=A_n'$, $B_{n+1}=B_n'$, $C_{n+1}=C_n'=C_nsetminus {c}$. If $|A|<|C|$ then there exists $n$ so that $A_n=emptyset$ and $C_nneemptyset$; hence $B_n$ is a proper subset of the independent set $C$ and $B_n$ spans $V$, contradiction.
Question: Is there a way to get the Corollary from the Lemma if $A$ is infinite?
"My work so far:" The obvious transfinite recursion. The problem is if $alpha$ is a limit ordinal: I can't imagine what' $A_alpha$ and $B_alpha$ could be other than $bigcap_{beta<alpha}A_beta$ and $bigcup_{beta<alpha}B_beta$, but in that case I see no reason that $A_alphacup B_alpha$ should span $V$.
The reason I suspect I may just be missing something is that in Finite Dimensional Vector Spaces Halmos comments that he tends to give proofs that can be generalized to the infinite-dimensional case.
Edit: It seems likely the answer is no, since nobody's come up with a yes. This raises the question "ok, how do you prove the corollary for infinite $A$?" In fact there's a very simple proof of the corollary for infinite $A$ on Wikipedia; see the Answer below for a paraphrase.
For anyone missing the point:
Exercise. (i) Show that "maximal independent set" is equivalent to "minimal spanning set". (ii) Explain why nonetheless the first phrase always comes up in a proof that every vector space has a basis, never the second..
linear-algebra transfinite-induction
linear-algebra transfinite-induction
edited Dec 15 '18 at 14:59
David C. Ullrich
asked Dec 14 '18 at 15:07
David C. UllrichDavid C. Ullrich
61.2k43994
61.2k43994
$begingroup$
I believe you want to do this with Zorn's lemma, instead of transfinite induction. If you want clarification I can write a complete answer.
$endgroup$
– SmileyCraft
Dec 14 '18 at 15:15
$begingroup$
@SmileyCraft Please do write that complete answer! The problem with Zorn's lemma is the same, as far as I can see: The intersection of a (decreasing) chain of spanning sets need not be a spanning set. (Hence part (ii) of the exercise...)
$endgroup$
– David C. Ullrich
Dec 14 '18 at 15:21
$begingroup$
I'll admit that I underestimated the difficulty here. Do you know an example of a decreasing chain of spanning sets of which the intersection is not a spanning set?
$endgroup$
– SmileyCraft
Dec 14 '18 at 15:43
$begingroup$
Nevermind, I found one myself: $A_n:={1/k:k>n}subsetmathbb{R}$.
$endgroup$
– SmileyCraft
Dec 14 '18 at 15:46
$begingroup$
I think that the question exactly as it is stated would be a definite "no". You an't get the infinite-dimensional case from the lemma. That lemma will not get you past a limit ordinal as you've noticed. Of course, that doesn't mean there aren't other ways to handle it.
$endgroup$
– Paul Sinclair
Dec 14 '18 at 23:42
|
show 2 more comments
$begingroup$
I believe you want to do this with Zorn's lemma, instead of transfinite induction. If you want clarification I can write a complete answer.
$endgroup$
– SmileyCraft
Dec 14 '18 at 15:15
$begingroup$
@SmileyCraft Please do write that complete answer! The problem with Zorn's lemma is the same, as far as I can see: The intersection of a (decreasing) chain of spanning sets need not be a spanning set. (Hence part (ii) of the exercise...)
$endgroup$
– David C. Ullrich
Dec 14 '18 at 15:21
$begingroup$
I'll admit that I underestimated the difficulty here. Do you know an example of a decreasing chain of spanning sets of which the intersection is not a spanning set?
$endgroup$
– SmileyCraft
Dec 14 '18 at 15:43
$begingroup$
Nevermind, I found one myself: $A_n:={1/k:k>n}subsetmathbb{R}$.
$endgroup$
– SmileyCraft
Dec 14 '18 at 15:46
$begingroup$
I think that the question exactly as it is stated would be a definite "no". You an't get the infinite-dimensional case from the lemma. That lemma will not get you past a limit ordinal as you've noticed. Of course, that doesn't mean there aren't other ways to handle it.
$endgroup$
– Paul Sinclair
Dec 14 '18 at 23:42
$begingroup$
I believe you want to do this with Zorn's lemma, instead of transfinite induction. If you want clarification I can write a complete answer.
$endgroup$
– SmileyCraft
Dec 14 '18 at 15:15
$begingroup$
I believe you want to do this with Zorn's lemma, instead of transfinite induction. If you want clarification I can write a complete answer.
$endgroup$
– SmileyCraft
Dec 14 '18 at 15:15
$begingroup$
@SmileyCraft Please do write that complete answer! The problem with Zorn's lemma is the same, as far as I can see: The intersection of a (decreasing) chain of spanning sets need not be a spanning set. (Hence part (ii) of the exercise...)
$endgroup$
– David C. Ullrich
Dec 14 '18 at 15:21
$begingroup$
@SmileyCraft Please do write that complete answer! The problem with Zorn's lemma is the same, as far as I can see: The intersection of a (decreasing) chain of spanning sets need not be a spanning set. (Hence part (ii) of the exercise...)
$endgroup$
– David C. Ullrich
Dec 14 '18 at 15:21
$begingroup$
I'll admit that I underestimated the difficulty here. Do you know an example of a decreasing chain of spanning sets of which the intersection is not a spanning set?
$endgroup$
– SmileyCraft
Dec 14 '18 at 15:43
$begingroup$
I'll admit that I underestimated the difficulty here. Do you know an example of a decreasing chain of spanning sets of which the intersection is not a spanning set?
$endgroup$
– SmileyCraft
Dec 14 '18 at 15:43
$begingroup$
Nevermind, I found one myself: $A_n:={1/k:k>n}subsetmathbb{R}$.
$endgroup$
– SmileyCraft
Dec 14 '18 at 15:46
$begingroup$
Nevermind, I found one myself: $A_n:={1/k:k>n}subsetmathbb{R}$.
$endgroup$
– SmileyCraft
Dec 14 '18 at 15:46
$begingroup$
I think that the question exactly as it is stated would be a definite "no". You an't get the infinite-dimensional case from the lemma. That lemma will not get you past a limit ordinal as you've noticed. Of course, that doesn't mean there aren't other ways to handle it.
$endgroup$
– Paul Sinclair
Dec 14 '18 at 23:42
$begingroup$
I think that the question exactly as it is stated would be a definite "no". You an't get the infinite-dimensional case from the lemma. That lemma will not get you past a limit ordinal as you've noticed. Of course, that doesn't mean there aren't other ways to handle it.
$endgroup$
– Paul Sinclair
Dec 14 '18 at 23:42
|
show 2 more comments
1 Answer
1
active
oldest
votes
$begingroup$
It seems likely the answer is no, since nobody's come up with a yes. This raises the question "ok, how do you prove the corollary for infinite $A$?" In fact there's a very simple proof of the corollary for infinite $A$ on Wikipedia;. Here's the same proof, in a version that seems somewhat cleaner to me:
Suppose $A$ is infinite. Since any independent set is contained in a maximal independent set, wlog $C$ is actually a basis. For $cin C$ let $pi_c$ be the corresponding coordinate functional, so that $$x=sum_{cin C}pi_c(x)c$$for every $xin V$.
Let $S(x)$ be the support of $xin V$: $$S(x)={cin C:pi_c(x)ne0}.$$Since $A$ spans $V$ it's clear that $$S(x)subset S(A):=bigcup_{ain A}S(a)$$for every $xin V$. We certainly have $$S(c)={c}quad(cin C),$$ so $$Csubset S(A).$$And since $A$ is infinite and each $S(a)$ is finite it follows that $$|S(A)|le|A|.$$
I feel so silly not having come up with that on my own.
$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%2f3039470%2funiqueness-of-dimension-in-the-infinite-dimensional-case%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$
It seems likely the answer is no, since nobody's come up with a yes. This raises the question "ok, how do you prove the corollary for infinite $A$?" In fact there's a very simple proof of the corollary for infinite $A$ on Wikipedia;. Here's the same proof, in a version that seems somewhat cleaner to me:
Suppose $A$ is infinite. Since any independent set is contained in a maximal independent set, wlog $C$ is actually a basis. For $cin C$ let $pi_c$ be the corresponding coordinate functional, so that $$x=sum_{cin C}pi_c(x)c$$for every $xin V$.
Let $S(x)$ be the support of $xin V$: $$S(x)={cin C:pi_c(x)ne0}.$$Since $A$ spans $V$ it's clear that $$S(x)subset S(A):=bigcup_{ain A}S(a)$$for every $xin V$. We certainly have $$S(c)={c}quad(cin C),$$ so $$Csubset S(A).$$And since $A$ is infinite and each $S(a)$ is finite it follows that $$|S(A)|le|A|.$$
I feel so silly not having come up with that on my own.
$endgroup$
add a comment |
$begingroup$
It seems likely the answer is no, since nobody's come up with a yes. This raises the question "ok, how do you prove the corollary for infinite $A$?" In fact there's a very simple proof of the corollary for infinite $A$ on Wikipedia;. Here's the same proof, in a version that seems somewhat cleaner to me:
Suppose $A$ is infinite. Since any independent set is contained in a maximal independent set, wlog $C$ is actually a basis. For $cin C$ let $pi_c$ be the corresponding coordinate functional, so that $$x=sum_{cin C}pi_c(x)c$$for every $xin V$.
Let $S(x)$ be the support of $xin V$: $$S(x)={cin C:pi_c(x)ne0}.$$Since $A$ spans $V$ it's clear that $$S(x)subset S(A):=bigcup_{ain A}S(a)$$for every $xin V$. We certainly have $$S(c)={c}quad(cin C),$$ so $$Csubset S(A).$$And since $A$ is infinite and each $S(a)$ is finite it follows that $$|S(A)|le|A|.$$
I feel so silly not having come up with that on my own.
$endgroup$
add a comment |
$begingroup$
It seems likely the answer is no, since nobody's come up with a yes. This raises the question "ok, how do you prove the corollary for infinite $A$?" In fact there's a very simple proof of the corollary for infinite $A$ on Wikipedia;. Here's the same proof, in a version that seems somewhat cleaner to me:
Suppose $A$ is infinite. Since any independent set is contained in a maximal independent set, wlog $C$ is actually a basis. For $cin C$ let $pi_c$ be the corresponding coordinate functional, so that $$x=sum_{cin C}pi_c(x)c$$for every $xin V$.
Let $S(x)$ be the support of $xin V$: $$S(x)={cin C:pi_c(x)ne0}.$$Since $A$ spans $V$ it's clear that $$S(x)subset S(A):=bigcup_{ain A}S(a)$$for every $xin V$. We certainly have $$S(c)={c}quad(cin C),$$ so $$Csubset S(A).$$And since $A$ is infinite and each $S(a)$ is finite it follows that $$|S(A)|le|A|.$$
I feel so silly not having come up with that on my own.
$endgroup$
It seems likely the answer is no, since nobody's come up with a yes. This raises the question "ok, how do you prove the corollary for infinite $A$?" In fact there's a very simple proof of the corollary for infinite $A$ on Wikipedia;. Here's the same proof, in a version that seems somewhat cleaner to me:
Suppose $A$ is infinite. Since any independent set is contained in a maximal independent set, wlog $C$ is actually a basis. For $cin C$ let $pi_c$ be the corresponding coordinate functional, so that $$x=sum_{cin C}pi_c(x)c$$for every $xin V$.
Let $S(x)$ be the support of $xin V$: $$S(x)={cin C:pi_c(x)ne0}.$$Since $A$ spans $V$ it's clear that $$S(x)subset S(A):=bigcup_{ain A}S(a)$$for every $xin V$. We certainly have $$S(c)={c}quad(cin C),$$ so $$Csubset S(A).$$And since $A$ is infinite and each $S(a)$ is finite it follows that $$|S(A)|le|A|.$$
I feel so silly not having come up with that on my own.
answered Dec 15 '18 at 14:57
David C. UllrichDavid C. Ullrich
61.2k43994
61.2k43994
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%2f3039470%2funiqueness-of-dimension-in-the-infinite-dimensional-case%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$
I believe you want to do this with Zorn's lemma, instead of transfinite induction. If you want clarification I can write a complete answer.
$endgroup$
– SmileyCraft
Dec 14 '18 at 15:15
$begingroup$
@SmileyCraft Please do write that complete answer! The problem with Zorn's lemma is the same, as far as I can see: The intersection of a (decreasing) chain of spanning sets need not be a spanning set. (Hence part (ii) of the exercise...)
$endgroup$
– David C. Ullrich
Dec 14 '18 at 15:21
$begingroup$
I'll admit that I underestimated the difficulty here. Do you know an example of a decreasing chain of spanning sets of which the intersection is not a spanning set?
$endgroup$
– SmileyCraft
Dec 14 '18 at 15:43
$begingroup$
Nevermind, I found one myself: $A_n:={1/k:k>n}subsetmathbb{R}$.
$endgroup$
– SmileyCraft
Dec 14 '18 at 15:46
$begingroup$
I think that the question exactly as it is stated would be a definite "no". You an't get the infinite-dimensional case from the lemma. That lemma will not get you past a limit ordinal as you've noticed. Of course, that doesn't mean there aren't other ways to handle it.
$endgroup$
– Paul Sinclair
Dec 14 '18 at 23:42