sagemathgh-40944: some missing capitals to proper nouns
    
just adding a few capitals

### 📝 Checklist

- [x] The title is concise and informative.
- [x] The description explains in detail what this PR is about.
    
URL: sagemath#40944
Reported by: Frédéric Chapoton
Reviewer(s): Martin Rubey

Author: Release Manager

src/sage/calculus/calculus.py

@@ -2256,8 +2256,8 @@ def dummy_integrate(*args):
 
 def dummy_laplace(*args):
     """
-    This function is called to create formal wrappers of laplace transforms
-    that Maxima can't compute:
+    This function is called to create formal wrappers of Laplace transforms
+    that Maxima cannot compute:
 
     EXAMPLES::
 

src/sage/graphs/graph.py

@@ -3088,7 +3088,7 @@ def is_chordal_bipartite(self, certificate=False):
                     pewveo.extend(certif)
                 return True, pewveo
             return all(gg.is_chordal_bipartite() for gg in
-                        self.connected_components_subgraphs())
+                       self.connected_components_subgraphs())
 
         left = [v for v, c in bipartite_certificate.items() if c == 0]
         right = [v for v, c in bipartite_certificate.items() if c == 1]
@@ -3756,8 +3756,8 @@ def summand(stack, dsf, sizes):
             # edges in stack to current subgraph.
             if not stack:
                 return p.monomial(_Partitions(sorted(
-                            [s for v, s in sizes.items() if dsf[v] is None],
-                            reverse=True)))
+                    [s for v, s in sizes.items() if dsf[v] is None],
+                    reverse=True)))
             ret = p.zero()
             e = stack.pop()
             u = find(dsf, e[0])
@@ -7732,7 +7732,7 @@ def modular_decomposition(self, algorithm=None, style="tuple"):
                   PARALLEL[5[], 6[], 7[]]]
         """
         from sage.graphs.graph_decompositions.modular_decomposition import \
-                modular_decomposition
+            modular_decomposition
 
         D = modular_decomposition(self, algorithm=algorithm)
 
@@ -8033,7 +8033,7 @@ def is_prime(self, algorithm=None):
             True
         """
         from sage.graphs.graph_decompositions.modular_decomposition import \
-                modular_decomposition
+            modular_decomposition
 
         if self.order() <= 1:
             return True
@@ -9565,7 +9565,7 @@ def is_projective_planar(self, return_map=False):
 
         EXAMPLES:
 
-        The Peterson graph is a known projective planar graph::
+        The Petersen graph is a known projective planar graph::
 
             sage: P = graphs.PetersenGraph()
             sage: P.is_projective_planar()  # long time
@@ -9731,6 +9731,6 @@ def is_projective_planar(self, return_map=False):
     "is_matching_covered"       : "Matching",
     "matching"                  : "Matching",
     "perfect_matchings"         : "Matching"
-    }
+}
 
 __doc__ = __doc__.replace("{INDEX_OF_METHODS}", gen_thematic_rest_table_index(Graph, _additional_categories))

src/sage/groups/finitely_presented.py

@@ -1616,7 +1616,7 @@ def alexander_matrix(self, im_gens=None):
         """
         Return the Alexander matrix of the group.
 
-        This matrix is given by the fox derivatives of the relations
+        This matrix is given by the Fox derivatives of the relations
         with respect to the generators.
 
         - ``im_gens`` -- (optional) the images of the generators

src/sage/groups/free_group.py

@@ -398,7 +398,7 @@ def fox_derivative(self, gen, im_gens=None, ring=None):
 
         OUTPUT:
 
-        The fox derivative of ``self`` with respect to ``gen``
+        The Fox derivative of ``self`` with respect to ``gen``
         (induced by ``im_gens``).
         By default, it is an element of the group algebra with
         integer coefficients.
@@ -898,7 +898,7 @@ def _element_constructor_(self, *args, **kwds):
         except AttributeError:
             return self.element_class(self, x, **kwds)
         if isinstance(P, FreeGroup_class):
-            names = {P._gen_names[abs(i)-1] for i in x.Tietze()}
+            names = {P._gen_names[abs(i) - 1] for i in x.Tietze()}
             if names.issubset(self._gen_names):
                 return self([i.sign()*(self._gen_names.index(P._gen_names[abs(i)-1])+1)
                              for i in x.Tietze()])

src/sage/rings/finite_rings/integer_mod.pyx

@@ -3229,7 +3229,7 @@ cdef int_fast32_t mod_pow_int(int_fast32_t base, int_fast32_t exp, int_fast32_t
 
 cdef int jacobi_int(int_fast32_t a, int_fast32_t m) except -2:
     """
-    Calculate the jacobi symbol (a/n).
+    Calculate the Jacobi symbol (a/n).
 
     For use in ``IntegerMod_int``.
 
@@ -3244,7 +3244,7 @@ cdef int jacobi_int(int_fast32_t a, int_fast32_t m) except -2:
 
     while True:
         if a == 0:
-            return 0 # gcd was nontrivial
+            return 0  # gcd was nontrivial
         elif a == 1:
             return jacobi
         s = 0
@@ -3893,7 +3893,7 @@ cdef int_fast64_t mod_pow_int64(int_fast64_t base, int_fast64_t exp, int_fast64_
 
 cdef int jacobi_int64(int_fast64_t a, int_fast64_t m) except -2:
     """
-    Calculate the jacobi symbol (a/n).
+    Calculate the Jacobi symbol (a/n).
 
     For use in ``IntegerMod_int64``.
 
@@ -3908,7 +3908,7 @@ cdef int jacobi_int64(int_fast64_t a, int_fast64_t m) except -2:
 
     while True:
         if a == 0:
-            return 0 # gcd was nontrivial
+            return 0  # gcd was nontrivial
         elif a == 1:
             return jacobi
         s = 0