diff --git a/src/doc/en/developer/sage_manuals.rst b/src/doc/en/developer/sage_manuals.rst index 6482700b0e0..a640cc2df24 100644 --- a/src/doc/en/developer/sage_manuals.rst +++ b/src/doc/en/developer/sage_manuals.rst @@ -83,7 +83,7 @@ The documentation can contain links toward modules, classes, or methods, e.g.:: :mod:`sage.module_name` (here the link's text is the module's name) For links toward classes, methods, or function, replace **:mod:** by -**:class:**, **:meth:** or **func:** respectively. See `Sphinx' documentation +**:class:**, **:meth:** or **:func:** respectively. See `Sphinx' documentation `_. **Short links:** the link ``:func:`~sage.mod1.mod2.mod3.func1``` is equivalent diff --git a/src/sage/categories/coxeter_groups.py b/src/sage/categories/coxeter_groups.py index 58f80fa120e..543f5a3763e 100644 --- a/src/sage/categories/coxeter_groups.py +++ b/src/sage/categories/coxeter_groups.py @@ -36,7 +36,7 @@ class CoxeterGroups(Category_singleton): `I` is the *index set* of `W` and `|I|` is the *rank* of `W`. - See :Wikipedia:`Coxeter_group` for details. + See :wikipedia:`Coxeter_group` for details. EXAMPLES:: diff --git a/src/sage/categories/finite_dimensional_modules_with_basis.py b/src/sage/categories/finite_dimensional_modules_with_basis.py index c14709eb099..278a17e095c 100644 --- a/src/sage/categories/finite_dimensional_modules_with_basis.py +++ b/src/sage/categories/finite_dimensional_modules_with_basis.py @@ -1,13 +1,13 @@ r""" Finite dimensional modules with basis """ -#***************************************************************************** +# **************************************************************************** # Copyright (C) 2008 Teresa Gomez-Diaz (CNRS) # 2011 Nicolas M. Thiery # # Distributed under the terms of the GNU General Public License (GPL) # http://www.gnu.org/licenses/ -#****************************************************************************** +# ***************************************************************************** import operator from sage.categories.category_with_axiom import CategoryWithAxiom_over_base_ring @@ -84,7 +84,7 @@ def annihilator(self, S, action=operator.mul, side='right', category=None): If ``self`` is a ring, ``action`` an action of ``self`` on a module `M` and `S` is a subset of `M`, we recover the - :Wikipedia:`Annihilator_%28ring_theory%29`. Similarly this + :wikipedia:`Annihilator_%28ring_theory%29`. Similarly this can be used to compute torsion or orthogonals. .. SEEALSO:: :meth:`annihilator_basis` for lots of examples. diff --git a/src/sage/categories/permutation_groups.py b/src/sage/categories/permutation_groups.py index c3191f4876d..7e71ad4d857 100644 --- a/src/sage/categories/permutation_groups.py +++ b/src/sage/categories/permutation_groups.py @@ -23,7 +23,7 @@ class PermutationGroups(Category): This distinguished action should be preserved by permutation group morphisms. For details, see - :Wikipedia:`Permutation_group#Permutation_isomorphic_groups`. + :wikipedia:`Permutation_group#Permutation_isomorphic_groups`. .. TODO:: shall we accept only permutations with finite support or not? diff --git a/src/sage/geometry/polyhedron/combinatorial_polyhedron/face_iterator.pyx b/src/sage/geometry/polyhedron/combinatorial_polyhedron/face_iterator.pyx index f4abdbba69e..7e854219418 100644 --- a/src/sage/geometry/polyhedron/combinatorial_polyhedron/face_iterator.pyx +++ b/src/sage/geometry/polyhedron/combinatorial_polyhedron/face_iterator.pyx @@ -2014,7 +2014,7 @@ cdef inline int next_face_loop(iter_t structure) nogil except -1: cdef inline size_t n_atom_rep(iter_t structure) nogil except -1: r""" - See meth:`FaceIterator.n_atom_rep`. + See :meth:`FaceIterator.n_atom_rep`. """ if structure.face_status: return face_len_atoms(structure.face) diff --git a/src/sage/groups/cubic_braid.py b/src/sage/groups/cubic_braid.py index 66d1fbe9668..846b8710604 100644 --- a/src/sage/groups/cubic_braid.py +++ b/src/sage/groups/cubic_braid.py @@ -923,12 +923,12 @@ def _internal_test_attached_group(self, attached_group, tester): r""" It tests conversion maps from ``self`` to the given attached Group which must have been defined using the :meth:`as_classical_group`, - :meth:`as_matrix_group`, meth:`as_permutation_group` or + :meth:`as_matrix_group`, :meth:`as_permutation_group` or :meth:`as_reflection_group`. INPUT: - - ``attached_group`` -- attached group to be tested as specified above. + - ``attached_group`` -- attached group to be tested as specified above. EXAMPLES:: diff --git a/src/sage/rings/padics/generic_nodes.py b/src/sage/rings/padics/generic_nodes.py index c1a1c29ef37..b6a0625c423 100644 --- a/src/sage/rings/padics/generic_nodes.py +++ b/src/sage/rings/padics/generic_nodes.py @@ -1027,7 +1027,7 @@ def unknown(self, start_val=0, digits=None): of the previous ones. This method is used to declare a self-referent number (and optionally, to set its first digits). The definition of the number itself will be given afterwords using - to method meth:`sage.rings.padics.relaxed_template.RelaxedElement_unknown.set` + to method :meth:`sage.rings.padics.relaxed_template.RelaxedElement_unknown.set` of the element. EXAMPLES: @@ -1044,7 +1044,7 @@ def unknown(self, start_val=0, digits=None): sage: a O(5^0) - We can now use the method meth:`sage.rings.padics.relaxed_template.RelaxedElement_unknown.set` + We can now use the method :meth:`sage.rings.padics.relaxed_template.RelaxedElement_unknown.set` to define `a`. Below, for example, we say that the digits of `a` have to agree with the digits of `1 + 5 a`. Note that the factor `5` shifts the digits; the `n`-th digit of `a` is then defined by the previous ones:: diff --git a/src/sage/rings/ring_extension.pyx b/src/sage/rings/ring_extension.pyx index d4c8e179ed8..0edd33209d3 100644 --- a/src/sage/rings/ring_extension.pyx +++ b/src/sage/rings/ring_extension.pyx @@ -1177,7 +1177,7 @@ cdef class RingExtension_generic(CommutativeAlgebra): .. SEEALSO:: - !meth:`base`, :meth:`bases`, :meth:`absolute_base` + :meth:`base`, :meth:`bases`, :meth:`absolute_base` """ cdef CommutativeRing b b = self diff --git a/src/sage/schemes/curves/zariski_vankampen.py b/src/sage/schemes/curves/zariski_vankampen.py index de4cc3ebfc5..46ebbbc708f 100644 --- a/src/sage/schemes/curves/zariski_vankampen.py +++ b/src/sage/schemes/curves/zariski_vankampen.py @@ -528,8 +528,8 @@ def roots_interval_cached(f, x0): def populate_roots_interval_cache(inputs): r""" - Call func:`roots_interval` to the inputs that have not been computed previously, - and cache them. + Call :func:`roots_interval` to the inputs that have not been + computed previously, and cache them. INPUT: