An element of a Euclidean Jordan algebra.
"""
+ def __init__(self, A, elt=None):
+ """
+ EXAMPLES:
+
+ The identity in `S^n` is converted to the identity in the EJA::
+
+ sage: J = RealSymmetricSimpleEJA(3)
+ sage: I = identity_matrix(QQ,3)
+ sage: J(I) == J.one()
+ True
+
+ This skew-symmetric matrix can't be represented in the EJA::
+
+ sage: J = RealSymmetricSimpleEJA(3)
+ sage: A = matrix(QQ,3, lambda i,j: i-j)
+ sage: J(A)
+ Traceback (most recent call last):
+ ...
+ ArithmeticError: vector is not in free module
+
+ """
+ # Goal: if we're given a matrix, and if it lives in our
+ # parent algebra's "natural ambient space," convert it
+ # into an algebra element.
+ #
+ # The catch is, we make a recursive call after converting
+ # the given matrix into a vector that lives in the algebra.
+ # This we need to try the parent class initializer first,
+ # to avoid recursing forever if we're given something that
+ # already fits into the algebra, but also happens to live
+ # in the parent's "natural ambient space" (this happens with
+ # vectors in R^n).
+ try:
+ FiniteDimensionalAlgebraElement.__init__(self, A, elt)
+ except ValueError:
+ natural_basis = A.natural_basis()
+ if elt in natural_basis[0].matrix_space():
+ # Thanks for nothing! Matrix spaces aren't vector
+ # spaces in Sage, so we have to figure out its
+ # natural-basis coordinates ourselves.
+ V = VectorSpace(elt.base_ring(), elt.nrows()**2)
+ W = V.span( _mat2vec(s) for s in natural_basis )
+ coords = W.coordinates(_mat2vec(elt))
+ FiniteDimensionalAlgebraElement.__init__(self, A, coords)
+
def __pow__(self, n):
"""
Return ``self`` raised to the power ``n``.
return tuple(S)
+def _mat2vec(m):
+ return vector(m.base_ring(), m.list())
+
+def _vec2mat(v):
+ return matrix(v.base_ring(), sqrt(v.degree()), v.list())
+
def _multiplication_table_from_matrix_basis(basis):
"""
At least three of the five simple Euclidean Jordan algebras have the
field = basis[0].base_ring()
dimension = basis[0].nrows()
- def mat2vec(m):
- return vector(field, m.list())
-
- def vec2mat(v):
- return matrix(field, dimension, v.list())
-
V = VectorSpace(field, dimension**2)
- W = V.span( mat2vec(s) for s in basis )
+ W = V.span( _mat2vec(s) for s in basis )
# Taking the span above reorders our basis (thanks, jerk!) so we
# need to put our "matrix basis" in the same order as the
# (reordered) vector basis.
- S = tuple( vec2mat(b) for b in W.basis() )
+ S = tuple( _vec2mat(b) for b in W.basis() )
Qs = []
for s in S:
# why we're computing rows here and not columns.
Q_rows = []
for t in S:
- this_row = mat2vec((s*t + t*s)/2)
+ this_row = _mat2vec((s*t + t*s)/2)
Q_rows.append(W.coordinates(this_row))
Q = matrix(field, W.dimension(), Q_rows)
Qs.append(Q)