Merge #34167

Author: Matthias Koeppe

src/sage/geometry/polyhedron/constructor.py

@@ -29,16 +29,16 @@
 
     where
 
-    * **vertices** `v_1`, `\dots`, `v_k` are a finite number of
+    * **vertices** `v_1,\dots,v_k` are a finite number of
       points. Each vertex is specified by an arbitrary vector, and two
       points are equal if and only if the vector is the same.
 
-    * **rays** `r_1`, `\dots`, `r_m` are a finite number of directions
+    * **rays** `r_1,\dots,r_m` are a finite number of directions
       (directions of infinity). Each ray is specified by a non-zero
       vector, and two rays are equal if and only if the vectors are
       the same up to rescaling with a positive constant.
 
-    * **lines** `\ell_1`, `\dots`, `\ell_n` are a finite number of
+    * **lines** `\ell_1,\dots,\ell_n` are a finite number of
       unoriented directions. In other words, a line is equivalent to
       the set `\{r, -r\}` for a ray `r`. Each line is specified by a
       non-zero vector, and two lines are equivalent if and only if the
@@ -159,11 +159,10 @@
 
 The base ring of the polyhedron can be specified by the ``base_ring``
 optional keyword argument. If not specified, a suitable common base
-ring for all coordinates/coefficients will be chosen
+ring for all coordinates and coefficients will be chosen
 automatically. Important cases are:
 
-* ``base_ring=QQ`` uses a fast implementation for exact rational
-  numbers.
+* ``base_ring=QQ`` uses a fast implementation for exact rational numbers.
 
 * ``base_ring=ZZ`` is similar to ``QQ``, but the resulting polyhedron
   object will have extra methods for lattice polyhedra.
@@ -174,8 +173,8 @@
 Polyhedra with symmetries often are defined over some algebraic field
 extension of the rationals. As a simple example, consider the
 equilateral triangle whose vertex coordinates involve `\sqrt{3}`. An
-exact way to work with roots in Sage is the :mod:`Algebraic Real Field
-<sage.rings.qqbar>` ::
+exact way to work with roots in Sage is the
+:mod:`Algebraic Real Field <sage.rings.qqbar>` ::
 
     sage: triangle = Polyhedron([(0,0), (1,0), (1/2, sqrt(3)/2)], base_ring=AA) # optional - sage.rings.number_field  # optional - sage.symbolic
     sage: triangle.Hrepresentation()                                            # optional - sage.rings.number_field  # optional - sage.symbolic

src/sage/matroids/graphic_matroid.py

@@ -317,13 +317,13 @@ def _repr_(self):
 
     def _vertex_stars(self):
         """
-        Computes the set of edge labels around each vertex.
+        Compute the set of edge labels around each vertex.
 
         Internal method for hashing purposes.
 
         OUTPUT:
 
-        A ``frozenset`` of ``frozenset``s containing the edge labels around
+        A ``frozenset`` of ``frozenset`` s containing the edge labels around
         each vertex.
 
         EXAMPLES::
@@ -345,7 +345,7 @@ def _vertex_stars(self):
         """
         star_list = []
         for v in self._G.vertices():
-            star = [l for (u, v, l) in self._G.edges_incident(v)]
+            star = [l for (_, _, l) in self._G.edges_incident(v)]
             star_list.append(frozenset(star))
         return frozenset(star_list)
 

src/sage/modules/free_module.py

@@ -453,7 +453,7 @@ def FreeModule(base_ring, rank_or_basis_keys=None, sparse=False, inner_product_m
         [1 2]
         [3 4]
 
-    .. todo::
+    .. TODO::
 
         Refactor modules such that it only counts what category the base
         ring belongs to, but not what is its Python class.

src/sage/modules/tensor_operations.py

@@ -248,7 +248,7 @@ class TensorOperation(VectorCollection):
     - ``operation`` -- string. The tensor operation. Currently allowed
       values are ``product``, ``symmetric``, and ``antisymmetric``.
 
-    .. todo::
+    .. TODO::
 
         More general tensor operations (specified by Young tableaux)
         should be implemented.
@@ -326,8 +326,7 @@ def _init_product_vectors(self, i):
         .. NOTE::
 
             In a convenient choice of coordinates the tensor product
-            of, say, two vectors `(a,b)` and `(c,d)`, is `(ac, ad, bc,
-            bd)$.
+            of, say, two vectors `(a,b)` and `(c,d)`, is `(ac, ad, bc, bd)`.
 
         EXAMPLES::
 

src/sage/modules/tutorial_free_modules.py

@@ -1,7 +1,7 @@
 r"""
 Tutorial: Using free modules and vector spaces
 
-.. MODULEAUTHOR:: Jason Bandlow
+AUTHOR: Jason Bandlow
 
 In this tutorial, we show how to construct and manipulate free modules
 and vector spaces and their elements.

src/sage_docbuild/conf.py

@@ -176,7 +176,7 @@ def sphinx_plot(graphics, **kwds):
 
 # If true, sectionauthor and moduleauthor directives will be shown in the
 # output. They are ignored by default.
-#show_authors = False
+show_authors = True
 
 # Default lexer to use when highlighting code blocks, using the IPython
 # console lexers. 'ipycon' is the IPython console, which is what we want

src/tox.ini

@@ -207,7 +207,9 @@ rst-roles =
     wikipedia
 rst-directives =
     automethod,
+    autofunction,
     toctree,
+    MODULEAUTHOR,
     ONLY,
     PLOT,
     SEEALSO,