Alphabeta Math
CorollaryStatement: AI-adaptedProof: AI-generatedprecheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)verified 2026-08-03 (gpt-5.6-sol-codex-subscription)
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.

If V=⨁i<nUi with every Ui finite-dimensional, then V is finite-dimensional and dim⁡FV=∑i<ndim⁡FUi; in particular dim⁡F(U⊕W)=dim⁡FU+dim⁡FW

Statement

Let F be a field (Field), let n∈N, let V be a vector space over F (Vector space over a field) and let U be a family of linear subspaces Ui of V indexed by i<n (Linear subspace of a vector space, The sum U+W of two linear subspaces and the sum ∑i<nUi of a finite family) with

V  =  ⨁i<nUi

(Internal direct sum V=⨁i<nUi: the sum is everything and each summand meets the sum of the others only in 0V) and every Ui finite-dimensional over F (Finite-dimensional vector space, and its dimension dim⁡FV; infinite-dimensional means having no finite basis). Then V is finite-dimensional over F and

dim⁡FV  =  ∑i<ndim⁡FUi,

the right-hand side being the finite sum of The product g0g1⋯gn−1 of a finite list in a monoid, by recursion, with the empty product (n=0) equal to the identity read additively in the commutative monoid (N,+,0) (Addition of natural numbers, Left identity for addition, Addition is associative, Addition is commutative).

The base case is a genuine case. At n=0 the direct sum of the empty family is {0V} and the empty sum of natural numbers is 0, so the formula reads dim⁡F{0V}=0. At n=2 it reads dim⁡F(U⊕W)=dim⁡FU+dim⁡FW.

No choice principle is used. The only inputs are 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⁡FU+dim⁡FW and If dim⁡FV=n and U is a linear subspace of V, then U is finite-dimensional, dim⁡FU≤n, and dim⁡FU=n if and only if U=V, both of which are proved in finite dimension without one.

Facts & Assumptions

Given: A field F; a natural number n; a vector space V over F; and a family of finite-dimensional linear subspaces Ui of V indexed by i<n with V=⨁i<nUi.

[L1]

V=⨁i<nUi means (D1) ∑i<nUi=V and (D2) Uj∩∑i≠jUi={0V} for every j<n, where ∑i≠jUi=∑i<nUi(j) for the family U(j) with Uj(j)={0V}; and ⨁i<0Ui={0V} holds exactly for the zero space (Internal direct sum V=⨁i<nUi: the sum is everything and each summand meets the sum of the others only in 0V).

[L2]

∑i<nUi is a linear subspace of V whose elements are exactly the ∑i<nui with ui∈Ui; ∑i<0Ui={0V}; and the finite sum obeys ∑i<σ(p)ui=(∑i<pui)+up (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).

[L3]

A sum of a family contains each of its summands (∑i<nUi=span⁡(⋃i<nUi), so the sum is the smallest linear subspace containing every Ui); the intersection of two linear subspaces is a linear subspace (The intersection of a nonempty family of linear subspaces of V is a linear subspace of V); and a linear subspace of V contained in a linear subspace V′ of V is a linear subspace of V′, with the same independence and the same spans (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).

[L4]

For finite-dimensional linear subspaces X and Y of a vector space, X+Y and X∩Y are finite-dimensional and dim⁡F(X+Y)+dim⁡F(X∩Y)=dim⁡FX+dim⁡FY (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⁡FU+dim⁡FW); and a linear subspace of a finite-dimensional space is finite-dimensional (If dim⁡FV=n and U is a linear subspace of V, then U is finite-dimensional, dim⁡FU≤n, and dim⁡FU=n if and only if U=V).

[L5]

dim⁡F{0V}=0, and dim⁡F depends only on the space and the field (Finite-dimensional vector space, and its dimension dim⁡FV; infinite-dimensional means having no finite basis).

[L6]

Addition makes (N,+,0) a commutative monoid, and its finite sums satisfy ∑i<0di=0 and ∑i<σ(p)di=(∑i<pdi)+dp (Addition of natural numbers, Left identity for addition, Addition is associative, Addition is commutative, 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 · induction
1.1

The statement to be proved by induction on n is: for every vector space V over F and every family of finite-dimensional linear subspaces Ui of V indexed by i<n with V=⨁i<nUi, the space V is finite-dimensional with dim⁡FV=∑i<ndim⁡FUi. At n=0 the hypothesis V=⨁i<0Ui holds exactly when V={0V}, and then dim⁡FV=0, which is also the empty sum ∑i<0dim⁡FUi.

baseL1L5L6
1.2

Two identities used in the successor step. Let n=σ(p) and put V′:=∑i<pUi, a linear subspace of V. First, V′=∑i≠pUi: an element of the right-hand side is ∑i<σ(p)ui with ui∈Ui for i<p and up=0V, and the recursion makes that (∑i<pui)+0V=∑i<pui, so the two sets have the same elements. Second, V′+Up=∑i<σ(p)Ui: an element of the left-hand side is (∑i<pui)+up with ui∈Ui for i<p and up∈Up, which by the recursion is ∑i<σ(p)ui, and conversely.

L1L2
1.3

Assume the displayed statement at the natural number p, for every vector space over F and every family of finite-dimensional linear subspaces indexed by i<p.

ih
2.1

The successor step. Let n=σ(p), let V=⨁i<σ(p)Ui with every Ui finite-dimensional, and let V′:=∑i<pUi as in step 1.2. Then V′=⨁i<pUi as a direct sum inside V′: condition (D1) holds by the definition of V′, and for j<p every element ∑i<pui with ui∈Ui(j) is also ∑i<σ(p)ui after setting up:=0V∈Up, so ∑i<pUi(j) is contained in the corresponding sum for the family indexed by σ(p), and (D2) for the larger family at j forces Uj∩∑i<pUi(j)={0V}, the reverse inclusion holding because both sides are linear subspaces. Each Ui with i<p is contained in V′ and is therefore a linear subspace of V′, still finite-dimensional. So step 1.3 applies to V′ and gives that V′ is finite-dimensional with dim⁡FV′=∑i<pdim⁡FUi. Now V′ and Up are finite-dimensional linear subspaces of V; by step 1.2 their sum is ∑i<σ(p)Ui=V, and their intersection is Up∩∑i≠pUi={0V} by (D2) at j=p. The dimension formula therefore gives dim⁡FV+dim⁡F{0V}=dim⁡FV′+dim⁡FUp, that is dim⁡FV=(∑i<pdim⁡FUi)+dim⁡FUp=∑i<σ(p)dim⁡FUi, and V is finite-dimensional because the dimension formula asserts that the sum of two finite-dimensional subspaces is one.

step 1.2step 1.3L1L2L3L4L5L6
3.1

Step 1.1 and step 2.1 are the base case and the successor step of an induction on n, so the statement holds for every n∈N; at n=2 it reads dim⁡F(U0⊕U1)=∑i<2dim⁡FUi=dim⁡FU0+dim⁡FU1, by the recursion for finite sums of naturals.

step 1.1step 2.1L6L7discharge-induction∎

Remarks

Depends on

Used by

Dependency tree · two levels

61 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