gh-35069: Conform to doc requirements so that the docs look more beautiful
    
These are mostly either of the form of unindenting text that was
accidentally put in a code block, or correctly adding `::` or
`EXAMPLES::` so that docs render nicely.

<!-- ^^^^^
Please provide a concise, informative and self-explanatory title.
Don't put issue numbers in there, do this in the PR body below.
For example, instead of "Fixes #1234" use "Introduce new method to
calculate 1+1"
-->
### 📚 Description

<!-- Describe your changes here in detail -->
<!-- Why is this change required? What problem does it solve? -->
<!-- If it resolves an open issue, please link to the issue here. For
example "Closes #1337" -->

### 📝 Checklist

<!-- Put an `x` in all the boxes that apply. -->
<!-- If your change requires a documentation PR, please link it
appropriately -->
<!-- If you're unsure about any of these, don't hesitate to ask. We're
here to help! -->

- [ ] I have made sure that the title is self-explanatory and the
description concisely explains the PR.
- [ ] I have linked an issue or discussion.
- [ ] I have created tests covering the changes.
- [ ] I have updated the documentation accordingly.

### ⌛ Dependencies
<!-- List all open pull requests that this PR logically depends on -->
<!--
- #xyz: short description why this is a dependency
- #abc: ...
-->
    
URL: #35069
Reported by: Alex J Best
Reviewer(s): Alex J Best, Frédéric Chapoton, Travis Scrimshaw

Author: Release Manager

src/sage/algebras/free_algebra_quotient.py

@@ -295,6 +295,8 @@ def module(self):
         """
         The free module of the algebra.
 
+        EXAMPLES::
+
             sage: H = sage.algebras.free_algebra_quotient.hamilton_quatalg(QQ)[0]; H
             Free algebra quotient on 3 generators ('i', 'j', 'k') and dimension 4 over Rational Field
             sage: H.module()

src/sage/algebras/iwahori_hecke_algebra.py

@@ -2491,6 +2491,8 @@ def __init__(self, IHAlgebra, prefix=None):
             r"""
             Initialize the `A`-basis of the Iwahori-Hecke algebra ``IHAlgebra``.
 
+            EXAMPLES::
+
                 sage: R.<v> = LaurentPolynomialRing(QQ)
                 sage: H = IwahoriHeckeAlgebra('A3', v**2)
                 sage: A = H.A()

src/sage/algebras/quatalg/quaternion_algebra.py

@@ -1337,8 +1337,8 @@ def __init__(self, A, basis, check=True):
             sage: type(R)
             <class 'sage.algebras.quatalg.quaternion_algebra.QuaternionOrder_with_category'>
 
-            Over QQ and number fields it is checked whether the given
-            basis actually gives an order (as a module over the maximal order):
+        Over QQ and number fields it is checked whether the given
+        basis actually gives an order (as a module over the maximal order)::
 
             sage: A.<i,j,k> = QuaternionAlgebra(-1,-1)
             sage: A.quaternion_order([1,i,j,i-j])

src/sage/categories/cartesian_product.py

@@ -155,7 +155,7 @@ def __call__(self, args, **kwds):
             sage: _.category()
             Category of Cartesian products of finite enumerated sets
 
-        Check that the empty product is handled correctly:
+        Check that the empty product is handled correctly::
 
             sage: C = cartesian_product([])
             sage: C

src/sage/categories/domains.py

@@ -57,18 +57,18 @@ def _test_zero_divisors(self, **options):
                 In rings whose elements can not be represented exactly, there
                 may be zero divisors in practice, even though these rings do
                 not have them in theory. For such inexact rings, these tests
-                are not performed:
-
-                sage: R = ZpFM(5); R
-                5-adic Ring of fixed modulus 5^20
-                sage: R.is_exact()
-                False
-                sage: a = R(5^19)
-                sage: a.is_zero()
-                False
-                sage: (a*a).is_zero()
-                True
-                sage: R._test_zero_divisors()
+                are not performed::
+
+                    sage: R = ZpFM(5); R
+                    5-adic Ring of fixed modulus 5^20
+                    sage: R.is_exact()
+                    False
+                    sage: a = R(5^19)
+                    sage: a.is_zero()
+                    False
+                    sage: (a*a).is_zero()
+                    True
+                    sage: R._test_zero_divisors()
 
             EXAMPLES::
 

src/sage/categories/examples/sets_cat.py

@@ -160,7 +160,7 @@ class PrimeNumbers_Abstract(UniqueRepresentation, Parent):
     datastructure will then be constructed by inheriting from
     :class:`PrimeNumbers_Abstract`.
 
-    This is used by:
+    This is used by::
 
         sage: P = Sets().example("facade")
         sage: P = Sets().example("inherits")

src/sage/categories/magmas.py

@@ -711,6 +711,8 @@ def one(self):
                     r"""
                     Return the unit element of ``self``.
 
+                    EXAMPLES::
+
                         sage: from sage.combinat.root_system.extended_affine_weyl_group import ExtendedAffineWeylGroup
                         sage: PvW0 = ExtendedAffineWeylGroup(['A',2,1]).PvW0()
                         sage: PvW0 in Magmas().Unital().Realizations()

src/sage/coding/abstract_code.py

@@ -337,7 +337,7 @@ def __iter__(self):
             ....:        super().__init__(10)
 
         We check we get a sensible error message while asking for an
-        iterator over the elements of our new class:
+        iterator over the elements of our new class::
 
             sage: C = MyCode()
             sage: list(C)
@@ -365,7 +365,7 @@ def __contains__(self, c):
             ....:        super().__init__(length)
 
         We check we get a sensible error message while asking if an element is
-        in our new class:
+        in our new class::
 
             sage: C = MyCode(3)
             sage: vector((1, 0, 0, 0, 0, 1, 1)) in C
@@ -461,7 +461,7 @@ def _repr_(self):
             ....:        super().__init__(10)
 
         We check we get a sensible error message while asking for a string
-        representation of an instance of our new class:
+        representation of an instance of our new class::
 
             sage: C = MyCode()
             sage: C #random
@@ -489,7 +489,7 @@ def _latex_(self):
             ....:        super().__init__(10)
 
         We check we get a sensible error message while asking for a string
-        representation of an instance of our new class:
+        representation of an instance of our new class::
 
             sage: C = MyCode()
             sage: latex(C)

src/sage/coding/guruswami_sudan/interpolation.py

@@ -184,7 +184,7 @@ def _interpolation_matrix_problem(points, tau, parameters, wy):
     EXAMPLES:
 
     The following parameters arise from Guruswami-Sudan decoding of an [6,2,5]
-    GRS code over F(11) with multiplicity 2 and list size 4.
+    GRS code over F(11) with multiplicity 2 and list size 4. ::
 
         sage: from sage.coding.guruswami_sudan.interpolation import _interpolation_matrix_problem
         sage: F = GF(11)

src/sage/coding/linear_code_no_metric.py

@@ -538,7 +538,7 @@ def systematic_generator_matrix(self, systematic_positions=None):
             [1 2 0 1]
             [0 0 1 2]
 
-        Specific systematic positions can also be requested:
+        Specific systematic positions can also be requested::
 
             sage: C.systematic_generator_matrix(systematic_positions=[3,2])
             [1 2 0 1]