eja: update the TODO with a bug example.

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

diff --git a/mjo/eja/TODO b/mjo/eja/TODO
index 38aa85bfe7a5c5ecc4b97c880c05533e42b5ad69..1def3d2e9fd8cf381ae743344ce670a13f226438 100644 (file)
--- a/mjo/eja/TODO
+++ b/mjo/eja/TODO
@@ -1,22 +1,20 @@
-A. Add tests for orthogonality in the Peirce decomposition.
+1. Add references and start citing them.
 
-B. Add support for a symmetric positive-definite bilinear form in
-   the JordanSpinEJA.
+2. Profile (and fix?) any remaining slow operations.
 
-1. Add CartesianProductEJA.
+3. Every once in a long while, the test
 
-2. Check the axioms in the constructor when check != False?
+       sage: set_random_seed()
+       sage: x = random_eja().random_element()
+       sage: x.is_invertible() == (x.det() != 0)
 
-3. Add references and start citing them.
+   in eja_element.py returns False. Example:
 
-4. Implement the octonion simple EJA.
-
-5. Factor out the unit-norm basis (and operator symmetry) tests once
-   all of the algebras pass.
-
-6. Can we make the minimal and characteristic polynomial tests work
-   for trivial algebras, too? Then we wouldn't need the "nontrivial"
-   argument to random_eja().
-
-7. Solve the charpoly system with A_of_x.solve_right(x_powers[r])
-   rather than dumbass Cramer's rule.
+       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