passagemath-schemes 10.5.44__cp313-cp313-musllinux_1_2_aarch64.whl → 10.6.42__cp313-cp313-musllinux_1_2_aarch64.whl

sage/modular/arithgroup/congroup_gamma1.py

@@ -137,7 +137,7 @@ class Gamma1_class(GammaH_class):
         """
         return Gamma1_constructor, (self.level(),)
 
-    def _latex_(self):
+    def _latex_(self) -> str:
         r"""
         Return the \LaTeX representation of ``self``.
 
@@ -150,7 +150,7 @@ class Gamma1_class(GammaH_class):
         """
         return "\\Gamma_1(%s)" % self.level()
 
-    def is_even(self):
+    def is_even(self) -> bool:
         """
         Return ``True`` precisely if this subgroup contains the matrix -1.
 
@@ -163,9 +163,9 @@ class Gamma1_class(GammaH_class):
             sage: Gamma1(15).is_even()
             False
         """
-        return self.level() in [1,2]
+        return self.level() in [1, 2]
 
-    def is_subgroup(self, right):
+    def is_subgroup(self, right) -> bool:
         """
         Return ``True`` if ``self`` is a subgroup of ``right``.
 

sage/modular/arithgroup/congroup_gammaH.py

@@ -435,7 +435,7 @@ class GammaH_class(CongruenceSubgroup):
         """
         return self.__Hlist
 
-    def is_even(self):
+    def is_even(self) -> bool:
         """
         Return ``True`` precisely if this subgroup contains the matrix -1.
 
@@ -1002,7 +1002,7 @@ class GammaH_class(CongruenceSubgroup):
             for t in reps2:
                 yield SL2Z(t) * r
 
-    def is_subgroup(self, other):
+    def is_subgroup(self, other) -> bool:
         r"""
         Return ``True`` if ``self`` is a subgroup of ``right``, and ``False``
         otherwise.

sage/modular/arithgroup/congroup_generic.py

@@ -181,16 +181,15 @@ class CongruenceSubgroupBase(ArithmeticSubgroup):
         N = self.level()
         return self([1-N, -N, N, 1+N])
 
-    def is_congruence(self):
+    def is_congruence(self) -> bool:
         r"""
-        Return True, since this is a congruence subgroup.
+        Return ``True``, since this is a congruence subgroup.
 
         EXAMPLES::
 
             sage: Gamma0(7).is_congruence()
             True
         """
-
         return True
 
     def level(self):

sage/modular/arithgroup/congroup_sl2z.py

@@ -15,7 +15,7 @@ AUTHORS:
 #
 #  The full text of the GPL is available at:
 #
-#                  http://www.gnu.org/licenses/
+#                  https://www.gnu.org/licenses/
 #
 ################################################################################
 
@@ -141,7 +141,7 @@ class SL2Z_class(Gamma0_class):
         """
         return "Modular Group SL(2,Z)"
 
-    def _latex_(self):
+    def _latex_(self) -> str:
         r"""
         Return the \LaTeX representation of ``self``.
 
@@ -154,7 +154,7 @@ class SL2Z_class(Gamma0_class):
         """
         return "\\mbox{\\rm SL}_2(%s)" % (ZZ._latex_())
 
-    def is_subgroup(self, right):
+    def is_subgroup(self, right) -> bool:
         """
         Return ``True`` if ``self`` is a subgroup of ``right``.
 

sage/modular/arithgroup/farey_symbol.pyx

@@ -1,7 +1,7 @@
 # sage_setup: distribution = sagemath-schemes
 # distutils: sources = sage/modular/arithgroup/sl2z.cpp sage/modular/arithgroup/farey.cpp
 # distutils: language = c++
-# distutils: extra_compile_args = -std=c++11
+# distutils: extra_compile_args = -std=c++17
 # sage.doctest: needs sage.libs.pari
 r"""
 Farey symbol for arithmetic subgroups of `\PSL_2(\ZZ)`
@@ -48,7 +48,6 @@ from sage.structure.richcmp cimport richcmp_not_equal
 
 cdef extern from "sl2z.hpp":
     cppclass cpp_SL2Z "SL2Z":
-        mpz_class a, b, c, d
         cpp_SL2Z(int, int, int, int)
         cpp_SL2Z(mpz_class, mpz_class, mpz_class, mpz_class)
         mpz_class a()

