gh-36388: fix typographic typos
    
Fix a few typographic typos in `thematic_tutorials/tutorial-
implementing-algebraic-structures`: missing double backtick, missing
underscore.

- [X] The title is concise, informative, and self-explanatory.
- [X] The description explains in detail what this PR is about.
    
URL: #36388
Reported by: Martin Rubey
Reviewer(s): David Coudert, Martin Rubey

Author: Release Manager

src/doc/en/thematic_tutorials/tutorial-implementing-algebraic-structures.rst

@@ -179,7 +179,7 @@ Since we defined the class interactively, instead of in a Python
 module, those tests will complain about "pickling". We can silence this
 error by making sage think that the class is defined in a module. We could also
 just ignore those failing tests for now or call :class:`TestSuite` with the
-argument `skip='_test_pickling')`::
+argument ``skip='_test_pickling')``::
 
     sage: import __main__
     sage: __main__.MyCyclicGroupAlgebra = MyCyclicGroupAlgebra
@@ -238,7 +238,7 @@ Exercises
 #. Make a tiny modification to ``product_on_basis`` in
    "MyCyclicGroupAlgebra" to implement the *dual* of the group algebra
    of the cyclic group instead of its group algebra (so the product is now given by
-   `b_fb_g=\delta_{f,g}bf`).
+   `b_fb_g=\delta_{f,g}b_f`).
 
    Run the :class:`TestSuite` tests (you may ignore the "pickling"
    errors). What do you notice?
@@ -319,7 +319,7 @@ Diagonal and Triangular Morphisms
 
 We now illustrate how to specify that a given morphism is diagonal or triangular
 with respect to some order on the basis, which means that the morphism is
-invertible and `Sage` is able to compute the inverse morphism automatically.
+invertible and Sage is able to compute the inverse morphism automatically.
 Currently this feature requires the domain and codomain to have the same index
 set (in progress ...).
 
@@ -659,7 +659,7 @@ particular, this construction says that they are:
     There is a bit of redundancy here: given that ``A`` knows it is a
     commutative algebra with realizations the infrastructure could, in
     principle, determine that its realizations are commutative algebras. If this
-    was done then it would be possible to implement `Bases.super_categories` by
+    was done then it would be possible to implement ``Bases.super_categories`` by
     returning::
 
             [A.Realizations().WithBasis()]