from sage.matrix.constructor import matrix
-from mjo.eja.eja_algebra import FiniteDimensionalEuclideanJordanAlgebra
-from mjo.eja.eja_element import FiniteDimensionalEuclideanJordanAlgebraElement
+from mjo.eja.eja_algebra import FiniteDimensionalEJA
+from mjo.eja.eja_element import FiniteDimensionalEJAElement
-
-class FiniteDimensionalEuclideanJordanElementSubalgebraElement(FiniteDimensionalEuclideanJordanAlgebraElement):
+class FiniteDimensionalEJASubalgebraElement(FiniteDimensionalEJAElement):
"""
SETUP::
TESTS::
- The natural representation of an element in the subalgebra is
- the same as its natural representation in the superalgebra::
+ The matrix representation of an element in the subalgebra is
+ the same as its matrix representation in the superalgebra::
sage: set_random_seed()
- sage: A = random_eja().random_element().subalgebra_generated_by()
+ sage: x = random_eja(field=QQ,orthonormalize=False).random_element()
+ sage: A = x.subalgebra_generated_by(orthonormalize=False)
sage: y = A.random_element()
- sage: actual = y.natural_representation()
- sage: expected = y.superalgebra_element().natural_representation()
+ sage: actual = y.to_matrix()
+ sage: expected = y.superalgebra_element().to_matrix()
sage: actual == expected
True
+ The left-multiplication-by operator for elements in the subalgebra
+ works like it does in the superalgebra, even if we orthonormalize
+ our basis::
+
+ sage: set_random_seed()
+ sage: x = random_eja(field=AA).random_element()
+ sage: A = x.subalgebra_generated_by(orthonormalize=True)
+ sage: y = A.random_element()
+ sage: y.operator()(A.one()) == y
+ True
+
"""
def superalgebra_element(self):
sage: x = sum(J.gens())
sage: x
e0 + e1 + e2 + e3 + e4 + e5
- sage: A = x.subalgebra_generated_by()
+ sage: A = x.subalgebra_generated_by(orthonormalize=False)
sage: A(x)
f1
sage: A(x).superalgebra_element()
e0 + e1 + e2 + e3 + e4 + e5
+ sage: y = sum(A.gens())
+ sage: y
+ f0 + f1
+ sage: B = y.subalgebra_generated_by(orthonormalize=False)
+ sage: B(y)
+ g1
+ sage: B(y).superalgebra_element()
+ f0 + f1
TESTS:
sage: y = A.random_element()
sage: A(y.superalgebra_element()) == y
True
+ sage: B = y.subalgebra_generated_by()
+ sage: B(y).superalgebra_element() == y
+ True
"""
- return self.parent().superalgebra().linear_combination(
- zip(self.parent()._superalgebra_basis, self.to_vector()) )
+ return self.parent().superalgebra()(self.to_matrix())
-class FiniteDimensionalEuclideanJordanElementSubalgebra(FiniteDimensionalEuclideanJordanAlgebra):
+class FiniteDimensionalEJASubalgebra(FiniteDimensionalEJA):
"""
- The subalgebra of an EJA generated by a single element.
+ A subalgebra of an EJA with a given basis.
SETUP::
sage: from mjo.eja.eja_algebra import (ComplexHermitianEJA,
- ....: JordanSpinEJA)
+ ....: JordanSpinEJA,
+ ....: RealSymmetricEJA)
+ sage: from mjo.eja.eja_subalgebra import FiniteDimensionalEJASubalgebra
+
+ EXAMPLES:
+
+ The following Peirce subalgebras of the 2-by-2 real symmetric
+ matrices do not contain the superalgebra's identity element::
+
+ sage: J = RealSymmetricEJA(2)
+ sage: E11 = matrix(AA, [ [1,0],
+ ....: [0,0] ])
+ sage: E22 = matrix(AA, [ [0,0],
+ ....: [0,1] ])
+ sage: K1 = FiniteDimensionalEJASubalgebra(J, (J(E11),))
+ sage: K1.one().to_matrix()
+ [1 0]
+ [0 0]
+ sage: K2 = FiniteDimensionalEJASubalgebra(J, (J(E22),))
+ sage: K2.one().to_matrix()
+ [0 0]
+ [0 1]
TESTS:
1
"""
- def __init__(self, elt):
- self._superalgebra = elt.parent()
- category = self._superalgebra.category().Associative()
+ def __init__(self, superalgebra, basis, **kwargs):
+ self._superalgebra = superalgebra
V = self._superalgebra.vector_space()
field = self._superalgebra.base_ring()
except ValueError:
prefix = prefixen[0]
- if elt.is_zero():
- # Short circuit because 0^0 == 1 is going to make us
- # think we have a one-dimensional algebra otherwise.
- natural_basis = tuple()
- mult_table = tuple()
- rank = 0
- self._vector_space = V.zero_subspace()
- self._superalgebra_basis = []
- fdeja = super(FiniteDimensionalEuclideanJordanElementSubalgebra,
- self)
- return fdeja.__init__(field,
- mult_table,
- rank,
- prefix=prefix,
- category=category,
- natural_basis=natural_basis)
-
-
- # First compute the vector subspace spanned by the powers of
- # the given element.
- superalgebra_basis = [self._superalgebra.one()]
- # If our superalgebra is a subalgebra of something else, then
- # superalgebra.one().to_vector() won't have the right
- # coordinates unless we use V.from_vector() below.
- basis_vectors = [V.from_vector(self._superalgebra.one().to_vector())]
- W = V.span_of_basis(basis_vectors)
- for exponent in range(1, V.dimension()):
- new_power = elt**exponent
- basis_vectors.append( V.from_vector(new_power.to_vector()) )
- try:
- W = V.span_of_basis(basis_vectors)
- superalgebra_basis.append( new_power )
- except ValueError:
- # Vectors weren't independent; bail and keep the
- # last subspace that worked.
- break
-
- # Make the basis hashable for UniqueRepresentation.
- superalgebra_basis = tuple(superalgebra_basis)
-
- # Now figure out the entries of the right-multiplication
- # matrix for the successive basis elements b0, b1,... of
- # that subspace.
- n = len(superalgebra_basis)
- mult_table = [[W.zero() for i in range(n)] for j in range(n)]
- for i in range(n):
- for j in range(n):
- product = superalgebra_basis[i]*superalgebra_basis[j]
- # product.to_vector() might live in a vector subspace
- # if our parent algebra is already a subalgebra. We
- # use V.from_vector() to make it "the right size" in
- # that case.
- product_vector = V.from_vector(product.to_vector())
- mult_table[i][j] = W.coordinate_vector(product_vector)
-
- # The rank is the highest possible degree of a minimal
- # polynomial, and is bounded above by the dimension. We know
- # in this case that there's an element whose minimal
- # polynomial has the same degree as the space's dimension
- # (remember how we constructed the space?), so that must be
- # its rank too.
- rank = W.dimension()
-
- natural_basis = tuple( b.natural_representation()
- for b in superalgebra_basis )
-
-
- self._vector_space = W
- self._superalgebra_basis = superalgebra_basis
-
-
- fdeja = super(FiniteDimensionalEuclideanJordanElementSubalgebra, self)
- return fdeja.__init__(field,
- mult_table,
- rank,
- prefix=prefix,
- category=category,
- natural_basis=natural_basis)
-
-
- def _a_regular_element(self):
- """
- Override the superalgebra method to return the one
- regular element that is sure to exist in this
- subalgebra, namely the element that generated it.
-
- SETUP::
+ # The superalgebra constructor expects these to be in original matrix
+ # form, not algebra-element form.
+ matrix_basis = tuple( b.to_matrix() for b in basis )
+ def jordan_product(x,y):
+ return (self._superalgebra(x)*self._superalgebra(y)).to_matrix()
- sage: from mjo.eja.eja_algebra import random_eja
+ def inner_product(x,y):
+ return self._superalgebra(x).inner_product(self._superalgebra(y))
- TESTS::
+ super().__init__(matrix_basis,
+ jordan_product,
+ inner_product,
+ prefix=prefix,
+ **kwargs)
- sage: set_random_seed()
- sage: J = random_eja().random_element().subalgebra_generated_by()
- sage: J._a_regular_element().is_regular()
- True
-
- """
- if self.dimension() == 0:
- return self.zero()
- else:
- return self.monomial(1)
def _element_constructor_(self, elt):
SETUP::
sage: from mjo.eja.eja_algebra import RealSymmetricEJA
- sage: from mjo.eja.eja_subalgebra import FiniteDimensionalEuclideanJordanElementSubalgebra
+ sage: from mjo.eja.eja_subalgebra import FiniteDimensionalEJASubalgebra
EXAMPLES::
sage: J = RealSymmetricEJA(3)
- sage: x = sum( i*J.gens()[i] for i in range(6) )
- sage: K = FiniteDimensionalEuclideanJordanElementSubalgebra(x)
- sage: [ K(x^k) for k in range(J.rank()) ]
- [f0, f1, f2]
+ sage: X = matrix(AA, [ [0,0,1],
+ ....: [0,1,0],
+ ....: [1,0,0] ])
+ sage: x = J(X)
+ sage: basis = ( x, x^2 ) # x^2 is the identity matrix
+ sage: K = FiniteDimensionalEJASubalgebra(J, basis, orthonormalize=False)
+ sage: K(J.one())
+ f1
+ sage: K(J.one() + x)
+ f0 + f1
::
"""
- if elt == 0:
- # Just as in the superalgebra class, we need to hack
- # this special case to ensure that random_element() can
- # coerce a ring zero into the algebra.
- return self.zero()
-
if elt in self.superalgebra():
- coords = self.vector_space().coordinate_vector(elt.to_vector())
- return self.from_vector(coords)
-
-
- def one_basis(self):
- """
- Return the basis-element-index of this algebra's unit element.
- """
- return 0
-
-
- def one(self):
- """
- Return the multiplicative identity element of this algebra.
-
- The superclass method computes the identity element, which is
- beyond overkill in this case: the algebra identity should be our
- first basis element. We implement this via :meth:`one_basis`
- because that method can optionally be used by other parts of the
- category framework.
-
- SETUP::
-
- sage: from mjo.eja.eja_algebra import (RealCartesianProductEJA,
- ....: random_eja)
-
- EXAMPLES::
-
- sage: J = RealCartesianProductEJA(5)
- sage: J.one()
- e0 + e1 + e2 + e3 + e4
- sage: x = sum(J.gens())
- sage: A = x.subalgebra_generated_by()
- sage: A.one()
- f0
- sage: A.one().superalgebra_element()
- e0 + e1 + e2 + e3 + e4
-
- TESTS:
-
- The identity element acts like the identity::
-
- sage: set_random_seed()
- sage: J = random_eja().random_element().subalgebra_generated_by()
- sage: x = J.random_element()
- sage: J.one()*x == x and x*J.one() == x
- True
-
- The matrix of the unit element's operator is the identity::
-
- sage: set_random_seed()
- sage: J = random_eja().random_element().subalgebra_generated_by()
- sage: actual = J.one().operator().matrix()
- sage: expected = matrix.identity(J.base_ring(), J.dimension())
- sage: actual == expected
- True
- """
- if self.dimension() == 0:
- return self.zero()
+ return super()._element_constructor_(elt.to_matrix())
else:
- return self.monomial(self.one_basis())
+ return super()._element_constructor_(elt)
- def natural_basis_space(self):
+
+ def matrix_space(self):
"""
- Return the natural basis space of this algebra, which is identical
- to that of its superalgebra.
+ Return the matrix space of this algebra, which is identical to
+ that of its superalgebra.
- This is correct "by definition," and avoids a mismatch when the
- subalgebra is trivial (with no natural basis to infer anything
- from) and the parent is not.
+ This is correct "by definition," and avoids a mismatch when
+ the subalgebra is trivial (with no matrix basis elements to
+ infer anything from) and the parent is not.
"""
- return self.superalgebra().natural_basis_space()
+ return self.superalgebra().matrix_space()
def superalgebra(self):
return self._superalgebra
- def vector_space(self):
- """
- SETUP::
-
- sage: from mjo.eja.eja_algebra import RealSymmetricEJA
- sage: from mjo.eja.eja_subalgebra import FiniteDimensionalEuclideanJordanElementSubalgebra
-
- EXAMPLES::
-
- sage: J = RealSymmetricEJA(3)
- sage: x = J.monomial(0) + 2*J.monomial(2) + 5*J.monomial(5)
- sage: K = FiniteDimensionalEuclideanJordanElementSubalgebra(x)
- sage: K.vector_space()
- Vector space of degree 6 and dimension 3 over...
- User basis matrix:
- [ 1 0 1 0 0 1]
- [ 1 0 2 0 0 5]
- [ 1 0 4 0 0 25]
- sage: (x^0).to_vector()
- (1, 0, 1, 0, 0, 1)
- sage: (x^1).to_vector()
- (1, 0, 2, 0, 0, 5)
- sage: (x^2).to_vector()
- (1, 0, 4, 0, 0, 25)
-
- """
- return self._vector_space
-
-
- Element = FiniteDimensionalEuclideanJordanElementSubalgebraElement
+ Element = FiniteDimensionalEJASubalgebraElement