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 : the sum is everything and each summand meets the sum of the others only in
Definition
Let be a vector space over a field (Vector space over a field), let , and let be a finite family of linear subspaces of indexed by (Linear subspace of a vector space, The sum of two linear subspaces and the sum of a finite family); as everywhere on this page the index runs over the von Neumann natural (The natural numbers (von Neumann), On the order is membership: ).
The sum of the other summands. The set is a linear subspace of : it contains , it is closed under addition since , and it is closed under scalar multiplication since (In any vector space , , , , and forces or ). So for each the family defined by
is again a finite family of linear subspaces of indexed by , and we write
a linear subspace of by The sum of two linear subspaces and the sum of a finite family. Replacing the -th summand by , rather than re-indexing over a smaller set, keeps every family on this page indexed by a natural number.
The definition. is the internal direct sum of the family , written
when both of the following hold:
- (D1) ;
- (D2) for every , .
In (D2) the inclusion is automatic, since and are linear subspaces and each therefore contains ; the content of (D2) is the inclusion , that no nonzero vector of is a sum of vectors drawn from the other summands.
Two summands
Take and write , . For the family is , so ; for it is in the same way. So (D2) reduces to the single condition , and
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 the condition (D2) is strictly stronger than requiring for all .
That (D2) implies the pairwise condition is immediate: for with we have , since a sum of a family contains each of its summands (, so the sum is the smallest linear subspace containing every ), so , 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 ( if and only if every is with in exactly one way; equivalently, if and only if the sum is and with forces every ) would be false for it.
The empty family
contains , so is a genuine case. Then (The sum of two linear subspaces and the sum of a finite family) and (D2) is vacuous, there being no . So holds exactly when : the zero space is the direct sum of the empty family, and no other space is.
Remarks
-
"Internal" is the operative word. The summands here are linear subspaces of one given space , and the direct sum is a property of that configuration, not a construction producing a new space out of unrelated ones. No external direct sum, and no product of vector spaces, is defined on this page.
-
The notation is reserved for the direct case. Writing asserts nothing beyond The sum of two linear subspaces and the sum of a finite family; writing asserts (D1) and (D2) as well. In particular the symbol is not used for a sum that has merely been checked to be everything.
-
What (D2) is for. It is exactly the condition that makes decompositions unique: holds if and only if every is with in exactly one way. That equivalence is if and only if every is with in exactly one way; equivalently, if and only if the sum is and with forces every , and it is the reason the definition is worth stating in this form rather than in terms of uniqueness directly.
Depends on
- The sum $U + W$ of two linear subspaces and the sum $\sum_{i<n} U_i$ of a finite family
- $\sum_{i<n} U_i = \operatorname{span}\bigl(\bigcup_{i<n} U_i\bigr)$, so the sum is the smallest linear subspace containing every $U_i$
- Linear subspace of a vector space
- Vector space over a field
- In any vector space $0_F v = 0_V$, $\lambda 0_V = 0_V$, $(-\lambda)v = -(\lambda v)$, $(-1_F)v = -v$, and $\lambda v = 0_V$ forces $\lambda = 0_F$ or $v = 0_V$
- The natural numbers $\mathbb{N}$ (von Neumann)
- On $\mathbb{N}$ the order is membership: $m < n \iff m \in n$
Used by
- Every linear subspace U of a vector space V has a complement: a linear subspace W with V = U ⊕ W Corollary
- If V = bigoplus_i<n Uᵢ with every Uᵢ finite-dimensional, then V is finite-dimensional and dim_F V = ∑_i<n dim_F Uᵢ; in particular dim_F(U ⊕ W) = dim_F U + dim_F W Corollary
- Three lines in F² that meet pairwise only in 0 and whose sum is F² with decompositions that are not unique, so pairwise trivial intersection does not give a direct sum Counterexample
- In F³ the three coordinate lines are linear subspaces whose internal direct sum is F³, and F⁰ is the zero space Example
- Two planes in F³ whose sum is F³ and whose intersection is a line, computed explicitly Example
- Assuming the Axiom of Choice, ℝ has a Hamel basis over ℚ: there is B ⊆ ℝ such that every real is a finite ℚ-linear combination of elements of B in exactly one way, and each basis vector carries a well-defined ℚ-linear coefficient map Lemma
- V = bigoplus_i<n Uᵢ if and only if every v ∈ V is ∑_i<n uᵢ with uᵢ ∈ Uᵢ in exactly one way; equivalently, if and only if the sum is V and ∑_i<n uᵢ = 0_V with uᵢ ∈ Uᵢ forces every uᵢ = 0_V Lemma
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
- Direct sum of modules (Wikipedia) (standard reference, not scraped)
- S. Axler, Linear Algebra Done Right, 4th ed., Ch. 1 (standard reference, not scraped)
- Direct sum (Encyclopedia of Mathematics) (standard reference, not scraped)