Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-adaptedSession-authored (Fable 5 assisted)precheck 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.

The dimension formula: for finite-dimensional linear subspaces UU and WW of VV, the subspaces U+WU + W and UWU \cap W are finite-dimensional and dimF(U+W)+dimF(UW)=dimFU+dimFW\dim_F(U+W) + \dim_F(U \cap W) = \dim_F U + \dim_F W

Statement

Let VV be a vector space over a field FF (Vector space over a field) and let UU and WW be linear subspaces of VV (Linear subspace of a vector space), both finite-dimensional over FF (Finite-dimensional vector space, and its dimension dimFV\dim_F V; infinite-dimensional means having no finite basis). Then UWU \cap W and U+WU + W (The sum U+WU + W of two linear subspaces and the sum i<nUi\sum_{i<n} U_i of a finite family) are finite-dimensional and

dimF(U+W)  +  dimF(UW)  =  dimFU  +  dimFW.\dim_F(U+W) \;+\; \dim_F(U \cap W) \;=\; \dim_F U \;+\; \dim_F W .

The ambient space VV is arbitrary and need not be finite-dimensional.

The two boundary cases. If UW={0V}U \cap W = \{0_V\} the formula reads dimF(UW)=dimFU+dimFW\dim_F(U \oplus W) = \dim_F U + \dim_F W, since dimF{0V}=0\dim_F\{0_V\} = 0; if U=WU = W it reads dimFU+dimFU=dimFU+dimFU\dim_F U + \dim_F U = \dim_F U + \dim_F U.

No choice principle is used. The bases of UU and of WW extending a basis of UWU \cap W come from claim 3 of If dimFV=n\dim_F V = n and UU is a linear subspace of VV, then UU is finite-dimensional, dimFUn\dim_F U \le n, and dimFU=n\dim_F U = n if and only if U=VU = V, which is proved by a largest-independent-subset argument inside a finite-dimensional space. Zorn's lemma is not used anywhere below, and the Zorn-based extension theorem of this page is neither cited nor needed; the remarks say where the difference lies.

Facts & Assumptions

Given: A field FF; a vector space VV over FF; and finite-dimensional linear subspaces UU and WW of VV; write u:=dimFUu := \dim_F U and w:=dimFWw := \dim_F W.

[L2]

The intersection of two linear subspaces of VV is a linear subspace of VV (The intersection of a nonempty family of linear subspaces of VV is a linear subspace of VV); a linear subspace of VV contained in UU is a linear subspace of UU, linear independence is the same computed in a linear subspace or in VV, and spans agree (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 subspace of a vector space).

[L5]

In a finite-dimensional vector space XX over FF, every linearly independent A0XA_0 \subseteq X is contained in a basis of XX, and no choice principle is used to produce it (If dimFV=n\dim_F V = n and UU is a linear subspace of VV, then UU is finite-dimensional, dimFUn\dim_F U \le n, and dimFU=n\dim_F U = n if and only if U=VU = V, claim 3, which states this for a linear subspace and notes that a space is a linear subspace of itself). Also span(X)=X\operatorname{span}(X) = X for a linear subspace XX (The span is monotone and idempotent, span(S)=S\operatorname{span}(S) = S exactly when SS is a linear subspace, and span(S{0V})=span(S)\operatorname{span}(S \cup \{0_V\}) = \operatorname{span}(S), claim 4).

[L6]

Concatenation: for y:pZy : p \to Z and z:qZz : q \to Z there is exactly one c:p+qZc : p+q \to Z with ci=yic_i = y_i for i<pi < p and cp+j=zjc_{p+j} = z_j for j<qj < q; for Z=VZ = V it satisfies i<p+qci=i<pyi+j<qzj\sum_{i<p+q}c_i = \sum_{i<p}y_i + \sum_{j<q}z_j; and if y,zy, z are injective with disjoint images then cc is injective with image y[p]z[q]y[p] \cup z[q]. A list is linearly independent exactly when it is injective with linearly independent image, and every subset of a linearly independent set 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 0V0_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, claims 3, 6 and 7). The scalar case is the same statement read in FF, a vector space over itself (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).

[L7]

