From: Michael Orlitzky Date: Sun, 4 Aug 2019 18:34:34 +0000 (-0400) Subject: eja: move away from using matrices as our "multiplication table." X-Git-Url: https://gitweb.michael.orlitzky.com/?a=commitdiff_plain;h=c8af8b316ce0f238fea8a994d24776f74dc1e271;p=sage.d.git eja: move away from using matrices as our "multiplication table." Instead of passing around a bunch of matrices that can be applied to vectors to figure out how multiplication works, it's simpler (and probably faster) to use a two-dimensional array whose (i,j)th entry contains the answer to "how do we multiply basis elements i and j?" When we feed these arrays into the EJA constructor, they must contain vectors: there's no algebra yet, so it's not like we have any algebra elements to pass in. However, in the long run, it's much more convenient to have the multiplication table *stored* in terms of algebra elements; that way we don't have to convert back and forth every time we want to multiply two algebra elements. The algebra constructor now performs this conversion and stores a table containing algebra elements. This makes product_on_basis() a simple table lookup. --- diff --git a/mjo/eja/eja_algebra.py b/mjo/eja/eja_algebra.py index c768632..db14946 100644 --- a/mjo/eja/eja_algebra.py +++ b/mjo/eja/eja_algebra.py @@ -48,7 +48,7 @@ class FiniteDimensionalEuclideanJordanAlgebra(CombinatorialFreeModule): """ self._rank = rank self._natural_basis = natural_basis - self._multiplication_table = mult_table + if category is None: category = FiniteDimensionalAlgebrasWithBasis(field).Unital() fda = super(FiniteDimensionalEuclideanJordanAlgebra, self) @@ -58,6 +58,15 @@ class FiniteDimensionalEuclideanJordanAlgebra(CombinatorialFreeModule): category=category) self.print_options(bracket='') + # The multiplication table we're given is necessarily in terms + # of vectors, because we don't have an algebra yet for + # anything to be an element of. However, it's faster in the + # long run to have the multiplication table be in terms of + # algebra elements. We do this after calling the superclass + # constructor so that from_vector() knows what to do. + self._multiplication_table = [ map(lambda x: self.from_vector(x), ls) + for ls in mult_table ] + def _element_constructor_(self, elt): """ @@ -144,10 +153,7 @@ class FiniteDimensionalEuclideanJordanAlgebra(CombinatorialFreeModule): return fmt.format(self.dimension(), self.base_ring()) def product_on_basis(self, i, j): - ei = self.basis()[i] - ej = self.basis()[j] - Lei = self._multiplication_table[i] - return self.from_vector(Lei*ej.to_vector()) + return self._multiplication_table[i][j] def _a_regular_element(self): """ @@ -241,10 +247,11 @@ class FiniteDimensionalEuclideanJordanAlgebra(CombinatorialFreeModule): # Construct a new algebra over a multivariate polynomial ring... names = tuple('X' + str(i) for i in range(1,n+1)) R = PolynomialRing(self.base_ring(), names) - J = FiniteDimensionalEuclideanJordanAlgebra( - R, - tuple(self._multiplication_table), - r) + # Hack around the fact that our multiplication table is in terms of + # algebra elements but the constructor wants it in terms of vectors. + vmt = [ tuple(map(lambda x: x.to_vector(), ls)) + for ls in self._multiplication_table ] + J = FiniteDimensionalEuclideanJordanAlgebra(R, tuple(vmt), r) idmat = matrix.identity(J.base_ring(), n) @@ -595,16 +602,12 @@ class RealCartesianProductEJA(FiniteDimensionalEuclideanJordanAlgebra): """ def __init__(self, n, field=QQ): - # The superclass constructor takes a list of matrices, the ith - # representing right multiplication by the ith basis element - # in the vector space. So if e_1 = (1,0,0), then right - # (Hadamard) multiplication of x by e_1 picks out the first - # component of x; and likewise for the ith basis element e_i. - Qs = [ matrix(field, n, n, lambda k,j: 1*(k == j == i)) - for i in xrange(n) ] + V = VectorSpace(field, n) + mult_table = [ [ V.basis()[i]*(i == j) for i in range(n) ] + for j in range(n) ] fdeja = super(RealCartesianProductEJA, self) - return fdeja.__init__(field, Qs, rank=n) + return fdeja.__init__(field, mult_table, rank=n) def inner_product(self, x, y): return _usual_ip(x,y) @@ -775,10 +778,7 @@ def _multiplication_table_from_matrix_basis(basis): multiplication on the right is matrix multiplication. Given a basis for the underlying matrix space, this function returns a multiplication table (obtained by looping through the basis - elements) for an algebra of those matrices. A reordered copy - of the basis is also returned to work around the fact that - the ``span()`` in this function will change the order of the basis - from what we think it is, to... something else. + elements) for an algebra of those matrices. """ # In S^2, for example, we nominally have four coordinates even # though the space is of dimension three only. The vector space V @@ -790,20 +790,14 @@ def _multiplication_table_from_matrix_basis(basis): V = VectorSpace(field, dimension**2) W = V.span_of_basis( _mat2vec(s) for s in basis ) + n = len(basis) + mult_table = [[W.zero() for i in range(n)] for j in range(n)] + for i in range(n): + for j in range(n): + mat_entry = (basis[i]*basis[j] + basis[j]*basis[i])/2 + mult_table[i][j] = W.coordinate_vector(_mat2vec(mat_entry)) - Qs = [] - for s in basis: - # Brute force the multiplication-by-s matrix by looping - # through all elements of the basis and doing the computation - # to find out what the corresponding row should be. - Q_cols = [] - for t in basis: - this_col = _mat2vec((s*t + t*s)/2) - Q_cols.append(W.coordinates(this_col)) - Q = matrix.column(field, W.dimension(), Q_cols) - Qs.append(Q) - - return Qs + return mult_table def _embed_complex_matrix(M): @@ -1262,24 +1256,27 @@ class JordanSpinEJA(FiniteDimensionalEuclideanJordanAlgebra): """ def __init__(self, n, field=QQ): - Qs = [] - id_matrix = matrix.identity(field, n) - for i in xrange(n): - ei = id_matrix.column(i) - Qi = matrix.zero(field, n) - Qi.set_row(0, ei) - Qi.set_column(0, ei) - Qi += matrix.diagonal(n, [ei[0]]*n) - # The addition of the diagonal matrix adds an extra ei[0] in the - # upper-left corner of the matrix. - Qi[0,0] = Qi[0,0] * ~field(2) - Qs.append(Qi) + V = VectorSpace(field, n) + mult_table = [[V.zero() for i in range(n)] for j in range(n)] + for i in range(n): + for j in range(n): + x = V.basis()[i] + y = V.basis()[j] + x0 = x[0] + xbar = x[1:] + y0 = y[0] + ybar = y[1:] + # z = x*y + z0 = x.inner_product(y) + zbar = y0*xbar + x0*ybar + z = V([z0] + zbar.list()) + mult_table[i][j] = z # The rank of the spin algebra is two, unless we're in a # one-dimensional ambient space (because the rank is bounded by # the ambient dimension). fdeja = super(JordanSpinEJA, self) - return fdeja.__init__(field, Qs, rank=min(n,2)) + return fdeja.__init__(field, mult_table, rank=min(n,2)) def inner_product(self, x, y): return _usual_ip(x,y) diff --git a/mjo/eja/eja_subalgebra.py b/mjo/eja/eja_subalgebra.py index 95534db..22fa870 100644 --- a/mjo/eja/eja_subalgebra.py +++ b/mjo/eja/eja_subalgebra.py @@ -99,25 +99,12 @@ class FiniteDimensionalEuclideanJordanElementSubalgebra(FiniteDimensionalEuclide # matrix for the successive basis elements b0, b1,... of # that subspace. field = superalgebra.base_ring() - mult_table = [] - for b_right in superalgebra_basis: - b_right_cols = [] - # The first column of the left-multiplication matrix by - # b1 is what we get if we apply that matrix to b1. The - # second column of the left-multiplication matrix by b1 - # is what we get when we apply that matrix to b2... - for b_left in superalgebra_basis: - # Multiply in the original EJA, but then get the - # coordinates from the subalgebra in terms of its - # basis. - this_col = W.coordinates((b_left*b_right).to_vector()) - b_right_cols.append(this_col) - b_right_matrix = matrix.column(field, b_right_cols) - mult_table.append(b_right_matrix) - - for m in mult_table: - m.set_immutable() - mult_table = tuple(mult_table) + n = len(superalgebra_basis) + mult_table = [[W.zero() for i in range(n)] for j in range(n)] + for i in range(n): + for j in range(n): + product = superalgebra_basis[i]*superalgebra_basis[j] + mult_table[i][j] = W.coordinate_vector(product.to_vector()) # TODO: We'll have to redo this and make it unique again... prefix = 'f'