o
    §ƒðj  ã                   @   sŠ   d Z ddlmZ ddlmZ ddlmZ ddlmZ	m
ZmZmZmZ ddd„Zdd	d
„Zddd„Z
ddd„Zddd„Zdddœdd„ZdS )z,Functions returning normal forms of matricesé    )ÚZZ)ÚPoly)ÚDomainMatrix)Úsmith_normal_formÚis_smith_normal_formÚsmith_normal_decompÚinvariant_factorsÚhermite_normal_formNc                 C   sB   t | ddƒ}|  dd„ ¡} t | ¡}|p|}|dur| |¡}|S )zConvert Matrix to DomainMatrixÚringNc                 S   s   t | tƒr	|  ¡ S | S ©N)Ú
isinstancer   Úas_expr)Úe© r   úœ/tmp/claude-1000/-var-www-html-academy/3f42efd1-c2b7-4d08-9b05-30d86bb35479/scratchpad/piper/venv/lib/python3.10/site-packages/sympy/matrices/normalforms.pyÚ<lambda>   s    z_to_domain.<locals>.<lambda>)ÚgetattrÚ	applyfuncr   Úfrom_MatrixÚ
convert_to)ÚmÚdomainr
   ÚdMr   r   r   Ú
_to_domain   s   

r   c                 C   s   t | |ƒ}t|ƒ ¡ S )aª  
    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 Matrix, ZZ
    >>> from sympy.matrices.normalforms import smith_normal_form
    >>> m = Matrix([[12, 6, 4], [3, 9, 6], [2, 16, 14]])
    >>> print(smith_normal_form(m, domain=ZZ))
    Matrix([[1, 0, 0], [0, 10, 0], [0, 0, 30]])

    )r   Ú_snfÚ	to_Matrix©r   r   r   r   r   r   r      s   
r   c                 C   s   t | |ƒ}t|ƒS )z8
    Checks that the matrix is in Smith Normal Form
    )r   Ú_is_snfr   r   r   r   r   0   s   
r   c                 C   s.   t | |ƒ}t|ƒ\}}}| ¡ | ¡ | ¡ fS )a§  
    Return the Smith Normal Decomposition of a matrix `m` over the ring
    `domain`. This will only work if the ring is a principal ideal domain.

    Examples
    ========

    >>> from sympy import Matrix, ZZ
    >>> from sympy.matrices.normalforms import smith_normal_decomp
    >>> m = Matrix([[12, 6, 4], [3, 9, 6], [2, 16, 14]])
    >>> a, s, t = smith_normal_decomp(m, domain=ZZ)
    >>> assert a == s * m * t
    )r   Ú_sndr   )r   r   r   ÚaÚsÚtr   r   r   r   8   s   
r   c                    sf   t | |ƒ‰tˆƒ}t‡fdd„|D ƒƒ}t| dƒr1| jjr1| j‰ ‡ fdd„‰t‡fdd„|D ƒƒ}|S )a9  
    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

    c                 3   s   � | ]	}ˆ j  |¡V  qd S r   )r   Úto_sympy©Ú.0Úf)r   r   r   Ú	<genexpr>Y   s   € z$invariant_factors.<locals>.<genexpr>r
   c                    s   t | ˆ jˆ jd�S )N)r   )r   Úsymbolsr   )r%   )ÚKr   r   r   ^   s    z#invariant_factors.<locals>.<lambda>c                 3   s   � | ]}ˆ |ƒV  qd S r   r   r#   )Úto_polyr   r   r&   _   s   € )r   Ú_invfÚtupleÚhasattrr
   Úis_PolynomialRing)r   r   Úfactorsr   )r(   r   r)   r   r   K   s   

r   F©ÚDÚ
check_rankc                C   s2   |durt  |¡st t|ƒƒ}t| j||d� ¡ S )a  
    Compute the Hermite Normal Form of a Matrix *A* of integers.

    Examples
    ========

    >>> from sympy import Matrix
    >>> from sympy.matrices.normalforms import hermite_normal_form
    >>> m = Matrix([[12, 6, 4], [3, 9, 6], [2, 16, 14]])
    >>> print(hermite_normal_form(m))
    Matrix([[10, 0, 2], [0, 15, 3], [0, 0, 2]])

    Parameters
    ==========

    A : $m \times n$ ``Matrix`` of integers.

    D : int, 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
    =======

    ``Matrix``
        The HNF of matrix *A*.

    Raises
    ======

    DMDomainError
        If the domain of the matrix is not :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.)

    Nr/   )r   Úof_typeÚintÚ_hnfÚ_repr   )ÚAr0   r1   r   r   r   r	   c   s   7r	   r   )Ú__doc__Úsympy.polys.domains.integerringr   Úsympy.polys.polytoolsr   Úsympy.polys.matricesr   Ú sympy.polys.matrices.normalformsr   r   r   r   r   r   r   r*   r	   r4   r   r   r   r   r   Ú<module>   s    
	



