logo

Smith Normal Form of a Matrix 📂Topological Data Analysis

Smith Normal Form of a Matrix

Definition 1 2

Given a PID, or Principal Ideal Domain RR, if there exist d1,,drRd_{1} , \cdots , d_{r} \in R and invertible matrices PRm×mP \in R^{m \times m}, QRn×nQ \in R^{n \times n} that satisfy the following for a matrix ARm×nA \in R^{m \times n}, then PAQRm×nPAQ \in R^{m \times n} is called the Smith Normal Form of AA. PAQ=[d10000000000dr000000000000]Rm×n PAQ = \begin{bmatrix} d_{1} & 0 & 0 & 0 & \cdots & 0 \\ 0 & \ddots & 0 & 0 & \cdots & 0 \\ 0 & 0 & d_{r} & 0 & \cdots & 0 \\ 0 & 0 & 0 & 0 & \cdots & 0 \\ \vdots & \vdots & \vdots & \vdots & \ddots & \vdots \\ 0 & 0 & 0 & 0 & \cdots & 0 \end{bmatrix} \in R^{m \times n} Here, d1,,drd_{1} , \cdots , d_{r} must not be 00 in RR, and it must be d1drd_{1} \mid \cdots \mid d_{r}. In other words, dk0d_{k} \ne 0 must be a [Divisor] of dk+1d_{k+1}.

Example

The inverse matrix might seem complicated, but it can actually be obtained through the Gaussian elimination method. While it’s not an official expression, to make the example easier to read, I will indicate on the right side of the matrix which operations are applied. rr- is row, cc- is column, x-x is exchange, e-e is elimination, and +-+ is the operation of multiplying by a coefficient and adding.

Of course, computing it through Gaussian elimination might not be smart in terms of computation. It’s just something to note that it can also be solved this way when calulating by hand.

Ring of Integers Z\mathbb{Z}

[231411][132114]cx(1,3)[100126]ce(12,3)[100026]re(12)[100020]ce(23) \begin{align*} \begin{bmatrix} 2 & 3 & 1 \\ 4 &-1 &-1 \end{bmatrix} \sim & & \begin{bmatrix} 1 & 3 & 2 \\ -1 &-1 & 4 \end{bmatrix} & \qquad cx(1,3) \\ \sim & & \begin{bmatrix} 1 & 0 & 0 \\ -1 & 2 & 6 \end{bmatrix} & \qquad ce(1 \to 2,3) \\ \sim & & \begin{bmatrix} 1 & 0 & 0 \\ 0 & 2 & 6 \end{bmatrix} & \qquad re(1 \to 2) \\ \sim & & \begin{bmatrix} 1 & 0 & 0 \\ 0 & 2 & 0 \end{bmatrix} & \qquad ce(2 \to 3) \end{align*}

Here, note that 121 \mid 2.

Ring of Polynomials Q[x]\mathbb{Q} [x]

[x20012x10x+1][x2x012x10x]c+(13,1)[x+12021010x]re(31,2)[210x+12010x]rx(1,2)[1202x+1001x]cx(1,2)[1200x3001x]re(12)[1000x3001x]ce(12)[10001x0x30]rx(2,3)[1000100x3x(x3)]c+(23,x)[10001000x(x3)]r+(23,(x3)) \begin{align*} \begin{bmatrix} x & 2 & 0 \\ 0 & 1 & 2x \\ -1 & 0 & x+1 \end{bmatrix} \sim & \begin{bmatrix} x & 2 & x \\ 0 & 1 & 2x \\ -1 & 0 & x \end{bmatrix} & \qquad c+(1 \to 3, 1) \\ \sim & \begin{bmatrix} x+1 & 2 & 0 \\ 2 & 1 & 0 \\ -1 & 0 & x \end{bmatrix} & \qquad re(3 \to 1, 2) \\ \sim & \begin{bmatrix} 2 & 1 & 0 \\ x+1 & 2 & 0 \\ -1 & 0 & x \end{bmatrix} & \qquad rx(1,2) \\ \sim & \begin{bmatrix} 1 & 2 & 0 \\ 2 & x+1 & 0 \\ 0 & -1 & x \end{bmatrix} & \qquad cx(1,2) \\ \sim & \begin{bmatrix} 1 & 2 & 0 \\ 0 & x-3 & 0 \\ 0 & -1 & x \end{bmatrix} & \qquad re(1 \to 2) \\ \sim & \begin{bmatrix} 1 & 0 & 0 \\ 0 & x-3 & 0 \\ 0 & -1 & x \end{bmatrix} & \qquad ce(1 \to 2) \\ \sim & \begin{bmatrix} 1 & 0 & 0 \\ 0 & 1 & -x \\ 0 & x-3 & 0 \end{bmatrix} & \qquad rx(2,3) \\ \sim & \begin{bmatrix} 1 & 0 & 0 \\ 0 & 1 & 0 \\ 0 & x-3 & x(x-3) \end{bmatrix} & \qquad c+(2 \to 3, x) \\ \sim & \begin{bmatrix} 1 & 0 & 0 \\ 0 & 1 & 0 \\ 0 & 0 & x(x-3) \end{bmatrix} & \qquad r+(2 \to 3, -(x-3)) \end{align*}

Explanation

It’s important to note that the given Principal Ideal Domain RR does not guarantee to be a Field, which means division is generally not permitted, and elimination must be performed using PID being a Bézout Domain.

Conclusion

Existence and Uniqueness

When RR is a Principal Ideal Domain, a Smith Normal Form uniquely exists for all matrices ARm×nA \in R^{m \times n}. The uniqueness here disregards the multiplication of dkd_{k} by units.

Proof

It is shown through an algorithm that specifically computes the Smith Normal Form.

See Also