Edit detail for SandBox Sedenion Algebra is Frobenius In Just One Way revision 5 of 5

Sedenion Algebra is Frobenius in just one way!

Linear operators over a 16-dimensional vector space representing Sedenion Algebra

Ref:

• http://arxiv.org/abs/1103.5113

  -permuted Frobenius Algebras

  Zbigniew Oziewicz (UNAM), Gregory Peter Wene (UTSA)

• http://mat.uab.es/~kock/TQFT.html

  Frobenius algebras and 2D topological quantum field theories

  Joachim Kock

• http://en.wikipedia.org/wiki/Frobenius_algebra
• http://en.wikipedia.org/wiki/Sedenion

We need the Axiom LinearOperator library.

(1) -> )library CARTEN MONAL PROP LOP CALEY

   >> System error:
   The value
  15684
is not of type
  LIST

Use the following macros for convenient notation

-- summation
macro Σ(x,i,n)==reduce(+,[x for i in n])

-- subscript
macro sb == subscript

ℒ is the domain of 16-dimensional linear operators over the rational functions ℚ (Expression Integer), i.e. ratio of polynomials with integer coefficients.

dim:=16

(1)

macro ℂ == CaleyDickson

macro ℚ == Expression Integer

ℒ := LinearOperator(OVAR ['0,'1,'2,'3,'4,'5,'6,'7,'8,'9,'10,'11,'12,'13,'14,'15], ℚ)

   There are no library operations named LinearOperator 
      Use HyperDoc Browse or issue
                           )what op LinearOperator
      to learn if there is any operation containing " LinearOperator " 
      in its name.

   Cannot find a definition or applicable library operation named 
      LinearOperator with argument type(s) 
                                    Type
                                    Type

      Perhaps you should use "@" to indicate the required return type, 
      or "$" to specify which version of the function you need.

Now generate structure constants for Sedenion Algebra

The basis consists of the real and imaginary units. We use quaternion multiplication to form the "multiplication table" as a matrix. Then the structure constants can be obtained by dividing each matrix entry by the list of basis vectors.

Split-complex, co-quaternions, split-octonions and seneions can be specified by Caley-Dickson parameters

--q0:=sb('q,[0])
q0:=1  -- not split-complex

(2)

--q1:=sb('q,[1])
q1:=1  -- not co-quaternion

(3)

--q2:=sb('q,[2])
q2:=1  -- not split-octonion

(4)

--q3:=sb('q,[3])
q3:=1  -- not split-sedennion

(5)

QQ := ℂ(ℂ(ℂ(ℂ(ℚ,'i,q0),'j,q1),'k,q2),'l,q3);

   There are no library operations named CaleyDickson 
      Use HyperDoc Browse or issue
                            )what op CaleyDickson
      to learn if there is any operation containing " CaleyDickson " in
      its name.

   Cannot find a definition or applicable library operation named 
      CaleyDickson with argument type(s) 
                                    Type
                                 Variable(i)
                               PositiveInteger

      Perhaps you should use "@" to indicate the required return type, 
      or "$" to specify which version of the function you need.

Basis: Each B.i is a sedennion number

B:List QQ := map(x +-> hyper x,1$SQMATRIX(dim,ℚ)::List List ℚ)

   QQ is not a valid type.

A scalar product is denoted by the (2,0)-tensor

U:=Σ(Σ(script('u,[[],[i,j]])*ⅆ.i*ⅆ.j, i,1..dim), j,1..dim);

   There are no library operations named ⅆ 
      Use HyperDoc Browse or issue
                                 )what op ⅆ
      to learn if there is any operation containing " ⅆ " in its name.
   Cannot find a definition or applicable library operation named ⅆ 
      with argument type(s) 
                               PositiveInteger

      Perhaps you should use "@" to indicate the required return type, 
      or "$" to specify which version of the function you need.
   FriCAS will attempt to step through and interpret the code.
   There are no library operations named ⅆ 
      Use HyperDoc Browse or issue
                                 )what op ⅆ
      to learn if there is any operation containing " ⅆ " in its name.

   Cannot find a definition or applicable library operation named ⅆ 
      with argument type(s) 
                               PositiveInteger

      Perhaps you should use "@" to indicate the required return type, 
      or "$" to specify which version of the function you need.

Definition 1

We say that the scalar product is associative if the tensor equation holds:

    Y   =   Y
     U     U

In other words, if the (3,0)-tensor:

(6)

Using the LinearOperator domain in Axiom and some carefully chosen symbols we can easily enter expressions that are both readable and interpreted by Axiom as "graphical calculus" diagrams describing complex products and compositions of linear operators.

ω:ℒ :=(Y*I)/U  - (I*Y)/U;

   ℒ is not a valid type.

Definition 2

An algebra with a non-degenerate associative scalar product is called a [Frobenius Algebra]?.

We may consider the problem where multiplication Y is given, and look for all associative scalar products

This problem can be solved using linear algebra.

)expose MCALCFN

   MultiVariableCalculusFunctions is now explicitly exposed in frame 
      initial 
J := jacobian(ravel ω,concat map(variables,ravel U)::List Symbol);

   There are 1 exposed and 0 unexposed library operations named ravel 
      having 1 argument(s) but none was determined to be applicable. 
      Use HyperDoc Browse, or issue
                              )display op ravel
      to learn more about the available operations. Perhaps 
      package-calling the operation or using coercions on the arguments
      will allow you to apply the operation.

   Cannot find a definition or applicable library operation named ravel
      with argument type(s) 
                                 Variable(ω)

      Perhaps you should use "@" to indicate the required return type, 
      or "$" to specify which version of the function you need.

The matrix J transforms the coefficients of the tensor into coefficients of the tensor . We are looking for the general linear family of tensors such that J transforms into for any such .

If the null space of the J matrix is not empty we can use the basis to find all non-trivial solutions for U:

Ñ:=nullSpace(J);

   There are 3 exposed and 3 unexposed library operations named 
      nullSpace having 1 argument(s) but none was determined to be 
      applicable. Use HyperDoc Browse, or issue
                            )display op nullSpace
      to learn more about the available operations. Perhaps 
      package-calling the operation or using coercions on the arguments
      will allow you to apply the operation.

   Cannot find a definition or applicable library operation named 
      nullSpace with argument type(s) 
                                 Variable(J)

      Perhaps you should use "@" to indicate the required return type, 
      or "$" to specify which version of the function you need.

This defines a family of Frobenius algebras:

zero? eval(ω,ℰ)

   There are 10 exposed and 6 unexposed library operations named eval 
      having 2 argument(s) but none was determined to be applicable. 
      Use HyperDoc Browse, or issue
                              )display op eval
      to learn more about the available operations. Perhaps 
      package-calling the operation or using coercions on the arguments
      will allow you to apply the operation.

   Cannot find a definition or applicable library operation named eval 
      with argument type(s) 
                                 Variable(ω)
                                 Variable(ℰ)

      Perhaps you should use "@" to indicate the required return type, 
      or "$" to specify which version of the function you need.

The pairing is necessarily diagonal!

Ų:ℒ := eval(U,ℰ)

   ℒ is not a valid type.

The scalar product must be non-degenerate:

Ů:=determinant [[retract((ⅇ.i * ⅇ.j)/Ų) for j in 1..dim] for i in 1..dim]

   There are no library operations named ⅇ 
      Use HyperDoc Browse or issue
                                 )what op ⅇ
      to learn if there is any operation containing " ⅇ " in its name.
   Cannot find a definition or applicable library operation named ⅇ 
      with argument type(s) 
                               PositiveInteger

      Perhaps you should use "@" to indicate the required return type, 
      or "$" to specify which version of the function you need.
   FriCAS will attempt to step through and interpret the code.
   There are no library operations named ⅇ 
      Use HyperDoc Browse or issue
                                 )what op ⅇ
      to learn if there is any operation containing " ⅇ " in its name.

   Cannot find a definition or applicable library operation named ⅇ 
      with argument type(s) 
                               PositiveInteger

      Perhaps you should use "@" to indicate the required return type, 
      or "$" to specify which version of the function you need.

Definition 3

Co-pairing

Solve the Snake Relation as a system of linear equations.

Um:=matrix [[(ⅇ.i*ⅇ.j)/Ų for i in 1..dim] for j in 1..dim];

   There are no library operations named ⅇ 
      Use HyperDoc Browse or issue
                                 )what op ⅇ
      to learn if there is any operation containing " ⅇ " in its name.
   Cannot find a definition or applicable library operation named ⅇ 
      with argument type(s) 
                               PositiveInteger

      Perhaps you should use "@" to indicate the required return type, 
      or "$" to specify which version of the function you need.
   FriCAS will attempt to step through and interpret the code.
   There are no library operations named ⅇ 
      Use HyperDoc Browse or issue
                                 )what op ⅇ
      to learn if there is any operation containing " ⅇ " in its name.

   Cannot find a definition or applicable library operation named ⅇ 
      with argument type(s) 
                               PositiveInteger

      Perhaps you should use "@" to indicate the required return type, 
      or "$" to specify which version of the function you need.

Check "dimension" and the snake relations.

d:ℒ:=
       Ω    /
       X    /
       Ų

   ℒ is not a valid type.

Definition 4

Co-algebra

Compute the "three-point" function and use it to define co-multiplication.

Too slow:

  \begin{axiom}
  W:=(Y,I)/Ų;
  λ:=(Ω,I,Ω)/(I,W,I)
  \end{axiom}

λ:= (I,Ω) / (Y,I)

   There are 11 exposed and 15 unexposed library operations named / 
      having 2 argument(s) but none was determined to be applicable. 
      Use HyperDoc Browse, or issue
                                )display op /
      to learn more about the available operations. Perhaps 
      package-calling the operation or using coercions on the arguments
      will allow you to apply the operation.

   Cannot find a definition or applicable library operation named / 
      with argument type(s) 
                      Tuple(OrderedVariableList([I,Ω]))
                      Tuple(OrderedVariableList([Y,I]))

      Perhaps you should use "@" to indicate the required return type, 
      or "$" to specify which version of the function you need.

Frobenius Condition

Like Octonion algebra Sedenion algebra also fails the Frobenius Condition!

Too slow to complete here:

  \begin{axiom}

  Χ := Y / λ ;

  Χr := (λ,I)/(I,Y)
  test(Χr = Χ )

  Χl := (I,λ)/(Y,I);
  --test( Χl = Χ )
  test( Χr = Χl )

  \end{axiom}

Perhaps this is not too surprising since like Octonion Seden algebra is non-associative (in fact also non-alternative). Nevertheless Sedenions are "Frobenius" in a more general sense just because there is a non-degenerate associative pairing.

i = Unit of the algebra

i:=ⅇ.1

   There are no library operations named ⅇ 
      Use HyperDoc Browse or issue
                                 )what op ⅇ
      to learn if there is any operation containing " ⅇ " in its name.

   Cannot find a definition or applicable library operation named ⅇ 
      with argument type(s) 
                               PositiveInteger

      Perhaps you should use "@" to indicate the required return type, 
      or "$" to specify which version of the function you need.

Handle

H:ℒ :=
         λ     /
         X     /
         Y

   ℒ is not a valid type.

Definition 5

  i 
  U
  

ι:ℒ:=
    (    i I    ) /
    (     Ų     )

   ℒ is not a valid type.

Y=U
ι  

test
        Y    /
        ι       = Ų

(7)

For example:

ex1:=[q[3]=1,p[1]=1]

(8)

Ų0:ℒ  :=eval(Ų,ex1)

   ℒ is not a valid type.