various small fixes, some after ruff

fchapoton · fchapoton · commit e0074e63c105 · 2025-04-30T19:22:00.000+02:00
diff --git a/src/sage/algebras/fusion_rings/fusion_double.py b/src/sage/algebras/fusion_rings/fusion_double.py
@@ -257,8 +257,8 @@ def s_ij(self, i, j, unitary=False, base_coercion=True):
         """
         sum_val = ZZ.zero()
         G = self._G
-        [i] = list(i._monomial_coefficients)
-        [j] = list(j._monomial_coefficients)
+        i, = list(i._monomial_coefficients)
+        j, = list(j._monomial_coefficients)
         a = self._elt[i]
         b = self._elt[j]
         for g in G:
diff --git a/src/sage/combinat/crystals/fast_crystals.py b/src/sage/combinat/crystals/fast_crystals.py
@@ -220,9 +220,9 @@ def _type_bc_init(self, l1, l2):
             4
         """
         if self._cartan_type[0] == 'B':
-            [m1, m2] = [l1+l2, l1-l2]
+            m1, m2 = [l1+l2, l1-l2]
         else:
-            [m1, m2] = [l1, l2]
+            m1, m2 = [l1, l2]
         for b in range(m2,-1,-1):
             for a in range(m1,m2-1,-1):
                 for c in range(b,a+1):
@@ -336,11 +336,11 @@ def weight(self):
             delpat = self.parent().delpat[self.value]
             if self.parent()._cartan_type[0] == 'A':
                 delpat = delpat + [0,]
-            [alpha1, alpha2] = self.parent().weight_lattice_realization().simple_roots()
+            alpha1, alpha2 = self.parent().weight_lattice_realization().simple_roots()
             hwv = sum(self.parent().shape[i]*self.parent().weight_lattice_realization().monomial(i) for i in range(2))
             return hwv - (delpat[0]+delpat[2])*alpha1 - (delpat[1]+delpat[3])*alpha2
 
-        def _repr_(self):
+        def _repr_(self) -> str:
             """
             EXAMPLES::
 
diff --git a/src/sage/combinat/parallelogram_polyomino.py b/src/sage/combinat/parallelogram_polyomino.py
@@ -695,7 +695,7 @@ def rotate(pos, angle):
 
             The rotated position.
             """
-            [x, y] = pos
+            x, y = pos
             return [x*cos(angle) - y*sin(angle), x*sin(angle) + y*cos(angle)]
 
         def mirror(pos, axe):
@@ -770,8 +770,8 @@ def draw_line(self, v1, v2, color=None, size=None):
             color = self._color_line
         if size is None:
             size = self._line_size
-        [x1, y1] = self.XY(v1)
-        [x2, y2] = self.XY(v2)
+        x1, y1 = self.XY(v1)
+        x2, y2 = self.XY(v2)
         return "\n  \\draw[color=%s, line width=%s] (%f, %f) -- (%f, %f);" % (
             color, size, float(x1), float(y1), float(x2), float(y2)
         )
@@ -844,14 +844,14 @@ def draw_point(self, p1, color=None, size=None):
             color = self._color_point
         if size is None:
             size = self._point_size
