passagemath-schemes 10.8.1a4__cp314-cp314t-macosx_13_0_arm64.whl

sage/modular/hecke/degenmap.py

@@ -0,0 +1,119 @@
+# sage_setup: distribution = sagemath-schemes
+# sage.doctest: needs sage.libs.flint
+"""
+Degeneracy maps
+"""
+
+# ****************************************************************************
+#       Sage: Open Source Mathematical Software
+#
+#       Copyright (C) 2005 William Stein <wstein@gmail.com>
+#
+#  Distributed under the terms of the GNU General Public License (GPL)
+#
+#    This code is distributed in the hope that it will be useful,
+#    but WITHOUT ANY WARRANTY; without even the implied warranty of
+#    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+#    General Public License for more details.
+#
+#  The full text of the GPL is available at:
+#
+#                  https://www.gnu.org/licenses/
+# ****************************************************************************
+from . import morphism
+
+
+class DegeneracyMap(morphism.HeckeModuleMorphism_matrix):
+    """
+    A degeneracy map between Hecke modules of different levels.
+
+    EXAMPLES:
+
+    We construct a number of degeneracy maps::
+
+        sage: M = ModularSymbols(33)
+        sage: d = M.degeneracy_map(11)
+        sage: d
+        Hecke module morphism degeneracy map corresponding to f(q) |--> f(q)
+        defined by the matrix
+        [ 1  0  0]
+        [ 0  0  1]
+        [ 0  0 -1]
+        [ 0  1 -1]
+        [ 0  0  1]
+        [ 0 -1  1]
+        [-1  0  0]
+        [-1  0  0]
+        [-1  0  0]
+        Domain: Modular Symbols space of dimension 9 for Gamma_0(33) of weight ...
+        Codomain: Modular Symbols space of dimension 3 for Gamma_0(11) of weight ...
+        sage: d.t()
+        1
+        sage: d = M.degeneracy_map(11,3)
+        sage: d.t()
+        3
+
+    The parameter d must be a divisor of the quotient of the two levels::
+
+        sage: d = M.degeneracy_map(11,2)
+        Traceback (most recent call last):
+        ...
+        ValueError: the level of self (=33) must be a divisor or multiple
+        of level (=11) and t (=2) must be a divisor of the quotient
+
+    Degeneracy maps can also go from lower level to higher level::
+
+        sage: M.degeneracy_map(66,2)
+        Hecke module morphism degeneracy map corresponding to f(q) |--> f(q^2)
+        defined by the matrix
+        [ 2  0  0  0  0  0  1  0  0  0  1 -1  0  0  0 -1  1  0  0  0  0  0  0  0 -1]
+        [ 0  0  1 -1  0 -1  1  0 -1  2  0  0  0 -1  0  0 -1  1  2 -2  0  0  0 -1  1]
+        [ 0  0  1  0  0  0  0  0  1  0  0  0  1  0  0  0 -1  1  0  0 -1  1  0  0  0]
+        [ 0  0  0  0  0  0  0  0  0  2 -1  0  0  1  0  0 -1  1  0  0  1  0 -1 -1  1]
+        [ 0 -1  0  0  1  0  0  0  0  0  0  1  0  0  1  1 -1  0  0 -1  0  0  0  0  0]
+        [ 0  0  0  0  0  0  0  1 -1  0  0  2 -1  0  0  1  0  0  0 -1  0 -1  1 -1  1]
+        [ 0  0  0  0  1 -1  0  1 -1  0  0  0  0  0 -1  2  0  0  0  0  1  0  1  0  0]
+        [ 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  1  0  0]
+        [ 0  0  0  0  0  0  0  0  0  0 -1  0  0  0  0  0  0  0  0  1  1  1  0  0  0]
+        Domain: Modular Symbols space of dimension 9 for Gamma_0(33) of weight ...
+        Codomain: Modular Symbols space of dimension 25 for Gamma_0(66) of weight ...
+    """
+    def __init__(self, matrix, domain, codomain, t):
+        r"""
+        Initialise a degeneracy map.
+
+        EXAMPLES::
+
+            sage: D = ModularSymbols(Gamma0(100)).degeneracy_map(2,5); D
+            Hecke module morphism degeneracy map corresponding to f(q) |--> f(q^5) defined by the matrix
+            31 x 1 dense matrix over Rational Field
+            Domain: Modular Symbols space of dimension 31 for Gamma_0(100) of weight ...
+            Codomain: Modular Symbols space of dimension 1 for Gamma_0(2) of weight ...
+            sage: D == loads(dumps(D))
+            True
+        """
+        self.__t = t
+        H = domain.Hom(codomain)
+        if t == 1:
+            pow = ""
+        else:
+            pow = "^%s" % t
+        name = "degeneracy map corresponding to f(q) |--> f(q%s)" % (pow)
+        morphism.HeckeModuleMorphism_matrix.__init__(self, H, matrix, name)
+
+    def t(self):
+        """
+        Return the divisor of the quotient of the two levels
+        associated to the degeneracy map.
+
+        EXAMPLES::
+
+            sage: M = ModularSymbols(33)
+            sage: d = M.degeneracy_map(11,3)
+            sage: d.t()
+            3
+            sage: d = M.degeneracy_map(11,1)
+            sage: d.t()
+            1
+        """
+        return self.__t