For any list v:pVv : p \to V, span(v[p])={i<pλivi:λ:pF}\operatorname{span}(v[p]) = \{\, \sum_{i<p}\lambda_i v_i : \lambda : p \to F \,\} (A finite list v:nVv : n \to V is an ordered basis if and only if every xVx \in V equals i<nλivi\sum_{i<n} \lambda_i v_i for exactly one λ:nF\lambda : n \to F; those scalars are the coordinates of xx in that ordered basis, claim 1).

Proof

technique · constructive
1.1

UWU \cap W is a linear subspace of VV contained in UU, hence a linear subspace of UU; since UU is finite-dimensional, so is UWU \cap W. Write a:=dimF(UW)a := \dim_F(U \cap W), fix a basis AA of UWU \cap W with AaA \approx a, and fix an injective list α:aV\alpha : a \to V with image AA. Note span(A)=UW\operatorname{span}(A) = U \cap W, and that independence and spans may be computed in VV throughout.

L1L2L3construct
2.1

Extending AA in each of UU and WW. The set AA is linearly independent with AUA \subseteq U, and UU is finite-dimensional, so AA is contained in a basis BUB_U of UU; likewise AWA \subseteq W gives a basis BWB_W of WW with ABWA \subseteq B_W. Both extensions are the finite-dimensional ones, with no appeal to Zorn's lemma. Put AU:=BUAA_U := B_U \setminus A and AW:=BWAA_W := B_W \setminus A, which are disjoint from AA by construction. Each is a subset of a linearly independent set, hence linearly independent, and each lies in a space with a finite basis, hence is finite; fix qq and rr with AUqA_U \approx q and AWrA_W \approx r, and injective lists β:qV\beta : q \to V with image AUA_U and δ:rV\delta : r \to V with image AWA_W.

step 1.1L1L4L5L6L11construct
3.1

The sizes add up. The lists α\alpha and β\beta are injective with disjoint images, so their concatenation is an injective list a+qVa+q \to V with image AAU=BUA \cup A_U = B_U; hence BUa+qB_U \approx a + q. Also BUB_U is a basis of UU, so BUuB_U \approx u, and a finite set is equinumerous with exactly one natural number, so a+q=ua + q = u. The same argument with δ\delta gives a+r=wa + r = w.

step 2.1L1L6L11
3.2

AUA_U and AWA_W are disjoint. Suppose yAUAWy \in A_U \cap A_W. Then yBUUy \in B_U \subseteq U and yBWWy \in B_W \subseteq W, so yUW=span(A)y \in U \cap W = \operatorname{span}(A). But yAWy \in A_W means yAy \notin A, so ABW{y}A \subseteq B_W \setminus \{y\} and monotonicity gives yspan(A)span(BW{y})y \in \operatorname{span}(A) \subseteq \operatorname{span}(B_W \setminus \{y\}), which makes BWB_W linearly dependent and contradicts its being a basis.

step 2.1L8L9
4.1

