gh-40429: Remove unnecessary range start
    
<!-- ^ Please provide a concise and informative title. -->
<!-- ^ Don't put issue numbers in the title, do this in the PR
description below. -->
<!-- ^ For example, instead of "Fixes #12345" use "Introduce new method
to calculate 1 + 2". -->
<!-- v Describe your changes below in detail. -->
<!-- v Why is this change required? What problem does it solve? -->
<!-- v If this PR resolves an open issue, please link to it here. For
example, "Fixes #12345". -->

Autofix with `ruff check . --select PIE808 --fix`. There are probably >
10k occurrences without the range start and 42 with 0 as the range
start, so it's already favored to remove the range start for consistency


### 📝 Checklist

<!-- Put an `x` in all the boxes that apply. -->

- [x] The title is concise and informative.
- [x] The description explains in detail what this PR is about.
- [ ] I have linked a relevant issue or discussion.
- [ ] I have created tests covering the changes.
- [ ] I have updated the documentation and checked the documentation
preview.

### ⌛ Dependencies

<!-- List all open PRs that this PR logically depends on. For example,
-->
<!-- - #12345: short description why this is a dependency -->
<!-- - #34567: ... -->
    
URL: #40429
Reported by: Trinh Quoc Anh
Reviewer(s): Martin Rubey

Author: Release Manager

src/sage/crypto/mq/sr.py

@@ -2289,13 +2289,13 @@ def lin_matrix(self, length=None):
         lin = matrix(self.base_ring(), length*e, length*e)
         if e == 4:
             l = [k.from_integer(x) for x in (5, 1, 12, 5)]
-            for k in range( 0, length ):
+            for k in range(length):
                 for i in range(4):
                     for j in range(4):
                         lin[k*4+j, k*4+i] = l[(i-j) % 4] ** (2**j)
         elif e == 8:
             l = [k.from_integer(x) for x in (5, 9, 249, 37, 244, 1, 181, 143)]
-            for k in range( 0, length ):
+            for k in range(length):
                 for i in range(8):
                     for j in range(8):
                         lin[k*8+j, k*8+i] = l[(i-j) % 8] ** (2**j)

src/sage/graphs/generators/families.py

@@ -3608,7 +3608,7 @@ def WindmillGraph(k, n):
         slide = 1/sin(sector/4)
 
         pos_dict = {}
-        for i in range(0, k):
+        for i in range(k):
             x = float(cos(i*pi/(k-2)))
             y = float(sin(i*pi/(k-2))) + slide
             pos_dict[i] = (x, y)

src/sage/graphs/generic_graph.py

@@ -11859,7 +11859,7 @@ def random_vertex(self, **kwds):
             raise ValueError("cannot get a random vertex from the empty graph")
         from sage.misc.prandom import randint
         it = self.vertex_iterator(**kwds)
-        for i in range(0, randint(0, self.order() - 1)):
+        for i in range(randint(0, self.order() - 1)):
             next(it)
         return next(it)
 
@@ -11941,7 +11941,7 @@ def random_edge(self, **kwds):
 
         from sage.misc.prandom import randint
         it = self.edge_iterator(**kwds)
-        for i in range(0, randint(0, self.size() - 1)):
+        for i in range(randint(0, self.size() - 1)):
             next(it)
         return next(it)
 

src/sage/groups/perm_gps/permgroup_named.py

@@ -1026,10 +1026,10 @@ def __init__(self, n):
         # Representation of  x
         # Four-cycles that will conjugate the generator  a  properly
         x = [(i+1, (-i) % halfr + halfr + 1, (fourthr+i) % halfr + 1, (-fourthr-i) % halfr + halfr + 1)
-             for i in range(0, fourthr)]
+             for i in range(fourthr)]
         # With an odd part, transpositions will conjugate the m-cycle to create inverse
         if m > 1:
-            x += [(r+i+1, r+m-i) for i in range(0, (m-1)//2)]
+            x += [(r+i+1, r+m-i) for i in range((m-1)//2)]
 
         PermutationGroup_generic.__init__(self, gens=[a, x])
 

src/sage/homology/chain_complex.py

@@ -1361,7 +1361,7 @@ def _homology_generators_snf(self, d_in, d_out, d_out_rank):
         (N, P, Q) = d_in_induced.smith_form()
         all_divs = [0]*N.nrows()
         non_triv = 0
-        for i in range(0, N.nrows()):
+        for i in range(N.nrows()):
             if i >= N.ncols():
                 break
             all_divs[i] = N[i][i]

src/sage/interacts/library.py

@@ -1230,7 +1230,7 @@ def trapezoid_integration(
         ))
     elif output_form == 'table':
         s = [['$i$', '$x_i$', '$f(x_i)$', '$m$', r'$m\cdot f(x_i)$']]
-        for i in range(0,n+1):
+        for i in range(n+1):
             if i == 0 or i == n:
                 j = 1
             else:
@@ -1343,7 +1343,7 @@ def parabola(a, b, c):
     if output_form == 'traditional':
         sum_formula_html = r"\frac{d}{3} \cdot \left[ f(x_0) + %s + f(x_{%s})\right]" % (
             ' + '.join(r"%s \cdot f(x_{%s})" % (i % 2 * (-2) + 4, i + 1)
-                       for i in range(0,n-1)),
+                       for i in range(n-1)),
             n
             )
 

src/sage/manifolds/differentiable/examples/symplectic_space.py

@@ -155,7 +155,7 @@ def __init__(
         self._symplectic_form = SymplecticFormParal(
             self, symplectic_name, symplectic_latex_name
         )
-        for i in range(0, dim_half):
+        for i in range(dim_half):
             q_index = 2 * i + 1
             self._symplectic_form.set_comp()[q_index, q_index + 1] = -1
 

src/sage/manifolds/differentiable/symplectic_form.py

@@ -535,7 +535,7 @@ def volume_form(self, contra: int = 0) -> TensorField:
             self._vol_form = vol_form
 
         result = self._vol_form
-        for k in range(0, contra):
+        for k in range(contra):
             result = result.up(self, k)
         if contra > 1:
             # restoring the antisymmetry after the up operation:

src/sage/matroids/database_collections.py

@@ -179,7 +179,7 @@ def AllMatroids(n, r=None, type='all'):
         raise ValueError("The rank needs to be specified for type '%s'" % type)
 
     if r is None:
-        rng = range(0, n + 1)
+        rng = range(n + 1)
     else:
         rng = range(r, r + 1)
 

src/sage/matroids/database_matroids.py

@@ -2401,8 +2401,8 @@ def Psi(r, groundset=None):
 
     [Oxl2011]_, p. 664.
     """
-    A = [f'a{i}' for i in range(0, r)]
-    B = [f'b{i}' for i in range(0, r)]
+    A = [f'a{i}' for i in range(r)]
+    B = [f'b{i}' for i in range(r)]
     E = A + B
 
     def generate_binary_strings(bit_count):
@@ -2419,7 +2419,7 @@ def genbin(n, bs=""):
         return binary_strings
 
     NSC = []  # nonspanning circuits
-    for i in range(0, r):
+    for i in range(r):
         for k in range(1, r - 2):
             I0 = [f'a{i}', f'b{i}']
             IK = [f'a{(i + k) % r}', f'b{(i + k) % r}']