sage/modular/btquotients/btquotient.py

@@ -1715,7 +1715,7 @@ class BruhatTitsQuotient(SageObject, UniqueRepresentation):
         Compute certain invariants from the level data of the quotient
         which allow one to compute the genus of the curve.
 
-        Details to be found in Theorem 9 of [FM2014]_.
+        Details to be found in Theorem 3.8 of [FM2014]_.
 
         EXAMPLES::
 
@@ -2121,7 +2121,7 @@ class BruhatTitsQuotient(SageObject, UniqueRepresentation):
         my_args.update(kwargs)
         return S.plot(*args, **my_args)
 
-    def is_admissible(self, D):
+    def is_admissible(self, D) -> bool:
         r"""
         Test whether the imaginary quadratic field of
         discriminant `D` embeds in the quaternion algebra. It
@@ -2456,7 +2456,7 @@ class BruhatTitsQuotient(SageObject, UniqueRepresentation):
 
         INPUT:
 
-        - ``g`` -- a row vector of size `4` whose entries represent a
+        - ``g`` -- a column vector of size `4` whose entries represent a
           quaternion in our basis
 
         - ``exact`` -- boolean (default: ``False``); if True, tries to embed
@@ -3099,8 +3099,7 @@ class BruhatTitsQuotient(SageObject, UniqueRepresentation):
             Vertex of Bruhat-Tits tree for p = 3
         """
         try:
-            tmp = self._cached_paths[v1]
-            return tmp
+            return self._cached_paths[v1]
         except KeyError:
             pass
         chain, v = self._BT.find_path(v1, self.get_vertex_dict())

sage/modular/btquotients/pautomorphicform.py

@@ -863,7 +863,7 @@ class BruhatTitsHarmonicCocycles(AmbientHeckeModule, UniqueRepresentation):
         # return BruhatTitsHarmonicCocyclesSubmodule(self, v)
         raise NotImplementedError
 
-    def is_simple(self):
+    def is_simple(self) -> bool:
         r"""
         Whether ``self`` is irreducible.
 
@@ -2498,7 +2498,7 @@ class pAdicAutomorphicForms(Module, UniqueRepresentation):
             sage: H = X.harmonic_cocycles(2,prec = 5)
             sage: A = X.padic_automorphic_forms(2,prec = 5)
             sage: h = H.basis()[0]
-            sage: A.lift(h) # indirect doctest long time
+            sage: A.lift(h)  # indirect doctest, long time
             p-adic automorphic form of cohomological weight 0
         """
         S = self._source.get_stabilizers()

sage/modular/cusps.py

@@ -27,6 +27,7 @@ EXAMPLES::
 #
 #                  https://www.gnu.org/licenses/
 # ****************************************************************************
+from typing import Any
 
 from sage.misc.cachefunc import cached_method
 from sage.misc.fast_methods import Singleton
@@ -318,7 +319,7 @@ class Cusp(Element):
             o = right._rational_()
         return richcmp(s, o, op)
 
-    def is_infinity(self):
+    def is_infinity(self) -> bool:
         """
         Return ``True`` if this is the cusp infinity.
 
@@ -466,7 +467,8 @@ class Cusp(Element):
         """
         return Cusp(-self.__a, self.__b)
 
-    def is_gamma0_equiv(self, other, N, transformation=None):
+    def is_gamma0_equiv(self, other, N,
+                        transformation=None) -> bool | tuple[bool, Any]:
         r"""
         Return whether ``self`` and ``other`` are equivalent modulo the action of
         `\Gamma_0(N)` via linear fractional transformations.
@@ -647,7 +649,7 @@ class Cusp(Element):
                 A = A % (u2 * v1 * M)
             return (True, A)
 
-    def is_gamma1_equiv(self, other, N):
+    def is_gamma1_equiv(self, other, N) -> tuple[bool, int]:
         r"""
         Return whether ``self`` and ``other`` are equivalent modulo the action of
         `\Gamma_1(N)` via linear fractional transformations.
@@ -702,7 +704,7 @@ class Cusp(Element):
             return True, -1
         return False, 0
 
