Alphabeta Math
DefinitionDefinition: AI-adaptedProof: AI-generatedjudge 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<nUi: the sum is everything and each summand meets the sum of the others only in 0V

Definition

Let V be a vector space over a field F (Vector space over a field), let n∈N, and let U be a finite 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); as everywhere on this page the index runs over the von Neumann natural n={0,…,n−1} (The natural numbers N (von Neumann), On N the order is membership: m<n  ⟺  m∈n).

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

Ui(j):=Ui(i≠j),Uj(j):={0V}

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

∑i≠jUi  :=  ∑i<nUi(j),

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

The definition. V is the internal direct sum of the family U, written

V  =  ⨁i<nUi,

when both of the following hold:

  • (D1) ∑i<nUi=V;
  • (D2) for every j<n, Uj∩∑i≠jUi={0V}.

In (D2) the inclusion ⊇ is automatic, since Uj and ∑i≠jUi are linear subspaces and each therefore contains 0V; the content of (D2) is the inclusion ⊆, that no nonzero vector of Uj is a sum of vectors drawn from the other summands.

Two summands

Take n=2 and write U:=U0, W:=U1. For j=0 the family U(0) is {0V},W, so ∑i≠0Ui={ 0V+w:w∈W }=W; for j=1 it is U in the same way. So (D2) reduces to the single condition U∩W={0V}, and

V=U⊕WmeansU+W=V  and  U∩W={0V}.

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 n≥3 the condition (D2) is strictly stronger than requiring Ui∩Uj={0V} for all i≠j.

That (D2) implies the pairwise condition is immediate: for i≠j with i,j<n we have Ui=Ui(j)⊆∑i≠jUi, since 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), so Uj∩Ui⊆Uj∩∑i≠jUi={0V}, 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<nUi if and only if every v∈V is ∑i<nui with ui∈Ui in exactly one way; equivalently, if and only if the sum is V and ∑i<nui=0V with ui∈Ui forces every ui=0V) would be false for it.

The empty family

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

Remarks

Depends on

Used by

Dependency tree · two levels

34 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