This function produces a diagonal matrix
D, and invertible matrices
P and
Q such that
D = PMQ. Warning: even though this function is called the Smith normal form, it doesn't necessarily satisfy the more stringent condition that the diagonal entries
d1, d2, ..., dn of
D satisfy:
d1|d2|...|dn..
i1 : M = matrix{{1,2,3},{1,34,45},{2213,1123,6543},{0,0,0}}
o1 = | 1 2 3 |
| 1 34 45 |
| 2213 1123 6543 |
| 0 0 0 |
4 3
o1 : Matrix ZZ <--- ZZ
|
i2 : (D,P,Q) = smithNormalForm M
o2 = (| 135654 0 0 |, | 1 33471 -43292 0 |, | 171927 -42421 54868 |)
| 0 1 0 | | 0 1 0 0 | | 93042 -22957 29693 |
| 0 0 1 | | 0 0 1 0 | | -74119 18288 -23654 |
| 0 0 0 | | 0 0 0 1 |
o2 : Sequence
|
i3 : D == P * M * Q
o3 = true
|
i4 : (D,P) = smithNormalForm(M, ChangeMatrix=>{true,false})
o4 = (| 135654 0 0 |, | 1 33471 -43292 0 |)
| 0 1 0 | | 0 1 0 0 |
| 0 0 1 | | 0 0 1 0 |
| 0 0 0 | | 0 0 0 1 |
o4 : Sequence
|
i5 : D = smithNormalForm(M, ChangeMatrix=>{false,false}, KeepZeroes=>true)
o5 = | 135654 0 0 |
| 0 1 0 |
| 0 0 1 |
3 3
o5 : Matrix ZZ <--- ZZ
|
This function is the underlying routine used by minimalPresentation in the case when the ring is ZZ, or a polynomial ring in one variable over a field.
i6 : prune coker M
o6 = cokernel | 135654 |
| 0 |
2
o6 : ZZ-module, quotient of ZZ
|
In the following example, we test the result be checking that the entries of
D1, P1 M Q1 are the same. The degrees associated to these matrices do not match up, so a simple test of equality would return false.
i7 : S = ZZ/101[t]
o7 = S
o7 : PolynomialRing
|
i8 : D = diagonalMatrix{t^2+1, (t^2+1)^2, (t^2+1)^3, (t^2+1)^5}
o8 = | t2+1 0 0 0 |
| 0 t4+2t2+1 0 0 |
| 0 0 t6+3t4+3t2+1 0 |
| 0 0 0 t10+5t8+10t6+10t4+5t2+1 |
4 4
o8 : Matrix S <--- S
|
i9 : P = random(S^4, S^4)
o9 = | 35 -32 -10 -1 |
| 19 44 -22 -43 |
| -31 -43 -50 35 |
| 16 -36 28 41 |
4 4
o9 : Matrix S <--- S
|
i10 : Q = random(S^4, S^4)
o10 = | 36 -18 -2 9 |
| -31 42 0 27 |
| -10 -36 -7 -46 |
| -33 -37 -44 -44 |
4 4
o10 : Matrix S <--- S
|
i11 : M = P*D*Q
o11 = | 33t10-37t8+26t6+6t4-28t2-39 37t10-17t8+23t6+5t4-33t2+39
| 5t10+25t8-33t6-48t4-46t2+50 -25t10-24t8+37t6+35t4+50t2-50
| -44t10-18t8-41t6-31t4+2t2-34 18t10-11t8-40t6+37t4+12t2-36
| -40t10+2t8+27t6-23t4-50t2-42 -2t10-10t8-18t6-11t4+17t2+18
-----------------------------------------------------------------------
44t10+18t8+5t6+44t4-44t2+44 44t10+18t8-9t6+47t4-15t2-45 |
-27t10-34t8-15t6-10t4-14t2-12 -27t10-34t8+35t6+15t4-6t2+21 |
-25t10-24t8-t6-8t4-23t2-17 -25t10-24t8+30t6+35t4+33t2+27 |
14t10-31t8+45t6-44t4-45t2-12 14t10-31t8-37t6-50t4-39t2+19 |
4 4
o11 : Matrix S <--- S
|
i12 : (D1,P1,Q1) = smithNormalForm M;
|
i13 : D1 - P1*M*Q1 == 0
o13 = true
|
i14 : prune coker M
o14 = cokernel | t10+5t8+10t6+10t4+5t2+1 0 0 0 |
| 0 t6+3t4+3t2+1 0 0 |
| 0 0 t4+2t2+1 0 |
| 0 0 0 t2+1 |
4
o14 : S-module, quotient of S
|
This routine is under development. The main idea is to compute a Gröbner basis, transpose the generators, and repeat, until we encounter a matrix whose transpose is already a Gröbner basis. This may depend heavily on the monomial order.