-    def is_gamma_h_equiv(self, other, G):
+    def is_gamma_h_equiv(self, other, G) -> tuple[bool, int]:
         r"""
         Return a pair ``(b, t)``, where ``b`` is ``True`` or ``False`` as
         ``self`` and ``other`` are equivalent under the action of `G`, and `t`

sage/modular/cusps_nf.py

@@ -73,14 +73,14 @@ List representatives for Gamma_0(N) - equivalence classes of cusps::
 #  Distributed under the terms of the GNU General Public License (GPL)
 #                  https://www.gnu.org/licenses/
 # ****************************************************************************
+from typing import Any
 
+from sage.misc.cachefunc import cached_method, cached_function
 from sage.structure.parent import Parent
 from sage.structure.element import Element, InfinityElement
 from sage.structure.richcmp import richcmp, rich_to_bool
 from sage.structure.unique_representation import UniqueRepresentation
 
-from sage.misc.cachefunc import cached_method, cached_function
-
 
 @cached_function
 def list_of_representatives(N):
@@ -598,7 +598,7 @@ class NFCusp(Element):
         """
         return self.parent().number_field()
 
-    def is_infinity(self):
+    def is_infinity(self) -> bool:
         """
         Return ``True`` if this is the cusp infinity.
 
@@ -823,7 +823,7 @@ class NFCusp(Element):
         k = self.number_field()
         return k.ideal(self.__a, self.__b)
 
-    def ABmatrix(self):
+    def ABmatrix(self) -> list:
         """
         Return AB-matrix associated to the cusp ``self``.
 
@@ -898,11 +898,10 @@ class NFCusp(Element):
         r = A1.element_1_mod(A2)
         b1 = -(1 - r) / a2 * g
         b2 = (r / a1) * g
-        ABM = [a1, b1, a2, b2]
-
-        return ABM
+        return [a1, b1, a2, b2]
 
-    def is_Gamma0_equivalent(self, other, N, Transformation=False):
+    def is_Gamma0_equivalent(self, other, N,
+                             Transformation=False) -> bool | tuple[bool, Any]:
         r"""
         Check if cusps ``self`` and ``other`` are `\Gamma_0(N)`- equivalent.
 

sage/modular/dirichlet.py

@@ -192,7 +192,7 @@ class DirichletCharacter(MultiplicativeGroupElement):
     """
     A Dirichlet character.
     """
-    def __init__(self, parent, x, check=True):
+    def __init__(self, parent, x, check=True) -> None:
         r"""
         Create a Dirichlet character with specified values on
         generators of `(\ZZ/n\ZZ)^*`.
@@ -402,7 +402,7 @@ class DirichletCharacter(MultiplicativeGroupElement):
         G = self.parent().change_ring(R)
         return G.element_class(G, [R(x) for x in self.values_on_gens()])
 
-    def _richcmp_(self, other, op):
+    def _richcmp_(self, other, op) -> bool:
         """
         Compare ``self`` to ``other``.
 
@@ -430,7 +430,7 @@ class DirichletCharacter(MultiplicativeGroupElement):
         """
         return richcmp(self.values_on_gens(), other.values_on_gens(), op)
 
-    def __hash__(self):
+    def __hash__(self) -> int:
         """
         Return the hash of ``self``.
 
@@ -528,7 +528,7 @@ class DirichletCharacter(MultiplicativeGroupElement):
             x = tuple(z**n for z in self.values_on_gens())
         return G.element_class(G, x, check=False)
 
-    def _repr_short_(self):
+    def _repr_short_(self) -> str:
         r"""
         A short string representation of ``self``, often used in string representations of modular forms.
 
@@ -540,7 +540,7 @@ class DirichletCharacter(MultiplicativeGroupElement):
         """
         return str(list(self.values_on_gens()))
 
-    def _repr_(self):
+    def _repr_(self) -> str:
         """
         String representation of ``self``.
 
@@ -570,7 +570,7 @@ class DirichletCharacter(MultiplicativeGroupElement):
             s += str(self.parent().unit_gens()[i]) + ' |--> ' + str(self.values_on_gens()[i])
         return s
 
-    def _latex_(self):
+    def _latex_(self) -> str:
         r"""
         LaTeX representation of ``self``.
 
@@ -1049,7 +1049,7 @@ class DirichletCharacter(MultiplicativeGroupElement):
         return NumberField(self.fixed_field_polynomial(), 'a')
 
     @cached_method
-    def decomposition(self):
+    def decomposition(self) -> list:
         r"""
         Return the decomposition of ``self`` as a product of Dirichlet
         characters of prime power modulus, where the prime powers exactly
