sagemath#37377 fix/improve docs based on reviewer comments

src/sage/rings/fraction_field_FpT.pyx

@@ -44,7 +44,8 @@ class FpT(FractionField_1poly_field):
         """
         INPUT:
 
-        - ``R`` -- A dense polynomial ring over a finite field of prime order `p` with `2 < p < 2^16`
+        - ``R`` -- a dense polynomial ring over a finite field of prime order
+          `p` with `2 < p < 2^{16}`
 
         EXAMPLES::
 

src/sage/rings/polynomial/polynomial_modn_dense_ntl.pyx

@@ -864,7 +864,7 @@ cdef class Polynomial_dense_modn_ntl_zz(Polynomial_dense_mod_n):
             sage: type(R(0)^0) == type(R(0))
             True
 
-        Negative powers work (over prime fields) but use a generic
+        Negative powers work (over prime fields) but use the generic
         implementation of fraction fields::
 
             sage: R.<x> = PolynomialRing(Integers(101), implementation='NTL')

src/sage/rings/polynomial/polynomial_ring.py

@@ -2456,7 +2456,7 @@ def lagrange_polynomial(self, points, algorithm="divided_difference", previous_r
     @cached_method
     def fraction_field(self):
         """
-        Returns the fraction field of self.
+        Return the fraction field of ``self``.
 
         EXAMPLES::
 
@@ -2482,7 +2482,7 @@ def fraction_field(self):
             sage: t(x)
             x
 
-        Issue :issue:`37374`:
+        Fixed :issue:`37374`::
 
             sage: x = PolynomialRing(GF(37), ['x'], sparse=True).fraction_field().gen()
             sage: type(x.numerator())
@@ -3565,7 +3565,7 @@ def irreducible_element(self, n, algorithm=None):
     @cached_method
     def fraction_field(self):
         """
-        Returns the fraction field of self.
+        Return the fraction field of ``self``.
 
         EXAMPLES::