passagemath-pari 10.6.32__cp314-cp314-musllinux_1_2_x86_64.whl

sage/rings/padics/qadic_flint_CR.pyx

@@ -0,0 +1,172 @@
+# sage_setup: distribution = sagemath-pari
+# sage.doctest: needs sage.libs.flint
+
+include "sage/libs/linkages/padics/fmpz_poly_unram.pxi"
+include "sage/libs/linkages/padics/unram_shared.pxi"
+include "CR_template.pxi"
+
+cdef class PowComputer_(PowComputer_flint_unram):
+    """
+    A PowComputer for a capped-relative unramified ring or field.
+    """
+    def __init__(self, Integer prime, long cache_limit, long prec_cap, long ram_prec_cap, bint in_field, poly=None):
+        """
+        Initialization.
+
+        EXAMPLES::
+
+            sage: R.<a> = ZqCR(125)
+            sage: type(R.prime_pow)
+            <class 'sage.rings.padics.qadic_flint_CR.PowComputer_'>
+            sage: R.prime_pow._prec_type
+            'capped-rel'
+        """
+        self._prec_type = 'capped-rel'
+        PowComputer_flint_unram.__init__(self, prime, cache_limit, prec_cap, ram_prec_cap, in_field, poly)
+
+cdef class qAdicCappedRelativeElement(CRElement):
+    frobenius = frobenius_unram
+    trace = trace_unram
+    norm = norm_unram
+
+    def matrix_mod_pn(self):
+        r"""
+        Return the matrix of right multiplication by the element on
+        the power basis `1, x, x^2, \ldots, x^{d-1}` for this
+        extension field.  Thus the *rows* of this matrix give the
+        images of each of the `x^i`.  The entries of the matrices are
+        IntegerMod elements, defined modulo ``p^(self.absprec() / e)``.
+
+        Raises an error if ``self`` has negative valuation.
+
+        EXAMPLES::
+
+            sage: R.<a> = QqCR(5^5,5)
+            sage: b = (5 + 15*a)^3
+            sage: b.matrix_mod_pn()
+            [   125   1125   3375   3375      0]
+            [     0    125   1125   3375   3375]
+            [380500 377125    125   1125   3375]
+            [380500 367000 377125    125   1125]
+            [387250 376000 367000 377125    125]
+
+            sage: M = R(0,3).matrix_mod_pn(); M == 0
+            True
+            sage: M.base_ring()
+            Ring of integers modulo 125
+
+        Check that :issue:`13617` has been fixed::
+
+            sage: R(0).matrix_mod_pn()
+            [0 0 0 0 0]
+            [0 0 0 0 0]
+            [0 0 0 0 0]
+            [0 0 0 0 0]
+            [0 0 0 0 0]
+        """
+        if self.ordp < 0:
+            raise ValueError("self must be integral")
+        if exactzero(self.ordp):
+            from sage.matrix.constructor import matrix
+            return matrix(ZZ, self.prime_pow.deg, self.prime_pow.deg)
+        else:
+            return cmatrix_mod_pn(self.unit, self.ordp + self.relprec, self.ordp, self.prime_pow)
+
+    def _flint_rep(self, var='x'):
+        """
+        Replacement for _ntl_rep for use in printing and debugging.
+
+        EXAMPLES::
+
+            sage: R.<a> = Qq(27, 4)
+            sage: (~(1+a))._flint_rep()
+            41*x^2 + 40*x + 42
+            sage: (1+a)*(41*a^2+40*a+42)
+            1 + O(3^4)
+        """
+        if exactzero(self.ordp):
+            raise ValueError("zero does not have a flint rep")
+        return self.prime_pow._new_fmpz_poly(self.unit, var)
+
+    def _flint_rep_abs(self, var='x'):
+        """
+        Replacement for _ntl_rep_abs for use in printing and debugging.
+
+        EXAMPLES::
+
+            sage: R.<a> = Qq(27, 4)
+            sage: (~(3+3*a))._flint_rep_abs()
+            (41*x^2 + 40*x + 42, -1)
+            sage: (3+3*a)*(41*a^2+40*a+42)
+            3 + O(3^5)
+            sage: (3+3*a)._flint_rep_abs()
+            (3*x + 3, 0)
+
+        TESTS::
+
+            sage: R(0)._flint_rep_abs()
+            Traceback (most recent call last):
+            ...
+            ValueError: zero does not have a flint rep
+        """
+        if self.ordp < 0:
+            return self._flint_rep(var), Integer(self.ordp)
+        elif exactzero(self.ordp):
+            raise ValueError("zero does not have a flint rep")
+        cshift_notrunc(self.prime_pow.poly_flint_rep, self.unit, self.ordp, self.ordp + self.relprec, self.prime_pow, False)
+        return self.prime_pow._new_fmpz_poly(self.prime_pow.poly_flint_rep, var), Integer(0)
+
+    def _modp_rep(self, use_smallest_mode=False, return_list=True):
+        r"""
+        Return the element with the same reduction mod p that can be expressed
+        with coefficients between 0 and p-1.  The absolute precision will be maximal.
+
+        This method is used in printing and computing `p`-adic expansions.
+
+        INPUT:
+
+        - ``use_smallest_mode`` -- if ``True``, use reps between -p/2 and p/2 instead
+        - ``return_list`` -- if ``True``, return a list of coefficients (as integers);
+          for use in printing
+
+        EXAMPLES::
+
+            sage: R.<a> = Qq(27,4)
+            sage: b = a^2 + 5*a - 3
+            sage: b._modp_rep()
+            ((a^2 + 2*a) + O(3^4), [0, 2, 1])
+            sage: b._modp_rep(use_smallest_mode=True)[1]
+            [0, -1, 1]
+        """
+        if self.ordp < 0:
+            raise ValueError("No mod p reduction in negative valuation")
+        cdef CRElement rep = self._new_c()
+        if self.ordp > 0:
+            rep._set_exact_zero()
+            L = []
+        else:
+            rep.ordp = 0
+            rep.relprec = self.prime_pow.prec_cap
+            L = cmodp_rep(rep.unit, self.unit, smallest_mode if use_smallest_mode else simple_mode, return_list, self.prime_pow)
+        if return_list:
+            return rep, L
+        else:
+            return rep
+
+    def __hash__(self):
+        r"""
+        Raise a :exc:`TypeError` since this element is not hashable
+        (:issue:`11895`).
+
+        TESTS::
+
+            sage: K.<a> = Qq(9)
+            sage: hash(a)
+            Traceback (most recent call last):
+            ...
+            TypeError: ...unhashable type: 'sage.rings.padics.qadic_flint_CR.qAdicCappedRelativeElement'...
+        """
+        # Eventually, hashing will be disabled for all (non-fixed-mod) p-adic
+        # elements (#11895), until then, we only to this for types which did
+        # not support hashing before we switched some elements to FLINT
+        raise TypeError("unhashable type: 'sage.rings.padics.qadic_flint_CR.qAdicCappedRelativeElement'")