@@ -1230,7 +1230,7 @@ class DirichletCharacter(MultiplicativeGroupElement):
         G, v = self._pari_init_()
         return pari.znconreyexp(G, v).sage()
 
-    def lmfdb_page(self):
+    def lmfdb_page(self) -> None:
         r"""
         Open the LMFDB web page of the character in a browser.
 
@@ -1247,7 +1247,7 @@ class DirichletCharacter(MultiplicativeGroupElement):
         url = lmfdb_url.format(self.modulus(), self.conrey_number())
         webbrowser.open(url)
 
-    def galois_orbit(self, sort=True):
+    def galois_orbit(self, sort=True) -> list:
         r"""
         Return the orbit of this character under the action of the absolute
         Galois group of the prime subfield of the base ring.
@@ -1549,7 +1549,7 @@ class DirichletCharacter(MultiplicativeGroupElement):
 
         And sums where exactly one character is nontrivial (see :issue:`6393`)::
 
-            sage: G = DirichletGroup(5); X = G.list(); Y=X[0]; Z=X[1]
+            sage: G = DirichletGroup(5); X = G.list(); Y = X[0]; Z = X[1]
             sage: Y.jacobi_sum(Z)
             -1
             sage: Z.jacobi_sum(Y)
@@ -1704,7 +1704,7 @@ class DirichletCharacter(MultiplicativeGroupElement):
         return g
 
     @cached_method
-    def is_even(self):
+    def is_even(self) -> bool:
         r"""
         Return ``True`` if and only if `\varepsilon(-1) = 1`.
 
@@ -1748,7 +1748,7 @@ class DirichletCharacter(MultiplicativeGroupElement):
         return self(-1) == R.one()
 
     @cached_method
-    def is_odd(self):
+    def is_odd(self) -> bool:
         r"""
         Return ``True`` if and only if `\varepsilon(-1) = -1`.
 
@@ -1788,7 +1788,7 @@ class DirichletCharacter(MultiplicativeGroupElement):
         return self(-1) == R(-1)
 
     @cached_method
-    def is_primitive(self):
+    def is_primitive(self) -> bool:
         """
         Return ``True`` if and only if this character is
         primitive, i.e., its conductor equals its modulus.
@@ -1813,7 +1813,7 @@ class DirichletCharacter(MultiplicativeGroupElement):
         return (self.conductor() == self.modulus())
 
     @cached_method
-    def is_trivial(self):
+    def is_trivial(self) -> bool:
         r"""
         Return ``True`` if this is the trivial character,
         i.e., has order 1.
@@ -1831,7 +1831,7 @@ class DirichletCharacter(MultiplicativeGroupElement):
         one = self.base_ring().one()
         return all(x == one for x in self.values_on_gens())
 
-    def kernel(self):
+    def kernel(self) -> list:
         r"""
         Return the kernel of this character.
 
@@ -2045,7 +2045,7 @@ class DirichletCharacter(MultiplicativeGroupElement):
         return H(self)
 
     @cached_method
-    def values(self):
+    def values(self) -> list:
         """
         Return a list of the values of this character on each integer
         between 0 and the modulus.
@@ -2133,7 +2133,7 @@ class DirichletCharacter(MultiplicativeGroupElement):
                 i += 1
 
     @cached_method(do_pickle=True)
-    def values_on_gens(self):
+    def values_on_gens(self) -> tuple:
         r"""
         Return a tuple of the values of ``self`` on the standard
         generators of `(\ZZ/N\ZZ)^*`, where `N` is the modulus.
@@ -2459,6 +2459,12 @@ class DirichletGroupFactory(UniqueFactory):
 
         sage: DirichletGroup(60) is DirichletGroup(60)
         True
+
+    Test for pickling::
+
+        sage: G = DirichletGroup(9)
+        sage: loads(dumps(G)) is G
+        True
     """
     def create_key(self, N, base_ring=None, zeta=None, zeta_order=None,
                    names=None, integral=False):
@@ -2566,7 +2572,7 @@ class DirichletGroupFactory(UniqueFactory):
 DirichletGroup = DirichletGroupFactory("DirichletGroup")
 
 
