X-Git-Url: http://gitweb.michael.orlitzky.com/?a=blobdiff_plain;f=mjo%2Feja%2FTODO;h=26ff1e9e7db77b22f3d749056121d094a08f2d8b;hb=8d91b5b5af605dabe11a024ab030f2fcb2828cde;hp=39daf2a796c0d9d21c21057ae0899dacf4fbed89;hpb=e5b0be0dcbe6cbce15e0b9974fcfb6626f4afda0;p=sage.d.git

diff --git a/mjo/eja/TODO b/mjo/eja/TODO
index 39daf2a..26ff1e9 100644
--- a/mjo/eja/TODO
+++ b/mjo/eja/TODO
@@ -11,32 +11,17 @@ 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
    15-dimensional QuaternionHermitianAlgebra(3)) to find out why
    they're so slow.
 
-4. Instead of storing a basis multiplication matrix, just make
-   product_on_basis() a cached method and manually cache its
-   entries. The cython cached method lookup should be faster than a
-   python-based matrix lookup anyway. NOTE: we should still be able
-   to recompute the table somehow. Is this worth it?
-
-5. What the ever-loving fuck is this shit?
+4. What the ever-loving fuck is this shit?
 
        sage: O = Octonions(QQ)
        sage: e0 = O.monomial(0)
        sage: e0*[[[[]]]]
        [[[[]]]]*e0
 
-6. Can we convert the complex/quaternion algebras to avoid real-
-   (un)embeddings? Quaternions would need their own
-   QuaternionMatrixAlgebra, since Sage matrices have to have entries
-   in a commutative ring.
-
-7. Every once in a long while, the test
+5. Every once in a long while, the test
 
        sage: set_random_seed()
        sage: x = random_eja().random_element()
        sage: x.is_invertible() == (x.det() != 0)
 
    in eja_element.py returns False.
-
-8. The definition of product_on_basis() and the element constructor
-   for MatrixAlgebra are totally wrong. There's no reason to expect
-   a product of monomials to again be plus/minus a monomial.