Sage documentation build fixes for 3.1.3 (#4272)

src/sage/calculus/calculus.py

@@ -3156,7 +3156,7 @@ def find_root(self, a, b, var=None, xtol=10e-13, rtol=4.5e-16, maxiter=100, full
 
         TESTS:
 
-        Test the special case that failed for the first attempt to fix #3980.
+        Test the special case that failed for the first attempt to fix \#3980.
             sage: t = var('t')
             sage: find_root(1/t - x,0,2)
             Traceback (most recent call last):

src/sage/modular/modsym/heilbronn.pyx

@@ -782,7 +782,7 @@ def hecke_images_gamma0_weight_k(int u, int v, int i, int N, int k, indices, R):
     OUTPUT:
         a dense matrix with rational entries whose columns are
         the images T_n(x) for n in indices and x the Manin
-        symbol [X^i*Y^(k-2-i), (u,v)], expressed in terms of the basis.
+        symbol [$X^i*Y^(k-2-i), (u,v)$], expressed in terms of the basis.
 
     EXAMPLES:
         sage: M = ModularSymbols(15,6,sign=-1)

src/sage/plot/plot.py

@@ -2356,9 +2356,9 @@ def __getitem__(self, i):
         return self.xdata[i], self.ydata[i]
 
     def _render_on_subplot(self,subplot):
-        """
+        r"""
         TESTS:
-        We check to make sure that #2076 is fixed by verifying all
+        We check to make sure that \#2076 is fixed by verifying all
         the points are red.
             sage: point(((1,1), (2,2), (3,3)), rgbcolor=hue(1), pointsize=30)
         """
@@ -2368,7 +2368,7 @@ def _render_on_subplot(self,subplot):
         #method does not interpret it as a list of 3 floating
         #point color specifications when there are
         #three points. This is mentioned in the matplotlib 0.98
-        #documentation and fixes #2076
+        #documentation and fixes \#2076
         from matplotlib.colors import rgb2hex
         c = rgb2hex(to_mpl_color(options['rgbcolor']))
 

src/sage/rings/integer.pyx

@@ -1,4 +1,4 @@
-r"""
+"""
 Elements of the ring $\Z$ of integers
 
 AUTHORS:
@@ -1116,7 +1116,7 @@ cdef class Integer(sage.structure.element.EuclideanDomainElement):
 
     cpdef RingElement _div_(self, RingElement right):
         r"""
-        Computes \frac{a}{b}
+        Computes $\frac{a}{b}$
 
         EXAMPLES:
             sage: a = Integer(3) ; b = Integer(4)

src/sage/rings/polynomial/multi_polynomial_ideal.py

@@ -121,13 +121,13 @@
         sage: ideal(x+y, x^2 - 1, y^2 - 2*x).groebner_basis()
         [1]
 
-The next example shows how we can use Groebner bases over \ZZ to find
+The next example shows how we can use Groebner bases over $\ZZ$ to find
 the primes modulo which a system of equations has a solution, when the
 system has no solutions over the rationals.
 
     We first form a certain ideal $I$ in $\ZZ[x, y, z]$, and note that
-    the Groebner basis of $I$ over \QQ contains 1, so there are no
-    solutions over \QQ or an algebraic closure of it (this is not
+    the Groebner basis of $I$ over $\QQ$ contains 1, so there are no
+    solutions over $\QQ$ or an algebraic closure of it (this is not
     surprising as there are 4 equations in 3 unknowns).
 
         sage: P.<x,y,z> = PolynomialRing(ZZ,order='lex')
@@ -137,7 +137,7 @@
         [1]
 
     However, when we compute the Groebner basis of I (defined over
-    \ZZ), we note that there is a certain integer in the ideal which
+    $\ZZ$), we note that there is a certain integer in the ideal which
     is not 1.
 
         sage: I.groebner_basis()

src/sage/structure/coerce.pyx

@@ -724,7 +724,7 @@ cdef class CoercionModel_cache_maps(CoercionModel):
             sage: type(a)
             <type 'sage.rings.rational.Rational'>
 
-        We also make an exception for 0, even if $\mathbb{Z}$ does not map in:
+        We also make an exception for 0, even if $\ZZ$ does not map in:
             sage: canonical_coercion(vector([1, 2, 3]), 0)
             ((1, 2, 3), (0, 0, 0))
         """