QuadraticField)
from mjo.eja.eja_element import FiniteDimensionalEJAElement
from mjo.eja.eja_operator import FiniteDimensionalEJAOperator
-from mjo.eja.eja_utils import _mat2vec
+from mjo.eja.eja_utils import _all2list, _mat2vec
class FiniteDimensionalEJA(CombinatorialFreeModule):
r"""
INPUT:
- - basis -- a tuple of basis elements in their matrix form.
+ - basis -- a tuple of basis elements in "matrix form," which
+ must be the same form as the arguments to ``jordan_product``
+ and ``inner_product``. In reality, "matrix form" can be either
+ vectors, matrices, or a Cartesian product (ordered tuple)
+ of vectors or matrices. All of these would ideally be vector
+ spaces in sage with no special-casing needed; but in reality
+ we turn vectors into column-matrices and Cartesian products
+ `(a,b)` into column matrices `(a,b)^{T}` after converting
+ `a` and `b` themselves.
- jordan_product -- function of two elements (in matrix form)
that returns their jordan product in this algebra; this will
field=AA,
orthonormalize=True,
associative=False,
+ cartesian_product=False,
check_field=True,
check_axioms=True,
prefix='e'):
+ # Keep track of whether or not the matrix basis consists of
+ # tuples, since we need special cases for them damned near
+ # everywhere. This is INDEPENDENT of whether or not the
+ # algebra is a cartesian product, since a subalgebra of a
+ # cartesian product will have a basis of tuples, but will not
+ # in general itself be a cartesian product algebra.
+ self._matrix_basis_is_cartesian = False
+ n = len(basis)
+ if n > 0:
+ if hasattr(basis[0], 'cartesian_factors'):
+ self._matrix_basis_is_cartesian = True
+
if check_field:
if not field.is_subring(RR):
# Note: this does return true for the real algebraic
# If the basis given to us wasn't over the field that it's
# supposed to be over, fix that. Or, you know, crash.
- basis = tuple( b.change_ring(field) for b in basis )
+ if not cartesian_product:
+ # The field for a cartesian product algebra comes from one
+ # of its factors and is the same for all factors, so
+ # there's no need to "reapply" it on product algebras.
+ if self._matrix_basis_is_cartesian:
+ # OK since if n == 0, the basis does not consist of tuples.
+ P = basis[0].parent()
+ basis = tuple( P(tuple(b_i.change_ring(field) for b_i in b))
+ for b in basis )
+ else:
+ basis = tuple( b.change_ring(field) for b in basis )
+
if check_axioms:
# Check commutativity of the Jordan and inner-products.
if associative:
# Element subalgebras can take advantage of this.
category = category.Associative()
+ if cartesian_product:
+ category = category.CartesianProducts()
# Call the superclass constructor so that we can use its from_vector()
# method to build our multiplication table.
- n = len(basis)
- super().__init__(field,
- range(n),
- prefix=prefix,
- category=category,
- bracket=False)
+ CombinatorialFreeModule.__init__(self,
+ field,
+ range(n),
+ prefix=prefix,
+ category=category,
+ bracket=False)
# Now comes all of the hard work. We'll be constructing an
# ambient vector space V that our (vectorized) basis lives in,
degree = 0
if n > 0:
- # Works on both column and square matrices...
- degree = len(basis[0].list())
+ degree = len(_all2list(basis[0]))
# Build an ambient space that fits our matrix basis when
# written out as "long vectors."
# Save a copy of the un-orthonormalized basis for later.
# Convert it to ambient V (vector) coordinates while we're
# at it, because we'd have to do it later anyway.
- deortho_vector_basis = tuple( V(b.list()) for b in basis )
+ deortho_vector_basis = tuple( V(_all2list(b)) for b in basis )
from mjo.eja.eja_utils import gram_schmidt
basis = tuple(gram_schmidt(basis, inner_product))
# Now create the vector space for the algebra, which will have
# its own set of non-ambient coordinates (in terms of the
# supplied basis).
- vector_basis = tuple( V(b.list()) for b in basis )
+ vector_basis = tuple( V(_all2list(b)) for b in basis )
W = V.span_of_basis( vector_basis, check=check_axioms)
if orthonormalize:
# The jordan product returns a matrixy answer, so we
# have to convert it to the algebra coordinates.
elt = jordan_product(q_i, q_j)
- elt = W.coordinate_vector(V(elt.list()))
+ elt = W.coordinate_vector(V(_all2list(elt)))
self._multiplication_table[i][j] = self.from_vector(elt)
if not orthonormalize:
sage: y = J.random_element()
sage: (n == 1) or (x.inner_product(y) == (x*y).trace()/2)
True
+
"""
B = self._inner_product_matrix
return (B*x.to_vector()).inner_product(y.to_vector())
- def _is_commutative(self):
+ def is_associative(self):
r"""
- Whether or not this algebra's multiplication table is commutative.
+ Return whether or not this algebra's Jordan product is associative.
+
+ SETUP::
+
+ sage: from mjo.eja.eja_algebra import ComplexHermitianEJA
+
+ EXAMPLES::
+
+ sage: J = ComplexHermitianEJA(3, field=QQ, orthonormalize=False)
+ sage: J.is_associative()
+ False
+ sage: x = sum(J.gens())
+ sage: A = x.subalgebra_generated_by(orthonormalize=False)
+ sage: A.is_associative()
+ True
- This method should of course always return ``True``, unless
- this algebra was constructed with ``check_axioms=False`` and
- passed an invalid multiplication table.
"""
- return all( self.product_on_basis(i,j) == self.product_on_basis(i,j)
- for i in range(self.dimension())
- for j in range(self.dimension()) )
+ return "Associative" in self.category().axioms()
def _is_jordanian(self):
r"""
We only check one arrangement of `x` and `y`, so for a
``True`` result to be truly true, you should also check
- :meth:`_is_commutative`. This method should of course always
+ :meth:`is_commutative`. This method should of course always
return ``True``, unless this algebra was constructed with
``check_axioms=False`` and passed an invalid multiplication table.
"""
- return all( (self.monomial(i)**2)*(self.monomial(i)*self.monomial(j))
+ return all( (self.gens()[i]**2)*(self.gens()[i]*self.gens()[j])
==
- (self.monomial(i))*((self.monomial(i)**2)*self.monomial(j))
+ (self.gens()[i])*((self.gens()[i]**2)*self.gens()[j])
for i in range(self.dimension())
for j in range(self.dimension()) )
for i in range(self.dimension()):
for j in range(self.dimension()):
for k in range(self.dimension()):
- x = self.monomial(i)
- y = self.monomial(j)
- z = self.monomial(k)
+ x = self.gens()[i]
+ y = self.gens()[j]
+ z = self.gens()[k]
diff = (x*y).inner_product(z) - x.inner_product(y*z)
if self.base_ring().is_exact():
...
ValueError: not an element of this algebra
+ Tuples work as well, provided that the matrix basis for the
+ algebra consists of them::
+
+ sage: J1 = HadamardEJA(3)
+ sage: J2 = RealSymmetricEJA(2)
+ sage: J = cartesian_product([J1,J2])
+ sage: J( (J1.matrix_basis()[1], J2.matrix_basis()[2]) )
+ e(0, 1) + e(1, 2)
+
TESTS:
Ensure that we can convert any element of the two non-matrix
# closure whereas the base ring of the 3-by-3 identity matrix
# could be QQ instead of QQbar.
#
+ # And, we also have to handle Cartesian product bases (when
+ # the matric basis consists of tuples) here. The "good news"
+ # is that we're already converting everything to long vectors,
+ # and that strategy works for tuples as well.
+ #
# We pass check=False because the matrix basis is "guaranteed"
# to be linearly independent... right? Ha ha.
- V = VectorSpace(self.base_ring(), elt.nrows()*elt.ncols())
- W = V.span_of_basis( (_mat2vec(s) for s in self.matrix_basis()),
+ elt = _all2list(elt)
+ V = VectorSpace(self.base_ring(), len(elt))
+ W = V.span_of_basis( (V(_all2list(s)) for s in self.matrix_basis()),
check=False)
try:
- coords = W.coordinate_vector(_mat2vec(elt))
+ coords = W.coordinate_vector(V(elt))
except ArithmeticError: # vector is not in free module
raise ValueError(msg)
# And to each subsequent row, prepend an entry that belongs to
# the left-side "header column."
- M += [ [self.monomial(i)] + [ self.product_on_basis(i,j)
- for j in range(n) ]
+ M += [ [self.gens()[i]] + [ self.product_on_basis(i,j)
+ for j in range(n) ]
for i in range(n) ]
return table(M, header_row=True, header_column=True, frame=True)
if not c.is_idempotent():
raise ValueError("element is not idempotent: %s" % c)
- from mjo.eja.eja_subalgebra import FiniteDimensionalEJASubalgebra
-
# Default these to what they should be if they turn out to be
# trivial, because eigenspaces_left() won't return eigenvalues
# corresponding to trivial spaces (e.g. it returns only the
# eigenspace corresponding to lambda=1 if you take the
# decomposition relative to the identity element).
- trivial = FiniteDimensionalEJASubalgebra(self, ())
+ trivial = self.subalgebra(())
J0 = trivial # eigenvalue zero
J5 = VectorSpace(self.base_ring(), 0) # eigenvalue one-half
J1 = trivial # eigenvalue one
J5 = eigspace
else:
gens = tuple( self.from_vector(b) for b in eigspace.basis() )
- subalg = FiniteDimensionalEJASubalgebra(self,
- gens,
- check_axioms=False)
+ subalg = self.subalgebra(gens, check_axioms=False)
if eigval == 0:
J0 = subalg
elif eigval == 1:
def L_x_i_j(i,j):
# From a result in my book, these are the entries of the
# basis representation of L_x.
- return sum( vars[k]*self.monomial(k).operator().matrix()[i,j]
+ return sum( vars[k]*self.gens()[k].operator().matrix()[i,j]
for k in range(n) )
L_x = matrix(F, n, n, L_x_i_j)
return len(self._charpoly_coefficients())
+ def subalgebra(self, basis, **kwargs):
+ r"""
+ Create a subalgebra of this algebra from the given basis.
+ """
+ from mjo.eja.eja_subalgebra import FiniteDimensionalEJASubalgebra
+ return FiniteDimensionalEJASubalgebra(self, basis, **kwargs)
+
+
def vector_space(self):
"""
Return the vector space that underlies this algebra.
return self.zero().to_vector().parent().ambient_vector_space()
- Element = FiniteDimensionalEJAElement
class RationalBasisEJA(FiniteDimensionalEJA):
r"""
if "check_axioms" not in kwargs: kwargs["check_axioms"] = False
column_basis = tuple( b.column() for b in FreeModule(ZZ, n).basis() )
- super().__init__(column_basis, jordan_product, inner_product, **kwargs)
+ super().__init__(column_basis,
+ jordan_product,
+ inner_product,
+ associative=True,
+ **kwargs)
self.rank.set_cache(n)
if n == 0:
SETUP::
- sage: from mjo.eja.eja_algebra import (CartesianProductEJA,
+ sage: from mjo.eja.eja_algebra import (random_eja,
+ ....: CartesianProductEJA,
....: HadamardEJA,
....: JordanSpinEJA,
....: RealSymmetricEJA)
The ability to retrieve the original factors is implemented by our
CombinatorialFreeModule Cartesian product superclass::
- sage: J1 = HadamardEJA(2, field=QQ)
- sage: J2 = JordanSpinEJA(3, field=QQ)
- sage: J = cartesian_product([J1,J2])
- sage: J.cartesian_factors()
- (Euclidean Jordan algebra of dimension 2 over Rational Field,
- Euclidean Jordan algebra of dimension 3 over Rational Field)
+ sage: J1 = HadamardEJA(2, field=QQ)
+ sage: J2 = JordanSpinEJA(3, field=QQ)
+ sage: J = cartesian_product([J1,J2])
+ sage: J.cartesian_factors()
+ (Euclidean Jordan algebra of dimension 2 over Rational Field,
+ Euclidean Jordan algebra of dimension 3 over Rational Field)
+
+ You can provide more than two factors::
+
+ sage: J1 = HadamardEJA(2)
+ sage: J2 = JordanSpinEJA(3)
+ sage: J3 = RealSymmetricEJA(3)
+ sage: cartesian_product([J1,J2,J3])
+ Euclidean Jordan algebra of dimension 2 over Algebraic Real
+ Field (+) Euclidean Jordan algebra of dimension 3 over Algebraic
+ Real Field (+) Euclidean Jordan algebra of dimension 6 over
+ Algebraic Real Field
+
+ Rank is additive on a Cartesian product::
+
+ sage: J1 = HadamardEJA(1)
+ sage: J2 = RealSymmetricEJA(2)
+ sage: J = cartesian_product([J1,J2])
+ sage: J1.rank.clear_cache()
+ sage: J2.rank.clear_cache()
+ sage: J.rank.clear_cache()
+ sage: J.rank()
+ 3
+ sage: J.rank() == J1.rank() + J2.rank()
+ True
+
+ The same rank computation works over the rationals, with whatever
+ basis you like::
+
+ sage: J1 = HadamardEJA(1, field=QQ, orthonormalize=False)
+ sage: J2 = RealSymmetricEJA(2, field=QQ, orthonormalize=False)
+ sage: J = cartesian_product([J1,J2])
+ sage: J1.rank.clear_cache()
+ sage: J2.rank.clear_cache()
+ sage: J.rank.clear_cache()
+ sage: J.rank()
+ 3
+ sage: J.rank() == J1.rank() + J2.rank()
+ True
+
+ The product algebra will be associative if and only if all of its
+ components are associative::
+
+ sage: J1 = HadamardEJA(2)
+ sage: J1.is_associative()
+ True
+ sage: J2 = HadamardEJA(3)
+ sage: J2.is_associative()
+ True
+ sage: J3 = RealSymmetricEJA(3)
+ sage: J3.is_associative()
+ False
+ sage: CP1 = cartesian_product([J1,J2])
+ sage: CP1.is_associative()
+ True
+ sage: CP2 = cartesian_product([J1,J3])
+ sage: CP2.is_associative()
+ False
TESTS:
Traceback (most recent call last):
...
ValueError: all factors must share the same base field
+
+ The cached unit element is the same one that would be computed::
+
+ sage: set_random_seed() # long time
+ sage: J1 = random_eja() # long time
+ sage: J2 = random_eja() # long time
+ sage: J = cartesian_product([J1,J2]) # long time
+ sage: actual = J.one() # long time
+ sage: J.one.clear_cache() # long time
+ sage: expected = J.one() # long time
+ sage: actual == expected # long time
+ True
+
"""
- def __init__(self, modules, **kwargs):
- CombinatorialFreeModule_CartesianProduct.__init__(self, modules, **kwargs)
- field = modules[0].base_ring()
- if not all( J.base_ring() == field for J in modules ):
+ Element = FiniteDimensionalEJAElement
+
+
+ def __init__(self, algebras, **kwargs):
+ CombinatorialFreeModule_CartesianProduct.__init__(self,
+ algebras,
+ **kwargs)
+ field = algebras[0].base_ring()
+ if not all( J.base_ring() == field for J in algebras ):
raise ValueError("all factors must share the same base field")
- M = cartesian_product( [J.matrix_space() for J in modules] )
+ associative = all( m.is_associative() for m in algebras )
+
+ # The definition of matrix_space() and self.basis() relies
+ # only on the stuff in the CFM_CartesianProduct class, which
+ # we've already initialized.
+ Js = self.cartesian_factors()
+ m = len(Js)
+ MS = self.matrix_space()
+ basis = tuple(
+ MS(tuple( self.cartesian_projection(i)(b).to_matrix()
+ for i in range(m) ))
+ for b in self.basis()
+ )
- m = len(modules)
- W = VectorSpace(field,m)
- self._matrix_basis = []
- for k in range(m):
- for a in modules[k].matrix_basis():
- v = W.zero().list()
- v[k] = a
- self._matrix_basis.append(M(v))
+ # Define jordan/inner products that operate on that matrix_basis.
+ def jordan_product(x,y):
+ return MS(tuple(
+ (Js[i](x[i])*Js[i](y[i])).to_matrix() for i in range(m)
+ ))
- self._matrix_basis = tuple(self._matrix_basis)
+ def inner_product(x, y):
+ return sum(
+ Js[i](x[i]).inner_product(Js[i](y[i])) for i in range(m)
+ )
- n = len(self._matrix_basis)
- # TODO:
- #
- # Initialize the FDEJA class, too. Does this override the
- # initialization that we did for the
- # CombinatorialFreeModule_CartesianProduct class? If not, we
- # will probably have to duplicate some of the work (i.e. one
- # of the constructors). Since the CartesianProduct one is
- # smaller, that makes the most sense to copy/paste if it comes
- # down to that.
+ # There's no need to check the field since it already came
+ # from an EJA. Likewise the axioms are guaranteed to be
+ # satisfied, unless the guy writing this class sucks.
#
+ # If you want the basis to be orthonormalized, orthonormalize
+ # the factors.
+ FiniteDimensionalEJA.__init__(self,
+ basis,
+ jordan_product,
+ inner_product,
+ field=field,
+ orthonormalize=False,
+ associative=associative,
+ cartesian_product=True,
+ check_field=False,
+ check_axioms=False)
+
+ ones = tuple(J.one() for J in algebras)
+ self.one.set_cache(self._cartesian_product_of_elements(ones))
+ self.rank.set_cache(sum(J.rank() for J in algebras))
+
+ def matrix_space(self):
+ r"""
+ Return the space that our matrix basis lives in as a Cartesian
+ product.
+
+ SETUP::
+
+ sage: from mjo.eja.eja_algebra import (HadamardEJA,
+ ....: RealSymmetricEJA)
- self.rank.set_cache(sum(J.rank() for J in modules))
+ EXAMPLES::
+
+ sage: J1 = HadamardEJA(1)
+ sage: J2 = RealSymmetricEJA(2)
+ sage: J = cartesian_product([J1,J2])
+ sage: J.matrix_space()
+ The Cartesian product of (Full MatrixSpace of 1 by 1 dense
+ matrices over Algebraic Real Field, Full MatrixSpace of 2
+ by 2 dense matrices over Algebraic Real Field)
+
+ """
+ from sage.categories.cartesian_product import cartesian_product
+ return cartesian_product( [J.matrix_space()
+ for J in self.cartesian_factors()] )
@cached_method
def cartesian_projection(self, i):
SETUP::
sage: from mjo.eja.eja_algebra import (random_eja,
+ ....: JordanSpinEJA,
....: HadamardEJA,
- ....: RealSymmetricEJA)
+ ....: RealSymmetricEJA,
+ ....: ComplexHermitianEJA)
- EXAMPLES::
+ EXAMPLES:
+
+ The projection morphisms are Euclidean Jordan algebra
+ operators::
sage: J1 = HadamardEJA(2)
sage: J2 = RealSymmetricEJA(2)
Codomain: Euclidean Jordan algebra of dimension 3 over Algebraic
Real Field
+ The projections work the way you'd expect on the vector
+ representation of an element::
+
+ sage: J1 = JordanSpinEJA(2)
+ sage: J2 = ComplexHermitianEJA(2)
+ sage: J = cartesian_product([J1,J2])
+ sage: pi_left = J.cartesian_projection(0)
+ sage: pi_right = J.cartesian_projection(1)
+ sage: pi_left(J.one()).to_vector()
+ (1, 0)
+ sage: pi_right(J.one()).to_vector()
+ (1, 0, 0, 1)
+ sage: J.one().to_vector()
+ (1, 0, 1, 0, 0, 1)
+
TESTS:
The answer never changes::
"""
Ji = self.cartesian_factors()[i]
- # We reimplement the CombinatorialFreeModule superclass method
- # because if we don't, something gets messed up with the caching
- # and the answer changes the second time you run it. See the TESTS.
- Pi = self._module_morphism(lambda j_t: Ji.monomial(j_t[1])
- if i == j_t[0] else Ji.zero(),
- codomain=Ji)
+ # Requires the fix on Trac 31421/31422 to work!
+ Pi = super().cartesian_projection(i)
return FiniteDimensionalEJAOperator(self,Ji,Pi.matrix())
@cached_method
SETUP::
sage: from mjo.eja.eja_algebra import (random_eja,
+ ....: JordanSpinEJA,
....: HadamardEJA,
....: RealSymmetricEJA)
- EXAMPLES::
+ EXAMPLES:
+
+ The embedding morphisms are Euclidean Jordan algebra
+ operators::
sage: J1 = HadamardEJA(2)
sage: J2 = RealSymmetricEJA(2)
Algebraic Real Field (+) Euclidean Jordan algebra of
dimension 3 over Algebraic Real Field
+ The embeddings work the way you'd expect on the vector
+ representation of an element::
+
+ sage: J1 = JordanSpinEJA(3)
+ sage: J2 = RealSymmetricEJA(2)
+ sage: J = cartesian_product([J1,J2])
+ sage: iota_left = J.cartesian_embedding(0)
+ sage: iota_right = J.cartesian_embedding(1)
+ sage: iota_left(J1.zero()) == J.zero()
+ True
+ sage: iota_right(J2.zero()) == J.zero()
+ True
+ sage: J1.one().to_vector()
+ (1, 0, 0)
+ sage: iota_left(J1.one()).to_vector()
+ (1, 0, 0, 0, 0, 0)
+ sage: J2.one().to_vector()
+ (1, 0, 1)
+ sage: iota_right(J2.one()).to_vector()
+ (0, 0, 0, 1, 0, 1)
+ sage: J.one().to_vector()
+ (1, 0, 0, 1, 0, 1)
+
TESTS:
The answer never changes::
sage: E0 == E1
True
+ Composing a projection with the corresponding inclusion should
+ produce the identity map, and mismatching them should produce
+ the zero map::
+
+ sage: set_random_seed()
+ sage: J1 = random_eja()
+ sage: J2 = random_eja()
+ sage: J = cartesian_product([J1,J2])
+ sage: iota_left = J.cartesian_embedding(0)
+ sage: iota_right = J.cartesian_embedding(1)
+ sage: pi_left = J.cartesian_projection(0)
+ sage: pi_right = J.cartesian_projection(1)
+ sage: pi_left*iota_left == J1.one().operator()
+ True
+ sage: pi_right*iota_right == J2.one().operator()
+ True
+ sage: (pi_left*iota_right).is_zero()
+ True
+ sage: (pi_right*iota_left).is_zero()
+ True
+
"""
Ji = self.cartesian_factors()[i]
- # We reimplement the CombinatorialFreeModule superclass method
- # because if we don't, something gets messed up with the caching
- # and the answer changes the second time you run it. See the TESTS.
- Ei = Ji._module_morphism(lambda t: self.monomial((i, t)), codomain=self)
+ # Requires the fix on Trac 31421/31422 to work!
+ Ei = super().cartesian_embedding(i)
return FiniteDimensionalEJAOperator(Ji,self,Ei.matrix())
-FiniteDimensionalEJA.CartesianProduct = CartesianProductEJA
-
-
-# def projections(self):
-# r"""
-# Return a pair of projections onto this algebra's factors.
-
-# SETUP::
-
-# sage: from mjo.eja.eja_algebra import (JordanSpinEJA,
-# ....: ComplexHermitianEJA,
-# ....: DirectSumEJA)
-
-# EXAMPLES::
-
-# sage: J1 = JordanSpinEJA(2)
-# sage: J2 = ComplexHermitianEJA(2)
-# sage: J = DirectSumEJA(J1,J2)
-# sage: (pi_left, pi_right) = J.projections()
-# sage: J.one().to_vector()
-# (1, 0, 1, 0, 0, 1)
-# sage: pi_left(J.one()).to_vector()
-# (1, 0)
-# sage: pi_right(J.one()).to_vector()
-# (1, 0, 0, 1)
-
-# """
-# (J1,J2) = self.factors()
-# m = J1.dimension()
-# n = J2.dimension()
-# V_basis = self.vector_space().basis()
-# # Need to specify the dimensions explicitly so that we don't
-# # wind up with a zero-by-zero matrix when we want e.g. a
-# # zero-by-two matrix (important for composing things).
-# P1 = matrix(self.base_ring(), m, m+n, V_basis[:m])
-# P2 = matrix(self.base_ring(), n, m+n, V_basis[m:])
-# pi_left = FiniteDimensionalEJAOperator(self,J1,P1)
-# pi_right = FiniteDimensionalEJAOperator(self,J2,P2)
-# return (pi_left, pi_right)
-
-# def inclusions(self):
-# r"""
-# Return the pair of inclusion maps from our factors into us.
-
-# SETUP::
-
-# sage: from mjo.eja.eja_algebra import (random_eja,
-# ....: JordanSpinEJA,
-# ....: RealSymmetricEJA,
-# ....: DirectSumEJA)
-
-# EXAMPLES::
-
-# sage: J1 = JordanSpinEJA(3)
-# sage: J2 = RealSymmetricEJA(2)
-# sage: J = DirectSumEJA(J1,J2)
-# sage: (iota_left, iota_right) = J.inclusions()
-# sage: iota_left(J1.zero()) == J.zero()
-# True
-# sage: iota_right(J2.zero()) == J.zero()
-# True
-# sage: J1.one().to_vector()
-# (1, 0, 0)
-# sage: iota_left(J1.one()).to_vector()
-# (1, 0, 0, 0, 0, 0)
-# sage: J2.one().to_vector()
-# (1, 0, 1)
-# sage: iota_right(J2.one()).to_vector()
-# (0, 0, 0, 1, 0, 1)
-# sage: J.one().to_vector()
-# (1, 0, 0, 1, 0, 1)
-
-# TESTS:
-
-# Composing a projection with the corresponding inclusion should
-# produce the identity map, and mismatching them should produce
-# the zero map::
-
-# sage: set_random_seed()
-# sage: J1 = random_eja()
-# sage: J2 = random_eja()
-# sage: J = DirectSumEJA(J1,J2)
-# sage: (iota_left, iota_right) = J.inclusions()
-# sage: (pi_left, pi_right) = J.projections()
-# sage: pi_left*iota_left == J1.one().operator()
-# True
-# sage: pi_right*iota_right == J2.one().operator()
-# True
-# sage: (pi_left*iota_right).is_zero()
-# True
-# sage: (pi_right*iota_left).is_zero()
-# True
-
-# """
-# (J1,J2) = self.factors()
-# m = J1.dimension()
-# n = J2.dimension()
-# V_basis = self.vector_space().basis()
-# # Need to specify the dimensions explicitly so that we don't
-# # wind up with a zero-by-zero matrix when we want e.g. a
-# # two-by-zero matrix (important for composing things).
-# I1 = matrix.column(self.base_ring(), m, m+n, V_basis[:m])
-# I2 = matrix.column(self.base_ring(), n, m+n, V_basis[m:])
-# iota_left = FiniteDimensionalEJAOperator(J1,self,I1)
-# iota_right = FiniteDimensionalEJAOperator(J2,self,I2)
-# return (iota_left, iota_right)
-
-# def inner_product(self, x, y):
-# r"""
-# The standard Cartesian inner-product.
-
-# We project ``x`` and ``y`` onto our factors, and add up the
-# inner-products from the subalgebras.
-
-# SETUP::
-
-
-# sage: from mjo.eja.eja_algebra import (HadamardEJA,
-# ....: QuaternionHermitianEJA,
-# ....: DirectSumEJA)
-
-# EXAMPLE::
-
-# sage: J1 = HadamardEJA(3,field=QQ)
-# sage: J2 = QuaternionHermitianEJA(2,field=QQ,orthonormalize=False)
-# sage: J = DirectSumEJA(J1,J2)
-# sage: x1 = J1.one()
-# sage: x2 = x1
-# sage: y1 = J2.one()
-# sage: y2 = y1
-# sage: x1.inner_product(x2)
-# 3
-# sage: y1.inner_product(y2)
-# 2
-# sage: J.one().inner_product(J.one())
-# 5
-
-# """
-# (pi_left, pi_right) = self.projections()
-# x1 = pi_left(x)
-# x2 = pi_right(x)
-# y1 = pi_left(y)
-# y2 = pi_right(y)
-
-# return (x1.inner_product(y1) + x2.inner_product(y2))
-
+FiniteDimensionalEJA.CartesianProduct = CartesianProductEJA
random_eja = ConcreteEJA.random_instance