]> gitweb.michael.orlitzky.com - sage.d.git/blobdiff - mjo/matrix_algebra.py
Reorganize the Hurwitz (matrix) algebra stuff.
[sage.d.git] / mjo / matrix_algebra.py
index 668a1c44d839e6b5704aa72acb90970136eca571..94a8410f9929986a8737f9bbb846c04490751fe5 100644 (file)
@@ -37,7 +37,7 @@ class MatrixAlgebraElement(IndexedFreeModuleElement):
             l[i][j] += v*e
         return l
 
-    def __repr__(self):
+    def _repr_(self):
         r"""
         Display this matrix as a table.
 
@@ -50,11 +50,11 @@ class MatrixAlgebraElement(IndexedFreeModuleElement):
 
         EXAMPLES::
 
-            sage: MatrixAlgebra(ZZ,ZZ,2).one()
+            sage: MatrixAlgebra(ZZ,ZZ,2).zero()
             +---+---+
-            | 1 | 0 |
+            | 0 | 0 |
             +---+---+
-            | 0 | 1 |
+            | 0 | 0 |
             +---+---+
 
         """
@@ -71,8 +71,9 @@ class MatrixAlgebraElement(IndexedFreeModuleElement):
 
         EXAMPLES::
 
-            sage: MatrixAlgebra(ZZ,ZZ,2).one().list()
-            [1, 0, 0, 1]
+            sage: A = MatrixAlgebra(ZZ,ZZ,2)
+            sage: A([[1,2],[3,4]]).list()
+            [1, 2, 3, 4]
 
         """
         return sum( self.rows(), [] )
@@ -87,15 +88,15 @@ class MatrixAlgebraElement(IndexedFreeModuleElement):
 
         EXAMPLES::
 
-            sage: M = MatrixAlgebra(ZZ,ZZ,2).one()
+            sage: M = MatrixAlgebra(ZZ,ZZ,2)([[1,2],[3,4]])
             sage: M[0,0]
             1
             sage: M[0,1]
-            0
+            2
             sage: M[1,0]
-            0
+            3
             sage: M[1,1]
-            1
+            4
 
         """
         i,j = indices
@@ -117,7 +118,9 @@ class MatrixAlgebraElement(IndexedFreeModuleElement):
             sage: entries = MatrixSpace(ZZ,2)
             sage: scalars = ZZ
             sage: M = MatrixAlgebra(entries, scalars, 2)
-            sage: M.one().trace()
+            sage: I = entries.one()
+            sage: Z = entries.zero()
+            sage: M([[I,Z],[Z,I]]).trace()
             [2 0]
             [0 2]
 
@@ -143,25 +146,6 @@ class MatrixAlgebraElement(IndexedFreeModuleElement):
         """
         return self.parent()
 
-    # onlt valid in HurwitzMatrixAlgebra subclass
-    # def is_hermitian(self):
-    #     r"""
-
-    #     SETUP::
-
-    #         sage: from mjo.octonions import OctonionMatrixAlgebra
-
-    #     EXAMPLES::
-
-    #         sage: MS = OctonionMatrixAlgebra(3)
-    #         sage: MS.one().is_hermitian()
-    #         True
-
-    #     """
-    #     return all( self[i,j] == self[j,i].conjugate()
-    #                 for i in range(self.nrows())
-    #                 for j in range(self.ncols()) )
-
 
 class MatrixAlgebra(CombinatorialFreeModule):
     r"""
@@ -174,6 +158,22 @@ class MatrixAlgebra(CombinatorialFreeModule):
     the entries come from a commutative and associative ring. This
     is problematic in several interesting matrix algebras, like those
     where the entries are quaternions or octonions.
+
+    SETUP::
+
+        sage: from mjo.matrix_algebra import MatrixAlgebra
+
+    EXAMPLES::
+
+    The existence of a unit element is determined dynamically::
+
+        sage: MatrixAlgebra(ZZ,ZZ,2).one()
+        +---+---+
+        | 1 | 0 |
+        +---+---+
+        | 0 | 1 |
+        +---+---+
+
     """
     Element = MatrixAlgebraElement
 
@@ -184,6 +184,11 @@ class MatrixAlgebra(CombinatorialFreeModule):
 
         if "Unital" in entry_algebra.category().axioms():
             category = category.Unital()
+            entry_one = entry_algebra.one()
+            self.one = lambda: sum( (self.monomial((i,i,entry_one))
+                                     for i in range(self.nrows()) ),
+                                    self.zero() )
+
         if "Associative" in entry_algebra.category().axioms():
             category = category.Associative()
 
@@ -227,24 +232,40 @@ class MatrixAlgebra(CombinatorialFreeModule):
     ncols = nrows
 
     def product_on_basis(self, mon1, mon2):
-        (i,j,e1) = mon1
-        (k,l,e2) = mon2
-        if j == k:
-            return self.monomial((i,l,e1*e2))
-        else:
-            return self.zero()
-
-    # TODO: only makes sense if I'm unital.
-    def one(self):
         r"""
+
         SETUP::
 
+            sage: from mjo.hurwitz import Octonions
             sage: from mjo.matrix_algebra import MatrixAlgebra
 
+        TESTS::
+
+            sage: O = Octonions(QQ)
+            sage: e = O.gens()
+            sage: e[2]*e[1]
+            -e3
+            sage: A = MatrixAlgebra(O,QQ,2)
+            sage: A.product_on_basis( (0,0,e[2]), (0,0,e[1]) )
+            +-----+---+
+            | -e3 | 0 |
+            +-----+---+
+            | 0   | 0 |
+            +-----+---+
+
         """
-        return sum( (self.monomial((i,i,self.entry_algebra().one()))
-                     for i in range(self.nrows()) ),
-                    self.zero() )
+        (i,j,e1) = mon1
+        (k,l,e2) = mon2
+        if j == k:
+            # If e1*e2 has a negative sign in front of it,
+            # then (i,l,e1*e2) won't be a monomial!
+            p = e1*e2
+            if (i,l,p) in self.indices():
+                return self.monomial((i,l,p))
+            else:
+                return -self.monomial((i,l,-p))
+        else:
+            return self.zero()
 
     def from_list(self, entries):
         r"""
@@ -255,6 +276,16 @@ class MatrixAlgebra(CombinatorialFreeModule):
 
             sage: from mjo.matrix_algebra import MatrixAlgebra
 
+        EXAMPLES::
+
+            sage: A = MatrixAlgebra(QQbar, ZZ, 2)
+            sage: A.from_list([[0,I],[-I,0]])
+            +----+---+
+            | 0  | I |
+            +----+---+
+            | -I | 0 |
+            +----+---+
+
         """
         nrows = len(entries)
         ncols = 0
@@ -265,13 +296,29 @@ class MatrixAlgebra(CombinatorialFreeModule):
             raise ValueError("list must be square")
 
         def convert(e_ij):
-            # We have to pass through vectors to convert from the
-            # given entry algebra to ours. Otherwise we can fail
-            # to convert an element of (for example) Octonions(QQ)
-            # to Octonions(AA).
-            return self.entry_algebra().from_vector(e_ij.to_vector())
+            if e_ij in self.entry_algebra():
+                # Don't re-create an element if it already lives where
+                # it should!
+                return e_ij
+
+            try:
+                # This branch works with e.g. QQbar, where no
+                # to/from_vector() methods are available.
+                return self.entry_algebra()(e_ij)
+            except TypeError:
+                # We have to pass through vectors to convert from the
+                # given entry algebra to ours. Otherwise we can fail to
+                # convert an element of (for example) Octonions(QQ) to
+                # Octonions(AA).
+                return self.entry_algebra().from_vector(e_ij.to_vector())
 
         return sum( (self.monomial( (i,j, convert(entries[i][j])) )
                      for i in range(nrows)
                      for j in range(ncols) ),
                     self.zero() )
+
+    def _element_constructor_(self, elt):
+        if elt in self:
+            return self
+        else:
+            return self.from_list(elt)