X-Git-Url: http://gitweb.michael.orlitzky.com/?a=blobdiff_plain;f=mjo%2Feja%2Feja_algebra.py;h=e436bf144970a8398794903db00d52c86c3ce07e;hb=4bca351aed81d3ee621b530e7e802122b08bd2a6;hp=8219c5b4ff32b7acdb55de21aac53f657a11b20f;hpb=e0031c84e8b7d89071f052f44d1cf28b2370b161;p=sage.d.git

diff --git a/mjo/eja/eja_algebra.py b/mjo/eja/eja_algebra.py
index 8219c5b..e436bf1 100644
--- a/mjo/eja/eja_algebra.py
+++ b/mjo/eja/eja_algebra.py
@@ -588,6 +588,16 @@ class FiniteDimensionalEuclideanJordanAlgebra(CombinatorialFreeModule):
             sage: actual == expected
             True
 
+        Ensure that the cached unit element (often precomputed by
+        hand) agrees with the computed one::
+
+            sage: set_random_seed()
+            sage: J = random_eja()
+            sage: cached = J.one()
+            sage: J.one.clear_cache()
+            sage: J.one() == cached
+            True
+
         """
         # We can brute-force compute the matrices of the operators
         # that correspond to the basis elements of this algebra.
@@ -1108,7 +1118,8 @@ class MatrixEuclideanJordanAlgebra(FiniteDimensionalEuclideanJordanAlgebra):
         # time to ensure that it isn't a generator expression.
         basis = tuple(basis)
 
-        if len(basis) > 1 and normalize_basis:
+        algebra_dim = len(basis)
+        if algebra_dim > 1 and normalize_basis:
             # We'll need sqrt(2) to normalize the basis, and this
             # winds up in the multiplication table, so the whole
             # algebra needs to be over the field extension.
@@ -1129,6 +1140,14 @@ class MatrixEuclideanJordanAlgebra(FiniteDimensionalEuclideanJordanAlgebra):
                                                            natural_basis=basis,
                                                            **kwargs)
 
+        if algebra_dim == 0:
+            self.one.set_cache(self.zero())
+        else:
+            n = basis[0].nrows()
+            # The identity wrt (A,B) -> (AB + BA)/2 is independent of the
+            # details of this algebra.
+            self.one.set_cache(self(matrix.identity(field,n)))
+
 
     @cached_method
     def _charpoly_coefficients(self):
@@ -2051,6 +2070,7 @@ class HadamardEJA(RationalBasisEuclideanJordanAlgebra):
                                           check_axioms=False,
                                           **kwargs)
         self.rank.set_cache(n)
+        self.one.set_cache( sum(self.gens()) )
 
     @staticmethod
     def _max_random_instance_size():
@@ -2191,6 +2211,11 @@ class BilinearFormEJA(RationalBasisEuclideanJordanAlgebra):
                                               **kwargs)
         self.rank.set_cache(min(n,2))
 
+        if n == 0:
+            self.one.set_cache( self.zero() )
+        else:
+            self.one.set_cache( self.monomial(0) )
+
     @staticmethod
     def _max_random_instance_size():
         return 5
@@ -2201,9 +2226,8 @@ class BilinearFormEJA(RationalBasisEuclideanJordanAlgebra):
         Return a random instance of this algebra.
         """
         n = ZZ.random_element(cls._max_random_instance_size() + 1)
-        if n == 0:
-            # Special case needed since we use (n-1) below.
-            B = matrix.identity(field, 0)
+        if n.is_zero():
+            B = matrix.identity(field, n)
             return cls(B, field, **kwargs)
 
         B11 = matrix.identity(field,1)
@@ -2355,6 +2379,7 @@ class TrivialEJA(FiniteDimensionalEuclideanJordanAlgebra):
         # The rank is zero using my definition, namely the dimension of the
         # largest subalgebra generated by any element.
         self.rank.set_cache(0)
+        self.one.set_cache( self.zero() )
 
     @classmethod
     def random_instance(cls, field=AA, **kwargs):