12.15.2 Tensor Direct Sum Component Separation

Tensor Direct Sum Component Separation breaks down tensor components into distinct, additive parts, enabling clearer analysis and manipulation within algebraic structures.

Tensor Direct Sum Component Separation is the process, and accompanying uniqueness guarantee, of decomposing a single element of a direct sum into the individual pieces contributed by each summand, particularly in the internal setting where a tensor space V is presented as an internal direct sum V = U₁ + U₂ + ... + Uₙ of subspaces rather than as an external tuple construction from the outset. Where factor selection names which summand is of interest and extracts it via the canonical projection, component separation is the more general act of taking an arbitrary element and splitting it, all at once, into its full complement of pieces, one per summand, verifying that this splitting exists and is unique.

Separation in the Internal Direct Sum Setting

The Defining Condition for an Internal Direct Sum

V = U_{1} + U_{2} ​ ​ is direct ​ ​ \Leftrightarrow ​ ​ U_{1} \cap U_{2} = {0}

When V is spanned by subspaces U₁ and U₂, the sum U₁ + U₂ is called direct precisely when the two subspaces intersect only at the zero vector. This intersection condition is exactly what makes component separation well-defined: it is the internal counterpart of the external direct sum construction's built-in uniqueness of tuples.

Existence of a Separation

Given v ∈ V = U₁ + U₂, the defining property of a sum of subspaces guarantees v can be written as v = u₁ + u₂ for some u₁ ∈ U₁ and u₂ ∈ U₂; this is simply what it means for V to equal the sum U₁ + U₂. Existence of a separation is therefore immediate from the definition of the sum, without yet using directness.

Uniqueness of a Separation

v = u_{1} + u_{2} = {u^{'}}_{1} + {u^{'}}_{2} ​ ​ \Rightarrow ​ ​ u_{1} = {u^{'}}_{1}, ​ ​ u_{2} = {u^{'}}_{2}

If v admits two separations, rearranging gives u₁ − u₁′ = u₂′ − u₂, whose left side lies in U₁ and whose right side lies in U₂. By the trivial-intersection condition, both sides must equal 0, forcing u₁ = u₁′ and u₂ = u₂′. This is the precise mechanism by which directness of the sum upgrades mere existence of a separation into full uniqueness.

Separation as a Linear Operation

Well-Definedness as a Function of v

Because the separation of each v into u₁ and u₂ is unique, the assignments v ↦ u₁ and v ↦ u₂ are genuine functions of v, and in fact linear maps, coinciding exactly with the canonical projections π₁ and π₂ associated with the direct sum decomposition. Component separation and the canonical projection operations are therefore two descriptions of the same underlying process, one emphasizing the splitting itself and the other emphasizing the individual output for a fixed target summand.

Separation of a Basis-Expressed Element

v = \sum_{i} c_{i} e_{i}

If a basis of V is chosen by concatenating a basis of U₁ with a basis of U₂, separation of v reduces to sorting its coordinates cᵢ according to which half of the concatenated basis each eᵢ belongs to, then reassembling each sorted group into the corresponding summand's element. This gives a fully explicit, computational procedure for component separation once such an adapted basis has been fixed.

Diagram of Component Separation

Failure of Separation Outside the Direct Case

Nontrivial Intersection Breaks Uniqueness

If U₁ ∩ U₂ contains a nonzero vector z, then any separation v = u₁ + u₂ can be altered to v = (u₁ + z) + (u₂ − z), producing a second, equally valid separation. Component separation is therefore only a well-defined single-valued operation precisely when the trivial-intersection condition holds; outside of it, the term "the separation of v" ceases to refer to anything determinate.

Detecting Non-Directness Before Attempting Separation

Before relying on component separation in a computation, it is necessary to confirm U₁ ∩ U₂ = {0} (or the analogous pairwise-intersection conditions for more than two summands), typically by checking that the dimension of the sum equals the sum of the individual dimensions, dim(U₁ + U₂) = dim(U₁) + dim(U₂), which holds if and only if the sum is direct.

Extension to Several Summands

Pairwise Intersection Is Insufficient for More Than Two Summands

For three or more subspaces U₁, U₂, U₃, directness of the sum U₁ + U₂ + U₃ requires more than pairwise trivial intersections; it requires each Uₖ to intersect the sum of the remaining subspaces only at zero, Uₖ ∩ (Σⱼ≠ₖ Uⱼ) = {0} for every k. This stronger condition is exactly what is needed to guarantee a unique separation v = u₁ + u₂ + u₃ for every v, generalizing the two-summand uniqueness argument given above.

Iterated Separation

Given a valid multi-summand direct sum, component separation into n pieces can be computed by iterating the two-summand case: first separating v relative to U₁ and (U₂ + ... + Uₙ), then recursively separating the second piece relative to U₂ and (U₃ + ... + Uₙ), and so on, ultimately producing the same unique n-fold separation regardless of the order in which the iteration is carried out.