sagemathgh-39235: fixing a few typos

    
just fixing a few typos

### 📝 Checklist

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

docker/.gitpod.Dockerfile

@@ -6,7 +6,7 @@ RUN apt update && apt-get install -yq --no-install-recommends sudo gpg curl lsb-
 
 # Make Docker available, like the default gitpod image does
 # from https://github.com/gitpod-io/workspace-images/blob/main/chunks/tool-docker/Dockerfile @ 3f0988f2d06768d22d0aa1454ef0e963b0db65f3
-# - removed unneccessary "sudo"
+# - removed unnecessary "sudo"
 # - replaced use of "install-packages" (https://github.com/gitpod-io/workspace-images/blob/main/base/install-packages)
 # https://docs.docker.com/engine/install/ubuntu/
 RUN curl -fsSL https://download.docker.com/linux/ubuntu/gpg | gpg --dearmor -o /usr/share/keyrings/docker-archive-keyring.gpg \

src/sage/algebras/hecke_algebras/cubic_hecke_base_ring.py

@@ -683,7 +683,7 @@ def create_specialization(self, im_cubic_equation_roots, im_writhe_parameter=Non
 
         if len(cyclotomic_roots) > 0:
             E3 = cyclotomic_roots[0]
-            verbose('thrird root of unity %s found in %s' % (E3, E3.parent()), level=2)
+            verbose('third root of unity %s found in %s' % (E3, E3.parent()), level=2)
 
         if E3 is None:
             raise RuntimeError('cannot find a ring containing a third root of unity for the this choice of cubic roots!')

src/sage/categories/finite_enumerated_sets.py

@@ -474,7 +474,7 @@ def _random_element_from_unrank(self):
                 sage: n in C
                 True
 
-            TODO: implement _test_random which checks uniformness
+            TODO: implement _test_random which checks uniformity
             """
             from sage.misc.prandom import randint
             c = self.cardinality()

src/sage/combinat/designs/difference_family.py

@@ -1579,7 +1579,7 @@ def is_relative_difference_set(R, G, H, params, verbose=False):
     - ``H`` -- list; a submodule of ``G`` of order `n`
     - ``params`` -- tuple in the form `(m, n, k, d)`
     - ``verbose`` -- boolean (default: ``False``); if ``True``, the function
-      will be verbose when the sequences do not satisfy the contraints
+      will be verbose when the sequences do not satisfy the constraints
 
     EXAMPLES::
 
@@ -1659,7 +1659,7 @@ def is_supplementary_difference_set(Ks, v=None, lmbda=None, G=None, verbose=Fals
     - ``lmbda`` -- integer; the parameter `\lambda` of the supplementary difference sets
     - ``G`` -- a group of order `v`
     - ``verbose`` -- boolean (default: ``False``); if ``True``, the function will
-      be verbose when the sets do not satisfy the contraints
+      be verbose when the sets do not satisfy the constraints
 
     EXAMPLES::
 
@@ -1757,7 +1757,7 @@ def supplementary_difference_set_from_rel_diff_set(q, existence=False, check=Tru
     OUTPUT:
 
     If ``existence=False``, the function returns the 4 sets (containing integers),
-    or raises an error if ``q`` does not satify the constraints.
+    or raises an error if ``q`` does not satisfy the constraints.
     If ``existence=True``, the function returns a boolean representing whether
     supplementary difference sets can be constructed.
 
@@ -3084,7 +3084,7 @@ def are_complementary_difference_sets(G, A, B, verbose=False):
     - ``A`` -- set of elements of ``G``
     - ``B`` -- set of elements of ``G``
     - ``verbose`` -- boolean (default: ``False``); if ``True`` the function will
-      be verbose when the sets do not satisfy the contraints
+      be verbose when the sets do not satisfy the constraints
 
     EXAMPLES::
 

src/sage/combinat/matrices/hadamard_matrix.py

@@ -1503,7 +1503,7 @@ def hadamard_matrix_spence_construction(n, existence=False, check=True):
     - ``n`` -- integer; the order of the matrix to be constructed
     - ``existence`` -- boolean (default: ``False``); if ``True``, only check if
       the matrix exists
-    - ``check`` -- bolean (default: ``True``); if ``True``, check that the matrix
+    - ``check`` -- boolean (default: ``True``); if ``True``, check that the matrix
       is a Hadamard matrix before returning
 
     OUTPUT:

src/sage/combinat/posets/posets.py

@@ -6530,7 +6530,7 @@ def random_maximal_chain(self):
 
         EXAMPLES::
 
-            sage: set_random_seed(0)  # results are reproduceable
+            sage: set_random_seed(0)  # results are reproducible
             sage: P = posets.BooleanLattice(4)
             sage: P.random_maximal_chain()
             [0, 4, 5, 7, 15]
@@ -6565,7 +6565,7 @@ def random_maximal_antichain(self):
 
         EXAMPLES::
 
-            sage: set_random_seed(0)  # results are reproduceable
+            sage: set_random_seed(0)  # results are reproducible
             sage: P = posets.BooleanLattice(4)
             sage: P.random_maximal_antichain()
             [1, 8, 2, 4]
@@ -6597,7 +6597,7 @@ def random_linear_extension(self):
 
         EXAMPLES::
 
-            sage: set_random_seed(0)  # results are reproduceable
+            sage: set_random_seed(0)  # results are reproducible
             sage: P = posets.BooleanLattice(4)
             sage: P.random_linear_extension()
             [0, 4, 1, 2, 3, 8, 10, 5, 12, 9, 13, 11, 6, 14, 7, 15]

src/sage/combinat/regular_sequence.py

@@ -335,7 +335,7 @@ def __iter__(self):
     def is_degenerated(self):
         r"""
         Return whether this `k`-regular sequence is degenerated,
-        i.e., whether this `k`-regular sequence does not satisfiy
+        i.e., whether this `k`-regular sequence does not satisfy
         `\mu[0] \mathit{right} = \mathit{right}`.
 
         EXAMPLES::
@@ -368,7 +368,7 @@ def is_degenerated(self):
     def _error_if_degenerated_(self):
         r"""
         Raise an error if this `k`-regular sequence is degenerated,
-        i.e., if this `k`-regular sequence does not satisfiy
+        i.e., if this `k`-regular sequence does not satisfy
         `\mu[0] \mathit{right} = \mathit{right}`.
 
         TESTS::

src/sage/combinat/specht_module.py

@@ -1036,7 +1036,7 @@ def _repr_(self):
 
 class SimpleModule(SymmetricGroupRepresentation, QuotientModuleWithBasis):
     r"""
-    The simgle `S_n`-module associated with a partition `\lambda`.
+    The simple `S_n`-module associated with a partition `\lambda`.
 
     The simple module `D^{\lambda}` is the quotient of the Specht module
     `S^{\lambda}` by its :class:`maximal submodule <MaximalSpechtSubmodule>`

src/sage/combinat/t_sequences.py

@@ -84,7 +84,7 @@ def is_skew(seq, verbose=False):
     - ``seq`` -- the sequence that should be checked
 
     - ``verbose`` -- boolean (default: ``False``); if ``True`` the function
-      will be verbose when the sequences do not satisfy the contraints
+      will be verbose when the sequences do not satisfy the constraints
 
     EXAMPLES::
 
@@ -130,7 +130,7 @@ def is_symmetric(seq, verbose=False) -> bool:
     - ``seq`` -- the sequence that should be checked
 
     - ``verbose`` -- boolean (default: ``False``); if ``True`` the function will be
-      verbose when the sequences do not satisfy the contraints
+      verbose when the sequences do not satisfy the constraints
 
     EXAMPLES::
 
@@ -180,7 +180,7 @@ def is_T_sequences_set(sequences, verbose=False):
     - ``sequences`` -- list of four sequences
 
     - ``verbose`` -- boolean (default: ``False``); if ``True`` the function will be
-      verbose when the sequences do not satisfy the contraints
+      verbose when the sequences do not satisfy the constraints
 
     EXAMPLES::
 
@@ -643,7 +643,7 @@ def is_base_sequences_tuple(base_sequences, verbose=False):
     - ``base_sequences`` -- the list of 4 sequences that should be checked
 
     - ``verbose`` -- boolean (default: ``False``); if ``True`` the function
-      will be verbose when the sequences do not satisfy the contraints
+      will be verbose when the sequences do not satisfy the constraints
 
     EXAMPLES::
 
@@ -656,7 +656,7 @@ def is_base_sequences_tuple(base_sequences, verbose=False):
 
         sage: seqs = [[1, -1], [1, 1], [-1], [2]]
         sage: is_base_sequences_tuple(seqs, verbose=True)
-        Base sequences should only contiain -1, +1, found 2
+        Base sequences should only contain -1, +1, found 2
         False
 
     TESTS:
@@ -694,7 +694,7 @@ def is_base_sequences_tuple(base_sequences, verbose=False):
         for el in seq:
             if abs(el) != 1:
                 if verbose:
-                    print(f'Base sequences should only contiain -1, +1, found {el}')
+                    print(f'Base sequences should only contain -1, +1, found {el}')
                 return False
 
     for j in range(1, n+p):

src/sage/ext_data/valgrind/pyalloc.supp

@@ -1,4 +1,4 @@
-# Read Misc/README.valgrind in the Python sourcs for a thorough explanation
+# Read Misc/README.valgrind in the Python sources for a thorough explanation
 #
 # In short: We need these unless we compile python without pyalloc,
 # but that would be prohibitively slow. 

src/sage/geometry/polyhedral_complex.py

@@ -2271,7 +2271,7 @@ def is_simplicial_fan(self):
         Test if this polyhedral complex is a simplicial fan.
 
         A polyhedral complex is a **simplicial fan** if all of its (maximal)
-        cells are simplical cones, i.e., every cell is a pointed cone (with
+        cells are simplicial cones, i.e., every cell is a pointed cone (with
         vertex being the origin) generated by `d` linearly independent rays,
         where `d` is the dimension of the cone.
 

src/sage/graphs/generators/smallgraphs.py

@@ -4623,7 +4623,7 @@ def TricornGraph():
 
     The Tricorn graph is obtained by splicing a complete graph `K_4` with the
     the triangular circular ladder graph `\overline{C_6}`. (Note that this
-    generates a unqiue graph as both of the graphs `K_4` and `\overline{C_6}`
+    generates a unique graph as both of the graphs `K_4` and `\overline{C_6}`
     are vertex-transitive). It is a nonsolid brick. This matching covered graph
     is one of the ten extremal cubic bricks. (A matching covered graph `G` is
     *extremal* if `\Phi(G) = dim(\mathcal{Lin}(G))`, where `\Phi(G)` denotes

src/sage/graphs/matching_covered_graph.py

@@ -2580,7 +2580,7 @@ def remove_loops(self, vertices=None):
         INPUT:
 
         - ``vertices`` -- (default: ``None``) iterator container of vertex
-          labels correponding to which the looped edges are to be removed. If
+          labels corresponding to which the looped edges are to be removed. If
           ``vertices`` is ``None``, remove all loops.
 
         OUTPUT:
@@ -2750,4 +2750,4 @@ def update_matching(self, matching):
             raise exception
 
 
-__doc__ = __doc__.replace('{INDEX_OF_METHODS}', gen_thematic_rest_table_index(MatchingCoveredGraph, only_local_functions=False))
+__doc__ = __doc__.replace('{INDEX_OF_METHODS}', gen_thematic_rest_table_index(MatchingCoveredGraph, only_local_functions=False))

src/sage/interfaces/mathics.py

@@ -397,7 +397,7 @@
 
 def _mathics_sympysage_symbol(self):
     r"""
-    Convert a Sympy symbol ``self`` to a correspondig element
+    Convert a Sympy symbol ``self`` to a corresponding element
     in Sage's symbolic ring.
 
     This function replaces ``_sympysage_symbol`` to

src/sage/knots/knotinfo.py

@@ -17,7 +17,7 @@
 This will install a `Python wrapper <https://github.com/soehms/database_knotinfo#readme>`__
 for the original databases in Sage. This wrapper perfoms an automatic progress
 of version numbers. For more details and further install instructions please see
-the correspondig web-page.
+the corresponding web-page.
 
 To perform all the doctests concerning the usage of the database on the installation
 add the option ``-c``. In this case (for instance ``sage -f -c database_knotinfo``)
@@ -218,7 +218,7 @@
 - Sebastian Oehms August 2020: initial version
 - Sebastian Oehms June   2022: add :meth:`conway_polynomial` and :meth:`khovanov_polynomial` (:issue:`33969`)
 
-Thanks to Chuck Livingston and Allison Moore for their support. For further acknowledgments see the correspondig hompages.
+Thanks to Chuck Livingston and Allison Moore for their support. For further acknowledgments see the corresponding hompages.
 """
 
 
@@ -229,7 +229,7 @@
 # it under the terms of the GNU General Public License 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/
 ##############################################################################
 
 

src/sage/matrix/matrix2.pyx

@@ -14511,7 +14511,7 @@ cdef class Matrix(Matrix1):
 
             # Continuing the "else" branch of Higham's Step (1), and
             # onto B&K's Step (3) where we find the largest
-            # off-diagonal entry (in magniture) in column "r". Since
+            # off-diagonal entry (in magnitude) in column "r". Since
             # the matrix is Hermitian, we need only look at the
             # above-diagonal entries to find the off-diagonal of
             # maximal magnitude.

src/sage/modules/with_basis/cell_module.py

@@ -348,7 +348,7 @@ def _acted_upon_(self, scalar, self_on_left=False):
                 sage: 1/2 * elt
                 W[[1, 2], [3]] + W[[1, 3], [2]]
             """
-            # Check for elements coercable to the base ring first
+            # Check for elements coercible to the base ring first
             ret = CombinatorialFreeModule.Element._acted_upon_(self, scalar, self_on_left)
             if ret is not None:
                 return ret

src/sage/rings/semirings/tropical_polynomial.py

@@ -107,7 +107,7 @@ class TropicalPolynomial(Polynomial_generic_sparse):
         [1, 1]
 
     Even though every tropical polynomials have tropical roots, this does not
-    neccessarily means it can be factored into its linear factors::
+    necessarily means it can be factored into its linear factors::
 
         sage: p1.factor()
         (0) * (0*x^3 + 4*x + 1)

src/sage/rings/valuation/valuation.py

@@ -395,7 +395,7 @@ def mac_lane_approximants(self, G, assume_squarefree=False, require_final_EF=Tru
 
         - ``require_final_EF`` -- boolean (default: ``True``); whether to
           require the returned key polynomials to be in one-to-one
-          correspondance to the extensions of this valuation to ``L`` and
+          correspondence to the extensions of this valuation to ``L`` and
           require them to have the ramification index and residue degree of the
           valuations they correspond to.
 

src/sage/schemes/elliptic_curves/ell_generic.py

@@ -946,7 +946,7 @@ def lift_x(self, x, all=False, extend=False):
         b = (a1*x + a3)
         f = ((x + a2) * x + a4) * x + a6
 
-        # If possible find the associated y coorindates in L:
+        # If possible find the associated y coordinates in L:
 
         if K.characteristic() == 2:
             R = PolynomialRing(L, 'y')

src/sage/topology/cell_complex.py

@@ -544,7 +544,7 @@ def homology(self, dim=None, base_ring=ZZ, subcomplex=None,
              [0,0] x [0,1] x [0,1] - [0,1] x [0,0] x [0,1] + [0,1] x [0,1] x [0,0]
              - [0,1] x [0,1] x [1,1] + [0,1] x [1,1] x [0,1] - [1,1] x [0,1] x [0,1])]
 
-        Similarly for simpicial sets::
+        Similarly for simplicial sets::
 
             sage: S = simplicial_sets.Sphere(2)
             sage: S.homology(generators=True)                                           # needs sage.modules