1. Add CartesianProductEJA.
-2. Check the axioms in the constructor when check != False?
+2. Add references and start citing them.
-3. Add references and start citing them.
+3. Implement the octonion simple EJA.
-4. Implement the octonion simple EJA.
-
-5. Factor out the unit-norm basis (and operator symmetry) tests once
+4. Factor out the unit-norm basis (and operator symmetry) tests once
all of the algebras pass.
-6. Refactor the current ungodly fast charpoly hack (relies on the
- theory to ensure that the charpolys are equal.)
+5. Override inner_product(), _max_test_case_size(), et cetera in
+ DirectSumEJA.
+
+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.
-7. Implement random_instance() for the main EJA class.
+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.
-8. Implement random_instance() for the subalgebra class.
+ This may require supporting "basis" as a list of basis vectors
+ (as opposed to superalgebra elements) in the subalgebra constructor.