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 = | 29 -19 -45 25 |
| 5 35 6 39 |
| 30 5 -22 -38 |
| 12 -30 37 -33 |
4 4
o9 : Matrix S <--- S
|
i10 : Q = random(S^4, S^4)
o10 = | -26 15 -19 43 |
| 25 1 14 34 |
| -34 -11 43 -8 |
| -27 -20 -7 -46 |
4 4
o10 : Matrix S <--- S
|
i11 : M = P*D*Q
o11 = | 32t10-42t8+32t6-9t4+16t2+30 5t10+25t8+40t6+t4-12t2+7
| -43t10-13t8-28t6+35t4-15t2-7 28t10+39t8+12t6+16t4-14t2-29
| 16t10-21t8-t6+4t4-24t2+8 -48t10-38t8-36t6+49t4+37t2+43
| -18t10+11t8-24t6+43t4-20t2-15 -47t10-33t8+32t6-4t4-23t2-1
-----------------------------------------------------------------------
27t10+34t8-49t6-44t4+14t2+2 -39t10+7t8-30t6+44t4+32t2+13 |
30t10+49t8-48t6+49t4-9t2-24 24t10+19t8-10t6-27t4+46t2-33 |
-37t10+17t8-3t6-7t4-19t2+32 31t10-47t8-19t6-2t4-10t2-50 |
29t10+44t8-38t6-3t4+12t2-38 3t10+15t8+37t6+41t4+27t2+11 |
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.