sage/rings/padics/qadic_flint_FM.pxd

@@ -0,0 +1,14 @@
+# sage_setup: distribution = sagemath-pari
+
+from sage.libs.flint.types cimport fmpz_poly_t
+from sage.rings.padics.qadic_flint_FP cimport FPElement
+from sage.rings.padics.pow_computer_flint cimport PowComputer_flint_unram
+
+cdef class PowComputer_(PowComputer_flint_unram):
+    pass
+ctypedef fmpz_poly_t celement
+
+include "FM_template_header.pxi"
+
+cdef class qAdicFixedModElement(FMElement):
+    pass

sage/rings/padics/qadic_flint_FM.pyx

@@ -0,0 +1,111 @@
+# sage_setup: distribution = sagemath-pari
+# sage.doctest: needs sage.libs.flint
+
+include "sage/libs/linkages/padics/fmpz_poly_unram.pxi"
+include "sage/libs/linkages/padics/unram_shared.pxi"
+include "FM_template.pxi"
+
+cdef class PowComputer_(PowComputer_flint_unram):
+    """
+    A PowComputer for a fixed-modulus unramified ring.
+    """
+    def __init__(self, Integer prime, long cache_limit, long prec_cap, long ram_prec_cap, bint in_field, poly=None):
+        """
+        Initialization.
+
+        EXAMPLES::
+
+            sage: R.<a> = ZqFM(125)
+            sage: type(R.prime_pow)
+            <class 'sage.rings.padics.qadic_flint_FM.PowComputer_'>
+            sage: R.prime_pow._prec_type
+            'fixed-mod'
+        """
+        self._prec_type = 'fixed-mod'
+        PowComputer_flint_unram.__init__(self, prime, cache_limit, prec_cap, ram_prec_cap, in_field, poly)
+
+cdef class qAdicFixedModElement(FMElement):
+    frobenius = frobenius_unram
+    trace = trace_unram
+    norm = norm_unram
+
+    def matrix_mod_pn(self):
+        r"""
+        Return the matrix of right multiplication by the element on
+        the power basis `1, x, x^2, \ldots, x^{d-1}` for this
+        extension field.  Thus the *rows* of this matrix give the
+        images of each of the `x^i`.  The entries of the matrices are
+        IntegerMod elements, defined modulo ``p^(self.absprec() / e)``.
+
+        EXAMPLES::
+
+            sage: R.<a> = ZqFM(5^5,5)
+            sage: b = (5 + 15*a)^3
+            sage: b.matrix_mod_pn()
+            [ 125 1125  250  250    0]
+            [   0  125 1125  250  250]
+            [2375 2125  125 1125  250]
+            [2375 1375 2125  125 1125]
+            [2875 1000 1375 2125  125]
+
+            sage: M = R(0,3).matrix_mod_pn(); M == 0
+            True
+            sage: M.base_ring()
+            Ring of integers modulo 3125
+        """
+        return cmatrix_mod_pn(self.value, self.prime_pow.prec_cap, 0, self.prime_pow)
+
+    def _flint_rep(self, var='x'):
+        """
+        Replacement for _ntl_rep for use in printing and debugging.
+
+        EXAMPLES::
+
+            sage: R.<a> = ZqFM(27, 4)
+            sage: (1+a).inverse_of_unit()._flint_rep()
+            41*x^2 + 40*x + 42
+            sage: (1+a)*(41*a^2+40*a+42)
+            1
+        """
+        return self.prime_pow._new_fmpz_poly(self.value, var)
+
+    def _flint_rep_abs(self, var='x'):
+        """
+        Replacement for _ntl_rep_abs for use in printing and debugging.
+
+        EXAMPLES::
+
+            sage: R.<a> = ZqFM(27, 4)
+            sage: (3+3*a)._flint_rep_abs()
+            (3*x + 3, 0)
+        """
+        return self._flint_rep(var), Integer(0)
+
+    def _modp_rep(self, use_smallest_mode=False, return_list=True):
+        r"""
+        Return the element with the same reduction mod p that can be expressed
+        with coefficients between 0 and p-1.  The absolute precision will be maximal.
+
+        This method is used in printing and computing `p`-adic expansions.
+
+        INPUT:
+
+        - ``use_smallest_mode`` -- if ``True``, use reps between -p/2 and p/2 instead
+        - ``return_list`` -- if ``True``, return a list of coefficients (as integers);
+          for use in printing
+
+        EXAMPLES::
+
+            sage: R.<a> = ZqFM(27,4)
+            sage: b = a^2 + 5*a - 3
+            sage: b._modp_rep()
+            ((a^2 + 2*a), [0, 2, 1])
+            sage: b._modp_rep(use_smallest_mode=True)[1]
+            [0, -1, 1]
+        """
+        cdef FMElement rep = self._new_c()
+        L = cmodp_rep(rep.value, self.value, smallest_mode if use_smallest_mode else simple_mode, return_list, self.prime_pow)
+        if return_list:
+            return rep, L
+        else:
+            return rep