sage/modular/hecke/element.py

@@ -0,0 +1,302 @@
+# sage_setup: distribution = sagemath-schemes
+# sage.doctest: needs sage.libs.flint sage.libs.pari
+"""
+Elements of Hecke modules
+
+AUTHORS:
+
+- William Stein
+"""
+
+# ****************************************************************************
+#       Sage: Open Source Mathematical Software
+#
+#       Copyright (C) 2005 William Stein <wstein@gmail.com>
+#
+#  Distributed under the terms of the GNU General Public License (GPL)
+#
+#    This code is distributed in the hope that it will be useful,
+#    but WITHOUT ANY WARRANTY; without even the implied warranty of
+#    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+#    General Public License for more details.
+#
+#  The full text of the GPL is available at:
+#
+#                  https://www.gnu.org/licenses/
+# ****************************************************************************
+
+from typing import Self
+
+from sage.structure.element import ModuleElement
+from sage.structure.richcmp import op_NE, richcmp
+
+
+class HeckeModuleElement(ModuleElement):
+    """
+    Element of a Hecke module.
+    """
+    def __init__(self, parent, x=None):
+        """
+        INPUT:
+
+        - ``parent`` -- a Hecke module
+
+        - ``x`` -- element of the free module associated to parent
+
+        EXAMPLES::
+
+            sage: v = sage.modular.hecke.all.HeckeModuleElement(BrandtModule(37), vector(QQ,[1,2,3])); v
+            (1, 2, 3)
+            sage: type(v)
+            <class 'sage.modular.hecke.element.HeckeModuleElement'>
+
+        TESTS::
+
+            sage: v = ModularSymbols(37).0
+            sage: loads(dumps(v))
+            (1,0)
+            sage: loads(dumps(v)) == v
+            True
+        """
+        ModuleElement.__init__(self, parent)
+        if x is not None:
+            self.__element = x
+
+    def _repr_(self):
+        """
+        Return string representation of this Hecke module element.
+        The default representation is just the representation of the
+        underlying vector.
+
+        EXAMPLES::
+
+            sage: BrandtModule(37)([0,1,-1])._repr_()
+            '(0, 1, -1)'
+        """
+        return self.element()._repr_()
+
+    def _compute_element(self):
+        """
+        Use internally to compute vector underlying this element.
+
+        EXAMPLES::
+
+            sage: f = CuspForms(11, 2).gen(0)
+            sage: f._compute_element()
+            Traceback (most recent call last):
+            ...
+            NotImplementedError: _compute_element *must* be defined...
+        """
+        # You have to define this in the derived class if you ever set
+        # x=None in __init__ for your element class.
+        # The main reason for this is it allows for lazy constructors who
+        # compute the representation of an element (e.g., a q-expansion) in
+        # terms of the basis only when needed.
+
+        # Not in use at present.
+        raise NotImplementedError("_compute_element *must* be defined in the derived class if element is set to None in constructor")
+
+    def element(self):
+        """
+        Return underlying vector space element that defines this Hecke module element.
+
+        EXAMPLES::
+
+            sage: z = BrandtModule(37)([0,1,-1]).element(); z
+            (0, 1, -1)
+            sage: type(z)
+            <class 'sage.modules.vector_rational_dense.Vector_rational_dense'>
+        """
+        try:
+            return self.__element
+        except AttributeError:
+            self.__element = self._compute_element()
+        return self.__element
+
+    def _vector_(self, R=None):
+        """
+        This makes it so vector(self) and vector(self, R) both work.
+
+        EXAMPLES::
+
+            sage: v = BrandtModule(37)([0,1,-1]); v
+            (0, 1, -1)
+            sage: type(v._vector_())
+            <class 'sage.modules.vector_rational_dense.Vector_rational_dense'>
+            sage: type(vector(v))
+            <class 'sage.modules.vector_rational_dense.Vector_rational_dense'>
+            sage: type(vector(v, GF(2)))
+            <class 'sage.modules.vector_mod2_dense.Vector_mod2_dense'>
+        """
+        if R is None:
+            return self.__element
+        return self.__element.change_ring(R)
+
+    def _richcmp_(self, other, op):
+        """
+        Rich comparison of ``self`` and ``other``.
+
+        EXAMPLES::
+
+            sage: M = ModularSymbols(11, 2)
+            sage: M.0 == M.1  # indirect doctest
+            False
+            sage: M.0 == (M.1 + M.0 - M.1)
+            True
+            sage: M.0 == ModularSymbols(13, 2).0
+            False
+
+            sage: x = BrandtModule(37)([0,1,-1])
+            sage: x != x
+            False
+        """
+        if not isinstance(other, HeckeModuleElement):
+            return op == op_NE
+        return richcmp(self.element(), other.element(), op)
+
+    def ambient_module(self):
+        """
+        Return the ambient Hecke module that contains this element.
+
+        EXAMPLES::
+
+            sage: BrandtModule(37)([0,1,-1]).ambient_module()
+            Brandt module of dimension 3 of level 37 of weight 2 over Rational Field
+        """
+        return self.parent().ambient_module()
+
+    def _lmul_(self, x):
+        """
+        EXAMPLES::
+
+            sage: BrandtModule(37)([0,1,-1])._lmul_(3)
+            (0, 3, -3)
+        """
+        return self.parent()(self.element() * x)
+
+    def _rmul_(self, x):
+        """
+        EXAMPLES::
+
+            sage: BrandtModule(37)([0,1,-1])._rmul_(3)
+            (0, 3, -3)
+        """
+        return self.parent()(x * self.element())
+
+    def _neg_(self):
+        """
+        EXAMPLES::
+
+            sage: BrandtModule(37)([0,1,-1])._neg_()
+            (0, -1, 1)
+        """
+        return self.parent()(-self.element())
+
+    def _pos_(self) -> Self:
+        """
+        EXAMPLES::
+
+            sage: BrandtModule(37)([0,1,-1])._pos_()
+            (0, 1, -1)
+        """
+        return self
+
+    def _sub_(self, right):
+        """
+        EXAMPLES::
+
+            sage: BrandtModule(37)([0,1,-1])._sub_(BrandtModule(37)([0,1,-5]))
+            (0, 0, 4)
+        """
+        return self.parent()(self.element() - right.element())
+
+    def is_cuspidal(self) -> bool:
+        r"""
+        Return ``True`` if this element is cuspidal.
+
+        EXAMPLES::
+
+            sage: M = ModularForms(2, 22); M.0.is_cuspidal()
+            True
+            sage: (M.0 + M.4).is_cuspidal()
+            False
+            sage: EllipticCurve('37a1').newform().is_cuspidal()                         # needs database_cremona_mini_ellcurve
+            True
+
+        It works for modular symbols too::
+
+            sage: M = ModularSymbols(19,2)
+            sage: M.0.is_cuspidal()
+            False
+            sage: M.1.is_cuspidal()
+            True
+
+        TESTS:
+
+        Verify that :issue:`21497` is fixed::
+
+            sage: M = ModularSymbols(Gamma0(3),weight=22,sign=1)
+            sage: N = next(S for S in M.decomposition(anemic=False) if S.hecke_matrix(3).trace()==-128844)
+            sage: [g.is_cuspidal() for g in N.gens()]
+            [True, True]
+        """
+        return self in self.parent().ambient().cuspidal_submodule()
+
+    def is_eisenstein(self) -> bool:
+        r"""
+        Return ``True`` if this element is Eisenstein.
+
+        This makes sense for both modular forms and modular symbols.
+
+        EXAMPLES::
+
+            sage: CuspForms(2,8).0.is_eisenstein()
+            False
+            sage: M = ModularForms(2,8);(M.0  + M.1).is_eisenstein()
+            False
+            sage: M.1.is_eisenstein()
+            True
+            sage: ModularSymbols(19,4).0.is_eisenstein()
+            False
+            sage: EllipticCurve('37a1').newform().element().is_eisenstein()             # needs database_cremona_mini_ellcurve
+            False
+        """
+        return self in self.parent().ambient().eisenstein_submodule()
+
+    def is_new(self, p=None) -> bool:
+        r"""
+        Return ``True`` if this element is `p`-new.
+
+        If `p` is ``None``, return ``True`` if the element is new.
+
+        EXAMPLES::
+
+            sage: CuspForms(22, 2).0.is_new(2)
+            False
+            sage: CuspForms(22, 2).0.is_new(11)
+            True
+            sage: CuspForms(22, 2).0.is_new()
+            False
+        """
+        return self in self.parent().new_submodule(p)
+
+    def is_old(self, p=None) -> bool:
+        r"""
+        Return ``True`` if this element is `p`-old.
+
+        If `p` is ``None``, return ``True`` if the element is old.
+
+        EXAMPLES::
+
+            sage: CuspForms(22, 2).0.is_old(11)
+            False
+            sage: CuspForms(22, 2).0.is_old(2)
+            True
+            sage: CuspForms(22, 2).0.is_old()
+            True
+            sage: EisensteinForms(144, 2).1.is_old()  # long time (3s on sage.math, 2011)
+            False
+            sage: EisensteinForms(144, 2).1.is_old(2) # not implemented
+            False
+        """
+        return self in self.parent().old_submodule(p)