-def is_DirichletGroup(x):
+def is_DirichletGroup(x) -> bool:
     """
     Return ``True`` if ``x`` is a Dirichlet group.
 
@@ -2595,7 +2601,7 @@ class DirichletGroup_class(WithEqualityById, Parent):
 
     Element = DirichletCharacter
 
-    def __init__(self, base_ring, modulus, zeta, zeta_order):
+    def __init__(self, base_ring, modulus, zeta, zeta_order) -> None:
         """
         Create a Dirichlet group.
 
@@ -2634,21 +2640,6 @@ class DirichletGroup_class(WithEqualityById, Parent):
         self._modulus = modulus
         self._integers = IntegerModRing(modulus)
 
-    def __setstate__(self, state):
-        """
-        Used for unpickling old instances.
-
-        TESTS::
-
-            sage: G = DirichletGroup(9)
-            sage: loads(dumps(G)) is G
-            True
-        """
-        self._set_element_constructor()
-        if '_zeta_order' in state:
-            state['_zeta_order'] = Integer(state['_zeta_order'])
-        super().__setstate__(state)
-
     @property
     def _module(self):
         """
@@ -2689,7 +2680,7 @@ class DirichletGroup_class(WithEqualityById, Parent):
         return w
 
     @property
-    def _zeta_dlog(self):
+    def _zeta_dlog(self) -> dict:
         """
         Return a dictionary that can be used to compute discrete
         logarithms in the value group of this Dirichlet group.
@@ -2873,7 +2864,7 @@ class DirichletGroup_class(WithEqualityById, Parent):
             a.append(R(x(v)))
         return self.element_class(self, a)
 
-    def _coerce_map_from_(self, X):
+    def _coerce_map_from_(self, X) -> bool:
         """
         Decide whether there is a coercion map from `X`.
 
@@ -2918,7 +2909,7 @@ class DirichletGroup_class(WithEqualityById, Parent):
         """
         return self.order()
 
-    def _repr_(self):
+    def _repr_(self) -> str:
         """
         Return a print representation of this group, which can be renamed.
 
@@ -2938,7 +2929,7 @@ class DirichletGroup_class(WithEqualityById, Parent):
         return s
 
     @cached_method
-    def decomposition(self):
+    def decomposition(self) -> list:
         r"""
         Return the Dirichlet groups of prime power modulus corresponding
         to primes dividing modulus.
@@ -3107,7 +3098,7 @@ class DirichletGroup_class(WithEqualityById, Parent):
         return g[n]
 
     @cached_method
-    def gens(self):
+    def gens(self) -> tuple:
         """
         Return generators of ``self``.
 
@@ -3120,7 +3111,7 @@ class DirichletGroup_class(WithEqualityById, Parent):
         g = []
         ord = self.zeta_order()
         M = self._module
-        zero = M(0)
+        zero = M.zero()
         orders = self.integers_mod().unit_group().gens_orders()
         for i in range(len(self.unit_gens())):
             z = zero.__copy__()
@@ -3143,7 +3134,7 @@ class DirichletGroup_class(WithEqualityById, Parent):
 
     __iter__ = multiplicative_iterator
 
-    def list(self):
+    def list(self) -> list:
         """
         Return a list of the Dirichlet characters in this group.
 
@@ -3169,7 +3160,7 @@ class DirichletGroup_class(WithEqualityById, Parent):
         """
         return self._modulus
 
-    def ngens(self):
+    def ngens(self) -> int:
         """
         Return the number of generators of ``self``.
 
@@ -3247,7 +3238,7 @@ class DirichletGroup_class(WithEqualityById, Parent):
             e *= g**n
         return e
 
-    def unit_gens(self):
+    def unit_gens(self) -> tuple:
         r"""
         Return the minimal generators for the units of
         `(\ZZ/N\ZZ)^*`, where `N` is the

sage/modular/drinfeld_modform/element.py

@@ -88,7 +88,7 @@ class DrinfeldModularFormsElement(ModuleElement):
 
     .. NOTE::
 
-        This class should not be directly instanciated, instead create
+        This class should not be directly instantiated, instead create
         an instance of the parent
         :class:`~sage.modular.drinfeld_modform.ring.DrinfeldModularForms`
         and access its elements using the relevant methods.
@@ -255,7 +255,7 @@ class DrinfeldModularFormsElement(ModuleElement):
         """
         return self.parent()._rank
 
