fix doctests and a few details

Author: fchapoton

src/sage/categories/signed_tensor.py

@@ -1,3 +1,4 @@
+# -*- coding: utf-8 -*-
 """
 Signed Tensor Product Functorial Construction
 

src/sage/categories/tensor.py

@@ -1,12 +1,13 @@
+# -*- coding: utf-8 -*-
 """
 Tensor Product Functorial Construction
 
 AUTHORS:
 
- - Nicolas M. Thiery (2008-2010): initial revision and refactorization
+- Nicolas M. Thiéry (2008-2010): initial revision and refactorization
 """
 # ****************************************************************************
-#  Copyright (C) 2008-2010 Nicolas M. Thiery <nthiery at users.sf.net>
+#  Copyright (C) 2008-2010 Nicolas M. Thiéry <nthiery at users.sf.net>
 #
 #  Distributed under the terms of the GNU General Public License (GPL)
 #                  https://www.gnu.org/licenses/

src/sage/combinat/free_module.py

@@ -351,7 +351,7 @@ def element_class(self):
             'sage.combinat.free_module'
         """
         return self.__make_element_class__(self.Element,
-                                           name="%s.element_class"%self.__class__.__name__,
+                                           name="%s.element_class" % self.__class__.__name__,
                                            module=self.__class__.__module__,
                                            inherit=True)
 
@@ -669,7 +669,7 @@ def _element_constructor_(self, x):
             if x == 0:
                 return self.zero()
             else:
-                raise TypeError("do not know how to make x (= %s) an element of %s"%(x, self))
+                raise TypeError("do not know how to make x (= %s) an element of %s" % (x, self))
         #x is an element of the basis enumerated set;
         # This is a very ugly way of testing this
         elif ((hasattr(self._indices, 'element_class') and
@@ -685,7 +685,7 @@ def _element_constructor_(self, x):
                     return self._coerce_end(x)
                 except TypeError:
                     pass
-            raise TypeError("do not know how to make x (= %s) an element of self (=%s)"%(x,self))
+            raise TypeError("do not know how to make x (= %s) an element of self (=%s)" % (x, self))
 
     def _convert_map_from_(self, S):
         """
@@ -1297,15 +1297,13 @@ def __classcall_private__(cls, modules, **options):
                 options['category'] = options['category'].FiniteDimensional()
             return super(CombinatorialFreeModule.Tensor, cls).__classcall__(cls, modules, **options)
 
-
         def __init__(self, modules, **options):
             """
             TESTS::
 
                 sage: F = CombinatorialFreeModule(ZZ, [1,2]); F
                 F
             """
-            from sage.categories.tensor import tensor
             self._sets = modules
             indices = CartesianProduct_iters(*[module.basis().keys()
                                                for module in modules]).map(tuple)
@@ -1496,10 +1494,11 @@ def tensor_constructor(self, modules):
             # a list l such that l[i] is True if modules[i] is readily a tensor product
             is_tensor = [isinstance(module, CombinatorialFreeModule_Tensor) for module in modules]
             # the tensor_constructor, on basis elements
-            result = self.monomial * CartesianProductWithFlattening(is_tensor) #.
+            result = self.monomial * CartesianProductWithFlattening(is_tensor)
             # TODO: make this into an element of Hom( A x B, C ) when those will exist
-            for i in range(0, len(modules)):
-                result = modules[i]._module_morphism(result, position = i, codomain = self)
+            for i in range(len(modules)):
+                result = modules[i]._module_morphism(result, position=i,
+                                                     codomain=self)
             return result
 
         def _tensor_of_elements(self, elements):
@@ -1594,6 +1593,7 @@ def _coerce_map_from_(self, R):
 
             return super(CombinatorialFreeModule_Tensor, self)._coerce_map_from_(R)
 
+
 class CartesianProductWithFlattening(object):
     """
     A class for Cartesian product constructor, with partial flattening
@@ -1755,7 +1755,7 @@ def cartesian_embedding(self, i):
         """
         assert i in self._sets_keys()
         return self._sets[i]._module_morphism(lambda t: self.monomial((i, t)),
-                                              codomain = self)
+                                              codomain=self)
 
     summand_embedding = cartesian_embedding
 
@@ -1786,7 +1786,7 @@ def cartesian_projection(self, i):
         """
         assert i in self._sets_keys()
         module = self._sets[i]
-        return self._module_morphism(lambda j_t: module.monomial(j_t[1]) if i == j_t[0] else module.zero(), codomain = module)
+        return self._module_morphism(lambda j_t: module.monomial(j_t[1]) if i == j_t[0] else module.zero(), codomain=module)
 
     summand_projection = cartesian_projection
 
@@ -1832,4 +1832,5 @@ def cartesian_factors(self):
     class Element(CombinatorialFreeModule.Element): # TODO: get rid of this inheritance
         pass
 
+
 CombinatorialFreeModule.CartesianProduct = CombinatorialFreeModule_CartesianProduct