Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-generatedSession-authored (Fable 5 assisted)precheck passjudge pass (z-ai/glm-5.2)verified 2026-07-28 (claude-fable-5)
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 KFK \subseteq F every FF-vector space is a KK-vector space by restricting the scalars

Statement

Let FF be a field (Field).

  1. FF is a vector space over itself (Vector space over a field): take the set to be FF, the vector addition to be the field addition, the zero vector to be 0F0_F, and the scalar multiplication F×FFF \times F \to F to be the field multiplication.
  2. Let KFK \subseteq F 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 VV be a vector space over FF. Then VV, with the same addition and the same zero vector and with the scalar multiplication restricted to K×VK \times V, is a vector space over KK. This is called restricting the scalars from FF to KK.
  3. In particular FF is a vector space over every subfield KFK \subseteq F, with the field multiplication restricted to K×FK \times F as scalar multiplication.

Facts & Assumptions

Given: A field FF, a subfield KFK \subseteq F, and a vector space VV over FF.

[L1]

The vector space axioms (V1)–(V5) (Vector space over a field): (V,+,0V)(V,+,0_V) is an abelian group; λ(u+v)=λu+λv\lambda(u+v) = \lambda u + \lambda v; (λ+μ)v=λv+μv(\lambda+\mu)v = \lambda v + \mu v; (λμ)v=λ(μv)(\lambda\mu)v = \lambda(\mu v); 1Fv=v1_F v = v.

[L2]

The field axioms of Field, read as they are read throughout this library: (F,+,0F)(F,+,0_F) is an abelian group; multiplication on FF is associative and commutative with two-sided identity 1F1_F; multiplication distributes over addition, so that x(y+z)=xy+xzx(y+z) = xy+xz and (y+z)x=yx+zx(y+z)x = yx+zx; and every x0Fx \ne 0_F has a multiplicative inverse.

[L3]

A subfield KK of FF is a subring of FF closed under inverses of its nonzero elements; equivalently, a subset containing 1F1_F with abKa - b \in K and abKab \in K for all a,bKa, b \in K and x1Kx^{-1} \in K for every nonzero xKx \in K. With the restricted operations KK is itself a field, its addition and multiplication being the restrictions of those of FF, and 0K=0F0_K = 0_F, 1K=1F1_K = 1_F, with the negatives and the inverses of KK those of FF (Subfield: a subring of a field closed under inverses of its nonzero elements, and therefore a field with the restricted operations).

Proof

technique · direct
1.1

Put VF:=FV_F := F as a set, let the vector addition be the field addition with zero vector 0F0_F, and let the scalar multiplication be the field multiplication, which is a map F×FFF \times F \to F as required.

L2
1.2

Axiom (V1) holds for VFV_F: axiom (A) of a field says exactly that (F,+,0F)(F,+,0_F) is an abelian group.

L2
1.3

Axiom (V2) holds for VFV_F: λ(u+v)=λu+λv\lambda(u+v) = \lambda u + \lambda v is distributivity of multiplication over addition.

L2
1.4

Axiom (V3) holds for VFV_F: (λ+μ)v=λv+μv(\lambda+\mu)v = \lambda v + \mu v is distributivity on the other side.

L2
1.5

Axiom (V4) holds for VFV_F: (λμ)v=λ(μv)(\lambda\mu)v = \lambda(\mu v) is associativity of the field multiplication.

L2
1.6

Axiom (V5) holds for VFV_F: 1Fv=v1_F v = v is the multiplicative identity law.

L2
1.7

For claim 2: since KFK \subseteq F, restricting the scalar multiplication of VV to the subset K×VK \times V of F×VF \times V yields a map K×VVK \times V \to V, which is the required datum.

L3
1.8

The set VV, its addition and its zero vector are unchanged by the restriction, so (V,+,0V)(V,+,0_V) is still an abelian group; this is axiom (V1) for the KK-structure.

L1
1.9

For λ,μK\lambda, \mu \in K the sum λ+μ\lambda + \mu and the product λμ\lambda\mu formed in KK are the sum and the product formed in FF, and the multiplicative identity of KK is 1F1_F.

L3
2.1

Steps 1.1 to 1.6 verify (V1)–(V5), so FF with the operations of step 1.1 is a vector space over itself: claim 1.

step 1.1step 1.2step 1.3step 1.4step 1.5step 1.6L1
2.2

Let λ,μK\lambda, \mu \in K and u,vVu, v \in V. Then λ(u+v)=λu+λv\lambda(u+v) = \lambda u + \lambda v and (λμ)v=λ(μv)(\lambda\mu)v = \lambda(\mu v) are the instances of (V2) and (V4) for these elements of FF, the product λμ\lambda\mu being the same whether formed in KK or in FF; (λ+μ)v=λv+μv(\lambda+\mu)v = \lambda v + \mu v is the instance of (V3), the sum λ+μ\lambda+\mu being likewise the same; and the identity of KK is 1F1_F, so 1Kv=1Fv=v1_K v = 1_F v = v is the instance of (V5).

step 1.7step 1.9L1L3
3.1

With step 1.8, the restricted structure satisfies (V1)–(V5) over KK, so VV is a vector space over KK: claim 2.

step 1.8step 2.2L1
4.1

Claim 3 follows by applying claim 2 to the FF-vector space of claim 1: FF is a vector space over KK, its scalar multiplication being the field multiplication restricted to K×FK \times F.

step 2.1step 3.1

Remarks

  • On the field facts in [L2]. Axiom (M) of Field asserts that multiplication is associative and commutative on all of FF with x1F=xx \cdot 1_F = x for every xFx \in F, the element 0F0_F included, and right distributivity then follows from axiom (D) by commuting, as Multiplication by zero: 0a=00 \cdot a = 0 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 0F0_F: step 1.4 needs distributivity on the right; step 1.5 needs associativity of the multiplication at 0F0_F as well; and step 1.6 needs 1Fx=x1_F x = x rather than the literal x1F=xx \cdot 1_F = x, which commutativity supplies, and needs it at x=0Fx = 0_F 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 VV 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 VV as a KK-vector space is therefore a statement about the same object with fewer operations available, and every FF-linear subspace of VV is in particular a KK-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 VV" is incomplete: R\mathbb{R} is a vector space over R\mathbb{R} and also over the embedded copy of Q\mathbb{Q} 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 KK is than FF, and what that does to VV, 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

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