Hyper-determinant

Hyper-determinant


With the Levi-Civita symbol we can define a determinant:

ε^{a1,a2,a3,...} = 0 if any 2 of the indices the same. (1 otherwise) (Also, antisymmetric)

Determinant of a 2-tensor is:

det_2(A) = ε^{a}ε^{b}A^{a1,b1}A^{a2,b2}A^{a3,b3} ....

We can define

f^{a1,a2,a3,...} = 0 if any 3 of the indices the same.

Determinant of a 3-tensor is:

 det_3(A) = f^{a}f^{b}f^{c}A^{a1,b1,c1}A^{a2,b2,c2}A^{a3,b3,c3} ....

In the case where it is a 2x2x2 symmetric 3-tensor this should give the discriminant of a cubic.

Let
g_n{a1,a2,a3...} =0 if any no n of the indices are the same.

Determinant of a n-tensor is:
det_n(A) = g_n^{a}g_n^{b}g_n^{c}...A^{a1,b1,c1,...}A^{a2,b2,c2,...}A^{a3,b3,c3,...} ....
Properties
Assuming all components of A are independent (not true for symmetric tensors!).

det_1(A) = 0 by definition.

d/dAin d/dAim det_2(A) = 0

d/dAin d/dAim d/Aio det_3(A) = 0

Inverses
We can generalise the definition of an inverse for a 2-tensor:
(A^-1)ij  =   d/dAij log( det_2(A) )
Bijk = d/dAijk log( det_3(A) ) == ???
Cijkl = d/dAijkl log( det_4(A) ) == ???
What properties do these have?





Comments

Post a Comment

Popular posts from this blog

Vortex Solution to Navier Stokes Equations

Image
This is a solution I found to the Navier Stokes equations . It uses the flow lines of the Hopf Fibration (which is basically just a way of covering the entire 3D space in circles). The flow lines can be seen in this image below: You can see my paper here. Solution to Navier-Stokes equation . Unfortunately I won't get a million pounds for winning the Clay Millennium prize because this is a compressible not incompressible solution. :( Oh, well. Nice try! I think it's pretty nice anyway. :) Also it uses the nice identity: which paramaterizes the Pythagorean quadruples!
Read more

Solving two polynomials in two variables

Solving two polynomials in two variables I had an algorithm for solving two polynomials in 2 variables by converting it into an equation in 1 variable. I'll see if I can remember it. Let us start with 2 polynomials. (solution: x=2 y=3). We try to eliminate x. (1) x 2 +4xy+2y 2 +3x+4y - 64 = 0 (2) 3x 2  -xy + y 2 +5x-y -22 = 0 First eliminate x 2 (3) =- (2) +3 (1) :  13xy +5y 2  +4x +13y  -170 = 0 or (13y+4)x + (5y 2 +13y  -170) = 0 Next use this equation to eliminate x 2  again from (1) . (1) .(13y+4) :  (13y+4)x 2 + (52y 2 +55y+12)x + (13y+4)(2y 2 +4y - 64) = 0 - (3) .x:             (13y+4)x 2  + (5y 2 +13y  -170)x = 0 =(4) : (47y 2 +42y+182)x + (13y+4)(2y 2 +4y - 64) = 0 Now use these two linear equations to eliminate x: (13y+4) (4) -  (47y 2 +42y+182) (3)  :   (13y+4)(13y+4)(2y 2 +4y - 64) - (47y 2 +42y+182)(5y 2 +13y  -170) =0 or  (y-3) ...
Read more

Tarski-Seidenberg theorem

Tarski-Seidenberg theorem States that a set of equalities and inequalities f(x1,x2,x3,....xn)>=0 can be reduced down to a set of equalities and inequalities f(x1,x2,x3,....xn-1)>=0 with one less variable. Thus all equations can be reduced to a set of equalities and inequalities on their coefficients. See also: cylindrical algebraic decomposition See:  Elimination These algorithms aren't very simple.
Read more