-        [x1, y1] = self.XY(p1)
+        x1, y1 = self.XY(p1)
         return "\n  \\filldraw[color=%s] (%f, %f) circle (%spt);" % (
             color, float(x1), float(y1), size
         )
 
 
 class ParallelogramPolyomino(ClonableList,
-        metaclass=InheritComparisonClasscallMetaclass):
+                             metaclass=InheritComparisonClasscallMetaclass):
     r"""
     Parallelogram Polyominoes.
 
diff --git a/src/sage/combinat/words/finite_word.py b/src/sage/combinat/words/finite_word.py
@@ -1684,8 +1684,8 @@ def reduced_rauzy_graph(self, n):
             g.allow_loops(True)
             g.allow_multiple_edges(True)
             for v in l:
-                [i] = g.neighbors_in(v)
-                [o] = g.neighbors_out(v)
+                i, = g.neighbors_in(v)
+                o, = g.neighbors_out(v)
                 g.add_edge(i, o, g.edge_label(i, v)[0]*g.edge_label(v, o)[0])
                 g.delete_vertex(v)
         return g
diff --git a/src/sage/dynamics/arithmetic_dynamics/wehlerK3.py b/src/sage/dynamics/arithmetic_dynamics/wehlerK3.py
@@ -1140,20 +1140,20 @@ def sigmaX(self, P, **kwds):
                     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()
@@ -1237,7 +1237,7 @@ def sigmaX(self, P, **kwds):
         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):
@@ -1278,9 +1278,9 @@ def sigmaX(self, P, **kwds):
                 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)
@@ -1290,7 +1290,7 @@ def sigmaX(self, P, **kwds):
                 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:
@@ -1384,19 +1384,19 @@ def sigmaY(self, P, **kwds):
                     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()
@@ -1520,18 +1520,18 @@ def sigmaY(self, P, **kwds):
             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:
                     raise ValueError("cannot distinguish points in the degenerate fiber")
                 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:
diff --git a/src/sage/geometry/hyperbolic_space/hyperbolic_geodesic.py b/src/sage/geometry/hyperbolic_space/hyperbolic_geodesic.py
@@ -1213,11 +1213,10 @@ def ideal_endpoints(self):
             [Boundary point in UHP -sqrt(65) + 9,
              Boundary point in UHP sqrt(65) + 9]
         """
-
         start = self._start.coordinates()
         end = self._end.coordinates()
-        [x1, x2] = [real(k) for k in [start, end]]
-        [y1, y2] = [imag(k) for k in [start, end]]
+        x1, x2 = [real(k) for k in [start, end]]
+        y1, y2 = [imag(k) for k in [start, end]]
         M = self._model
         # infinity is the first endpoint, so the other ideal endpoint
         # is just the real part of the second coordinate
@@ -2046,8 +2045,7 @@ def _to_std_geod(self, p):
             Full MatrixSpace of 2 by 2 dense matrices over Complex Field
             with 53 bits of precision
         """
-
-        [s, e] = [k.coordinates() for k in self.complete().endpoints()]
+        s, e = [k.coordinates() for k in self.complete().endpoints()]
         B = HyperbolicGeodesicUHP._get_B(p)
         # outmat below will be returned after we normalize the determinant.
         outmat = B * HyperbolicGeodesicUHP._crossratio_matrix(s, p, e)
diff --git a/src/sage/geometry/hyperbolic_space/hyperbolic_model.py b/src/sage/geometry/hyperbolic_space/hyperbolic_model.py
@@ -1091,9 +1091,9 @@ def random_isometry(self, preserve_orientation=True, **kwargs):
             sage: B.preserves_orientation()                                             # needs scipy
             False
         """
-        [a, b, c, d] = [RR.random_element() for k in range(4)]
+        a, b, c, d = [RR.random_element() for k in range(4)]
         while abs(a*d - b*c) < EPSILON:
-            [a, b, c, d] = [RR.random_element() for k in range(4)]
+            a, b, c, d = [RR.random_element() for k in range(4)]
         M = matrix(RDF, 2, [a, b, c, d])
         M = M / (M.det()).abs().sqrt()
         if M.det() > 0:
diff --git a/src/sage/graphs/graph.py b/src/sage/graphs/graph.py
@@ -5781,7 +5781,7 @@ def write_to_eps(self, filename, **options):
         """
         from sage.graphs.print_graphs import print_graph_eps
         pos = self.layout(**options)
-        [xmin, xmax, ymin, ymax] = self._layout_bounding_box(pos)
+        xmin, xmax, ymin, ymax = self._layout_bounding_box(pos)
         for v in pos:
             pos[v] = (1.8*(pos[v][0] - xmin)/(xmax - xmin) - 0.9, 1.8*(pos[v][1] - ymin)/(ymax - ymin) - 0.9)
         if filename[-4:] != '.eps':
diff --git a/src/sage/knots/link.py b/src/sage/knots/link.py
@@ -2868,8 +2868,8 @@ def _bracket(self):
 
         cross = pd_code[0]
         rest = [list(vertex) for vertex in pd_code[1:]]
-        [a, b, c, d] = cross
-        if a == d and c == b and len(rest) > 0:
+        a, b, c, d = cross
+        if a == d and c == b and rest:
             return (~t + t**(-5)) * Link(rest)._bracket()
         elif a == b and c == d and len(rest) > 0:
             return (t + t**5) * Link(rest)._bracket()
diff --git a/src/sage/matroids/matroids_plot_helpers.py b/src/sage/matroids/matroids_plot_helpers.py
@@ -398,7 +398,7 @@ def slp(M1, pos_dict=None, B=None) -> tuple:
         sage: M1 = Matroid(ring=GF(2), matrix=[[1, 0, 0, 0, 1, 1, 1,0,1,0,1],
         ....:                                  [0, 1, 0, 1, 0, 1, 1,0,0,1,0],
         ....:                                  [0, 0, 1, 1, 1, 0, 1,0,0,0,0]])
-        sage: [M,L,P] = matroids_plot_helpers.slp(M1)                                   # needs sage.rings.finite_rings
+        sage: M, L, P = matroids_plot_helpers.slp(M1)                                   # needs sage.rings.finite_rings
         sage: M.is_simple()                                                             # needs sage.rings.finite_rings
         True
         sage: setprint([L,P])                                                           # needs sage.rings.finite_rings
@@ -408,7 +408,7 @@ def slp(M1, pos_dict=None, B=None) -> tuple:
         ....:                                  [0, 0, 1, 1, 1, 0, 1,0,0,0,0]])
         sage: posdict = {8: (0, 0),  1: (2, 0),  2: (1, 2),  3: (1.5, 1.0),
         ....:            4: (0.5, 1.0),  5: (1.0, 0.0), 6: (1.0, 0.6666666666666666)}
-        sage: [M,L,P] = matroids_plot_helpers.slp(M1, pos_dict=posdict)                 # needs sage.rings.finite_rings
+        sage: M, L, P = matroids_plot_helpers.slp(M1, pos_dict=posdict)                 # needs sage.rings.finite_rings
         sage: M.is_simple()                                                             # needs sage.rings.finite_rings
         True
         sage: setprint([L,P])                                                           # needs sage.rings.finite_rings
@@ -479,7 +479,7 @@ def addlp(M, M1, L, P, ptsdict, G=None, limits=None) -> tuple:
         sage: M = Matroid(ring=GF(2), matrix=[[1, 0, 0, 0, 1, 1, 1,0,1],
         ....:                                 [0, 1, 0, 1, 0, 1, 1,0,0],
         ....:                                 [0, 0, 1, 1, 1, 0, 1,0,0]])
-        sage: [M1,L,P] = matroids_plot_helpers.slp(M)                                   # needs sage.rings.finite_rings
+        sage: M1, L, P = matroids_plot_helpers.slp(M)                                   # needs sage.rings.finite_rings
         sage: G, lims = matroids_plot_helpers.addlp(M,M1,L,P,{0:(0,0)})                 # needs sage.plot sage.rings.finite_rings
         sage: G.show(axes=False)                                                        # needs sage.plot sage.rings.finite_rings
 
@@ -759,7 +759,7 @@ def geomrep(M1, B1=None, lineorders1=None, pd=None, sp=False):
     """
     G = Graphics()
     # create lists of loops and parallel elements and simplify given matroid
-    [M, L, P] = slp(M1, pos_dict=pd, B=B1)
+    M, L, P = slp(M1, pos_dict=pd, B=B1)
     if B1 is None:
         B1 = list(M.basis())
     M._cached_info = M1._cached_info
diff --git a/src/sage/modules/free_quadratic_module_integer_symmetric.py b/src/sage/modules/free_quadratic_module_integer_symmetric.py
@@ -304,7 +304,7 @@ def IntegralLatticeDirectSum(Lattices, return_embeddings=False):
         [ 0  0  0  0  0  0  0 -1  2 -1  0]
         [ 0  0  0  0  0  0  0  0 -1  2 -1]
         [ 0  0  0  0  0  0  0  0  0 -1  2]
-        sage: [L, phi] = IntegralLatticeDirectSum([L1, L2, L3], True)
+        sage: L, phi = IntegralLatticeDirectSum([L1, L2, L3], True)
         sage: LL3 = L.sublattice(phi[2].image().basis_matrix())
         sage: L3.discriminant() == LL3.discriminant()
         True
@@ -325,7 +325,7 @@ def IntegralLatticeDirectSum(Lattices, return_embeddings=False):
 
         sage: L1 = IntegralLattice(2 * matrix.identity(2), [[1/2, 1/2]])
         sage: L2 = IntegralLattice("A3", [[1, 1, 2]])                                   # needs sage.graphs
-        sage: [L, phi] = IntegralLatticeDirectSum([L1, L2], True)                       # needs sage.graphs
+        sage: L, phi = IntegralLatticeDirectSum([L1, L2], True)                       # needs sage.graphs
         sage: L                                                                         # needs sage.graphs
         Lattice of degree 5 and rank 2 over Integer Ring
         Basis matrix:
@@ -448,7 +448,7 @@ def IntegralLatticeGluing(Lattices, glue, return_embeddings=False):
         sage: g1 = L1.discriminant_group().gens()[0]
         sage: g2 = L2.discriminant_group().gens()[0]
         sage: glue = [[g1, 2 * g2]]
-        sage: [V, phi] = IntegralLatticeGluing([L1, L2], glue, True)
+        sage: V, phi = IntegralLatticeGluing([L1, L2], glue, True)
         sage: V
         Lattice of degree 8 and rank 8 over Integer Ring
         Basis matrix:
@@ -541,7 +541,7 @@ def IntegralLatticeGluing(Lattices, glue, return_embeddings=False):
         sage: D5 = IntegralLattice("D5")
         sage: gA7 = A7.discriminant_group().gens()[0]
         sage: gD5 = D5.discriminant_group().gens()[0]
-        sage: [L, phi] = IntegralLatticeGluing([A7, A7, D5, D5],
+        sage: L, phi = IntegralLatticeGluing([A7, A7, D5, D5],
         ....:                          [[gA7, gA7, gD5, 2 * gD5],
         ....:                          [gA7, 7 * gA7, 2 * gD5, gD5]], True)
         sage: L.determinant()
@@ -555,9 +555,9 @@ def IntegralLatticeGluing(Lattices, glue, return_embeddings=False):
         sage: # needs sage.graphs
         sage: L1 = IntegralLattice("D4", [[1, 1, 0, 0], [0, 1, 1, 0]])
         sage: L2 = IntegralLattice("E6", [[0, 2, 0, 0, 0, 0], [0, 0, 0, 0, 1, 1]])
-        sage: [f1, f2] = L1.discriminant_group().gens()
-        sage: [g1, g2] = L2.discriminant_group().gens()
-        sage: [L, phi] = IntegralLatticeGluing([L1, L2],
+        sage: f1, f2 = L1.discriminant_group().gens()
+        sage: g1, g2 = L2.discriminant_group().gens()
+        sage: L, phi = IntegralLatticeGluing([L1, L2],
         ....:                                  [[f1, g1], [f2, 2 * g2]], True)
         sage: phi[0]
         Free module morphism defined by the matrix
@@ -593,7 +593,7 @@ def IntegralLatticeGluing(Lattices, glue, return_embeddings=False):
         sage: B * L.gram_matrix() * B.transpose() == L1.gram_matrix()
         True
     """
-    [direct_sum, phi] = IntegralLatticeDirectSum(Lattices, return_embeddings=True)
+    direct_sum, phi = IntegralLatticeDirectSum(Lattices, return_embeddings=True)
     N = len(Lattices)
     for g in glue:
         if not len(g) == N:
diff --git a/src/sage/rings/invariants/reconstruction.py b/src/sage/rings/invariants/reconstruction.py
@@ -186,7 +186,7 @@ def binary_quintic_coefficients_from_invariants(invariants, K=None, invariant_ch
     If the invariant `M` vanishes, then the coefficients are computed in a
     different way::
 
-        sage: [A,B,C] = [3,1,2]
+        sage: A, B, C = [3, 1, 2]
         sage: M = 2*A*B - 3*C
         sage: M
         0
@@ -274,8 +274,8 @@ def binary_quintic_coefficients_from_invariants(invariants, K=None, invariant_ch
         else:
             # if R2 is not a square, we scale the invariants in a suitable way
             # so that the 'new' R2 is a square
-            [A, B, C] = [R2*A, R2**2*B, R2**3*C]
-            [M, N] = [R2**3*M, R2**4*N]
+            A, B, C = [R2*A, R2**2*B, R2**3*C]
+            M, N = [R2**3*M, R2**4*N]
             R = R2**5
     elif len(invariants) == 4:
         if invariants[3]**2 != R2:
@@ -292,17 +292,17 @@ def binary_quintic_coefficients_from_invariants(invariants, K=None, invariant_ch
                                  'quintics with a treefold linear factor')
             else:
                 if B == 0:
-                    return (1,0,0,0,0,1)
+                    return (1, 0, 0, 0, 0, 1)
                 else:
-                    return (0,1,0,0,1,0)
+                    return (0, 1, 0, 0, 1, 0)
         else:
             # case corresponding to using alpha and gamma as coordinates
             if A == 0:
-                return (1,0,0,0,1,0)
+                return (1, 0, 0, 0, 1, 0)
             else:
                 if scaling == 'normalized':
                     # scaling z by (R/A**3)
-                    scale = [ (-N)**-5*A**6*(R/A**3)**i for i in range(6) ]
+                    scale = [(-N)**-5*A**6*(R/A**3)**i for i in range(6)]
                 D = -N
                 Delta = C
                 a = [0]
diff --git a/src/sage/rings/number_field/totallyreal_rel.py b/src/sage/rings/number_field/totallyreal_rel.py
@@ -796,7 +796,7 @@ def enumerate_totallyreal_fields_rel(F, m, B, a=[], verbose=0,
                 counts[1] += 1
                 if nf.polisirreducible():
                     counts[2] += 1
-                    [zk,d] = nf.nfbasis_d()
+                    zk, d = nf.nfbasis_d()
 
                     if d <= B:
                         if verbose:
diff --git a/src/sage/rings/polynomial/msolve.py b/src/sage/rings/polynomial/msolve.py
@@ -267,7 +267,7 @@ def to_poly(p, d=1, *, upol=PolynomialRing(base, 't')):
             return upol(p[1])/d
 
         try:
-            [char, nvars, deg, vars, _, [one, [elim, den, param]]] = data[1]
+            char, nvars, deg, vars, _, [one, [elim, den, param]] = data[1]
         except (IndexError, ValueError):
             raise NotImplementedError(
                 f"unsupported msolve output format: {data}")
diff --git a/src/sage/schemes/curves/affine_curve.py b/src/sage/schemes/curves/affine_curve.py
diff --git a/src/sage/schemes/plane_conics/con_rational_field.py b/src/sage/schemes/plane_conics/con_rational_field.py
diff --git a/src/sage/schemes/product_projective/homset.py b/src/sage/schemes/product_projective/homset.py
diff --git a/src/sage/symbolic/expression_conversions.py b/src/sage/symbolic/expression_conversions.py
diff --git a/src/sage/topology/delta_complex.py b/src/sage/topology/delta_complex.py
diff --git a/src/sage/topology/simplicial_complex_examples.py b/src/sage/topology/simplicial_complex_examples.py
