U ;qLe13@sdZddlmZddlmZddlmZmZddlm Z ddl m Z m Z dd Z d d Zd d ZddZddZddZdddddZdS)z,Functions returning normal forms of matrices) defaultdict) DomainMatrix) DMDomainError DMShapeError)symmetric_residue)QQZZcCst|}t||j|j}|S)aJ Return the Smith Normal Form of a matrix `m` over the ring `domain`. This will only work if the ring is a principal ideal domain. Examples ======== >>> from sympy import ZZ >>> from sympy.polys.matrices import DomainMatrix >>> from sympy.polys.matrices.normalforms import smith_normal_form >>> m = DomainMatrix([[ZZ(12), ZZ(6), ZZ(4)], ... [ZZ(3), ZZ(9), ZZ(6)], ... [ZZ(2), ZZ(16), ZZ(14)]], (3, 3), ZZ) >>> print(smith_normal_form(m).to_Matrix()) Matrix([[1, 0, 0], [0, 10, 0], [0, 0, -30]]) )invariant_factorsrdiagdomainshape)minvsZsmfrw/home/p21-0144/sympy/latex2sympy2solve-back-end/sympyEq/lib/python3.8/site-packages/sympy/polys/matrices/normalforms.pysmith_normal_formsrc Csbtt|D]P}|||}|||||||||<|||||||||<q dSN)rangelen rijabcdkerrr add_columns(s  rc stjjsd}t|djkr&dSj\}tjfddfdd}fdd }fd d tD}|r|ddkr|ddd<|d<nVfd d tD}|r |ddkr D]&}||d|d|d<||d<qtfd dtdDsHtfddtdDr\||q d|krld}n2t dd ddDddf}t |}ddrZddg} | |tt | dD]} | | rN | | d| | ddkrN| | d| | }  | | | d| | d| | d<| | | <nqlqn|ddf} t| S)a3 Return the tuple of abelian invariants for a matrix `m` (as in the Smith-Normal form) References ========== [1] https://en.wikipedia.org/wiki/Smith_normal_form#Algorithm [2] https://web.archive.org/web/20200331143852/https://sierra.nmsu.edu/morandi/notes/SmithNormalForm.pdf z8The matrix entries must be over a principal ideal domainrrc s^tD]P}|||}|||||||||<|||||||||<qdSr)rr)colsrradd_rowsHs   z#invariant_factors..add_rowsc s|dddkr|S|dd}tdD]}||ddkr@q*||d|\}}|dkrx|d|dd| dq*|||d\}}}||d|d}||d} |d||||| |}q*|SNrr)rdivgcdex rZpivotrrrrrgZd_0Zd_j)r!r rowsrr clear_columnPs z'invariant_factors..clear_columnc s|dddkr|S|dd}tdD]}|d|dkr@q*|d||\}}|dkrxt|d|dd| dq*||d|\}}}|d||d}||d} t|d||||| |}q*|Sr")rr#rr$r%)r r rr clear_rowcs z$invariant_factors..clear_rowcs g|]}|ddkr|qSrr.0rrrr wsz%invariant_factors..cs g|]}d|dkr|qSr+r)r-rr.rrr/{sc3s|]}d|dkVqdSrNrr,r.rr sz$invariant_factors..rc3s|]}|ddkVqdSr0rr,r.rrr1scSsg|]}|ddqS)rNr)r-r&rrrr/sN)r is_PID ValueErrorr listto_denserepranyrr extendrr#gcdtuple) rmsgr r)r*indrowrZ lower_rightresultrr'r)r!r r rr(rr 1sL   $$  * ,(  r cCsDt||\}}}|dkr:||dkr:d}|dkr6dnd}|||fS)a This supports the functions that compute Hermite Normal Form. Explanation =========== Let x, y be the coefficients returned by the extended Euclidean Algorithm, so that x*a + y*b = g. In the algorithms for computing HNF, it is critical that x, y not only satisfy the condition of being small in magnitude -- namely that |x| <= |b|/g, |y| <- |a|/g -- but also that y == 0 when a | b. rr)r r$)rrxyr'rrr_gcdexs rBc Csr|jjstd|j\}}|j}|}t|dddD]}|dkrPqX|d8}t|dddD]l}|||dkrht||||||\}}}||||||||} } t |||||| | qh|||} | dkrt |||dddd| } | dkr|d7}q.add_columns_mod_Rz2Matrix must have at least as many columns as rows.r?r)r rDrr of_typerdictr rr5r6rErrBrr)rGDrOWrrHrrNrrrIrJrr&rKriirLrrr_hermite_normal_form_modulo_Ds@-  "      rUNF)rR check_rankcCsJ|jjstd|dk r>|r4|t|jdkr>t||St|SdS)a) Compute the Hermite Normal Form of :py:class:`~.DomainMatrix` *A* over :ref:`ZZ`. Examples ======== >>> from sympy import ZZ >>> from sympy.polys.matrices import DomainMatrix >>> from sympy.polys.matrices.normalforms import hermite_normal_form >>> m = DomainMatrix([[ZZ(12), ZZ(6), ZZ(4)], ... [ZZ(3), ZZ(9), ZZ(6)], ... [ZZ(2), ZZ(16), ZZ(14)]], (3, 3), ZZ) >>> print(hermite_normal_form(m).to_Matrix()) Matrix([[10, 0, 2], [0, 15, 3], [0, 0, 2]]) Parameters ========== A : $m \times n$ ``DomainMatrix`` over :ref:`ZZ`. D : :ref:`ZZ`, optional Let $W$ be the HNF of *A*. If known in advance, a positive integer *D* being any multiple of $\det(W)$ may be provided. In this case, if *A* also has rank $m$, then we may use an alternative algorithm that works mod *D* in order to prevent coefficient explosion. check_rank : boolean, optional (default=False) The basic assumption is that, if you pass a value for *D*, then you already believe that *A* has rank $m$, so we do not waste time checking it for you. If you do want this to be checked (and the ordinary, non-modulo *D* algorithm to be used if the check fails), then set *check_rank* to ``True``. Returns ======= :py:class:`~.DomainMatrix` The HNF of matrix *A*. Raises ====== DMDomainError If the domain of the matrix is not :ref:`ZZ`, or if *D* is given but is not in :ref:`ZZ`. DMShapeError If the mod *D* algorithm is used but the matrix has more rows than columns. References ========== .. [1] Cohen, H. *A Course in Computational Algebraic Number Theory.* (See Algorithms 2.4.5 and 2.4.8.) rCNr) r rDr convert_torrankr rUrM)rGrRrVrrrhermite_normal_formVs ;$ rY)__doc__ collectionsr domainmatrixr exceptionsrrsympy.ntheory.modularrsympy.polys.domainsrr rrr rBrMrUrYrrrrs     kMX