Alphabeta Math
CorollaryStatement: AI-adaptedProof: AI-generatedSession-authored (Fable 5 assisted)precheck 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<nUiV = \bigoplus_{i<n} U_i with every UiU_i finite-dimensional, then VV is finite-dimensional and dimFV=i<ndimFUi\dim_F V = \sum_{i<n} \dim_F U_i; in particular dimF(UW)=dimFU+dimFW\dim_F(U \oplus W) = \dim_F U + \dim_F W

Statement

Let FF be a field (Field), let nNn \in \mathbb{N}, let VV be a vector space over FF (Vector space over a field) and let UU be a family of linear subspaces UiU_i of VV indexed by i<ni < n (Linear subspace of a vector space, The sum U+WU + W of two linear subspaces and the sum i<nUi\sum_{i<n} U_i of a finite family) with

V  =  i<nUiV \;=\; \bigoplus_{i<n} U_i

(Internal direct sum V=i<nUiV = \bigoplus_{i<n} U_i: the sum is everything and each summand meets the sum of the others only in 0V0_V) and every UiU_i finite-dimensional over FF (Finite-dimensional vector space, and its dimension dimFV\dim_F V; infinite-dimensional means having no finite basis). Then VV is finite-dimensional over FF and

dimFV  =  i<ndimFUi,\dim_F V \;=\; \sum_{i<n} \dim_F U_i ,

