Alphabeta Math
DefinitionDefinition: AI-adaptedProof: AI-generatedSession-authored (Fable 5 assisted)judge 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.

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

Definition

Let VV be a vector space over a field FF (Vector space over a field), let nNn \in \mathbb{N}, and let UU be a finite 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); as everywhere on this page the index runs over the von Neumann natural n={0,,n1}n = \{0, \dots, n-1\} (The natural numbers N\mathbb{N} (von Neumann), On N\mathbb{N} the order is membership: m<n    mnm < n \iff m \in n).

The sum of the other summands. The set {0V}\{0_V\} is a linear subspace of VV: it contains 0V0_V, it is closed under addition since 0V+0V=0V0_V + 0_V = 0_V, and it is closed under scalar multiplication since λ0V=0V\lambda 0_V = 0_V (In any vector space 0Fv=0V0_F v = 0_V, λ0V=0V\lambda 0_V = 0_V, (λ)v=(λv)(-\lambda)v = -(\lambda v), (1F)v=v(-1_F)v = -v, and λv=0V\lambda v = 0_V forces λ=0F\lambda = 0_F or v=0Vv = 0_V). So for each j<nj < n the family U(j)U^{(j)} defined by

Ui(j):=Ui(ij),Uj(j):={0V}U^{(j)}_i := U_i \quad (i \ne j), \qquad U^{(j)}_j := \{0_V\}

is again a finite family of linear subspaces of VV indexed by i<ni < n, and we write

ijUi  :=  i<nUi(j),\sum_{i \ne j} U_i \;:=\; \sum_{i<n} U^{(j)}_i ,

a linear subspace of VV by The sum U+WU + W of two linear subspaces and the sum i<nUi\sum_{i<n} U_i of a finite family. Replacing the jj-th summand by {0V}\{0_V\}, rather than re-indexing over a smaller set, keeps every family on this page indexed by a natural number.

The definition. VV is the internal direct sum of the family UU, written

V  =  i<nUi,V \;=\; \bigoplus_{i<n} U_i ,

when both of the following hold:

  • (D1) i<nUi=V\displaystyle\sum_{i<n} U_i = V;
  • (D2) for every j<nj < n, UjijUi={0V}\displaystyle U_j \cap \sum_{i \ne j} U_i = \{0_V\}.

In (D2) the inclusion \supseteq is automatic, since UjU_j and ijUi\sum_{i \ne j} U_i are linear subspaces and each therefore contains 0V0_V; the content of (D2) is the inclusion \subseteq, that no nonzero vector of UjU_j is a sum of vectors drawn from the other summands.

Two summands

Take n=2n = 2 and write U:=U0U := U_0, W:=U1W := U_1. For j=0j = 0 the family U(0)U^{(0)} is {0V},W\{0_V\}, W, so i0Ui={0V+w:wW}=W\sum_{i \ne 0} U_i = \{\, 0_V + w : w \in W \,\} = W; for j=1j = 1 it is UU in the same way. So (D2) reduces to the single condition UW={0V}U \cap W = \{0_V\}, and

V=UWmeansU+W=V  and  UW={0V}.V = U \oplus W \quad\text{means}\quad U + W = V \ \text{ and } \ U \cap W = \{0_V\}.

For two summands, therefore, (D2) and the pairwise condition coincide; this is the familiar form of the definition.

Three or more summands: (D2) is not the pairwise condition

For n3n \ge 3 the condition (D2) is strictly stronger than requiring UiUj={0V}U_i \cap U_j = \{0_V\} for all iji \ne j.

That (D2) implies the pairwise condition is immediate: for iji \ne j with i,j<ni, j < n we have Ui=Ui(j)ijUiU_i = U^{(j)}_i \subseteq \sum_{i \ne j} U_i, since 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), so UjUiUjijUi={0V}U_j \cap U_i \subseteq U_j \cap \sum_{i \ne j} U_i = \{0_V\}, and the reverse inclusion holds because both are linear subspaces.

The converse fails, and it fails already for three summands: a family can satisfy (D1) and have all its pairwise intersections trivial while (D2) is false, so that decompositions are not unique. The companion examples page records a witness. A definition stated with the pairwise condition in place of (D2) would therefore be a different, and weaker, notion, and the characterisation by unique decomposition (V=i<nUiV = \bigoplus_{i<n} U_i if and only if every vVv \in V is i<nui\sum_{i<n} u_i with uiUiu_i \in U_i in exactly one way; equivalently, if and only if the sum is VV and i<nui=0V\sum_{i<n} u_i = 0_V with uiUiu_i \in U_i forces every ui=0Vu_i = 0_V) would be false for it.

The empty family

N\mathbb{N} contains 00, so n=0n = 0 is a genuine case. Then i<0Ui={0V}\sum_{i<0} U_i = \{0_V\} (The sum U+WU + W of two linear subspaces and the sum i<nUi\sum_{i<n} U_i of a finite family) and (D2) is vacuous, there being no j<0j < 0. So V=i<0UiV = \bigoplus_{i<0} U_i holds exactly when V={0V}V = \{0_V\}: the zero space is the direct sum of the empty family, and no other space is.

Remarks

Depends on

Used by

Dependency tree · next 3 levels

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