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

sage/dynamics/arithmetic_dynamics/projective_ds.py

@@ -1737,7 +1737,7 @@ class DynamicalSystem_projective(SchemeMorphism_polynomial_projective_space,
                 res = (f.lc() ** (d - g.degree()) * g.lc() ** (d - f.degree())
                        * f.__pari__().polresultant(g, x))
                 return self.domain().base_ring()(res)
-            except (TypeError, PariError):
+            except (TypeError, PariError):  # type: ignore
                 pass
         #Otherwise, use Macaulay
         R = F[0].parent()
@@ -2121,9 +2121,9 @@ class DynamicalSystem_projective(SchemeMorphism_polynomial_projective_space,
                                 h = max([R(emb(c).abs()) for c in poly.coefficients()])
                         else: #non-archimedean
                             if BR == QQ:
-                                h = max([R(v)**(-R(c.valuation(v)))  for c in poly.coefficients()])
+                                h = max(R(v)**(-R(c.valuation(v))) for c in poly.coefficients())
                             else:
-                                h = max([R(c.abs_non_arch(v, prec=prec)) for c in poly.coefficients()])
+                                h = max(R(c.abs_non_arch(v, prec=prec)) for c in poly.coefficients())
                         maxh = max(h, maxh)
             if maxh == 0:
                 maxh = 1  #avoid division by 0
@@ -5001,7 +5001,7 @@ class DynamicalSystem_projective(SchemeMorphism_polynomial_projective_space,
         r"""
         Compute the ``n`` multiplier spectra of this dynamical system.
 
-        This is the set of multipliers of all peroidic points of
+        This is the set of multipliers of all periodic points of
         period ``n`` included with the appropriate multiplicity.
         User can also specify to compute the formal ``n`` multiplier spectra
         instead which includes the multipliers of all formal periodic points
@@ -5417,7 +5417,7 @@ class DynamicalSystem_projective(SchemeMorphism_polynomial_projective_space,
 
             \prod_{P \text{ period n}} ( w - c(P,t)),
 
-        where `c(P,t)` is the charateristic polynomial (variable `t`) of the
+        where `c(P,t)` is the characteristic polynomial (variable `t`) of the
         multiplier at `P`. Note that in dimension 1, only the coefficients
         of the constant term is returned.
 
@@ -6847,14 +6847,14 @@ class DynamicalSystem_projective(SchemeMorphism_polynomial_projective_space,
     def Lattes_to_curve(self, return_conjugation=False, check_lattes=False):
         r"""
         Finds a Short Weierstrass Model Elliptic curve of self
-        self assumed to be Lattes map and not in charateristic 2 or 3
+        self assumed to be Lattes map and not in characteristic 2 or 3
 
         INPUT:
 
         ``return_conjugation`` -- (default: ``False``) if ``True``, then
         return the conjugation that moves self to a map that comes from a
         Short Weierstrass Model Elliptic curve
-        ``check_lattes``.-.(default:.``False``) if ``True``, then  will ValueError if not Lattes
+        ``check_lattes`` -- (default: ``False``) if ``True``, then  will ValueError if not Lattes
 
         OUTPUT: a Short Weierstrass Model Elliptic curve which is isogenous to
         the Elliptic curve of 'self',

sage/dynamics/arithmetic_dynamics/wehlerK3.py

@@ -1141,20 +1141,20 @@ class WehlerK3Surface_ring(AlgebraicScheme_subscheme_product_projective):
                     raise TypeError("%s fails to convert into the map's domain %s, but a `pushforward` method is not properly implemented" % (P, self))
         pt = list(P[0]) + [0, 0, 0]
         if P[1][0] != 0:
-            [a,b,c] = [P[1][0]*self.Gpoly(1, 0)(*pt),
+            a, b, c = [P[1][0]*self.Gpoly(1, 0)(*pt),
                        -1*P[1][0]*self.Hpoly(1, 0, 1)(*pt) - P[1][1]*self.Gpoly(1, 0)(*pt),
                        -P[1][0]*self.Hpoly(1, 0, 2)(*pt) - P[1][2]*self.Gpoly(1, 0)(*pt)]
         elif P[1][1] != 0:
-            [a,b,c] = [-1*P[1][1]*self.Hpoly(1, 0, 1)(*pt)-P[1][0]*self.Gpoly(1, 1)(*pt),
+            a, b, c = [-1*P[1][1]*self.Hpoly(1, 0, 1)(*pt)-P[1][0]*self.Gpoly(1, 1)(*pt),
                         P[1][1]*self.Gpoly(1, 1)(*pt),
                        -P[1][1]*self.Hpoly(1, 1, 2)(*pt)-P[1][2]*self.Gpoly(1, 1)(*pt)]
         else:
-            [a,b,c] = [-1*P[1][2]*self.Hpoly(1, 0, 2)(*pt) - P[1][0]*self.Gpoly(1, 2)(*pt),
+            a, b, c = [-1*P[1][2]*self.Hpoly(1, 0, 2)(*pt) - P[1][0]*self.Gpoly(1, 2)(*pt),
                        -P[1][2]*self.Hpoly(1, 1, 2)(*pt) - P[1][1]*self.Gpoly(1, 2)(*pt),
                        P[1][2]*self.Gpoly(1, 2)(*pt)]
         Point = [P[0][0], P[0][1], P[0][2], a, b, c]
 
-        if [a,b,c] != [0,0,0]:
+        if any([a, b, c]):
             if normalize:
                 Point = self.point(Point,False)
                 Point.normalize_coordinates()
@@ -1238,7 +1238,7 @@ class WehlerK3Surface_ring(AlgebraicScheme_subscheme_product_projective):
         if len(V) == 2:
             for D in V:
                 if D[s] != 0:
-                    [a,b,c] = [D[z0], D[z1], D[z2]]
+                    a, b, c = [D[z0], D[z1], D[z2]]
         else:
             newT = [phi(tee) for tee in T]
             for i in range(2):
@@ -1279,9 +1279,9 @@ class WehlerK3Surface_ring(AlgebraicScheme_subscheme_product_projective):
                 raise ValueError("cannot distinguish points in the degenerate fiber")
 
             if len(V) == 1:
-                [a, b, c] = [V[0][z0], V[0][z1], V[0][z2]]
+                a, b, c = [V[0][z0], V[0][z1], V[0][z2]]
 
-            if len(V) == 0 or [a,b,c] == [0, 0, 0]:
+            if len(V) == 0 or not any([a, b, c]):
                 SS = PolynomialRing(BR, 3, 'z0, z1, z2', order='lex')
                 z0,z1,z2 = SS.gens()
                 phi = RR.hom([1, 0, z0, z1, z2], SS)
@@ -1291,7 +1291,7 @@ class WehlerK3Surface_ring(AlgebraicScheme_subscheme_product_projective):
                 V = phi(I).variety()
                 if len(V) > 1:
                     raise ValueError( "cannot distinguish points in the degenerate fiber")
-                [a,b,c] = [V[0][z0], V[0][z1], V[0][z2]]
+                a, b, c = [V[0][z0], V[0][z1], V[0][z2]]
 
         Point = [P[0][0], P[0][1], P[0][2], a, b, c]
         if normalize:
@@ -1385,19 +1385,19 @@ class WehlerK3Surface_ring(AlgebraicScheme_subscheme_product_projective):
                     raise TypeError("%s fails to convert into the map's domain %s, but a `pushforward` method is not properly implemented" % (P, self))
         pt = [0, 0, 0] + list(P[1])
         if P[0][0] != 0:
-            [a, b, c] = [P[0][0]*self.Gpoly(0, 0)(*pt),
+            a, b, c = [P[0][0]*self.Gpoly(0, 0)(*pt),
                       -1*P[0][0]*self.Hpoly(0, 0, 1)(*pt) - P[0][1]*self.Gpoly(0, 0)(*pt),
                       -P[0][0]*self.Hpoly(0, 0, 2)(*pt) - P[0][2]*self.Gpoly(0, 0)(*pt)]
         elif P[0][1] != 0:
-            [a, b, c] = [-1*P[0][1]*self.Hpoly(0, 0, 1)(*pt) - P[0][0]*self.Gpoly(0, 1)(*pt),
+            a, b, c = [-1*P[0][1]*self.Hpoly(0, 0, 1)(*pt) - P[0][0]*self.Gpoly(0, 1)(*pt),
                        P[0][1]*self.Gpoly(0, 1)(*pt),
                        -P[0][1]*self.Hpoly(0, 1, 2)(*pt) - P[0][2]*self.Gpoly(0, 1)(*pt)]
         else:
-            [a, b, c] = [-1*P[0][2]*self.Hpoly(0, 0, 2)(*pt) - P[0][0]*self.Gpoly(0, 2)(*pt),
+            a, b, c = [-1*P[0][2]*self.Hpoly(0, 0, 2)(*pt) - P[0][0]*self.Gpoly(0, 2)(*pt),
                        - P[0][2]*self.Hpoly(0, 1, 2)(*pt) - P[0][1]*self.Gpoly(0, 2)(*pt),
                        P[0][2]*self.Gpoly(0, 2)(*pt)]
         Point = [a, b, c, P[1][0], P[1][1], P[1][2]]
-        if [a, b, c] != [0, 0, 0]:
+        if any([a, b, c]):
             if normalize:
                 Point = self.point(Point, False)
                 Point.normalize_coordinates()
@@ -1521,10 +1521,10 @@ class WehlerK3Surface_ring(AlgebraicScheme_subscheme_product_projective):
             if len(V) > 1:
                 raise ValueError("cannot distinguish points in the degenerate fiber")
             if len(V) == 1:
-                [a, b, c] = [V[0][z0], V[0][z1], V[0][z2]]
-            if len(V) == 0 or [a,b,c] == [0, 0, 0]:
+                a, b, c = [V[0][z0], V[0][z1], V[0][z2]]
+            if len(V) == 0 or not any([a, b, c]):
                 SS = PolynomialRing(BR, 3, 'z0, z1, z2', order='lex')
-                z0,z1,z2 = SS.gens()
+                z0, z1, z2 = SS.gens()
                 phi = RR.hom([1, 0, z0, z1, z2], SS)
                 J = phi(I)
                 if J.dimension() > 0:
@@ -1532,7 +1532,7 @@ class WehlerK3Surface_ring(AlgebraicScheme_subscheme_product_projective):
                 V = phi(I).variety()
                 if len(V) > 1:
                     raise ValueError("cannot distinguish points in the degenerate fiber")
-                [a,b,c] = [V[0][z0], V[0][z1], V[0][z2]]
+                a, b, c = [V[0][z0], V[0][z1], V[0][z2]]
 
         Point = [a, b, c, P[1][0], P[1][1], P[1][2]]
         if normalize:
@@ -2067,8 +2067,8 @@ class WehlerK3Surface_ring(AlgebraicScheme_subscheme_product_projective):
         Points = []
 
         if (self.Gpoly(component,0)(P0) != 0):
-             #We are using the quadratic formula, we need this check to ensure that the points
-             #will be rational
+            # We are using the quadratic formula, we need this check
+            # to ensure that the points will be rational
             T0 = (self.Hpoly(component, 0, 1)(P0)**2 - 4*self.Gpoly(component, 0)(P0)*self.Gpoly(component, 1)(P0))
             T1 = (self.Hpoly(component, 0, 2)(P0)**2 - 4*self.Gpoly(component, 0)(P0)*self.Gpoly(component, 2)(P0))
             if (T0.is_square() and T1.is_square()):

sage/modular/abvar/abvar.py

@@ -1610,7 +1610,7 @@ class ModularAbelianVariety_abstract(Parent):
 
         return H(Morphism(H, mat))
 
-    def is_subvariety_of_ambient_jacobian(self):
+    def is_subvariety_of_ambient_jacobian(self) -> bool:
         """
         Return ``True`` if ``self`` is (presented as) a subvariety of the ambient
         product Jacobian.
@@ -2769,7 +2769,7 @@ class ModularAbelianVariety_abstract(Parent):
             sage: t.order()
             4
             sage: t.gens()
-            [[(1/2, 0, 0, -1/2, 0, 0)], [(0, 0, 1/2, 0, 1/2, -1/2)]]
+            ([(1/2, 0, 0, -1/2, 0, 0)], [(0, 0, 1/2, 0, 1/2, -1/2)])
         """
         try:
             return self.__rational_torsion_subgroup
@@ -2788,7 +2788,7 @@ class ModularAbelianVariety_abstract(Parent):
             sage: J = J0(54)
             sage: C = J.cuspidal_subgroup()
             sage: C.gens()
-            [[(1/3, 0, 0, 0, 0, 1/3, 0, 2/3)], [(0, 1/3, 0, 0, 0, 2/3, 0, 1/3)], [(0, 0, 1/9, 1/9, 1/9, 1/9, 1/9, 2/9)], [(0, 0, 0, 1/3, 0, 1/3, 0, 0)], [(0, 0, 0, 0, 1/3, 1/3, 0, 1/3)], [(0, 0, 0, 0, 0, 0, 1/3, 2/3)]]
+            ([(1/3, 0, 0, 0, 0, 1/3, 0, 2/3)], [(0, 1/3, 0, 0, 0, 2/3, 0, 1/3)], [(0, 0, 1/9, 1/9, 1/9, 1/9, 1/9, 2/9)], [(0, 0, 0, 1/3, 0, 1/3, 0, 0)], [(0, 0, 0, 0, 1/3, 1/3, 0, 1/3)], [(0, 0, 0, 0, 0, 0, 1/3, 2/3)])
             sage: C.invariants()
             [3, 3, 3, 3, 3, 9]
             sage: J1(13).cuspidal_subgroup()
@@ -2900,7 +2900,7 @@ class ModularAbelianVariety_abstract(Parent):
             sage: CQ = J.rational_cusp_subgroup(); CQ
             Finite subgroup with invariants [3, 3, 9] over QQ of Abelian variety J0(54) of dimension 4
             sage: CQ.gens()
-            [[(1/3, 0, 0, 1/3, 2/3, 1/3, 0, 1/3)], [(0, 0, 1/9, 1/9, 7/9, 7/9, 1/9, 8/9)], [(0, 0, 0, 0, 0, 0, 1/3, 2/3)]]
+            ([(1/3, 0, 0, 1/3, 2/3, 1/3, 0, 1/3)], [(0, 0, 1/9, 1/9, 7/9, 7/9, 1/9, 8/9)], [(0, 0, 0, 0, 0, 0, 1/3, 2/3)])
             sage: factor(CQ.order())
             3^4
             sage: CQ.invariants()
@@ -2961,7 +2961,7 @@ class ModularAbelianVariety_abstract(Parent):
             sage: CQ = J.rational_cuspidal_subgroup(); CQ
             Finite subgroup with invariants [3, 3, 9] over QQ of Abelian variety J0(54) of dimension 4
             sage: CQ.gens()
-            [[(1/3, 0, 0, 1/3, 2/3, 1/3, 0, 1/3)], [(0, 0, 1/9, 1/9, 7/9, 7/9, 1/9, 8/9)], [(0, 0, 0, 0, 0, 0, 1/3, 2/3)]]
+            ([(1/3, 0, 0, 1/3, 2/3, 1/3, 0, 1/3)], [(0, 0, 1/9, 1/9, 7/9, 7/9, 1/9, 8/9)], [(0, 0, 0, 0, 0, 0, 1/3, 2/3)])
             sage: factor(CQ.order())
             3^4
             sage: CQ.invariants()
@@ -3109,7 +3109,7 @@ class ModularAbelianVariety_abstract(Parent):
             sage: G.order()
             625
             sage: G.gens()
-            [[(1/5, 0, 0, 0)], [(0, 1/5, 0, 0)], [(0, 0, 1/5, 0)], [(0, 0, 0, 1/5)]]
+            ([(1/5, 0, 0, 0)], [(0, 1/5, 0, 0)], [(0, 0, 1/5, 0)], [(0, 0, 0, 1/5)])
             sage: A = J0(23)
             sage: A.torsion_subgroup(2).order()
             16
@@ -3232,10 +3232,11 @@ class ModularAbelianVariety_abstract(Parent):
             else:
                 raise ValueError("self must be simple")
 
-    def is_simple(self, none_if_not_known=False):
+    def is_simple(self, none_if_not_known=False) -> bool:
         """
-        Return whether or not this modular abelian variety is simple, i.e.,
-        has no proper nonzero abelian subvarieties.
+        Return whether or not this modular abelian variety is simple.
+
+        This means that it has no proper nonzero abelian subvarieties.
 
         INPUT:
 
@@ -4243,7 +4244,7 @@ class ModularAbelianVariety_modsym_abstract(ModularAbelianVariety_abstract):
         """
         return self.modular_symbols().group()
 
-    def is_subvariety(self, other):
+    def is_subvariety(self, other) -> bool:
         """
         Return ``True`` if ``self`` is a subvariety of ``other``.
 
@@ -4296,7 +4297,7 @@ class ModularAbelianVariety_modsym_abstract(ModularAbelianVariety_abstract):
             return ModularAbelianVariety_abstract.is_subvariety(self, other)
         return self.modular_symbols().is_submodule(other.modular_symbols())
 
-    def is_ambient(self):
+    def is_ambient(self) -> bool:
         """
         Return ``True`` if this abelian variety attached to a modular symbols
         space is attached to the cuspidal subspace of the ambient

sage/modular/abvar/constructor.py

@@ -6,11 +6,11 @@ AUTHORS:
 
 - William Stein (2007-03)
 """
-###########################################################################
+# #########################################################################
 #       Copyright (C) 2007 William Stein <wstein@gmail.com>               #
 #  Distributed under the terms of the GNU General Public License (GPL)    #
-#                  http://www.gnu.org/licenses/                           #
-###########################################################################
+#                  https://www.gnu.org/licenses/                           #
+# #########################################################################
 
 import weakref
 

sage/modular/abvar/cuspidal_subgroup.py

@@ -12,7 +12,7 @@ EXAMPLES: We compute the cuspidal subgroup of `J_1(13)`::
     sage: C = A.cuspidal_subgroup(); C
     Finite subgroup with invariants [19, 19] over QQ of Abelian variety J1(13) of dimension 2
     sage: C.gens()
-    [[(1/19, 0, 9/19, 9/19)], [(0, 1/19, 0, 9/19)]]
+    ([(1/19, 0, 9/19, 9/19)], [(0, 1/19, 0, 9/19)])
     sage: C.order()
     361
     sage: C.invariants()
@@ -24,7 +24,7 @@ We compute the cuspidal subgroup of `J_0(54)`::
     sage: C = A.cuspidal_subgroup(); C
     Finite subgroup with invariants [3, 3, 3, 3, 3, 9] over QQ of Abelian variety J0(54) of dimension 4
     sage: C.gens()
-    [[(1/3, 0, 0, 0, 0, 1/3, 0, 2/3)], [(0, 1/3, 0, 0, 0, 2/3, 0, 1/3)], [(0, 0, 1/9, 1/9, 1/9, 1/9, 1/9, 2/9)], [(0, 0, 0, 1/3, 0, 1/3, 0, 0)], [(0, 0, 0, 0, 1/3, 1/3, 0, 1/3)], [(0, 0, 0, 0, 0, 0, 1/3, 2/3)]]
+    ([(1/3, 0, 0, 0, 0, 1/3, 0, 2/3)], [(0, 1/3, 0, 0, 0, 2/3, 0, 1/3)], [(0, 0, 1/9, 1/9, 1/9, 1/9, 1/9, 2/9)], [(0, 0, 0, 1/3, 0, 1/3, 0, 0)], [(0, 0, 0, 0, 1/3, 1/3, 0, 1/3)], [(0, 0, 0, 0, 0, 0, 1/3, 2/3)])
     sage: C.order()
     2187
     sage: C.invariants()
@@ -38,7 +38,7 @@ rational cusps.
     sage: C = J0(54).rational_cusp_subgroup(); C
     Finite subgroup with invariants [3, 3, 9] over QQ of Abelian variety J0(54) of dimension 4
     sage: C.gens()
-    [[(1/3, 0, 0, 1/3, 2/3, 1/3, 0, 1/3)], [(0, 0, 1/9, 1/9, 7/9, 7/9, 1/9, 8/9)], [(0, 0, 0, 0, 0, 0, 1/3, 2/3)]]
+    ([(1/3, 0, 0, 1/3, 2/3, 1/3, 0, 1/3)], [(0, 0, 1/9, 1/9, 7/9, 7/9, 1/9, 8/9)], [(0, 0, 0, 0, 0, 0, 1/3, 2/3)])
     sage: C.order()
     81
     sage: C.invariants()
@@ -181,8 +181,7 @@ class CuspidalSubgroup_generic(FiniteSubgroup):
         B = Cusp.free_module().basis_matrix().stack(Eis.free_module().basis_matrix())
         X = B.solve_left(cusp_matrix)
         X = X.matrix_from_columns(range(Cusp.dimension()))
-        lattice = X.row_module(ZZ) + A.lattice()
-        return lattice
+        return X.row_module(ZZ) + A.lattice()
 
 
 class CuspidalSubgroup(CuspidalSubgroup_generic):
@@ -338,7 +337,7 @@ class RationalCuspidalSubgroup(CuspidalSubgroup_generic):
             return lattice
 
 
-def is_rational_cusp_gamma0(c, N, data):
+def is_rational_cusp_gamma0(c, N, data) -> bool:
     """
     Return ``True`` if the rational number c is a rational cusp of level N.
 

sage/modular/abvar/finite_subgroup.py

@@ -28,7 +28,7 @@ EXAMPLES::
     sage: C.order()
     100
     sage: C.gens()
-    [[(1/10, 0, 1/10, 1/10, 1/10, 3/10)], [(0, 1/5, 1/10, 0, 1/10, 9/10)], [(0, 0, 1/2, 0, 1/2, 1/2)]]
+    ([(1/10, 0, 1/10, 1/10, 1/10, 3/10)], [(0, 1/5, 1/10, 0, 1/10, 9/10)], [(0, 0, 1/2, 0, 1/2, 1/2)])
     sage: C.0 + C.1
     [(1/10, 1/5, 1/5, 1/10, 1/5, 6/5)]
     sage: 10*(C.0 + C.1)
@@ -36,7 +36,7 @@ EXAMPLES::
     sage: G = C.subgroup([C.0 + C.1]); G
     Finite subgroup with invariants [10] over QQbar of Abelian variety J0(33) of dimension 3
     sage: G.gens()
-    [[(1/10, 1/5, 1/5, 1/10, 1/5, 1/5)]]
+    ([(1/10, 1/5, 1/5, 1/10, 1/5, 1/5)],)
     sage: G.order()
     10
     sage: G <= C
@@ -264,10 +264,10 @@ class FiniteSubgroup(Module):
         # order gets reversed in passing to lattices.
         return lx._echelon_matrix_richcmp(rx, op)
 
-    def is_subgroup(self, other):
+    def is_subgroup(self, other) -> bool:
         """
-        Return ``True`` exactly if ``self`` is a subgroup of ``other``, and both are
-        defined as subgroups of the same ambient abelian variety.
+        Return ``True`` exactly if ``self`` is a subgroup of ``other``,
+        and both are defined as subgroups of the same ambient abelian variety.
 
         EXAMPLES::
 
@@ -299,7 +299,7 @@ class FiniteSubgroup(Module):
 
             sage: C = J0(22).cuspidal_subgroup()
             sage: C.gens()
-            [[(1/5, 1/5, 4/5, 0)], [(0, 0, 0, 1/5)]]
+            ([(1/5, 1/5, 4/5, 0)], [(0, 0, 0, 1/5)])
             sage: A = C.subgroup([C.0]); B = C.subgroup([C.1])
             sage: A + B == C
             True
@@ -580,22 +580,24 @@ class FiniteSubgroup(Module):
             self.__order = o
             return o
 
-    def gens(self):
+    def gens(self) -> tuple:
         """
-        Return generators for this finite subgroup.
+        Return a tuple of the generators for this finite subgroup.
 
-        EXAMPLES: We list generators for several cuspidal subgroups::
+        EXAMPLES:
+
+        We list generators for several cuspidal subgroups::
 
             sage: J0(11).cuspidal_subgroup().gens()
-            [[(0, 1/5)]]
+            ([(0, 1/5)],)
             sage: J0(37).cuspidal_subgroup().gens()
-            [[(0, 0, 0, 1/3)]]
+            ([(0, 0, 0, 1/3)],)
             sage: J0(43).cuspidal_subgroup().gens()
-            [[(0, 1/7, 0, 6/7, 0, 5/7)]]
+            ([(0, 1/7, 0, 6/7, 0, 5/7)],)
             sage: J1(13).cuspidal_subgroup().gens()
-            [[(1/19, 0, 9/19, 9/19)], [(0, 1/19, 0, 9/19)]]
+            ([(1/19, 0, 9/19, 9/19)], [(0, 1/19, 0, 9/19)])
             sage: J0(22).torsion_subgroup(6).gens()
-            [[(1/6, 0, 0, 0)], [(0, 1/6, 0, 0)], [(0, 0, 1/6, 0)], [(0, 0, 0, 1/6)]]
+            ([(1/6, 0, 0, 0)], [(0, 1/6, 0, 0)], [(0, 0, 1/6, 0)], [(0, 0, 0, 1/6)])
         """
         try:
             return self.__gens
@@ -603,7 +605,7 @@ class FiniteSubgroup(Module):
             pass
 
         B = [self.element_class(self, v) for v in self.lattice().basis() if v.denominator() > 1]
-        self.__gens = Sequence(B, immutable=True)
+        self.__gens = tuple(B)
         return self.__gens
 
     def gen(self, n):
@@ -615,7 +617,7 @@ class FiniteSubgroup(Module):
             sage: J = J0(23)
             sage: C = J.torsion_subgroup(3)
             sage: C.gens()
-            [[(1/3, 0, 0, 0)], [(0, 1/3, 0, 0)], [(0, 0, 1/3, 0)], [(0, 0, 0, 1/3)]]
+            ([(1/3, 0, 0, 0)], [(0, 1/3, 0, 0)], [(0, 0, 1/3, 0)], [(0, 0, 0, 1/3)])
             sage: C.gen(0)
             [(1/3, 0, 0, 0)]
             sage: C.gen(3)
@@ -623,7 +625,7 @@ class FiniteSubgroup(Module):
             sage: C.gen(4)
             Traceback (most recent call last):
             ...
-            IndexError: list index out of range
+            IndexError: tuple index out of range
 
         Negative indices wrap around::
 
@@ -707,7 +709,7 @@ class FiniteSubgroup(Module):
             sage: G2 = J0(27).cuspidal_subgroup(); G2
             Finite subgroup with invariants [3, 3] over QQ of Abelian variety J0(27) of dimension 1
             sage: G2.gens()
-            [[(1/3, 0)], [(0, 1/3)]]
+            ([(1/3, 0)], [(0, 1/3)])
 
         Now we check whether various elements are in `G_1` and `G_2`::
 

sage/modular/abvar/homology.py

@@ -404,8 +404,7 @@ class IntegralHomology(Homology_abvar):
         """
         n = Integer(n)
         M = self.abelian_variety().modular_symbols(sign=1)
-        f = (M.hecke_polynomial(n, var)**2).change_ring(ZZ)
-        return f
+        return (M.hecke_polynomial(n, var)**2).change_ring(ZZ)
 
 
 class RationalHomology(Homology_abvar):

sage/modular/abvar/homspace.py

@@ -509,7 +509,7 @@ class Homspace(HomsetWithBase):
         self.calculate_generators()
         return len(self._gens)
 
-    def gens(self):
+    def gens(self) -> tuple:
         """
         Return tuple of generators for this endomorphism ring.
 

sage/modular/abvar/lseries.py

@@ -17,11 +17,11 @@ TESTS::
     True
 """
 
-###########################################################################
+# #########################################################################
 #       Copyright (C) 2007 William Stein <wstein@gmail.com>               #
 #  Distributed under the terms of the GNU General Public License (GPL)    #
-#                  http://www.gnu.org/licenses/                           #
-###########################################################################
+#                  https://www.gnu.org/licenses/                           #
+# #########################################################################
 
 from sage.structure.sage_object import SageObject
 from sage.rings.integer_ring import ZZ

sage/modular/abvar/morphism.py

@@ -118,7 +118,7 @@ class Morphism_abstract(sage.modules.matrix_morphism.MatrixMorphism_abstract):
             iM, denom = iM._clear_denom()
         return Morphism(self.parent().reversed(), iM)
 
-    def is_isogeny(self):
+    def is_isogeny(self) -> bool:
         """
         Return ``True`` if this morphism is an isogeny of abelian varieties.
 

sage/modular/abvar/torsion_point.py

@@ -16,7 +16,7 @@ AUTHORS:
 #  Distributed under the terms of the GNU General Public License (GPL)
 #  as published by the Free Software Foundation; either version 2 of
 #  the License, or (at your option) any later version.
-#                  http://www.gnu.org/licenses/
+#                  https://www.gnu.org/licenses/
 # ****************************************************************************
 
 from sage.structure.element import ModuleElement

sage/modular/abvar/torsion_subgroup.py

@@ -27,7 +27,7 @@ works out nicely::
     sage: T.divisor_of_order()
     15
     sage: T.gens()
-    [[(1/15, 3/5, 2/5, 14/15)]]
+    ([(1/15, 3/5, 2/5, 14/15)],)
     sage: T.invariants()
     [15]
     sage: d = J.decomposition(); d

sage/modular/arithgroup/arithgroup_perm.py

@@ -1117,7 +1117,7 @@ class ArithmeticSubgroup_Permutation_class(ArithmeticSubgroup):
     # Group stuff
     #
 
-    def is_normal(self):
+    def is_normal(self) -> bool:
         r"""
         Test whether the group is normal.
 
@@ -1135,9 +1135,9 @@ class ArithmeticSubgroup_Permutation_class(ArithmeticSubgroup):
         G = self.relabel(inplace=False)
         s2 = G._S2
         s3 = G._S3
-        ss2 = [None]*N
-        ss3 = [None]*N
-        for j in [s2[0],s3[0]]:
+        ss2 = [None] * N
+        ss3 = [None] * N
+        for j in [s2[0], s3[0]]:
             m = G._canonical_rooted_labels(j)
             for i in range(N):
                 ss2[m[i]] = m[s2[i]]
@@ -1333,7 +1333,7 @@ class ArithmeticSubgroup_Permutation_class(ArithmeticSubgroup):
         from .congroup_generic import CongruenceSubgroup_constructor as CS
         return CS(N, [x.matrix() for x in self.gens()])
 
-    def is_congruence(self):
+    def is_congruence(self) -> bool:
         r"""
         Return ``True`` if this is a congruence subgroup, and ``False``
         otherwise.
@@ -1434,14 +1434,14 @@ class ArithmeticSubgroup_Permutation_class(ArithmeticSubgroup):
             True
         """
         from sage.misc.verbose import verbose
-        if self.index() == 1: # the group is SL2Z (trivial case)
+        if self.index() == 1:  # the group is SL2Z (trivial case)
             return True
 
-        L = self.L() # action of L
-        R = self.R() # action of R
+        L = self.L()  # action of L
+        R = self.R()  # action of R
 
         if self.is_even():
-            N = L.order() # generalised level of the group
+            N = L.order()  # generalised level of the group
         else:
             N = 2 * L.order()
 
@@ -1452,13 +1452,13 @@ class ArithmeticSubgroup_Permutation_class(ArithmeticSubgroup):
         if e == 1:
             # N is odd
             # this only gets called if self is even
-            onehalf = ZZ(2).inverse_mod(N) # i.e. 2^(-1) mod N
+            onehalf = ZZ(2).inverse_mod(N)  # i.e. 2^(-1) mod N
             rel = (R*R*L**(-onehalf))**3
             return rel.is_one()
 
         elif m == 1:
             # N is a power of 2
-            onefifth = ZZ(5).inverse_mod(N) # i.e. 5^(-1) mod N
+            onefifth = ZZ(5).inverse_mod(N)  # i.e. 5^(-1) mod N
             S = L**20*R**onefifth*L**(-4)*~R
 
             # congruence if the three below permutations are trivial
@@ -1631,7 +1631,7 @@ class OddArithmeticSubgroup_Permutation(ArithmeticSubgroup_Permutation_class):
         return (OddArithmeticSubgroup_Permutation,
                 (self._S2,self._S3,self._L,self._R,canonical_labels))
 
-    def is_odd(self):
+    def is_odd(self) -> bool:
         r"""
         Test whether the group is odd.
 
@@ -1643,7 +1643,7 @@ class OddArithmeticSubgroup_Permutation(ArithmeticSubgroup_Permutation_class):
         """
         return True
 
-    def is_even(self):
+    def is_even(self) -> bool:
         r"""
         Test whether the group is even.
 
@@ -1948,7 +1948,7 @@ class EvenArithmeticSubgroup_Permutation(ArithmeticSubgroup_Permutation_class):
         return (EvenArithmeticSubgroup_Permutation,
                 (self._S2, self._S3, self._L, self._R, canonical_labels))
 
-    def is_odd(self):
+    def is_odd(self) -> bool:
         r"""
         Return ``True`` if this subgroup does not contain the matrix `-Id`.
 
@@ -1960,7 +1960,7 @@ class EvenArithmeticSubgroup_Permutation(ArithmeticSubgroup_Permutation_class):
         """
         return False
 
-    def is_even(self):
+    def is_even(self) -> bool:
         r"""
         Return ``True`` if this subgroup contains the matrix `-Id`.
 
@@ -2489,7 +2489,7 @@ class EvenArithmeticSubgroup_Permutation(ArithmeticSubgroup_Permutation_class):
             sage: Go == G
             True
 
-        Strating from `\Gamma(6)` we get a different group::
+        Starting from `\Gamma(6)` we get a different group::
 
             sage: G = Gamma(6).as_permutation_group()
             sage: G.is_odd(), G.index()

sage/modular/arithgroup/congroup_gamma0.py

@@ -245,7 +245,7 @@ class Gamma0_class(GammaH_class):
         """
         return [Gamma0_constructor(M) for M in self.level().divisors()]
 
-    def is_even(self):
+    def is_even(self) -> bool:
         r"""
         Return ``True`` precisely if this subgroup contains the matrix -1.
 
@@ -261,7 +261,7 @@ class Gamma0_class(GammaH_class):
         """
         return True
 
-    def is_subgroup(self, right):
+    def is_subgroup(self, right) -> bool:
         """
         Return ``True`` if ``self`` is a subgroup of ``right``.