sage/rings/padics/qadic_flint_FP.pxd

@@ -0,0 +1,12 @@
+# sage_setup: distribution = sagemath-pari
+
+from sage.libs.flint.fmpz_poly cimport fmpz_poly_t
+from sage.rings.padics.pow_computer_flint cimport PowComputer_flint_unram
+cdef class PowComputer_(PowComputer_flint_unram):
+    pass
+ctypedef fmpz_poly_t celement
+
+include "FP_template_header.pxi"
+
+cdef class qAdicFloatingPointElement(FPElement):
+    pass

sage/rings/padics/qadic_flint_FP.pyx

@@ -0,0 +1,165 @@
+# sage_setup: distribution = sagemath-pari
+# distutils: libraries = flint
+# sage.doctest: needs sage.libs.flint
+
+include "sage/libs/linkages/padics/fmpz_poly_unram.pxi"
+include "sage/libs/linkages/padics/unram_shared.pxi"
+include "FP_template.pxi"
+
+cdef class PowComputer_(PowComputer_flint_unram):
+    """
+    A PowComputer for a floating-point unramified ring or field.
+    """
+    def __init__(self, Integer prime, long cache_limit, long prec_cap, long ram_prec_cap, bint in_field, poly=None):
+        """
+        Initialization.
+
+        EXAMPLES::
+
+            sage: R.<a> = ZqFP(125)
+            sage: type(R.prime_pow)
+            <class 'sage.rings.padics.qadic_flint_FP.PowComputer_'>
+            sage: R.prime_pow._prec_type
+            'floating-point'
+        """
+        self._prec_type = 'floating-point'
+        PowComputer_flint_unram.__init__(self, prime, cache_limit, prec_cap, ram_prec_cap, in_field, poly)
+
+cdef class qAdicFloatingPointElement(FPElement):
+    frobenius = frobenius_unram
+    trace = trace_unram
+    norm = norm_unram
+
+    def matrix_mod_pn(self):
+        r"""
+        Return the matrix of right multiplication by the element on
+        the power basis `1, x, x^2, \ldots, x^{d-1}` for this
+        extension field.  Thus the *rows* of this matrix give the
+        images of each of the `x^i`.  The entries of the matrices are
+        IntegerMod elements, defined modulo ``p^(self.absprec() / e)``.
+
+        Raises an error if ``self`` has negative valuation.
+
+        EXAMPLES::
+
+            sage: R.<a> = QqFP(5^5,5)
+            sage: b = (5 + 15*a)^3
+            sage: b.matrix_mod_pn()
+            [   125   1125   3375   3375      0]
+            [     0    125   1125   3375   3375]
+            [380500 377125    125   1125   3375]
+            [380500 367000 377125    125   1125]
+            [387250 376000 367000 377125    125]
+
+            sage: M = R(0,3).matrix_mod_pn(); M == 0
+            True
+            sage: M.base_ring()
+            Integer Ring
+
+        Check that :issue:`13617` has been fixed::
+
+            sage: R(0).matrix_mod_pn()
+            [0 0 0 0 0]
+            [0 0 0 0 0]
+            [0 0 0 0 0]
+            [0 0 0 0 0]
+            [0 0 0 0 0]
+        """
+        if self.ordp < 0:
+            raise ValueError("self must be integral")
+        if very_pos_val(self.ordp):
+            from sage.matrix.constructor import matrix
+            return matrix(ZZ, self.prime_pow.deg, self.prime_pow.deg)
+        else:
+            return cmatrix_mod_pn(self.unit, self.ordp + self.prime_pow.prec_cap, self.ordp, self.prime_pow)
+
+    def _flint_rep(self, var='x'):
+        """
+        Replacement for _ntl_rep for use in printing and debugging.
+
+        EXAMPLES::
+
+            sage: R.<a> = QqFP(27, 4)
+            sage: (~(1+a))._flint_rep()
+            41*x^2 + 40*x + 42
+            sage: (1+a)*(41*a^2+40*a+42)
+            1
+        """
+        if self._is_exact_zero():
+            raise ValueError("zero does not have a flint rep")
+        return self.prime_pow._new_fmpz_poly(self.unit, var)
+
+    def _flint_rep_abs(self, var='x'):
+        """
+        Replacement for _ntl_rep_abs for use in printing and debugging.
+
+        EXAMPLES::
+
+            sage: R.<a> = QqFP(27, 4)
+            sage: (~(3+3*a))._flint_rep_abs()
+            (41*x^2 + 40*x + 42, -1)
+            sage: (3+3*a)*(41*a^2+40*a+42)
+            3
+            sage: (3+3*a)._flint_rep_abs()
+            (3*x + 3, 0)
+        """
+        if self.ordp < 0:
+            return self._flint_rep(var), Integer(self.ordp)
+        if self._is_exact_zero():
+            raise ValueError("zero does not have a flint rep")
+        cshift_notrunc(self.prime_pow.poly_flint_rep, self.unit, self.ordp, self.ordp + self.prime_pow.prec_cap, self.prime_pow, False)
+        return self.prime_pow._new_fmpz_poly(self.prime_pow.poly_flint_rep, var), Integer(0)
+
+    def _modp_rep(self, use_smallest_mode=False, return_list=True):
+        r"""
+        Return the element with the same reduction mod p that can be expressed
+        with coefficients between 0 and p-1.  The absolute precision will be maximal.
+
+        This method is used in printing and computing `p`-adic expansions.
+
+        INPUT:
+
+        - ``use_smallest_mode`` -- if ``True``, use reps between -p/2 and p/2 instead
+        - ``return_list`` -- if ``True``, return a list of coefficients (as integers);
+          for use in printing
+
+        EXAMPLES::
+
+            sage: R.<a> = Qq(27,4)
+            sage: b = a^2 + 5*a - 3
+            sage: b._modp_rep()
+            ((a^2 + 2*a) + O(3^4), [0, 2, 1])
+            sage: b._modp_rep(use_smallest_mode=True)[1]
+            [0, -1, 1]
+        """
+        if self.ordp < 0:
+            raise ValueError("No mod p reduction in negative valuation")
+        cdef FPElement rep = self._new_c()
+        if self.ordp > 0:
+            rep._set_exact_zero()
+            L = []
+        else:
+            rep.ordp = 0
+            L = cmodp_rep(rep.unit, self.unit, smallest_mode if use_smallest_mode else simple_mode, return_list, self.prime_pow)
+        if return_list:
+            return rep, L
+        else:
+            return rep
+
+    def __hash__(self):
+        r"""
+        Raise a :exc:`TypeError` since this element is not hashable
+        (:issue:`11895`).
+
+        TESTS::
+
+            sage: K.<a> = QqFP(9)
+            sage: hash(a)
+            Traceback (most recent call last):
+            ...
+            TypeError: ...unhashable type: 'sage.rings.padics.qadic_flint_FP.qAdicFloatingPointElement'...
+        """
+        # Eventually, hashing will be disabled for all (non-fixed-mod) p-adic
+        # elements (#11895), until then, we only to this for types which did
+        # not support hashing before we switched some elements to FLINT
+        raise TypeError("unhashable type: 'sage.rings.padics.qadic_flint_FP.qAdicFloatingPointElement'")