a RG5d3@sdZddlmZddlmZddlmZddlmZddl m Z ddl m Z ddl mZdd lmZdd lmZdd lmZd d ZddZddZeddZeGdddZeddZddZedddZdS)z'Utilities for algebraic number theory. )sympify) factorint)QQ)ZZ) DMRankError)minpoly)IntervalPrinter)public)lambdify)mpcCst|tpt|pt|S)z Test whether an argument is of an acceptable type to be used as a rational number. Explanation =========== Returns ``True`` on any argument of type ``int``, :ref:`ZZ`, or :ref:`QQ`. See Also ======== is_int ) isinstanceintrof_typercr^/var/www/html/django/DPS/env/lib/python3.9/site-packages/sympy/polys/numberfields/utilities.pyis_ratsrcCst|tpt|S)z Test whether an argument is of an acceptable type to be used as an integer. Explanation =========== Returns ``True`` on any argument of type ``int`` or :ref:`ZZ`. See Also ======== is_rat )r r rrrrrris_int)srcCst|}|j|jfS)z Given any argument on which :py:func:`~.is_rat` is ``True``, return the numerator and denominator of this number. See Also ======== is_rat )r numerator denominator)rrrrr get_num_denom>s rc Cs|ddvrtd|dkr(iddifS|dkr8iifSt|}i}i}d}|D]V\}}|ddkrd||<|ddkr|d7}|dkr|dd||<qT|d||<qTd|v}|s|ddkr|d}|dksJ|dkr|d=n |d|d<|rdnd|d<||fS)a Extract a fundamental discriminant from an integer *a*. Explanation =========== Given any rational integer *a* that is 0 or 1 mod 4, write $a = d f^2$, where $d$ is either 1 or a fundamental discriminant, and return a pair of dictionaries ``(D, F)`` giving the prime factorizations of $d$ and $f$ respectively, in the same format returned by :py:func:`~.factorint`. A fundamental discriminant $d$ is different from unity, and is either 1 mod 4 and squarefree, or is 0 mod 4 and such that $d/4$ is squarefree and 2 or 3 mod 4. This is the same as being the discriminant of some quadratic field. Examples ======== >>> from sympy.polys.numberfields.utilities import extract_fundamental_discriminant >>> print(extract_fundamental_discriminant(-432)) ({3: 1, -1: 1}, {2: 2, 3: 1}) For comparison: >>> from sympy import factorint >>> print(factorint(-432)) {2: 4, 3: 3, -1: 1} Parameters ========== a: int, must be 0 or 1 mod 4 Returns ======= Pair ``(D, F)`` of dictionaries. Raises ====== ValueError If *a* is not 0 or 1 mod 4. References ========== .. [1] Cohen, H. *A Course in Computational Algebraic Number Theory.* (See Prop. 5.1.3) )rzATo extract fundamental discriminant, number must be 0 or 1 mod 4.rr) ValueErrorritems) aZ a_factorsDFZ num_3_mod_4peevene2rrr extract_fundamental_discriminantMs66      r&c@sBeZdZdZdddZddZddZd d Zd d Zd dZ dS) AlgIntPowersa Compute the powers of an algebraic integer. Explanation =========== Given an algebraic integer $\theta$ by its monic irreducible polynomial ``T`` over :ref:`ZZ`, this class computes representations of arbitrarily high powers of $\theta$, as :ref:`ZZ`-linear combinations over $\{1, \theta, \ldots, \theta^{n-1}\}$, where $n = \deg(T)$. The representations are computed using the linear recurrence relations for powers of $\theta$, derived from the polynomial ``T``. See [1], Sec. 4.2.2. Optionally, the representations may be reduced with respect to a modulus. Examples ======== >>> from sympy import Poly, cyclotomic_poly >>> from sympy.polys.numberfields.utilities import AlgIntPowers >>> T = Poly(cyclotomic_poly(5)) >>> zeta_pow = AlgIntPowers(T) >>> print(zeta_pow[0]) [1, 0, 0, 0] >>> print(zeta_pow[1]) [0, 1, 0, 0] >>> print(zeta_pow[4]) # doctest: +SKIP [-1, -1, -1, -1] >>> print(zeta_pow[24]) # doctest: +SKIP [-1, -1, -1, -1] References ========== .. [1] Cohen, H. *A Course in Computational Algebraic Number Theory.* NcsH|_|_|_fddt|jjDddg_j_dS)a- Parameters ========== T : :py:class:`~.Poly` The monic irreducible polynomial over :ref:`ZZ` defining the algebraic integer. modulus : int, None, optional If not ``None``, all representations will be reduced w.r.t. this. csg|]}| qSrr).0rselfrr z)AlgIntPowers.__init__..N)Tmodulusdegreenreversedreppowers_n_and_up max_so_far)r*r.r/rr)r__init__s  &zAlgIntPowers.__init__cCs|jdur|S||jSN)r/)r*exprrrredszAlgIntPowers.redcCs ||Sr7)r9)r*otherrrr__rmod__szAlgIntPowers.__rmod__c sj}||krdSjjdt|d|dD]VdddgfddtdDq8|_dS)Nrrcs4g|],}d|d|qS)rrr(ibrkr1rr*rrr+sz3AlgIntPowers.compute_up_through..)r5r1r4rangeappend)r*r#mrr>rcompute_up_throughs $zAlgIntPowers.compute_up_throughcsR|j}dkrtdn6|kr6fddt|DS||j|SdS)NrzExponent must be non-negative.csg|]}|krdndqS)rrrr<r#rrr+r,z$AlgIntPowers.get..)r1rrArDr4)r*r#r1rrErgets  zAlgIntPowers.getcCs ||Sr7)rF)r*itemrrr __getitem__szAlgIntPowers.__getitem__)N) __name__ __module__ __qualname____doc__r6r9r;rDrFrHrrrrr's'  r'ccs|}|g|}||ks(||vs(| |vr6|ddV|d}||| krV|d8}q>||d8<t|d|D] }|||<qtt|D]}||dkrqq|d7}|g|}qdS)a[ Generate coefficients for searching through polynomials. Explanation =========== Lead coeff is always non-negative. Explore all combinations with coeffs bounded in absolute value before increasing the bound. Skip the all-zero list, and skip any repeats. See examples. Examples ======== >>> from sympy.polys.numberfields.utilities import coeff_search >>> cs = coeff_search(2, 1) >>> C = [next(cs) for i in range(13)] >>> print(C) [[1, 1], [1, 0], [1, -1], [0, 1], [2, 2], [2, 1], [2, 0], [2, -1], [2, -2], [1, 2], [1, -2], [0, 2], [3, 3]] Parameters ========== m : int Length of coeff list. R : int Initial max abs val for coeffs (will increase as search proceeds). Returns ======= generator Infinite generator of lists of coefficients. Nrr)rA)rCRZR0rjr=rrr coeff_searchs%     rOcCsj|j\}}||||j}|\}}|d|tt|krJtd|dd|df}|}|S)ax Extend a basis for a subspace to a basis for the whole space. Explanation =========== Given an $n \times r$ matrix *M* of rank $r$ (so $r \leq n$), this function computes an invertible $n \times n$ matrix $B$ such that the first $r$ columns of $B$ equal *M*. This operation can be interpreted as a way of extending a basis for a subspace, to give a basis for the whole space. To be precise, suppose you have an $n$-dimensional vector space $V$, with basis $\{v_1, v_2, \ldots, v_n\}$, and an $r$-dimensional subspace $W$ of $V$, spanned by a basis $\{w_1, w_2, \ldots, w_r\}$, where the $w_j$ are given as linear combinations of the $v_i$. If the columns of *M* represent the $w_j$ as such linear combinations, then the columns of the matrix $B$ computed by this function give a new basis $\{u_1, u_2, \ldots, u_n\}$ for $V$, again relative to the $\{v_i\}$ basis, and such that $u_j = w_j$ for $1 \leq j \leq r$. Examples ======== Note: The function works in terms of columns, so in these examples we print matrix transposes in order to make the columns easier to inspect. >>> from sympy.polys.matrices import DM >>> from sympy import QQ, FF >>> from sympy.polys.numberfields.utilities import supplement_a_subspace >>> M = DM([[1, 7, 0], [2, 3, 4]], QQ).transpose() >>> print(supplement_a_subspace(M).to_Matrix().transpose()) Matrix([[1, 7, 0], [2, 3, 4], [1, 0, 0]]) >>> M2 = M.convert_to(FF(7)) >>> print(M2.to_Matrix().transpose()) Matrix([[1, 0, 0], [2, 3, -3]]) >>> print(supplement_a_subspace(M2).to_Matrix().transpose()) Matrix([[1, 0, 0], [2, 3, -3], [0, 1, 0]]) Parameters ========== M : :py:class:`~.DomainMatrix` The columns give the basis for the subspace. Returns ======= :py:class:`~.DomainMatrix` This matrix is invertible and its first $r$ columns equal *M*. Raises ====== DMRankError If *M* was not of maximal rank. References ========== .. [1] Cohen, H. *A Course in Computational Algebraic Number Theory* (See Sec. 2.3.2.) NzM was not of maximal rank) shapehstackeyedomainZrreftuplerArinv)Mr1rZMaugrMZpivotsABrrrsupplement_a_subspace=sC  rYNFc Cst|}|jr||fS|js$tdtd|dtd}t|dd}|jdd}tj d}}zN|s|}|D]$\}} ||j krj|j | krjd}q\qjtj d 9_ q\W|t_ n|t_ 0|d ur|j || ||d \}} || fS) a Find a rational isolating interval for a real algebraic number. Examples ======== >>> from sympy import isolate, sqrt, Rational >>> print(isolate(sqrt(2))) # doctest: +SKIP (1, 2) >>> print(isolate(sqrt(2), eps=Rational(1, 100))) (24/17, 17/12) Parameters ========== alg : str, int, :py:class:`~.Expr` The algebraic number to be isolated. Must be a real number, to use this particular function. However, see also :py:meth:`.Poly.intervals`, which isolates complex roots when you pass ``all=True``. eps : positive element of :ref:`QQ`, None, optional (default=None) Precision to be passed to :py:meth:`.Poly.refine_root` fast : boolean, optional (default=False) Say whether fast refinement procedure should be used. (Will be passed to :py:meth:`.Poly.refine_root`.) Returns ======= Pair of rational numbers defining an isolating interval for the given algebraic number. See Also ======== .Poly.intervals z+complex algebraic numbers are not supportedrmpmath)modulesprinterT)polys)sqfFrN)epsfast) r is_Rationalis_realNotImplementedErrorr rr intervalsr dpsrr? refine_root) algr_r`funcpolyrdredonerr?rrrisolates.'    rk)NF)rLsympy.core.sympifyrsympy.ntheory.factor_rZ!sympy.polys.domains.rationalfieldrZsympy.polys.domains.integerringrZsympy.polys.matrices.exceptionsr sympy.polys.numberfields.minpolyrsympy.printing.lambdareprrsympy.utilities.decoratorr Zsympy.utilities.lambdifyr rZr rrrr&r'rOrYrkrrrrs,           X^ 7W