In algebra, the hyperdeterminant is a generalization of the determinant. Whereas a determinant is a scalar valued function defined on an n × n square matrix, a hyperdeterminant is defined on a multidimensional array of numbers or tensor. Like a determinant, the hyperdeterminant is a homogeneous polynomial with integer coefficients in the components of the tensor. Many other properties of determinants generalize in some way to hyperdeterminants, but unlike a determinant, the hyperdeterminant does not have a simple geometric interpretation in terms of volumes.
There are at least three definitions of hyperdeterminant. The first was discovered by Arthur Cayley in 1843 presented to the Cambridge Philosophical Society.[1] It is in two parts and Cayley's first hyperdeterminant is covered in the second part.[1] It is usually denoted by det0. The second Cayley hyperdeterminant originated in 1845[2] and is often denoted "Det". This definition is a discriminant for a singular point on a scalar valued multilinear map.[2]
Cayley's first hyperdeterminant is defined only for hypercubes having an even number of dimensions (although variations exist in odd dimensions). Cayley's second hyperdeterminant is defined for a restricted range of hypermatrix formats (including the hypercubes of any dimensions). The third hyperdeterminant, most recently defined by Glynn, occurs only for fields of prime characteristic p. It is denoted by detp and acts on all hypercubes over such a field.[3]
Only the first and third hyperdeterminants are "multiplicative," except for the second hyperdeterminant in the case of "boundary" formats. The first and third hyperdeterminants also have closed formulae as polynomials and therefore their degrees are known, whereas the second one does not appear to have a closed formula or degree in all cases that are known.
The notation for determinants can be extended to hyperdeterminants without change or ambiguity. Hence the hyperdeterminant of a hypermatrix A may be written using the vertical bar notation as |A| or as det(A).
A standard modern textbook on Cayley's second hyperdeterminant Det (as well as many other results) is "Discriminants, Resultants and Multidimensional Determinants" by Gel'fand, Kapranov and Zelevinsky. Their notation and terminology is followed in the next section.
In the special case of a 2 × 2 × 2 hypermatrix the hyperdeterminant is known as Cayley's hyperdeterminant after the British mathematician Arthur Cayley who discovered it. The quartic expression for the Cayley's hyperdeterminant of hypermatrix A with components aijk, ∊ is given by
Det(A) = a0002a1112 + a0012a1102 + a0102a1012 + a1002a0112
− 2a000a001a110a111 − 2a000a010a101a111 − 2a000a011a100a111 − 2a001a010a101a110 − 2a001a011a110a100 − 2a010a011a101a100 + 4a000a011a101a110 + 4a001a010a100a111.
This expression acts as a discriminant in the sense that it is zero if and only if there is a non-zero solution in six unknowns xi, yi, zi, (with superscript i = 0 or 1) of the following system of equations
a000x0y0 + a010x0y1 + a100x1y0 + a110x1y1 = 0
a001x0y0 + a011x0y1 + a101x1y0 + a111x1y1 = 0
a000x0z0 + a001x0z1 + a100x1z0 + a101x1z1 = 0
a010x0z0 + a011x0z1 + a110x1z0 + a111x1z1 = 0
a000y0z0 + a001y0z1 + a010y1z0 + a011y1z1 = 0
a100y0z0 + a101y0z1 + a110y1z0 + a111y1z1 = 0.
The hyperdeterminant can be written in a more compact form using the Einstein convention for summing over indices and the Levi-Civita symbol which is an alternating tensor density with components εij specified by ε00 = ε11 = 0, ε01 = −ε10 = 1:
bkn = (1/2)εilεjmaijkalmn
Det(A) = (1/2)εilεjmbijblm.
Using the same conventions we can define a multilinear form
f(x,y,z) = aijk xiyjzk
Then the hyperdeterminant is zero if and only if there is a non-trivial point where all partial derivatives of f vanish.
The above determinant can be written in terms of a generalisation of the Levi-Civita symbol:
Det(A)=fijklfnmopfqrstainqajmrakosalpt
where f is a generalisation of the Levi-Civita symbol which allows two indices to be the same:
f0011=f1100=f0110=f1001=-1/2
f0101=f1010=1
where the f satisfy:
f...abc...+f...bca...+f...cab...+f...cba...+f...acb...+f...bac...=0.
For symmetric 2 × 2 × 2 × ⋯ hypermatrices, the hyperdeterminant is the discriminant of a polynomial. For example,
a000=a
a001=a010=a100=b
a110=a101=a011=c
a111=d
Then Det(A) is the discriminant of
ax3+3bx2+3cx+d.
In the general case a hyperdeterminant is defined as a discriminant for a multilinear map f from finite-dimensional vector spaces Vi to their underlying field K which may be
R
C
f:V1 ⊗ V2 ⊗ … ⊗ Vr\toK
f can be identified with a tensor in the tensor product of each dual space V*i
f\in
| * | |
| V | |
| 1 |
⊗
| * | |
| V | |
| 2 |
⊗ … ⊗
| * | |
| V | |
| r |
By definition a hyperdeterminant Det(f) is a polynomial in components of the tensor f which is zero if and only if the map f has a non-trivial point where all partial derivatives with respect to the components of its vector arguments vanish (a non-trivial point means that none of the vector arguments are zero.)
The vector spaces Vi need not have the same dimensions and the hyperdeterminant is said to be of format if the dimension of each space Vi is It can be shown that the hyperdeterminant exists for a given format and is unique up to a scalar factor, if and only if the largest number in the format is less than or equal to the sum of the other numbers in the format.
This definition does not provide a means to construct the hyperdeteriminant and in general this is a difficult task. For hyperdeterminants with formats where the number of terms is usually too large to write out the hyperdeterminant in full. For larger r even the degree of the polynomial increases rapidly and does not have a convenient general formula.
The case of formats with r = 1 deals with vectors of length In this case the sum of the other format numbers is zero and k1 is always greater than zero so no hyperdeterminants exist.
The case of r = 2 deals with matrices. Each format number must be greater than or equal to the other, therefore only square matrices S have hyperdeterminants and they can be identified with the determinant det(S). Applying the definition of the hyperdeterminant as a discriminant to this case requires that det(S) is zero when there are vectors X and Y such that the matrix equations and have solutions for non-zero X and Y.
For there are hyperdeterminants with different formats satisfying the format inequality. For example, Cayley's hyperdeterminant has format (1, 1, 1) and a hyperdeterminant of format also exists. However a hyperdeterminant would have format but so it does not exist.
Since the hyperdeterminant is homogeneous in its variables it has a well-defined degree that is a function of the format and is written N(k1, ..., kr). In special cases we can write down an expression for the degree. For example, a hyperdeterminant is said to be of boundary format when the largest format number is the sum of the others and in this case we have
N(k2+ … +kr,k2,\ldots,kr)=
| (k2+ … +kr+1)! | |
| k2! … kr! |
.
For hyperdeterminants of dimensions 2r, a convenient generating formula for the degrees Nr is
| infty | |
| \sum | |
| r=0 |
Nr
| zr | |
| r! |
=
| e-2z | |
| (1-z)2 |
.
In particular for r = 2,3,4,5,6 the degree is respectively and then grows very rapidly.
Three other special formulae for computing the degree of hyperdeterminants are given in
for 2 × m × m use N(1, m − 1, m − 1) = 2m(m − 1)
for 3 × m × m use N(2, m − 1, m − 1) = 3m(m − 1)2
for 4 × m × m use N(3, m − 1, m − 1) = (2/3)m(m − 1)(m − 2)(5m − 3)
A general result that follows from the hyperdeterminants product rule and invariance properties listed below is that the least common multiple of the dimensions of the vector spaces on which the linear map acts divides the degree of the hyperdeterminant, that is,
lcm(k1 + 1, ..., kr + 1) | N(k1, ..., kr).
Hyperdeterminants generalise many of the properties of determinants. The property of being a discriminant is one of them and it is used in the definition above.
One of the most familiar properties of determinants is the multiplication rule which is sometimes known as the Binet-Cauchy formula. For square n × n matrices A and B the rule says that
det(AB) = det(A)det(B)
This is one of the harder rules to generalize from determinants to hyperdeterminants because generalizations of products of hypermatrices can give hypermatrices of different sizes. The full domain of cases in which the product rule can be generalized is still a subject of research. However, there are some basic instances that can be stated.
Given a multilinear form f(x1, ..., xr) we can apply a linear transformation on the last argument using an n × n matrix B, yr = B xr. This generates a new multilinear form of the same format,
g(x1, ..., xr) = f(x1, ..., yr)
In terms of hypermatrices this defines a product which can be written g = f.B
It is then possible to use the definition of the hyperdeterminant to show that
det(f.B) = det(f)det(B)N/n
where n is the degree of the hyperdeterminant. This generalises the product rule for matrices.
Further generalizations of the product rule have been demonstrated for appropriate products of hypermatrices of boundary format.
Cayley's first hyperdeterminant det0 is multiplicative in the following sense. Let A be a r-dimensional n × ... × n hypermatrix with elements ai, ..., k, B be a s-dimensional n × ... × n hypermatrix with elements b..., and C be a (r + s − 2)-dimensional n × ... × n hypermatrix with elements c... such that (using Einstein notation)
ci, ..., j, l, ..., m = ai, ..., jkbk, l, ..., m,then
det0(C) = det0(A) det0(B).
A determinant is not usually considered in terms of its properties as an algebraic invariant but when determinants are generalized to hyperdeterminants the invariance is more notable. Using the multiplication rule above on the hyperdeterminant of a hypermatrix H times a matrix S with determinant equal to one gives
det(H.S) = det(H)
In other words, the hyperdeterminant is an algebraic invariant under the action of the special linear group SL(n) on the hypermatrix. The transformation can be equally well applied to any of the vector spaces on which the multilinear map acts to give another distinct invariance. This leads to the general result,
The hyperdeterminant of format
(k1,\ldots,kr)
SL(k1+1) ⊗ … ⊗ SL(kr+1)
For example, the determinant of an n × n matrix is an SL(n)2 invariant and Cayley's hyperdeterminant for a 2 × 2 × 2 hypermatrix is an SL(2)3 invariant.
A more familiar property of a determinant is that if you add a multiple of a row (or column) to a different row (or column) of a square matrix then its determinant is unchanged. This is a special case of its invariance in the case where the special linear transformation matrix is an identity matrix plus a matrix with only one non-zero off-diagonal element. This property generalizes immediately to hyperdeterminants implying invariance when you add a multiple of one slice of a hypermatrix to another parallel slice.
A hyperdeterminant is not the only polynomial algebraic invariant for the group acting on the hypermatrix. For example, other algebraic invariants can be formed by adding and multiplying hyperdeterminants. In general the invariants form a ring algebra and it follows from Hilbert's basis theorem that the ring is finitely generated. In other words, for a given hypermatrix format, all the polynomial algebraic invariants with integer coefficients can be formed using addition, subtraction and multiplication starting from a finite number of them. In the case of a 2 × 2 × 2 hypermatrix, all such invariants can be generated in this way from Cayley's second hyperdeterminant alone, but this is not a typical result for other formats. For example, the second hyperdeterminant for a hypermatrix of format 2 × 2 × 2 × 2 is an algebraic invariant of degree 24 yet all the invariants can be generated from a set of four simpler invariants of degree 6 and less.
The second hyperdeterminant was invented and named by Arthur Cayley in 1845, who was able to write down the expression for the 2 × 2 × 2 format, but Cayley went on to use the term for any algebraic invariant and later abandoned the concept in favour of a general theory of polynomial forms which he called "quantics". For the next 140 years there were few developments in the subject and hyperdeterminants were largely forgotten until they were rediscovered by Gel'fand, Kapranov and Zelevinsky in the 1980s as an offshoot of their work on generalized hypergeometric functions. This led to them writing their textbook in which the hyperdeterminant is reintroduced as a discriminant. Indeed, Cayley's first hyperdeterminant is more fundamental than his second, since it is a straightforward generalization the ordinary determinant, and has found recent applications in the Alon-Tarsi conjecture.
Since then the hyperdeterminant has found applications over a wide range of disciplines including algebraic geometry, number theory, quantum computing and string theory.
In algebraic geometry the second hyperdeterminant is studied as a special case of an X-discriminant. A principal result is that there is a correspondence between the vertices of the Newton polytope for hyperdeterminants and the "triangulation" of a cube into simplices.
In quantum computing the invariants on hypermatrices of format 2N are used to study the entanglement of N qubits.
In string theory the hyperdeterminant first surfaced in connection with string dualities and black hole entropy.
For other historical developments not contained in the book from Gel'fand, Kapranov and Zelevinsky, see: