remove a few unused imports

src/sage/combinat/key_polynomial.py

@@ -42,15 +42,14 @@
 from sage.misc.cachefunc import cached_method
 from sage.rings.integer_ring import ZZ
 from sage.rings.polynomial.infinite_polynomial_ring import InfinitePolynomialRing, InfinitePolynomialRing_sparse
-from sage.rings.polynomial.infinite_polynomial_element import InfinitePolynomial
 from sage.rings.polynomial.multi_polynomial_ring_base import MPolynomialRing_base
 from sage.rings.polynomial.polynomial_ring import PolynomialRing_commutative
 from sage.rings.polynomial.polynomial_ring_constructor import PolynomialRing
 from sage.structure.element import parent
 
 
 #####################################################################
-## Helper functions
+#  Helper functions
 
 
 def sorting_word(alpha):
@@ -98,7 +97,7 @@
 
 
 #####################################################################
-## Divided difference operators
+#  Divided difference operators
 
 
 def divided_difference(f, i):
@@ -248,7 +247,7 @@
 
 
 #####################################################################
-## Main classes
+#  Main classes
 
 
 class OperatorPolynomial(CombinatorialFreeModule.Element):
@@ -1366,7 +1365,7 @@
             sage: a = AtomPolynomials(ZZ, 4)
             sage: k = KeyPolynomials(ZZ, 4)
             sage: it = iter(a.basis().keys())
             sage: for _ in range(50):
             ....:     C = next(it)
             ....:     assert a.from_key_polynomial(k.from_polynomial(a[C].expand())) == a[C], C
         """

src/sage/combinat/words/infinite_word.py

@@ -79,7 +79,7 @@
 
 
 class InfiniteWord_class(Word_class):
-    def _repr_(self):
+    def _repr_(self) -> str:
         r"""
         Return a string representation of ``self``.
 

src/sage/graphs/cycle_enumeration.py

@@ -206,7 +206,7 @@ def _all_cycles_iterator_vertex(self, vertex, starting_vertices=None, simple=Fal
             if weight_function(e) < 0:
                 raise ValueError("negative weight is not allowed")
 
-    from heapq import heapify, heappop, heappush
+    from heapq import heappop, heappush
     heap_queue = [(0, [vertex])]
     if max_length is None:
         from sage.rings.infinity import Infinity

src/sage/graphs/generators/families.py

@@ -22,10 +22,10 @@
 # ****************************************************************************
 
 from copy import copy
+from itertools import combinations
 from math import sin, cos, pi
+
 from sage.graphs.graph import Graph
-from itertools import combinations
-import subprocess
 
 
 def JohnsonGraph(n, k):

src/sage/modular/abvar/finite_subgroup.py

@@ -100,19 +100,18 @@
 
 import sage.rings.abc
 
-from sage.misc.lazy_import import lazy_import
+from sage.arith.functions import lcm
+from sage.misc.misc_c import prod
 from sage.modular.abvar.torsion_point import TorsionPoint
-from sage.modules.module import Module
 from sage.modules.free_module import FreeModule_generic
-from sage.structure.gens_py import abelian_iterator
-from sage.structure.sequence import Sequence
-from sage.structure.richcmp import richcmp_method, richcmp
+from sage.modules.module import Module
 from sage.rings.integer import Integer
 from sage.rings.integer_ring import ZZ
 from sage.rings.rational_field import QQ
-from sage.arith.functions import lcm
-from sage.misc.misc_c import prod
 from sage.structure.element import coercion_model
+from sage.structure.gens_py import abelian_iterator
+from sage.structure.richcmp import richcmp_method, richcmp
+from sage.structure.sequence import Sequence
 
 
 @richcmp_method

src/sage/schemes/elliptic_curves/cm.py

@@ -38,7 +38,6 @@
 from sage.rings.rational_field import QQ
 from sage.rings.integer_ring import ZZ
 from sage.rings.integer_ring import IntegerRing
-from sage.rings.polynomial.polynomial_ring_constructor import PolynomialRing
 
 from sage.misc.cachefunc import cached_function
 from sage.rings.number_field.number_field_element_base import NumberFieldElement_base

src/sage/schemes/elliptic_curves/ell_rational_field.py

@@ -74,7 +74,6 @@
 from sage.rings.power_series_ring import PowerSeriesRing
 from sage.rings.rational_field import QQ
 from sage.rings.rational_field import RationalField
-from sage.rings.real_mpfi import RealIntervalField
 from sage.rings.real_mpfr import RealField, RR
 from sage.structure.coerce import py_scalar_to_element
 from sage.structure.element import Element, RingElement

src/sage/schemes/elliptic_curves/hom_fractional.py

@@ -86,7 +86,6 @@
 - Lorenz Panny (2024)
 """
 
-from sage.structure.richcmp import op_EQ
 from sage.misc.cachefunc import cached_method
 from sage.structure.sequence import Sequence
 

src/sage/schemes/hyperelliptic_curves/constructor.py

@@ -272,7 +272,6 @@ def HyperellipticCurve(f, h=None, names=None, PP=None, check_squarefree=True):
         from sage.rings.polynomial.multi_polynomial import MPolynomial
         if isinstance(f, MPolynomial) and len(f.parent().gens()) == 2:
             from sage.rings.polynomial.polynomial_ring_constructor import PolynomialRing
-            from sage.structure.element import get_coercion_model
             P = PolynomialRing(f.base_ring(), 'x')
             f, h = _parse_multivariate_defining_equation(f)
             f, h = P(f), P(h)