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.
as a vector space over has a basis, and every such basis is infinite; the existence proof exhibits none
Example
Assume the Axiom of Choice (The Axiom of Choice). Let be the real numbers (The real numbers), a field (The reals form a field) and an ordered field (The reals form a totally ordered field, Ordered field), with the least-upper-bound property and hence complete as an ordered field (The Cauchy-sequence reals have the least-upper-bound property, Complete ordered field (least-upper-bound property)), and let be the rationals (The rationals as equivalence classes of pairs of integers), a field (The rationals form a field). Let be the unique field homomorphism (The unique embedding of ℚ into an ordered field, Field homomorphism and embedding), which is injective, and put . Then:
- is a subfield of (Subfield: a subring of a field closed under inverses of its nonzero elements, and therefore a field with the restricted operations) and is a vector space over by restriction of scalars (A field is a vector space over itself, and over any subfield every -vector space is a -vector space by restricting the scalars); setting also makes a vector space over itself;
- has a basis over (Basis of a vector space: a linearly independent spanning subset; and ordered basis: an injective finite list whose image is a basis, Every vector space has a basis);
- is infinite-dimensional over (Finite-dimensional vector space, and its dimension ; infinite-dimensional means having no finite basis): no basis of over is finite;
- the two structures of claim 1 have the same linearly independent subsets, the same spans and the same bases, so claims 2 and 3 hold verbatim for as a -vector space.
The existence proof exhibits no basis. Claim 2 comes from Every vector space has a basis, which runs through Zorn's lemma and therefore through the Axiom of Choice; nothing in it names a real number belonging to the basis it produces. That is a statement about this proof. It is not claimed here that no basis can be exhibited by any means: that would be a metamathematical assertion about what is definable, and this library has established nothing of the kind.
Facts & Assumptions
Given: The Axiom of Choice; the complete ordered field , the field , the unique field homomorphism , and .
There is a unique field homomorphism and it is injective (The unique embedding of ℚ into an ordered field); a field homomorphism satisfies , , , , and for (Field homomorphism and embedding); a subfield is a subset containing , closed under and , and containing for each nonzero in it (Subfield: a subring of a field closed under inverses of its nonzero elements, and therefore a field with the restricted operations).
A field is a vector space over itself, and an -vector space is a -vector space for every subfield by restricting the scalar multiplication (A field is a vector space over itself, and over any subfield every -vector space is a -vector space by restricting the scalars, Vector space over a field, Field).
Under the Axiom of Choice every vector space has a basis (The Axiom of Choice, Every vector space has a basis); a basis is a linearly independent spanning subset, an ordered basis is an injective list whose image is a basis, and is defined exactly when some basis is finite (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, Finite-dimensional vector space, and its dimension ; infinite-dimensional means having no finite basis, Linear combination of a finite list, and the span as the smallest linear subspace containing ).
A list is an ordered basis if and only if every is for exactly one (A finite list is an ordered basis if and only if every equals for exactly one ; those scalars are the coordinates of in that ordered basis); finite sums are those of The product of a finite list in a monoid, by recursion, with the empty product () equal to the identity read additively.
( is countably infinite); a product of two at most countable sets is at most countable (A product of two at most countable sets is at most countable); a subset of an at most countable set is at most countable (Every subset of an at most countable set is at most countable); the Cauchy-sequence reals have the least-upper-bound property and hence form a complete ordered field (The Cauchy-sequence reals have the least-upper-bound property, Complete ordered field (least-upper-bound property)), so is uncountable ( is uncountable (Cantor's nested intervals, 1874)); a finite set is equinumerous with exactly one natural (The pigeonhole principle on ); "at most countable" means finite or equinumerous with , and this property transfers along a bijection (Finite, countably infinite, countable, uncountable, Equinumerous sets, and , Injection, surjection, bijection).
is the set of functions (The vector space of all functions with pointwise operations, and as the case ); with (The natural numbers (von Neumann), On the order is membership: ); induction (The principle of mathematical induction).
Verification
Claim 1. is a subfield of : it contains ; for it contains and ; and if then , since , so . Since is a vector space over itself, restriction of scalars makes it a vector space over , with the field multiplication restricted to . The operation is a map , and it satisfies (V2) to (V5) because preserves sums and products and , while (V1) is the abelian group ; so it makes a vector space over .
is at most countable: is injective with image , hence a bijection , and ; composing bijections gives .
If is at most countable then so is , the set of functions , for every . By induction on : at the set has exactly one element, the empty function, so it is finite; and the map sending to the pair consisting of its restriction to and its value at is a bijection, since and , so a function on is determined by, and may be assembled from, those two data. Hence , which is at most countable by the inductive hypothesis and the product theorem, and countability transfers along the bijection.
Claim 4. For a list and scalars , the vector computed in the -structure is by definition , computed in the -structure; the two structures have the same underlying set, the same addition and the same zero, so their finite sums agree. Since is a bijection , the scalar lists and correspond bijectively, and for all exactly when for all . So a vanishing combination exists on one side exactly when it does on the other, and likewise for representations of an arbitrary vector; hence the two structures have the same linearly independent subsets, the same spans and the same bases.
Claim 2. is a vector space over by step 1.1, and every vector space has a basis, so a basis of over exists.
Claim 3. Suppose some basis of over were finite, say . A bijection is an injective list whose image is a basis, hence an ordered basis, so every is for exactly one . The resulting map , sending to that , is injective, since makes and the same sum. By steps 1.2 and 1.3 the set is at most countable, hence so is its subset ; and is a bijection , so is at most countable, contradicting the uncountability of . So no basis of over is finite, and is infinite-dimensional over .
Claim 1 is step 1.1, claim 2 is step 2.1, claim 3 is step 2.2, and claim 4 is step 1.4; by claim 4 the last two transfer to as a -vector space.
Remarks
-
Agreement with the order-69 examples page. Claim 1 above is exactly claims 2 and 3 of is a vector space over itself, over the embedded copy of by restriction of scalars, and over itself via the embedding, which states that is a subfield of , that restriction of scalars makes a vector space over it, and that makes a vector space over . It is rebuilt here rather than quoted, because an examples page is a leaf of the library and nothing outside it may depend on the items homed there; the statements agree, and neither is stronger than the other. That page says explicitly that nothing there claims anything about size; claims 2, 3 and 4 are new here.
-
What the sharper statement would need. This item does not claim that no basis of over is countably infinite. That statement is not proved here: it would need a count of the finite combinations drawn from a countably infinite set, which is a countable union of countable sets, and Countable unions of at most countable sets, assuming costs the Axiom of Countable Choice. The argument above avoids the question entirely by ruling out only finite bases, which is all that "infinite-dimensional" means (Finite-dimensional vector space, and its dimension ; infinite-dimensional means having no finite basis).
-
The contrast this page is built around. The eventually zero families have an infinite basis that is written down and costs no choice principle (The standard unit families form a basis of the linear subspace of eventually zero families: an explicit infinite basis, built with no choice principle); over has one that is produced by Zorn's lemma and that no argument here exhibits. Both are infinite-dimensional, and the difference is in what the proof delivers, not in the statement proved.
Depends on
- Every vector space has a basis
- The Axiom of Choice
- A finite list $v : n \to V$ is an ordered basis if and only if every $x \in V$ equals $\sum_{i<n} \lambda_i v_i$ for exactly one $\lambda : n \to F$; those scalars are the coordinates of $x$ in that ordered 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-dimensional vector space, and its dimension $\dim_F V$; infinite-dimensional means having no finite basis
- Linear combination of a finite list, and the span $\operatorname{span}(S)$ as the smallest linear subspace containing $S$
- 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
- Subfield: a subring of a field closed under inverses of its nonzero elements, and therefore a field with the restricted operations
- Field homomorphism and embedding
- The unique embedding of ℚ into an ordered field
- Ordered field
- The reals form a totally ordered field
- The Cauchy-sequence reals have the least-upper-bound property
- Complete ordered field (least-upper-bound property)
- $\mathbb{Q}$ is countably infinite
- A product of two at most countable sets is at most countable
- $\mathbb{R}$ is uncountable (Cantor's nested intervals, 1874)
- Every subset of an at most countable set is at most countable
- The pigeonhole principle on $\mathbb{N}$
- Finite, countably infinite, countable, uncountable
- Equinumerous sets, $A \approx B$ and $A \preceq B$
- Injection, surjection, bijection
- 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
- The rationals as equivalence classes of pairs of integers
- The real numbers
- The rationals form a field
- The reals form a field
- The principle of mathematical induction
- The natural numbers $\mathbb{N}$ (von Neumann)
- 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: 172 results over 37 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
- Hamel basis (Wikipedia) (standard reference, not scraped)
- Axiom of choice (Wikipedia) (standard reference, not scraped)
- University of Vermont notes: Infinite-dimensional vector spaces (standard reference, not scraped)