In my previous post I offered a more formal definition of a block diagonal matrix, and claimed that we can partition an arbitrary by square matrix into block diagonal form in a way that is both maximal (i.e., no partitioning with more partitions exists) and unique (only one partitioning exists with that exact number of partitions). In this post I lay the groundwork for a formal proof of this by working through an example of partitioning such a matrix into block diagonal form.
Let’s start with an example matrix:
and then consider alternative choices for the first partition:
In each alternative partition we move the partitioning lines down one row and right one column, each time considering a candidate for the first diagonal submatrix . We stop at the point when there are only zeroes below and to the right of the candidate submatrix. Our first submatrix is then the 3 by 3 matrix in the upper left.
We then repeat the process, drawing new partitioning lines down one row and right one column:
Since the 1 by 1 matrix containing zero as its only entry has only zeroes below it and to the right of it, we choose it as our second submatrix .
At this point we cannot draw any further partitioning lines, so we choose as our last submatrix the 1 by 1 matrix in the lower right. We have thus partitioned into block diagonal form with three submatrices on the diagonal.
Based on the process we followed it is apparent (or at least very plausible) that this is the only way to partition into block diagonal form with three submatrices on the diagonal, and also that we could not have partitioned into more than three submatrices on the diagonal and still have it be block diagonal according to the definition above.
Next we look at two extreme examples. In our first matrix the process of partitioning fails on the first step, in the sense that we cannot find suitable lines of partition for the first submatrix. No matter the choice of partition lines, the candidate submatrix never has only zeroes below it or to the right of it:
We conclude that this matrix can be considered to be in block diagonal form, but with only a single partition; in other words, and . As with the previous example this partitioning appears to be maximal, in that we can see no way to partition the matrix into two submatrices and have it be in block diagonal form. The partitioning is also obviously unique.
With the next example matrix the very first pair of partitioning lines we try produces a suitable submatrix with zeroes to the right and below, and each subsequent pair of lines does as well:
This matrix is a diagonal matrix with all entries off the diagonal being zero. We conclude that every diagonal matrix is also a block diagonal matrix with the number of partitions , and with each diagonal submatrix . The partitioning is clearly both maximal and unique, since we cannot have more than partitions of the rows and columns of an by matrix, and only one way exists to partition an by matrix into partitions.
In part 2 of this series I formalize the method used above to partition the example matrices into block diagonal form.