the right-hand side being the finite sum of The product g0g1gn1g_0 g_1 \cdots g_{n-1} of a finite list in a monoid, by recursion, with the empty product (n=0n = 0) equal to the identity read additively in the commutative monoid (N,+,0)(\mathbb{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=0n = 0 the direct sum of the empty family is {0V}\{0_V\} and the empty sum of natural numbers is 00, so the formula reads dimF{0V}=0\dim_F\{0_V\} = 0. At n=2n = 2 it reads dimF(UW)=dimFU+dimFW\dim_F(U \oplus W) = \dim_F U + \dim_F W.

No choice principle is used. The only inputs are 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 and 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, both of which are proved in finite dimension without one.

Facts & Assumptions

Given: A field FF; a natural number nn; a vector space VV over FF; and a family of finite-dimensional linear subspaces UiU_i of VV indexed by i<ni < n with V=i<nUiV = \bigoplus_{i<n} U_i.

[L1]

V=i<nUiV = \bigoplus_{i<n} U_i means (D1) i<nUi=V\sum_{i<n}U_i = V and (D2) UjijUi={0V}U_j \cap \sum_{i \ne j}U_i = \{0_V\} for every j<nj < n, where ijUi=i<nUi(j)\sum_{i \ne j}U_i = \sum_{i<n}U^{(j)}_i for the family U(j)U^{(j)} with Uj(j)={0V}U^{(j)}_j = \{0_V\}; and i<0Ui={0V}\bigoplus_{i<0}U_i = \{0_V\} holds exactly for the zero space (Internal direct sum V=i<nUiV = \bigoplus_{i<n} U_i: the sum is everything and each summand meets the sum of the others only in 0V0_V).

[L2]

i<nUi\sum_{i<n}U_i is a linear subspace of VV whose elements are exactly the i<nui\sum_{i<n}u_i with uiUiu_i \in U_i; i<0Ui={0V}\sum_{i<0}U_i = \{0_V\}; and the finite sum obeys i<σ(p)ui=(i<pui)+up\sum_{i<\sigma(p)}u_i = \bigl(\sum_{i<p}u_i\bigr) + u_p (The sum U+WU + W of two linear subspaces and the sum i<nUi\sum_{i<n} U_i of a finite family, The product g0g1gn1g_0 g_1 \cdots g_{n-1} of a finite list in a monoid, by recursion, with the empty product (n=0n = 0) equal to the identity).

[L3]

A sum of a family contains each of its summands (i<nUi=span(i<nUi)\sum_{i<n} U_i = \operatorname{span}\bigl(\bigcup_{i<n} U_i\bigr), so the sum is the smallest linear subspace containing every UiU_i); the intersection of two linear subspaces is a linear subspace (The intersection of a nonempty family of linear subspaces of VV is a linear subspace of VV); and a linear subspace of VV contained in a linear subspace VV' of VV is a linear subspace of VV', 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 XX and YY of a vector space, X+YX + Y and XYX \cap Y are finite-dimensional and dimF(X+Y)+dimF(XY)=dimFX+dimFY\dim_F(X+Y) + \dim_F(X \cap Y) = \dim_F X + \dim_F Y (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); and a linear subspace of a finite-dimensional space is finite-dimensional (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).

[L5]

dimF{0V}=0\dim_F\{0_V\} = 0, and dimF\dim_F depends only on the space and the field (Finite-dimensional vector space, and its dimension dimFV\dim_F V; infinite-dimensional means having no finite basis).

[L6]

Addition makes (N,+,0)(\mathbb{N},+,0) a commutative monoid, and its finite sums satisfy i<0di=0\sum_{i<0}d_i = 0 and i<σ(p)di=(i<pdi)+dp\sum_{i<\sigma(p)}d_i = \bigl(\sum_{i<p}d_i\bigr) + d_p (Addition of natural numbers, Left identity for addition, Addition is associative, Addition is commutative, The product g0g1gn1g_0 g_1 \cdots g_{n-1} of a finite list in a monoid, by recursion, with the empty product (n=0n = 0) equal to the identity).

[L7]

Induction on N\mathbb{N}, with σ(p)=p{p}\sigma(p) = p \cup \{p\} and p={i:i<p}p = \{\,i : i < p\,\} (The principle of mathematical induction, The natural numbers N\mathbb{N} (von Neumann), On N\mathbb{N} the order is membership: m<n    mnm < n \iff m \in n, Order on the natural numbers).

Proof

technique · induction
1.1

The statement to be proved by induction on nn is: for every vector space VV over FF and every family of finite-dimensional linear subspaces UiU_i of VV indexed by i<ni < n with V=i<nUiV = \bigoplus_{i<n}U_i, the space VV is finite-dimensional with dimFV=i<ndimFUi\dim_F V = \sum_{i<n}\dim_F U_i. At n=0n = 0 the hypothesis V=i<0UiV = \bigoplus_{i<0}U_i holds exactly when V={0V}V = \{0_V\}, and then dimFV=0\dim_F V = 0, which is also the empty sum i<0dimFUi\sum_{i<0}\dim_F U_i.

baseL1L5L6
1.2

Two identities used in the successor step. Let n=σ(p)n = \sigma(p) and put V:=i<pUiV' := \sum_{i<p}U_i, a linear subspace of VV. First, V=ipUiV' = \sum_{i \ne p}U_i: an element of the right-hand side is i<σ(p)ui\sum_{i<\sigma(p)}u_i with uiUiu_i \in U_i for i<pi < p and up=0Vu_p = 0_V, and the recursion makes that (i<pui)+0V=i<pui\bigl(\sum_{i<p}u_i\bigr) + 0_V = \sum_{i<p}u_i, so the two sets have the same elements. Second, V+Up=i<σ(p)UiV' + U_p = \sum_{i<\sigma(p)}U_i: an element of the left-hand side is (i<pui)+up\bigl(\sum_{i<p}u_i\bigr) + u_p with uiUiu_i \in U_i for i<pi < p and upUpu_p \in U_p, which by the recursion is i<σ(p)ui\sum_{i<\sigma(p)}u_i, and conversely.

L1L2
1.3

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

ih
2.1

The successor step. Let n=σ(p)n = \sigma(p), let V=i<σ(p)UiV = \bigoplus_{i<\sigma(p)}U_i with every UiU_i finite-dimensional, and let V:=i<pUiV' := \sum_{i<p}U_i as in step 1.2. Then V=i<pUiV' = \bigoplus_{i<p}U_i as a direct sum inside VV': condition (D1) holds by the definition of VV', and for j<pj < p every element i<pui\sum_{i<p}u_i with uiUi(j)u_i \in U^{(j)}_i is also i<σ(p)ui\sum_{i<\sigma(p)}u_i after setting up:=0VUpu_p := 0_V \in U_p, so i<pUi(j)\sum_{i<p}U^{(j)}_i is contained in the corresponding sum for the family indexed by σ(p)\sigma(p), and (D2) for the larger family at jj forces Uji<pUi(j)={0V}U_j \cap \sum_{i<p}U^{(j)}_i = \{0_V\}, the reverse inclusion holding because both sides are linear subspaces. Each UiU_i with i<pi < p is contained in VV' and is therefore a linear subspace of VV', still finite-dimensional. So step 1.3 applies to VV' and gives that VV' is finite-dimensional with dimFV=i<pdimFUi\dim_F V' = \sum_{i<p}\dim_F U_i. Now VV' and UpU_p are finite-dimensional linear subspaces of VV; by step 1.2 their sum is i<σ(p)Ui=V\sum_{i<\sigma(p)}U_i = V, and their intersection is UpipUi={0V}U_p \cap \sum_{i \ne p}U_i = \{0_V\} by (D2) at j=pj = p. The dimension formula therefore gives dimFV+dimF{0V}=dimFV+dimFUp\dim_F V + \dim_F\{0_V\} = \dim_F V' + \dim_F U_p, that is dimFV=(i<pdimFUi)+dimFUp=i<σ(p)dimFUi\dim_F V = \bigl(\sum_{i<p}\dim_F U_i\bigr) + \dim_F U_p = \sum_{i<\sigma(p)}\dim_F U_i, and VV 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 nn, so the statement holds for every nNn \in \mathbb{N}; at n=2n = 2 it reads dimF(U0U1)=i<2dimFUi=dimFU0+dimFU1\dim_F(U_0 \oplus U_1) = \sum_{i<2}\dim_F U_i = \dim_F U_0 + \dim_F U_1, by the recursion for finite sums of naturals.

step 1.1step 2.1L6L7discharge-induction

Remarks

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · next 3 levels

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