Direct sum of matrices

The direct sum of two matrices is the diagonal matrix where the top-left and bottom-right corners of the matrix fill the two given matrices, and where the top-right and bottom-left corners are all zeros.

Definition

The direct sum of any pair of matrices A of size m × n and B of size p × q is a matrix of size (m + p) × (n + q) defined as:Template:Sfn

$𝐀\oplus 𝐁=\left[\begin{array}{cc}𝐀& 0\\ 0& 𝐁\end{array}\right]=\left[\begin{array}{cccccc}{a}_{11}& \cdots & a_{1n}& 0& \cdots & 0\\ ⋮& \ddots & ⋮& ⋮& \ddots & ⋮\\ a_{m1}& \cdots & a_{mn}& 0& \cdots & 0\\ 0& \cdots & 0& b_{11}& \cdots & b_{1q}\\ ⋮& \ddots & ⋮& ⋮& \ddots & ⋮\\ 0& \cdots & 0& b_{p1}& \cdots & b_{pq}\end{array}\right]$

For instance,

$\left[\begin{array}{ccc}1& 3& 2\\ 2& 3& 1\end{array}\right]\oplus \left[\begin{array}{cc}1& 6\\ 0& 1\end{array}\right]=\left[\begin{array}{ccccc}1& 3& 2& 0& 0\\ 2& 3& 1& 0& 0\\ 0& 0& 0& 1& 6\\ 0& 0& 0& 0& 1\end{array}\right]$

The direct sum of matrices is a special type of block matrix. In particular, the direct sum of square matrices is a block diagonal matrix.

The adjacency matrix of the union of disjoint graphs (or multigraphs) is the direct sum of their adjacency matrices. Any element in the direct sum of two vector spaces of matrices can be represented as a direct sum of two matrices.

In general, the direct sum of n matrices is:Template:Sfn

$\underset{i=1}{\overset{n}{⨁}}{𝐀}_i=\mathrm{diag}({𝐀}_1,{𝐀}_2,{𝐀}_3,\dots ,{𝐀}_n)=\left[\begin{array}{cccc}{𝐀}_1& 0& \cdots & 0\\ 0& {𝐀}_2& \cdots & 0\\ ⋮& ⋮& \ddots & ⋮\\ 0& 0& \cdots & {𝐀}_n\end{array}\right]$

where the zeros are actually blocks of zeros (i.e., zero matrices).

See also

• Matrix addition
• Kronecker sum

References

• Template:Cite book

External links

• Template:PlanetMath
• Abstract nonsense: Direct Sum of Linear Transformations and Direct Sum of Matrices