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.
A field is a vector space over itself, and over any subfield every -vector space is a -vector space by restricting the scalars
Statement
Let be a field (Field).
- is a vector space over itself (Vector space over a field): take the set to be , the vector addition to be the field addition, the zero vector to be , and the scalar multiplication to be the field multiplication.
- Let be a subfield (Subfield: a subring of a field closed under inverses of its nonzero elements, and therefore a field with the restricted operations) and let be a vector space over . Then , with the same addition and the same zero vector and with the scalar multiplication restricted to , is a vector space over . This is called restricting the scalars from to .
- In particular is a vector space over every subfield , with the field multiplication restricted to as scalar multiplication.
Facts & Assumptions
Given: A field , a subfield , and a vector space over .
The vector space axioms (V1)–(V5) (Vector space over a field): is an abelian group; ; ; ; .
The field axioms of Field, read as they are read throughout this library: is an abelian group; multiplication on is associative and commutative with two-sided identity ; multiplication distributes over addition, so that and ; and every has a multiplicative inverse.
A subfield of is a subring of closed under inverses of its nonzero elements; equivalently, a subset containing with and for all and for every nonzero . With the restricted operations is itself a field, its addition and multiplication being the restrictions of those of , and , , with the negatives and the inverses of those of (Subfield: a subring of a field closed under inverses of its nonzero elements, and therefore a field with the restricted operations).
Proof
Put as a set, let the vector addition be the field addition with zero vector , and let the scalar multiplication be the field multiplication, which is a map as required.
Axiom (V1) holds for : axiom (A) of a field says exactly that is an abelian group.
Axiom (V2) holds for : is distributivity of multiplication over addition.
Axiom (V3) holds for : is distributivity on the other side.
Axiom (V4) holds for : is associativity of the field multiplication.
Axiom (V5) holds for : is the multiplicative identity law.
For claim 2: since , restricting the scalar multiplication of to the subset of yields a map , which is the required datum.
The set , its addition and its zero vector are unchanged by the restriction, so is still an abelian group; this is axiom (V1) for the -structure.
For the sum and the product formed in are the sum and the product formed in , and the multiplicative identity of is .
Steps 1.1 to 1.6 verify (V1)–(V5), so with the operations of step 1.1 is a vector space over itself: claim 1.
Let and . Then and are the instances of (V2) and (V4) for these elements of , the product being the same whether formed in or in ; is the instance of (V3), the sum being likewise the same; and the identity of is , so is the instance of (V5).
With step 1.8, the restricted structure satisfies (V1)–(V5) over , so is a vector space over : claim 2.
Claim 3 follows by applying claim 2 to the -vector space of claim 1: is a vector space over , its scalar multiplication being the field multiplication restricted to .
Remarks
-
On the field facts in [L2]. Axiom (M) of Field asserts that multiplication is associative and commutative on all of with for every , the element included, and right distributivity then follows from axiom (D) by commuting, as Multiplication by zero: already records. These unrestricted forms are spent in exactly three of the steps above, where axioms (V3), (V4) and (V5) are read off for arbitrary scalars including : step 1.4 needs distributivity on the right; step 1.5 needs associativity of the multiplication at as well; and step 1.6 needs rather than the literal , which commutativity supplies, and needs it at too. They are used nowhere else: step 1.2 is axiom (A) verbatim, step 1.3 is axiom (D) verbatim, and steps 1.7 to 4.1 use only the vector-space axioms of and the subfield facts of [L3].
-
Restricting the scalars changes the structure, not the set. The vectors, the addition and the zero are untouched; only the collection of scalars allowed to act shrinks. Everything that can be said about as a -vector space is therefore a statement about the same object with fewer operations available, and every -linear subspace of is in particular a -linear subspace (Linear subspace of a vector space). The converse fails, and that is the point of the construction.
-
The field is part of the data. Because of this lemma, a bare phrase like "the vector space " is incomplete: is a vector space over and also over the embedded copy of inside it, and these are different structures on one set. Every statement on this page names its field.
-
Nothing here is about dimension. How much smaller is than , and what that does to , is a question about bases and dimension, which are developed on a later page. This lemma asserts only that the restricted structure satisfies the five axioms.
Depends on
Used by
- Every linear subspace U of a vector space V has a complement: a linear subspace W with V = U ⊕ W Corollary
- Inside the space of eventually zero families, the linear subspace spanned by { eᵢ : i ≥ 1 } is proper and has a basis equinumerous with a basis of the whole space, so "equal dimension forces equality" fails without finite dimension Counterexample
- Finite-dimensional vector space, and its dimension dim_F V; infinite-dimensional means having no finite basis Definition
- An additive f : ℝ → ℝ that is not x ↦ cx: the coefficient of one fixed Hamel basis vector. It is unbounded above and below on every nondegenerate interval, its graph is dense in ℝ², and every nonempty level set is dense in ℝ Example
- ℝ as a vector space over ℚ has a basis, and every such basis is infinite; the existence proof exhibits none Example
- ℝ is a vector space over itself, over the embedded copy of ℚ by restriction of scalars, and over ℚ itself via the embedding Example
- The standard unit families eₖ ∈ F^ℕ form a basis of the linear subspace of eventually zero families: an explicit infinite basis, built with no choice principle Example
- FALSE: every additive f : ℝ → ℝ is of the form x ↦ cx for a single real c False statement
- Assuming the Axiom of Choice, ℝ has a Hamel basis over ℚ: there is B ⊆ ℝ such that every real is a finite ℚ-linear combination of elements of B in exactly one way, and each basis vector carries a well-defined ℚ-linear coefficient map Lemma
- The standard list e : n → Fⁿ with eᵢ(i) = 1_F and eᵢ(j) = 0_F for j ≠ i is an ordered basis of Fⁿ; hence dim_F Fⁿ = n, and F⁰ is the zero space with basis ∅ and dimension 0 Lemma
- The dimension formula: for finite-dimensional linear subspaces U and W of V, the subspaces U + W and U ∩ W are finite-dimensional and dim_F(U+W) + dim_F(U ∩ W) = dim_F U + dim_F W Theorem
Dependency tree · next 3 levels
Direct dependencies and their dependencies through the next three levels: 28 results over 16 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
- Restriction of scalars (Wikipedia) (standard reference, not scraped)
- Vector space (Wikipedia) (standard reference, not scraped)