-Trace inner product tests:
+1. Add CartesianProductEJA.
- TESTS:
+2. Check the axioms in the constructor when check != False?
- The trace inner product is commutative::
+3. Add references and start citing them.
- sage: set_random_seed()
- sage: J = random_eja()
- sage: x = J.random_element(); y = J.random_element()
- sage: x.trace_inner_product(y) == y.trace_inner_product(x)
- True
+4. Implement the octonion simple EJA.
- The trace inner product is bilinear::
+5. Factor out the unit-norm basis (and operator symmetry) tests once
+ all of the algebras pass.
- sage: set_random_seed()
- sage: J = random_eja()
- sage: x = J.random_element()
- sage: y = J.random_element()
- sage: z = J.random_element()
- sage: a = QQ.random_element();
- sage: actual = (a*(x+z)).trace_inner_product(y)
- sage: expected = a*x.trace_inner_product(y) + a*z.trace_inner_product(y)
- sage: actual == expected
- True
- sage: actual = x.trace_inner_product(a*(y+z))
- sage: expected = a*x.trace_inner_product(y) + a*x.trace_inner_product(z)
- sage: actual == expected
- True
+6. Refactor the current ungodly fast charpoly hack (relies on the
+ theory to ensure that the charpolys are equal.)
- The trace inner product is associative::
-
- sage: pass
-
- The trace inner product satisfies the compatibility
- condition in the definition of a Euclidean Jordan algebra:
-
- sage: set_random_seed()
- sage: J = random_eja()
- sage: x = J.random_element()
- sage: y = J.random_element()
- sage: z = J.random_element()
- sage: (x*y).trace_inner_product(z) == y.trace_inner_product(x*z)
- True
-
\ No newline at end of file
+7. If we factor out a "matrix algebra" class, then it would make sense
+ to replace the custom embedding/unembedding functions with static
+ _real_embedding() and _real_unembedding() methods.