Alphabeta Math
CorollaryStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (z-ai/glm-5.2)audited 2026-07-28
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.

Every linear subspace U of a vector space V has a complement: a linear subspace W with V=U⊕W

Statement

Assume the Axiom of Choice, through Zorn's lemma gives a basis between any linearly independent set and any spanning set containing it: if L⊆S⊆V with L independent and span⁡(S)=V, there is a basis B of V with L⊆B⊆S and Every vector space has a basis. Let V be a vector space over a field F (Vector space over a field) and let U be a linear subspace of V (Linear subspace of a vector space). Then there is a linear subspace W of V with

V  =  U⊕W

(Internal direct sum V=⨁i<nUi: the sum is everything and each summand meets the sum of the others only in 0V), that is U+W=V and U∩W={0V}.

No finiteness of V, of U or of any basis is assumed.

Facts & Assumptions

Given: The Axiom of Choice; a field F; a vector space V over F; and a linear subspace U of V.

[L1]

U is itself a vector space over F, with the addition, the zero and the scalar multiplication of V (Linear subspace of a vector space); every vector space has a basis (Every vector space has a basis); and for A⊆U, "A is a basis of U" means A is linearly independent as a subset of V with span⁡(A)=U (Basis of a vector space: a linearly independent spanning subset; and ordered basis: an injective finite list whose image is a basis, section on bases of a linear subspace, Linear independence: a finite list v:n→V is independent when ∑i<nλivi=0V forces every λi=0F, and a subset S⊆V is independent when every injective finite list into S is independent).

[L6]

Concatenation: for y:p→X and z:q→X there is exactly one c:p+q→X with ci=yi for i<p and cp+j=zj for j<q; when X=V it satisfies ∑i<p+qci=∑i<pyi+∑j<qzj; and if y and z are injective with disjoint images then c is injective with image y[p]∪z[q]. A list into V is linearly independent exactly when it is injective with linearly independent image (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 0V, 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, claims 3 and 6). The scalar case is the same statement read in F, a vector space over itself (A field is a vector space over itself, and over any subfield K⊆F every F-vector space is a K-vector space by restricting the scalars, claim 1).

[L7]

(V,+,0V) is an abelian group; 0Fy=0V; (−1F)y=−y; (V4) (λμ)y=λ(μy); (F1) an all-0V list sums to 0V; and a scalar passes through a finite sum, so (−1F)∑j<qβjbj=∑j<q(−βj)bj (Vector space over a field, In any vector space 0Fv=0V, λ0V=0V, (−λ)v=−(λv), (−1F)v=−v, and λv=0V forces λ=0F or v=0V, Field, The sum U+W of two linear subspaces and the sum ∑i<nUi of a finite family, The product g0g1⋯gn−1 of a finite list in a monoid, by recursion, with the empty product (n=0) equal to the identity).

Proof

technique · constructive
1.1

U is a vector space over F in its own right, so it has a basis A; equivalently A⊆U is linearly independent as a subset of V and span⁡(A)=U.

L1construct
2.1

Since A⊆V, A is linearly independent and span⁡(V)=V, the extension theorem supplies a basis B of V with A⊆B⊆V. Put W:=span⁡(B∖A), a linear subspace of V.

step 1.1L2L3
3.1

U+W=V. By step 2.1 and step 1.1 we have A⊆span⁡(A)=U and B∖A⊆span⁡(B∖A)=W, so B=A∪(B∖A)⊆U∪W and hence V=span⁡(B)⊆span⁡(U∪W)=U+W. Conversely span⁡(A)⊆span⁡(B) and span⁡(B∖A)⊆span⁡(B) by monotonicity, so U∪W⊆span⁡(B)=V, and span⁡(U∪W)⊆V since V is a linear subspace of itself containing U∪W.

step 1.1step 2.1L3L4
3.2

U∩W={0V}. Both are linear subspaces, so 0V lies in the intersection. Conversely let x∈U∩W. Since x∈span⁡(A) there are p, an injective a:p→A and α:p→F with x=∑i<pαiai; since x∈span⁡(B∖A) there are q, an injective b:q→B∖A and β:q→F with x=∑j<qβjbj. The images a[p]⊆A and b[q]⊆B∖A are disjoint, so the concatenation c:p+q→B of a and b is injective, and the concatenation γ:p+q→F of α with j↦−βj is a list of scalars; the list i↦γici is the concatenation of i↦αiai and j↦(−βj)bj, so ∑i<p+qγici=∑i<pαiai+∑j<q(−βj)bj=x+(−x)=0V. As c is an injective list into the linearly independent set B, it is a linearly independent list, so every γi=0F; in particular αi=0F for every i<p, whence every term αiai is 0V and x=0V by (F1).

step 1.1step 2.1L5L6L7L8
4.1

Taking W=span⁡(B∖A), steps 3.1 and 3.2 give U+W=V and U∩W={0V}, which for two summands is exactly V=U⊕W. So the required complement exists.

step 2.1step 3.1step 3.2L4discharge-construct∎

Remarks

Depends on

Used by

Dependency tree · two levels

65 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources