o GZŽhâBã@s¤dZddlmZddlmZddlmZmZddlm Z ddl m Z m Z dd „Z d d „Zd d „Zdd„Zdd„Zdd„Zdd„Zdd„Zdd„Zdddœdd„ZdS)z,Functions returning normal forms of matricesé)Ú defaultdicté)Ú DomainMatrix)Ú DMDomainErrorÚ DMShapeError)Úsymmetric_residue)ÚQQÚZZcCst|ƒ}t ||j|j¡}|S)aI 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_factorsrÚdiagÚdomainÚshape)ÚmÚinvsÚsmf©rúO/var/www/auris/lib/python3.10/site-packages/sympy/polys/matrices/normalforms.pyÚsmith_normal_formsrcCsì|j}|j}|j}| ¡}t|dƒD]}t|dƒD]}||kr"q||||ks.dSqqt|d|dƒ}td|ƒD]5}||d|d|krX||||krWdSq>| |||||d|d¡d}||krsdSq>dS)z8 Checks that the matrix is in Smith Normal Form rrFT)r r ÚzeroÚto_listÚrangeÚminÚdiv)rr r rÚiÚjÚupperÚrrrrÚis_smith_normal_form(s.ÿýÿ(ÿrc Csbtt|ƒƒD](}|||}|||||||||<|||||||||<qdS©N©rÚlen© rrrÚaÚbÚcÚdÚkÚerrrÚ add_columnsEs   "ýr(cCs$|j}|j}| ¡}t|||ddS)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 F©r Úfull)r r rÚ_smith_normal_decomp)rr r rrrr Ns r c Csr|j}|j\}}}| ¡}t|||dd\}}}t |||¡ ¡}t||||fd}t||||fd}|||fS)aå Return the Smith-Normal form decomposition of matrix `m`. Examples ======== >>> from sympy import ZZ >>> from sympy.polys.matrices import DomainMatrix >>> from sympy.polys.matrices.normalforms import smith_normal_decomp >>> m = DomainMatrix([[ZZ(12), ZZ(6), ZZ(4)], ... [ZZ(3), ZZ(9), ZZ(6)], ... [ZZ(2), ZZ(16), ZZ(14)]], (3, 3), ZZ) >>> a, s, t = smith_normal_decomp(m) >>> assert a == s * m * t Tr))r r )r r rr+rr Úto_dense) rr ÚrowsÚcolsr rÚsÚtrrrrÚsmith_normal_decomp`s r1c sHˆjs dˆ›}t|ƒ‚|\‰‰ˆj‰ ˆj‰‡‡ fdd„}d|vr.ˆr,d|ˆƒ|ˆƒfSdSˆr8|ˆƒ‰|ˆƒ‰ dd„‰‡‡‡‡‡‡‡ fdd „}‡‡‡‡‡ ‡ fd d „}‡‡ fd d „tˆƒDƒ}|rŒ|dˆ krŒˆ|dˆdˆd<ˆ|d<ˆr‹ˆ|dˆdˆd<ˆ|d<nB‡‡ fdd „tˆƒDƒ}|rÎ|dˆ krΈD]} | |d| d| d<| |d<q¢ˆrΈ D]} | |d| d| d<| |d<qºt‡‡ fdd„tdˆƒDƒƒsít‡‡ fdd„tdˆƒDƒƒr|ƒ|ƒt‡‡ fdd„tdˆƒDƒƒsít‡‡ fdd„tdˆƒDƒƒsí‡fdd„} ˆdddkrUˆ ˆdd¡‰ˆjr5dˆdd‰ˆˆjkrUˆddˆ9<ˆrU‡fdd „ˆdDƒˆd<d|vr]d} ngdd „ˆdd…Dƒ} t| ˆˆdˆdfˆd} ˆrÂ| \} }}dgdgˆdgdd „|Dƒ}dgdgˆdgdd „|Dƒ}t t | ˆ|ˆ |gƒƒ\‰}‰ }|ˆ‰ˆ |‰ ˆ  ¡‰ˆ   ¡‰ n| } ˆddrnˆddg}|  | ¡tt |ƒdƒD]}||||d}}|rlˆ ||¡dˆ krlˆrˆ ||¡\}}}nˆ ||¡}ˆ ||¡d}ˆr^ˆ ||¡d}ˆˆ||ddd|dƒtˆ ||dd|ddƒˆˆ||dd| ddƒtˆ ||ddd| dƒˆˆ||dddddƒ||||d<|||<qßn(ˆrˆdkrˆdd…ˆdg‰ˆdkrdd „ˆ Dƒ‰ | ˆddf}ˆr t|ƒˆˆ fSt|ƒS)zë Return the tuple of abelian invariants for a matrix `m` (as in the Smith-Normal form). If `full=True` then invertible matrices ``s, t`` such that the product ``s, m, t`` is the Smith Normal Form are also returned. zBThe matrix entries must be over a principal ideal domain, but got cs‡‡‡fdd„tˆƒDƒS)Ncs&g|]‰‡‡‡fdd„tˆƒDƒ‘qS)csg|] }|ˆkr ˆnˆ‘qSrr©Ú.0r)rÚonerrrÚ Œsz@_smith_normal_decomp..eye...©r)r3)Únr4r)rrr5Œs&z5_smith_normal_decomp..eye..r6©r7)r4rr8rÚeye‹sz!_smith_normal_decomp..eyerrc Ssftt|dƒƒD](}|||}|||||||||<|||||||||<qdS)Nrrr!rrrÚadd_rows˜s   "ýz&_smith_normal_decomp..add_rowsc sòˆdd}tdˆƒD]k}ˆ|dˆkrq ˆ ˆ|d|¡\}}|ˆkr?ˆˆd|dd| dƒˆr>ˆˆd|dd| dƒq ˆ |ˆ|d¡\}}}ˆ ˆ|d|¡}ˆ ||¡}ˆˆd||||| ƒˆrtˆˆd||||| ƒ|}q dS©Nrr)rrÚgcdexÚexquo© Zpivotrr%rr"r#ÚgZd_0Zd_j)r:r r*rr-r/rrrÚ clear_column ó$ € ñz*_smith_normal_decomp..clear_columnc sòˆdd}tdˆƒD]k}ˆd|ˆkrq ˆ ˆd||¡\}}|ˆkr?tˆd|dd| dƒˆr>tˆd|dd| dƒq ˆ |ˆd|¡\}}}ˆ ˆd||¡}ˆ ||¡}tˆd||||| ƒˆrttˆd||||| ƒ|}q dSr;)rrr(r<r=r>)r.r r*rr0rrrÚ clear_row´rAz'_smith_normal_decomp..clear_rowcs g|] }ˆ|dˆkr|‘qS©rrr2©rrrrr5Éó z(_smith_normal_decomp..cs g|] }ˆd|ˆkr|‘qSrCr)r3rrDrrr5ÏrEc3s |] }ˆd|ˆkVqdS©rNrr2rDrrÚ Øó€z'_smith_normal_decomp..rc3s |] }ˆ|dˆkVqdSrFrr2rDrrrGÙrHcst|t|ƒt|dƒfˆdS)Nr)r r )rr )r)r rrÚto_domain_matrixÝsz._smith_normal_decomp..to_domain_matrixcsg|]}|ˆ‘qSrr)r3Úelem)r$rrr5çscSsg|]}|dd…‘qS)rNr)r3rrrrr5ìsNr)cSóg|]}dg|‘qSrCr©r3Úrowrrrr5ñócSrKrCrrLrrrr5òrNéÿÿÿÿcSs"g|] }|dd…|dg‘qS)rNrrrLrrrr5s")Zis_PIDÚ ValueErrorrr4rÚanyZcanonical_unitZis_Fieldr+ÚlistÚmaprÚextendr rr<Úgcdr(Útuple)rr r r*Úmsgr9r@rBÚindrMrIrZ lower_rightÚretZs_smallZt_smallÚs2Út2Úresultrr"r#ÚxÚyr%ÚalphaÚbetar) r:r$r.r r*rr4r-r/r0rrr+|sº ""€$$ÿýÿ   ÿ $$    €  r+cCsDt ||¡\}}}|dkr||dkrd}|dkrdnd}|||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. rrOr)r r<)r"r#r]r^r?rrrÚ_gcdex"s  rac Csj|jjstdƒ‚|j\}}| ¡ ¡}|}t|dddƒD]ˆ}|dkr%n|d8}t|dddƒD]6}|||dkrgt||||||ƒ\}}}||||||||} } t|||||| | ƒq1|||} | dkrt|||ddddƒ| } | dkrˆ|d7}qt|d|ƒD]}|||| } t|||d| ddƒqqt   |  ¡¡dd…|d…fS)aè Compute the Hermite Normal Form of DomainMatrix *A* over :ref:`ZZ`. Parameters ========== A : :py:class:`~.DomainMatrix` over domain :ref:`ZZ`. Returns ======= :py:class:`~.DomainMatrix` The HNF of matrix *A*. Raises ====== DMDomainError If the domain of the matrix is not :ref:`ZZ`. References ========== .. [1] Cohen, H. *A Course in Computational Algebraic Number Theory.* (See Algorithm 2.4.5.) úMatrix must be over domain ZZ.rrOrN) r Úis_ZZrr Zto_ddmÚcopyrrar(rZfrom_repZ to_dfm_or_ddm) ÚArr7r&rrÚuÚvr%rr/r#ÚqrrrÚ_hermite_normal_form7s4   "€  þric CsÚ|jjstdƒ‚t |¡r|dkrtdƒ‚dd„}ttƒ}|j\}}||kr*tdƒ‚|  ¡}|}|}t |dddƒD]¨}|d8}t |dddƒD]7} ||| dkrt |||||| ƒ\} } } |||| ||| | } }||||| | | | | ƒqH|||}|dkr’||||<}t ||ƒ\} } } t |ƒD]}| |||||||<qž|||dkr½||||<t |d|ƒD]} ||| |||}t || |d| ddƒqÄ|| }q:t |||ftƒ ¡S) a[ Perform the mod *D* Hermite Normal Form reduction algorithm on :py:class:`~.DomainMatrix` *A*. Explanation =========== If *A* is an $m \times n$ matrix of rank $m$, having Hermite Normal Form $W$, and if *D* is any positive integer known in advance to be a multiple of $\det(W)$, then the HNF of *A* can be computed by an algorithm that works mod *D* in order to prevent coefficient explosion. Parameters ========== A : :py:class:`~.DomainMatrix` over :ref:`ZZ` $m \times n$ matrix, having rank $m$. D : :ref:`ZZ` Positive integer, known to be a multiple of the determinant of the HNF of *A*. 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 matrix has more rows than columns. References ========== .. [1] Cohen, H. *A Course in Computational Algebraic Number Theory.* (See Algorithm 2.4.8.) rbrz0Modulus D must be positive element of domain ZZ.c Ssvtt|ƒƒD]2}|||} t|| ||||||ƒ|||<t|| ||||||ƒ|||<qdSr)rr r) rÚRrrr"r#r$r%r&r'rrrÚadd_columns_mod_R¶s  *,ýz8_hermite_normal_form_modulo_D..add_columns_mod_Rz2Matrix must have at least as many columns as rows.rOr)r rcrr Zof_typerÚdictr rrrrar(rr,)reÚDrkÚWrr7r&rjrrrfrgr%rr/r#ÚiirhrrrÚ_hermite_normal_form_modulo_D„sB-  "€    rpNF)rmÚ check_rankcCsF|jjstdƒ‚|dur|r| t¡ ¡|jdkrt||ƒSt|ƒS)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.) rbNr) r rcrZ convert_torZrankr rpri)rermrqrrrÚhermite_normal_formÜs ;$ rr)Ú__doc__Ú collectionsrZ domainmatrixrÚ exceptionsrrZsympy.ntheory.modularrZsympy.polys.domainsrr rrr(r r1r+rarirprrrrrrÚs"     'MX