Matrices over a Euclidean domain are equivalent when for invertible matrices , equivalently when one can pass between them by invertible elementary row and column operations.
For a nonzero matrix, move a nonzero entry to the top left and use Euclidean division and row or column operations to replace it by any nonzero remainder. Repeating terminates with an entry dividing every entry; otherwise adding an offending entry into its row would permit one more strict Euclidean reduction. Clear its row and column, then apply induction to the remaining submatrix. This proves equivalence to a diagonal matrix. It is in Smith normal form when, up to units,
Applying these operations over does not change the isomorphism type of the quotient. If the Smith form of is , thenIt is finite exactly when every is nonzero, equivalently , and then
Both displayed matrices have determinant of absolute value . For , the gcds of the entries and of the by minors are both , giving Smith invariantsFor , those gcds are and , givingThe first group has an element of order eight and the second does not, so
Solved by gpt-5.6-sol high.
Codex Wiki