Skip to content

Direct Sum

Definition

Let V1,V2,…,VmV_1,V_2,\ldots,V_m be subspaces of VV, and let W=V1+V2+⋯+VmW=V_1+V_2+\cdots+V_m. If every w∈W\boldsymbol{w}\in W can be written in exactly one way as

w=v1+v2+⋯+vm,\boldsymbol{w}=\boldsymbol{v}_1+\boldsymbol{v}_2+\cdots+\boldsymbol{v}_m,

with vi∈Vi\boldsymbol{v}_i\in V_i, then WW is the direct sum of the subspaces, denoted

W=V1⊕V2⊕⋯⊕Vm.W=V_1\oplus V_2\oplus\cdots\oplus V_m.

Interpretation

A direct sum is a sum of subspaces in which every vector of the sum has only one decomposition: knowing w\boldsymbol{w} determines each piece vi∈Vi\boldsymbol{v}_i\in V_i. The subspaces do not overlap in a way that would allow a vector to be split in two different ways.

Two lines V1 and V2 through the origin in the plane, with a vector w written uniquely as the sum of v1 on V1 and v2 on V2.

In the figure, V1V_1 and V2V_2 are two different lines through the origin of R2\mathbb{R}^2. The parallelogram rule writes w\boldsymbol{w} as v1+v2\boldsymbol{v}_1+\boldsymbol{v}_2 with v1\boldsymbol{v}_1 on V1V_1 and v2\boldsymbol{v}_2 on V2V_2, and because the two lines meet only at 0\boldsymbol{0}, there is no other way to do it. Every vector of the plane can be split like this, so R2=V1⊕V2\mathbb{R}^2=V_1\oplus V_2.

For two subspaces, uniqueness is equivalent to V1∩V2={0}V_1\cap V_2=\{\boldsymbol{0}\}. If a nonzero u\boldsymbol{u} lay in both, then 0+0\boldsymbol{0}+\boldsymbol{0} and u+(−u)\boldsymbol{u}+(-\boldsymbol{u}) would be two different decompositions of 0\boldsymbol{0}. Conversely, if v1+v2=v1′+v2′\boldsymbol{v}_1+\boldsymbol{v}_2=\boldsymbol{v}_1'+\boldsymbol{v}_2', then v1−v1′=v2′−v2\boldsymbol{v}_1-\boldsymbol{v}_1'=\boldsymbol{v}_2'-\boldsymbol{v}_2 lies in both subspaces, so it is 0\boldsymbol{0} and the two decompositions agree. The idea is the same as in linear independence: uniqueness everywhere follows from uniqueness for 0\boldsymbol{0}.

For three or more subspaces, checking the intersections in pairs is not enough. In R2\mathbb{R}^2, the lines spanned by (1,0)(1,0), (0,1)(0,1) and (1,1)(1,1) meet pairwise only in 0\boldsymbol{0}, yet (1,1)(1,1) is both (1,0)+(0,1)+0(1,0)+(0,1)+\boldsymbol{0} and 0+0+(1,1)\boldsymbol{0}+\boldsymbol{0}+(1,1), so their sum is not direct.


Key Results

  • For two subspaces, V1+V2V_1+V_2 is direct exactly when V1∩V2={0}V_1\cap V_2=\{\boldsymbol{0}\}.

Examples

  • The xx-axis and yy-axis form a direct sum equal to R2\mathbb{R}^2.
  • Let V1={(a,0) ⁣:a∈R}V_1=\{(a,0)\colon a\in\mathbb{R}\} and V2={(0,b) ⁣:b∈R}V_2=\{(0,b)\colon b\in\mathbb{R}\}. The vector (3,−2)(3,-2) has the decomposition (3,0)+(0,−2)(3,0)+(0,-2). Any decomposition (a,0)+(0,b)=(3,−2)(a,0)+(0,b)=(3,-2) forces a=3a=3 and b=−2b=-2, so it is unique.

Prerequisites

  • Linear Dependence and Independence: uniqueness of the decomposition is the absence of a nontrivial relation between components.
  • Dimension: for finite-dimensional subspaces, dim⁡(V1⊕V2)=dim⁡V1+dim⁡V2\dim(V_1\oplus V_2)=\dim V_1+\dim V_2.

Sources

Keywords: internal direct sum, external direct sum Symbols: element of, intersection, real numbers

Last updated: 20 October 2026 03:02