Ed dZddlmZddlmZddlmZddlmZddl m Z ddl m Z dd l mZmZmZdd lmZd Zdd ZdZe ddZd S)z,Computing integral bases for number fields. )Poly)AlgebraicField)ZZ)QQ)CoercionFailed)public)ModuleEndomorphismModuleHomomorphism PowerBasis) extract_fundamental_discriminantc|j}t||}|\}}|dksJtd||}|D] \}}||z} ||z} t|t} t| t} | | z|z |z} t| |} | }|| fD]}||}||z}|}||fS)zz Apply the "Dedekind criterion" to test whether the order needs to be enlarged relative to a given prime *p*. modulusr domain)genr factor_listrgcddegree)TpxT_barlcflg_barti_bar_h_barghff_barZ_barbU_barms >lib/python3.11/site-packages/sympy/polys/numberfields/basis.py_apply_Dedekind_criterionr* s  A A   E    FB 7NNN Aq ! ! !E   UNE U2A U2A QqA A   E EU^ !  UNE A !8ONc|j}||kr |z|k t|fd}||S)a Compute the nilradical mod *p* for a given order *H*, and prime *p*. Explanation =========== This is the ideal $I$ in $H/pH$ consisting of all elements some positive power of which is zero in this quotient ring, i.e. is a multiple of *p*. Parameters ========== H : :py:class:`~.Submodule` The given order. p : int The rational prime. q : int, optional If known, the smallest power of *p* that is $>=$ the dimension of *H*. If not provided, we compute it here. Returns ======= :py:class:`~.Module` representing the nilradical mod *p* in *H*. References ========== .. [1] Cohen, H. *A Course in Computational Algebraic Number Theory*. (See Lemma 6.1.6.) Nc|zSN)rqs r)z"nilradical_mod_p..Ls !Q$r+r)nr kernel)Hrr0r2phis ` r)nilradical_mod_pr6&sfB A !e  FA!e  Q / /C ::a:  r+c t|||}|j|j|jz|j}|||zz}| t | fd}||}|j|j|jz|j|z}||z} | |fS)zD Perform the second enlargement in the Round Two algorithm. )r0)denomc.|Sr.)inner_endomorphism)rEs r)r1z%_second_enlargement..XsQ-A-A!-D-Dr+r)r6parentsubmodule_from_matrixmatrixr8endomorphism_ringr r3) r4rr0IpBCr5gammaGH1r;s @r)_second_enlargementrFPs !Q! $ $ $B &&qx")';17&KKA AaCA A Q#D#D#D#D E EC JJqJ ! !E &&qx%,'>agPQk&RRA QB r6Mr+cd}t|tr||j}}|jt kr( t |t}n#t$rYnwxYw|j r|j r|j r|jtkstd| }|}tjt!|}t#|\}}t%|p|}|} d} |r|\} } t+|| \} }|dkr3|t | t}| || z| z|} | |kr| }||kr || z}||k t1| | |\}} || kr|} t1| | |\}} || k|| t|t2r| || <| }d|_d|_||jdzz|jd|zzz}||fS)a Zassenhaus's "Round 2" algorithm. Explanation =========== Carry out Zassenhaus's "Round 2" algorithm on a monic irreducible polynomial *T* over :ref:`ZZ`. This computes an integral basis and the discriminant for the field $K = \mathbb{Q}[x]/(T(x))$. Alternatively, you may pass an :py:class:`~.AlgebraicField` instance, in place of the polynomial *T*, in which case the algorithm is applied to the minimal polynomial for the field's primitive element. Ordinarily this function need not be called directly, as one can instead access the :py:meth:`~.AlgebraicField.maximal_order`, :py:meth:`~.AlgebraicField.integral_basis`, and :py:meth:`~.AlgebraicField.discriminant` methods of an :py:class:`~.AlgebraicField`. Examples ======== Working through an AlgebraicField: >>> from sympy import Poly, QQ >>> from sympy.abc import x >>> T = Poly(x ** 3 + x ** 2 - 2 * x + 8) >>> K = QQ.alg_field_from_poly(T, "theta") >>> print(K.maximal_order()) Submodule[[2, 0, 0], [0, 2, 0], [0, 1, 1]]/2 >>> print(K.discriminant()) -503 >>> print(K.integral_basis(fmt='sympy')) [1, theta, theta/2 + theta**2/2] Calling directly: >>> from sympy import Poly >>> from sympy.abc import x >>> from sympy.polys.numberfields.basis import round_two >>> T = Poly(x ** 3 + x ** 2 - 2 * x + 8) >>> print(round_two(T)) (Submodule[[2, 0, 0], [0, 2, 0], [0, 1, 1]]/2, -503) The nilradicals mod $p$ that are sometimes computed during the Round Two algorithm may be useful in further calculations. Pass a dictionary under `radicals` to receive these: >>> T = Poly(x**3 + 3*x**2 + 5) >>> rad = {} >>> ZK, dK = round_two(T, radicals=rad) >>> print(rad) {3: Submodule[[-1, 1, 0], [-1, 0, 1]]} Parameters ========== T : :py:class:`~.Poly`, :py:class:`~.AlgebraicField` Either (1) the irreducible monic polynomial over :ref:`ZZ` defining the number field, or (2) an :py:class:`~.AlgebraicField` representing the number field itself. radicals : dict, optional This is a way for any $p$-radicals (if computed) to be returned by reference. If desired, pass an empty dictionary. If the algorithm reaches the point where it computes the nilradical mod $p$ of the ring of integers $Z_K$, then an $\mathbb{F}_p$-basis for this ideal will be stored in this dictionary under the key ``p``. This can be useful for other algorithms, such as prime decomposition. Returns ======= Pair ``(ZK, dK)``, where: ``ZK`` is a :py:class:`~sympy.polys.numberfields.modules.Submodule` representing the maximal order. ``dK`` is the discriminant of the field $K = \mathbb{Q}[x]/(T(x))$. See Also ======== .AlgebraicField.maximal_order .AlgebraicField.integral_basis .AlgebraicField.discriminant References ========== .. [1] Cohen, H. *A Course in Computational Algebraic Number Theory.* NrzCRound 2 requires a monic irreducible univariate polynomial over ZZ.r) hnf_modulusT) isinstancerextminpoly_of_elementrrrrr is_univariateis_irreducibleis_monic ValueErrorr discriminant from_sympyabsr r whole_submodulepopitemr*element_from_polyaddrFdict_starts_with_unity_is_sq_maxrank_HNFr>detr8)rradicalsKr2D D_modulusrFZthetar4nilradrer'r(Ur0rEZKdKs r) round_tworg_s@ A!^$$-!%**,,1x2~ Qr"""AA    D ``z`x2~`^___  A A c!ff%%I ,A . .DAq Q  F  A F 6yy{{1,Q22q 6    $ $T%%;%;%; < < EE!q&1*)E 4 4 6   !e  FA!e (Aq11 FAg 6A,Q155JBAg 6- 6@j488 B B B bimmoo" "rxAE': :B r6MsA A('A(r.)__doc__sympy.polys.polytoolsr"sympy.polys.domains.algebraicfieldrsympy.polys.domains.integerringr!sympy.polys.domains.rationalfieldrsympy.polys.polyerrorsrsympy.utilities.decoratorrmodulesr r r utilitiesr r*r6rFrgr/r+r)rqs 22&&&&&&======......000000111111,,,,,,GGGGGGGGGG7777772'!'!'!'!T   \\\\\\r+