-1. Finish DirectSumEJA: add to_matrix(), random_instance(),
- one()... methods. Make it subclass RationalBasisEuclideanJordanAlgebra.
- This is not a general direct sum / cartesian product implementation,
- it's used only with the other rationalbasis algebras (to make non-
- simple EJAs out of the simple ones).
+1. Add references and start citing them.
-2. Add references and start citing them.
+2. Profile (and fix?) any remaining slow operations.
-3. Implement the octonion simple EJA.
+3. Every once in a long while, the test
-4. Pre-cache charpoly for some small algebras?
+ sage: set_random_seed()
+ sage: x = random_eja().random_element()
+ sage: x.is_invertible() == (x.det() != 0)
-RealSymmetricEJA(4):
+ in eja_element.py returns False. Example:
-sage: F = J.base_ring()
-sage: a0 = (1/4)*X[4]**2*X[6]**2 - (1/2)*X[2]*X[5]*X[6]**2 - (1/2)*X[3]*X[4]*X[6]*X[7] + (F(2).sqrt()/2)*X[1]*X[5]*X[6]*X[7] + (1/4)*X[3]**2*X[7]**2 - (1/2)*X[0]*X[5]*X[7]**2 + (F(2).sqrt()/2)*X[2]*X[3]*X[6]*X[8] - (1/2)*X[1]*X[4]*X[6*X[8] - (1/2)*X[1]*X[3]*X[7]*X[8] + (F(2).sqrt()/2)*X[0]*X[4]*X[7]*X[8] + (1/4)*X[1]**2*X[8]**2 - (1/2)*X[0]*X[2]*X[8]**2 - (1/2)*X[2]*X[3]**2*X[9] + (F(2).sqrt()/2)*X[1]*X[3]*X[4]*X[9] - (1/2)*X[0]*X[4]**2*X[9] - (1/2)*X[1]**2*X[5]*X[9] + X[0]*X[2]*X[5]*X[9]
+ sage: J1 = ComplexHermitianEJA(2)
+ sage: J2 = TrivialEJA()
+ sage: J = cartesian_product([J1,J2])
+ sage: x = J.from_vector(vector(QQ, [-1, -1/2, -1/2, -1/2]))
+ sage: x.is_invertible()
+ True
+ sage: x.det()
+ 0
-5. Compute the scalar in the general natural_inner_product() for
- matrices, so no overrides are necessary.
-
-6. The main EJA element constructor is happy to convert between
- e.g. HadamardEJA(3) and JordanSpinEJA(3).
-
-7. Figure out if CombinatorialFreeModule's use of IndexedGenerators
- can be used to replace the matrix_basis().
-
-8. Move the "field" argument to a keyword after basis, jp, and ip.
-
-9. Add back the check_field=False and check_axioms=False parameters
- for the EJAs we've constructed ourselves. We can probably pass
- the value of "check_axioms" to <whatever>.span_of_basis() to skip
- the linear-independence check.
+4. When we take a Cartesian product involving a trivial algebra, we
+ could easily cache the identity and charpoly coefficients using
+ the nontrivial factor. On the other hand, it's nice that we can
+ test out some alternate code paths...