One list carrying all three blocks. Let cc' be the concatenation of α\alpha and β\beta, an injective list a+qVa+q \to V with image BUB_U, and let cc be the concatenation of cc' and δ\delta, a list (a+q)+rV(a+q)+r \to V. By step 3.2 the images BUB_U and AWA_W are disjoint, since BUAWB_U \cap A_W would lie in AAWA \cap A_W or in AUAWA_U \cap A_W, both empty; so cc is injective with image C:=BUAW=AAUAW=BUBWC := B_U \cup A_W = A \cup A_U \cup A_W = B_U \cup B_W. For scalars γ:(a+q)+rF\gamma : (a+q)+r \to F the sum splits as i<(a+q)+rγici=(i<a+qγici)+(k<rγ(a+q)+kδk)\sum_{i<(a+q)+r}\gamma_i c_i = \bigl(\sum_{i<a+q}\gamma_i c'_i\bigr) + \bigl(\sum_{k<r}\gamma_{(a+q)+k}\delta_k\bigr).

step 2.1step 3.2L6L10
5.1

The list cc is linearly independent. Let γ:(a+q)+rF\gamma : (a+q)+r \to F with i<(a+q)+rγici=0V\sum_{i<(a+q)+r}\gamma_i c_i = 0_V, and write P:=i<a+qγiciP := \sum_{i<a+q}\gamma_i c'_i and R:=k<rγ(a+q)+kδkR := \sum_{k<r}\gamma_{(a+q)+k}\delta_k, so P+R=0VP + R = 0_V by step 4.1 and hence R=PR = -P. Now PP is a linear combination of the list cc', whose values lie in BUB_U, so Pspan(BU)=UP \in \operatorname{span}(B_U) = U and therefore R=PUR = -P \in U; and RR is a linear combination of δ\delta, whose values lie in AWBWA_W \subseteq B_W, so Rspan(BW)=WR \in \operatorname{span}(B_W) = W. Hence RUW=span(A)=span(α[a])R \in U \cap W = \operatorname{span}(A) = \operatorname{span}(\alpha[a]), so R=i<aεiαiR = \sum_{i<a}\varepsilon_i\alpha_i for some ε:aF\varepsilon : a \to F. Let dd be the concatenation of α\alpha and δ\delta, injective with image AAW=BWA \cup A_W = B_W since AA and AWA_W are disjoint, and let η\eta be the concatenation of ε\varepsilon with kγ(a+q)+kk \mapsto -\gamma_{(a+q)+k}; then i<a+rηidi=R+(R)=0V\sum_{i<a+r}\eta_i d_i = R + (-R) = 0_V. As dd is an injective list into the linearly independent set BWB_W, it is a linearly independent list, so every ηi=0F\eta_i = 0_F; in particular γ(a+q)+k=0F\gamma_{(a+q)+k} = 0_F for every k<rk < r, and εi=0F\varepsilon_i = 0_F for every i<ai < a, whence R=0VR = 0_V by (F1) and P=R=0VP = -R = 0_V. Finally cc' is an injective list into the linearly independent set BUB_U, hence linearly independent, so P=0VP = 0_V forces γi=0F\gamma_i = 0_F for every i<a+qi < a+q. Every coefficient of γ\gamma therefore vanishes.

step 2.1step 4.1L6L7L9L10
5.2

span(C)=U+W\operatorname{span}(C) = U + W. From BUCB_U \subseteq C and BWCB_W \subseteq C and monotonicity, U=span(BU)span(C)U = \operatorname{span}(B_U) \subseteq \operatorname{span}(C) and W=span(BW)span(C)W = \operatorname{span}(B_W) \subseteq \operatorname{span}(C), so UWspan(C)U \cup W \subseteq \operatorname{span}(C) and hence U+W=span(UW)span(C)U + W = \operatorname{span}(U \cup W) \subseteq \operatorname{span}(C). Conversely C=BUBWUWU+WC = B_U \cup B_W \subseteq U \cup W \subseteq U + W, and U+WU + W is a linear subspace, so span(C)U+W\operatorname{span}(C) \subseteq U + W.

step 2.1step 4.1L9
6.1

CC is a basis of U+WU + W with (a+q)+r(a+q)+r elements. By step 5.1 the list cc is linearly independent, hence injective with linearly independent image CC and C(a+q)+rC \approx (a+q)+r; by step 5.2 it spans U+WU + W. So U+WU + W is finite-dimensional with dimF(U+W)=(a+q)+r\dim_F(U+W) = (a+q)+r.

step 4.1step 5.1step 5.2L1L6L11
7.1

The formula. By step 3.1, a+q=ua + q = u and a+r=wa + r = w, so step 6.1 gives dimF(U+W)=u+r\dim_F(U+W) = u + r, and with dimF(UW)=a\dim_F(U \cap W) = a from step 1.1 we get dimF(U+W)+dimF(UW)=(u+r)+a=u+(r+a)=u+(a+r)=u+w=dimFU+dimFW\dim_F(U+W) + \dim_F(U \cap W) = (u + r) + a = u + (r + a) = u + (a + r) = u + w = \dim_F U + \dim_F W, using associativity and commutativity of addition on N\mathbb{N}.

step 1.1step 3.1step 6.1L11discharge-construct

Remarks

Depends on

Used by

Dependency tree · next 3 levels

Direct dependencies and their dependencies through the next three levels: 88 results over 29 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