fix a bunch of similar errors in the doc

Author: fchapoton

src/sage/categories/additive_magmas.py

@@ -730,7 +730,7 @@ def is_empty(self):
 
                 TESTS:
 
-                We check that the method `is_empty` is inherited from this
+                We check that the method ``is_empty`` is inherited from this
                 category in both examples above::
 
                     sage: A.is_empty.__module__

src/sage/categories/category.py

@@ -2236,7 +2236,7 @@ def _sort(categories):
 
         .. NOTE::
 
-            The auxiliary function `_flatten_categories` used in the test
+            The auxiliary function ``_flatten_categories`` used in the test
             below expects a second argument, which is a type such that
             instances of that type will be replaced by its super
             categories. Usually, this type is :class:`JoinCategory`.

src/sage/categories/coxeter_groups.py

@@ -668,7 +668,7 @@ def _test_reduced_word(self, **options):
 
         def simple_projection(self, i, side='right', length_increasing=True):
             r"""
-            Return the simple projection `\pi_i` (or `\overline\pi_i` if `length_increasing` is ``False``).
+            Return the simple projection `\pi_i` (or `\overline\pi_i` if ``length_increasing`` is ``False``).
 
             INPUT:
 

src/sage/categories/crystals.py

@@ -1563,7 +1563,9 @@ def to_highest_weight(self, index_set=None):
             r"""
             Return the highest weight element `u` and a list `[i_1,...,i_k]`
             such that `self = f_{i_1} ... f_{i_k} u`, where `i_1,...,i_k` are
-            elements in `index_set`. By default the index set is assumed to be
+            elements in ``index_set``.
+
+            By default the index set is assumed to be
             the full index set of self.
 
             EXAMPLES::
@@ -1602,8 +1604,10 @@ def to_lowest_weight(self, index_set=None):
             r"""
             Return the lowest weight element `u` and a list `[i_1,...,i_k]`
             such that `self = e_{i_1} ... e_{i_k} u`, where `i_1,...,i_k` are
-            elements in `index_set`. By default the index set is assumed to be
-            the full index set of self.
+            elements in ``index_set``.
+
+            By default the index set is assumed to be the full index
+            set of self.
 
             EXAMPLES::
 
@@ -1642,7 +1646,7 @@ def to_lowest_weight(self, index_set=None):
         def all_paths_to_highest_weight(self, index_set=None):
             r"""
             Iterate over all paths to the highest weight from ``self``
-            with respect to `index_set`.
+            with respect to ``index_set``.
 
             INPUT:
 

src/sage/coding/cyclic_code.py

@@ -334,7 +334,7 @@ def __init__(self, generator_pol=None, length=None, code=None, check=True,
             ...
             ValueError: The code is not cyclic.
 
-        If the `primitive_root` does not lie in an extension of `field`,
+        If the ``primitive_root`̀  does not lie in an extension of ``field``,
         or is not a primitive `n`-th root of unity, then
         an exception is raised::
 

src/sage/crypto/block_cipher/present.py

@@ -838,7 +838,7 @@ def __getitem__(self, r):
         Computes the sub key for round ``r`` derived from initial master key.
 
         The key schedule object has to have been initialised with the
-        `master_key` argument.
+        ``master_key`` argument.
 
         INPUT:
 
@@ -860,7 +860,7 @@ def __getitem__(self, r):
     def __iter__(self):
         """
         Iterate over the ``self._rounds + 1`` PRESENT round keys, derived from
-        `master_key`
+        ``master_key``.
 
         EXAMPLES::
 

src/sage/dynamics/finite_dynamical_system_catalog.py

@@ -5,7 +5,7 @@
 dynamical systems.
 These are accessible through
 :mod:`sage.dynamics.finite_dynamical_system_catalog. <sage.dynamics.finite_dynamical_system_catalog>`
-or just through `finite_dynamical_systems.`
+or just through ``finite_dynamical_systems.``
 (type either of these in Sage and hit ``tab`` for a list).
 
 AUTHORS:

src/sage/graphs/weakly_chordal.pyx

@@ -53,7 +53,7 @@ cdef inline is_long_hole_free_process(g, short_digraph sd, bitset_t dense_graph,
                                       bint certificate,
                                       int a, int b, int c, int n):
     """
-    This method is part of method `is_long_hole_free`.
+    This method is part of method ``is_long_hole_free``.
 
     EXAMPLES::
 
@@ -285,7 +285,7 @@ cdef inline is_long_antihole_free_process(g, short_digraph sd, bitset_t dense_gr
                                           bint certificate,
                                           int a, int b, int c, int n):
     """
-    This method is part of method `is_long_antihole_free`.
+    This method is part of method ``is_long_antihole_free``.
 
     EXAMPLES::
 

src/sage/matrix/matrix_misc.py

@@ -39,10 +39,10 @@ def prm_mul(p1, p2, mask_free, prec):
 
     - `p1,p2` -- polynomials as dictionaries
 
-    - `mask_free` -- an integer mask that give the list of free variables
+    - ``mask_free`` -- an integer mask that give the list of free variables
       (the `i`-th variable is free if the `i`-th bit of ``mask_free`` is `1`)
 
-    - `prec` -- if `prec` is not None, truncate the product at precision `prec`
+    - ``prec`` -- if ``prec`` is not ``None``, truncate the product at precision ``prec``
 
     EXAMPLES::
 

src/sage/symbolic/function.pyx

@@ -502,7 +502,7 @@ cdef class Function(SageObject):
             sage: (out, parent(out))
             (0, Integer Ring)
 
-        Check that `real_part` and `imag_part` still works after :trac:`21216`::
+        Check that ``real_part`` and ``imag_part`` still works after :trac:`21216`::
 
             sage: import numpy
             sage: a = numpy.array([1+2*I, -2-3*I], dtype=complex)