eja: fix cartesian products of cartesian product EJAs.

[sage.d.git] / mjo / eja / TODO

diff --git a/mjo/eja/TODO b/mjo/eja/TODO
index ffa4f7c4ca0ccf3e2a72b6bfd996e9c30ec29fde..93aa9fb42e6ec6cdba6963db8dacfddd116ba762 100644 (file)
--- a/mjo/eja/TODO
+++ b/mjo/eja/TODO
@@ -1,33 +1,22 @@
-1. Add CartesianProductEJA.
+1. Finish CartesianProductEJA: add to_matrix(), random_instance(),...
+   methods. I guess we should create a separate class hierarchy for
+   Cartesian products of RationalBasisEJA? That way we get fast
+   charpoly and random_instance() defined...
 
 2. Add references and start citing them.
 
 3. Implement the octonion simple EJA.
 
-4. Factor out the unit-norm basis (and operator symmetry) tests once
-   all of the algebras pass.
+4. Pre-cache charpoly for some small algebras?
 
-5. Override random_instance(), one(), et cetera in DirectSumEJA.
+RealSymmetricEJA(4):
 
-6. Switch to QQ in *all* algebras for _charpoly_coefficients().
-   This only works when we know that the basis can be rationalized...
-   which is the case at least for the concrete EJAs we provide,
-   but not in general.
+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]
 
-7. Pass already_echelonized (default: False) and echelon_basis
-   (default: None) into the subalgebra constructor. The value of
-   already_echelonized can be passed to V.span_of_basis() to save
-   some time, and usinf e.g. FreeModule_submodule_with_basis_field
-   we may somehow be able to pass the echelon basis straight in to
-   save time.
+5. The main EJA element constructor is happy to convert between
+   e.g. HadamardEJA(3) and JordanSpinEJA(3).
 
-   This may require supporting "basis" as a list of basis vectors
-   (as opposed to superalgebra elements) in the subalgebra constructor.
-
-8. Implement random_instance() for general algebras as random_eja().
-   Copy/paste the "general" construction into the other classes that
-   can use it. The general construction can be something like "call
-   random_instance() on something that inherits me and return the
-   result."
-
-9. Use charpoly for inverse stuff if it's cached.
+6. Profile the construction of "large" matrix algebras (like the
+   15-dimensional QuaternionHermitianAlgebra(3)) to find out why
+   they're so slow.