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.
Inside the space of eventually zero families, the linear subspace spanned by is proper and has a basis equinumerous with a basis of the whole space, so "equal dimension forces equality" fails without finite dimension
Statement refuted
False claim: if is a linear subspace of a vector space over and some basis of is equinumerous with some basis of , then .
Let be any field, let be the linear subspace of eventually zero families and let be the standard unit families (The standard unit families form a basis of the linear subspace of eventually zero families: an explicit infinite basis, built with no choice principle). Put
Then
- is a linear subspace of and is a basis of , while is a basis of ;
- (Equinumerous sets, and ), both being equinumerous with ;
- : the family lies in and not in .
So a proper linear subspace can carry a basis equinumerous with a basis of the whole space, and the equality clause of If and is a linear subspace of , then is finite-dimensional, , and if and only if — which is stated only for a finite-dimensional ambient space — really does need its hypothesis.
No dimension is assigned to either space. and are both infinite-dimensional (Finite-dimensional vector space, and its dimension ; infinite-dimensional means having no finite basis assigns no number to such a space): for this is claim 4 of The standard unit families form a basis of the linear subspace of eventually zero families: an explicit infinite basis, built with no choice principle, and for it follows from claims 1 and 2 below, since the basis of is linearly independent and equinumerous with , so can have no finite spanning set and hence no finite basis, by claim 2 of 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 . And claim 2 compares two specific bases through an explicit bijection, not two cardinal numbers.
Facts & Assumptions
Given: A field , the vector space , the subspace of eventually zero families, the families , and the sets , and as above.
is a linear subspace of ; ; ; is linearly independent and is a basis of ; is a bijection ; and is infinite-dimensional (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 to 4).
Every subset of a linearly independent subset is linearly independent (Finite sums re-indexed along an injection, with a zero term deleted, and concatenated; and the closure properties of linear independence: an independent list is injective and never , its sublists are independent, a list is independent exactly when it is injective with linearly independent image, and every subset of a linearly independent set is linearly independent, claim 7).
is a linear subspace containing , contained in every linear subspace containing , monotone in , and equal to the set of linear combinations of finite lists (Linear combination of a finite list, and the span as the smallest linear subspace containing , The span is monotone and idempotent, exactly when is a linear subspace, and , is exactly the set of linear combinations of finite lists of elements of , and , Linear subspace of a vector space).
A basis of a vector space is a linearly independent spanning subset, and independence and spans of subsets of a linear subspace agree with those computed in the ambient space (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).
A finite sum in a function space is pointwise (The standard list with and for is an ordered basis of ; hence , and is the zero space with basis and dimension , claim 1); is a vector space over itself, so an all- list of scalars sums to (A field is a vector space over itself, and over any subfield every -vector space is a -vector space by restricting the scalars, The sum of two linear subspaces and the sum of a finite family, The product of a finite list in a monoid, by recursion, with the empty product () equal to the identity); and has the pointwise operations, with equality pointwise (The vector space of all functions with pointwise operations, and as the case , Vector space over a field).
In : and (In any vector space , , , , and forces or , Field).
is injective on , , and every is for a unique (The natural numbers (von Neumann), Every nonzero natural number is a successor, Order on the natural numbers, On the order is membership: ); bijections, images and are as in Injection, surjection, bijection, Equinumerous sets, and , Finite, countably infinite, countable, uncountable.
Counterexample
, so is linearly independent, and is a linear subspace of contained in , hence a linear subspace of ; since is independent and spans by definition, is a basis of .
Claim 2. The map is a bijection : it is injective, being the composite of the injective with the injective , and every element of is with , hence for the unique with . So , and as well, whence by symmetry and transitivity of .
Every satisfies . Indeed for some , some and some ; evaluating pointwise at gives , and each is with , so and ; a list of scalars all equal to sums to .
Claim 3. The family lies in and , so by step 1.3 it does not lie in ; hence , and is a proper linear subspace of .
Steps 1.1, 1.2 and 2.1 give claims 1, 2 and 3: is a proper linear subspace of , is a basis of , is a basis of , and . So a basis of a proper subspace can be equinumerous with a basis of the whole space, refuting the false claim.
Remarks
-
The finite case is a theorem, and this shows why it is one. If and is a linear subspace of , then is finite-dimensional, , and if and only if proves that in a finite-dimensional ambient space equality of dimensions forces equality of the spaces; its proof enlarges a basis of the subspace by a vector outside it and contradicts the bound on independent sets. Here the same enlargement is possible — is independent — and contradicts nothing, because there is no finite bound to violate.
-
No cardinal arithmetic is used or implied. The comparison in claim 2 is a named bijection, , between two specific sets. This item does not assign a dimension to or to , and it says nothing about whether any two bases of are equinumerous; that question needs cardinal arithmetic, which is not available at this point in the reading order.
-
The subspace is spanned by "all but one" basis vector. Deleting a single element from an infinite basis leaves a set that is still equinumerous with the original, which is exactly the phenomenon The pigeonhole principle on rules out for finite sets and for natural numbers.
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
- If $\dim_F V = n$ and $U$ is a linear subspace of $V$, then $U$ is finite-dimensional, $\dim_F U \le n$, and $\dim_F U = n$ if and only if $U = V$
- 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}$
- Finite-dimensional vector space, and its dimension $\dim_F V$; infinite-dimensional means having no finite basis
- 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 $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
- Finite sums re-indexed along an injection, with a zero term deleted, and concatenated; and the closure properties of linear independence: an independent list is injective and never $0_V$, its sublists are independent, a list is independent exactly when it is injective with linearly independent image, and every subset of a linearly independent set is linearly independent
- The standard list $e : n \to F^{n}$ with $e_i(i) = 1_F$ and $e_i(j) = 0_F$ for $j \ne i$ is an ordered basis of $F^{n}$; hence $\dim_F F^{n} = n$, and $F^{0}$ is the zero space with basis $\varnothing$ and dimension $0$
- Linear subspace of a vector space
- 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 span is monotone and idempotent, $\operatorname{span}(S) = S$ exactly when $S$ is a linear subspace, and $\operatorname{span}(S \cup \{0_V\}) = \operatorname{span}(S)$
- The sum $U + W$ of two linear subspaces and the sum $\sum_{i<n} U_i$ of a finite family
- The product $g_0 g_1 \cdots g_{n-1}$ of a finite list in a monoid, by recursion, with the empty product ($n = 0$) equal to the identity
- A field is a vector space over itself, and over any subfield $K \subseteq F$ every $F$-vector space is a $K$-vector space by restricting the scalars
- 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\}$
- Vector space over a field
- Field
- In any vector space $0_F v = 0_V$, $\lambda 0_V = 0_V$, $(-\lambda)v = -(\lambda v)$, $(-1_F)v = -v$, and $\lambda v = 0_V$ forces $\lambda = 0_F$ or $v = 0_V$
- Equinumerous sets, $A \approx B$ and $A \preceq B$
- Injection, surjection, bijection
- Finite, countably infinite, countable, uncountable
- 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$
- Every nonzero natural number is a successor
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: 90 results over 30 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
- Dimension (vector space) (Wikipedia) (standard reference, not scraped)
- Sequence space (Wikipedia) (standard reference, not scraped)
- University of Vermont notes: Infinite-dimensional vector spaces (standard reference, not scraped)