-    def is_one(self):
+    def is_one(self) -> bool:
         r"""
         Return ``True`` whether this graded Drinfeld form is the
         multiplicative identity.
@@ -272,7 +272,7 @@ class DrinfeldModularFormsElement(ModuleElement):
         """
         return self._polynomial.is_one()
 
-    def is_zero(self):
+    def is_zero(self) -> bool:
         r"""
         Return ``True`` whether this graded Drinfeld form is the
         additive identity.
@@ -294,7 +294,7 @@ class DrinfeldModularFormsElement(ModuleElement):
         """
         return not bool(self)
 
-    def is_homogeneous(self):
+    def is_homogeneous(self) -> bool:
         r"""
         Return whether the graded form is homogeneous in the weight.
 

sage/modular/drinfeld_modform/ring.py

@@ -103,7 +103,7 @@ class DrinfeldModularForms(Parent, UniqueRepresentation):
 
       If this parameter is a single character, for example ``f``, and a
       rank is specified, then the names will be of the form
-      ``f1, f2, ..., fr``. Finally, if this parameter is a list, a tupe
+      ``f1, f2, ..., fr``. Finally, if this parameter is a list, a tuple
       or a string of comma separated characters, then each character
       will corresponds to a generator. Note that in this case, it not
       necessary to specify the rank.
@@ -120,7 +120,7 @@ class DrinfeldModularForms(Parent, UniqueRepresentation):
     Use the :meth:`gens` method to obtain the generators of the ring::
 
         sage: M.gens()
-        [g1, g2, g3]
+        (g1, g2, g3)
         sage: M.inject_variables()  # assign the variable g1, g2, g3
         Defining g1, g2, g3
         sage: T*g1*g2 + g3
@@ -131,29 +131,29 @@ class DrinfeldModularForms(Parent, UniqueRepresentation):
 
         sage: M.<F, G, H> = DrinfeldModularForms(K)
         sage: M.gens()
-        [F, G, H]
+        (F, G, H)
         sage: M = DrinfeldModularForms(K, 5, names='f')  # must specify the rank
         sage: M.gens()
-        [f1, f2, f3, f4, f5]
+        (f1, f2, f3, f4, f5)
         sage: M = DrinfeldModularForms(K, names='u, v, w, x')
         sage: M.gens()
-        [u, v, w, x]
+        (u, v, w, x)
         sage: M = DrinfeldModularForms(K, names=['F', 'G', 'H'])
         sage: M.gens()
-        [F, G, H]
+        (F, G, H)
 
     Set the keyword parameter ``has_type`` to ``True`` in order to create
     the ring of Drinfeld modular forms of arbitrary type::
 
         sage: M = DrinfeldModularForms(K, 4, has_type=True)
         sage: M.gens()
-        [g1, g2, g3, h4]
+        (g1, g2, g3, h4)
         sage: h4 = M.3
         sage: h4.type()
         1
 
     To obtain a generating set of the subspace of forms of a fixed
-    weight, use the methode :meth:`basis_of_weight`::
+    weight, use the method :meth:`basis_of_weight`::
 
         sage: M = DrinfeldModularForms(K, 2)
         sage: M.basis_of_weight(q^3 - 1)                                                # needs sage.combinat
@@ -619,18 +619,18 @@ class DrinfeldModularForms(Parent, UniqueRepresentation):
         """
         return self(self._poly_ring.gen(n))
 
-    def gens(self):
+    def gens(self) -> tuple:
         r"""
-        Return a list of generators of this ring.
+        Return a tuple of generators of this ring.
 
         EXAMPLES::
 
             sage: A = GF(3)['T']; K = Frac(A); T = K.gen()
             sage: M = DrinfeldModularForms(K, 5)
             sage: M.gens()
-            [g1, g2, g3, g4, g5]
+            (g1, g2, g3, g4, g5)
         """
-        return [self(g) for g in self._poly_ring.gens()]
+        return tuple(self(g) for g in self._poly_ring.gens())
 
     def ngens(self):
         r"""

sage/modular/drinfeld_modform/tutorial.py

@@ -214,7 +214,7 @@ keyword argument ``has_type=True``::
 
     sage: M = DrinfeldModularForms(K, 4, has_type=True)
     sage: M.gens()
-    [g1, g2, g3, h4]
+    (g1, g2, g3, h4)
     sage: h4 = M.3
     sage: h4.weight()
     40