How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
The standard unit families are linearly independent in but do not span it: the constant family is not a finite linear combination of them
Statement refuted
False claim: if is an infinite-dimensional vector space over a field (Finite-dimensional vector space, and its dimension ; infinite-dimensional means having no finite basis) and is a linearly independent subset that is not finite, then .
Take any field, the function space of all families with the pointwise operations (The vector space of all functions with pointwise operations, and as the case ), and the standard unit families, where and for . Then is linearly independent and not finite, is infinite-dimensional, and yet , the linear subspace of eventually zero families, which is not all of : the constant family with for every lies outside it.
So is an infinite linearly independent set that is not a basis of (Basis of a vector space: a linearly independent spanning subset; and ordered basis: an injective finite list whose image is a basis), although it is a basis of .
Facts & Assumptions
Given: A field , the vector space , the set of eventually zero families, the families , and as above.
is a linear subspace of ; and ; is linearly independent; and (The standard unit families form a basis of the linear subspace of eventually zero families: an explicit infinite basis, built with no choice principle, claims 1, 2 and 3).
is a vector space over with pointwise operations, and two of its elements are equal exactly when they agree at every point (The vector space of all functions with pointwise operations, and as the case , Vector space over a field, Linear subspace of a vector space).
for every (The pigeonhole principle on , claim 4); a set is finite when it is equinumerous with some natural number; is symmetric and transitive (Finite, countably infinite, countable, uncountable, Equinumerous sets, and ).
If a vector space has a spanning set with elements then no linearly independent subset of it is equinumerous with ; a basis is a spanning set (If has a spanning set with elements, then every linearly independent subset of is finite with at most elements; in particular has no linearly independent subset equinumerous with , claim 2, Basis of a vector space: a linearly independent spanning subset; and ordered basis: an injective finite list whose image is a basis, Linear independence: a finite list is independent when forces every , and a subset is independent when every injective finite list into is independent, Linear combination of a finite list, and the span as the smallest linear subspace containing , is exactly the set of linear combinations of finite lists of elements of , and ).
in a field, and the order of is reflexive (Field, Order on the natural numbers, On the order is membership: , The natural numbers (von Neumann)).
Counterexample
is linearly independent, , and .
is not finite: if for some then, since , symmetry and transitivity of would give , which is impossible.
The constant family with for every lies in and not in : for any candidate witness we have and , so no witnesses that is eventually zero.
is infinite-dimensional. If it had a finite basis, that basis would be a spanning set with elements for some , and then no linearly independent subset of would be equinumerous with ; but is such a subset.
So is a linearly independent subset of the infinite-dimensional space , it is not finite, and , since lies in the second and not the first. The false claim therefore fails, and is not a basis of , its span not being the whole space.
Remarks
-
What is true instead. extends to a basis of by Zorn's lemma gives a basis between any linearly independent set and any spanning set containing it: if with independent and , there is a basis of with , applied with and . That is not in tension with anything above: the extension adds vectors outside , and it is produced by Zorn's lemma rather than exhibited.
-
Where the finite-dimensional intuition breaks. In a space of dimension , an independent set with elements does span, because If has a spanning set with elements, then every linearly independent subset of is finite with at most elements; in particular has no linearly independent subset equinumerous with forbids enlarging it and For the following are equivalent: is a basis; is a maximal linearly independent subset of ; is a minimal spanning subset of — maximality and minimality being in the inclusion order then makes it a basis. Infinitude is not a substitute for maximality: is infinite and still extendable.
-
The whole content of the failure is that a linear combination is finite. Every element of is built from finitely many of the ( is exactly the set of linear combinations of finite lists of elements of , and ), hence vanishes from some index on, while vanishes nowhere.
Depends on
- The standard unit families $e_k \in F^{\mathbb{N}}$ form a basis of the linear subspace of eventually zero families: an explicit infinite basis, built with no choice principle
- Linear independence: a finite list $v : n \to V$ is independent when $\sum_{i<n} \lambda_i v_i = 0_V$ forces every $\lambda_i = 0_F$, and a subset $S \subseteq V$ is independent when every injective finite list into $S$ is independent
- Basis of a vector space: a linearly independent spanning subset; and ordered basis: an injective finite list whose image is a basis
- Finite-dimensional vector space, and its dimension $\dim_F V$; infinite-dimensional means having no finite basis
- If $V$ has a spanning set with $n$ elements, then every linearly independent subset of $V$ is finite with at most $n$ elements; in particular $V$ has no linearly independent subset equinumerous with $\mathbb{N}$
- Zorn's lemma gives a basis between any linearly independent set and any spanning set containing it: if $L \subseteq S \subseteq V$ with $L$ independent and $\operatorname{span}(S) = V$, there is a basis $B$ of $V$ with $L \subseteq B \subseteq S$
- Linear combination of a finite list, and the span $\operatorname{span}(S)$ as the smallest linear subspace containing $S$
- $\operatorname{span}(S)$ is exactly the set of linear combinations of finite lists of elements of $S$, and $\operatorname{span}(\varnothing) = \{0_V\}$
- The vector space $F^{X}$ of all functions $X \to F$ with pointwise operations, and $F^{n}$ as the case $X = n = \{0, 1, \dots, n-1\}$
- Linear subspace of a vector space
- Vector space over a field
- Field
- Finite, countably infinite, countable, uncountable
- Equinumerous sets, $A \approx B$ and $A \preceq B$
- The pigeonhole principle on $\mathbb{N}$
- The natural numbers $\mathbb{N}$ (von Neumann)
- Order on the natural numbers
- On $\mathbb{N}$ the order is membership: $m < n \iff m \in n$
Used by
Nothing in the library uses this result yet.
Dependency tree · next 3 levels
Direct dependencies and their dependencies through the next three levels: 92 results over 27 levels. An arrow runs from a result to what uses it, and this result sits at the bottom with a heavier outline. Click the chart to enlarge it.
Sources
- Sequence space (Wikipedia) (standard reference, not scraped)
- Linear independence (Wikipedia) (standard reference, not scraped)
- Cambridge University Press excerpt: Vector spaces and bases (standard reference, not scraped)