Multilinear polynomial explained

In algebra, a multilinear polynomial^[1] is a multivariate polynomial that is linear (meaning affine) in each of its variables separately, but not necessarily simultaneously. It is a polynomial in which no variable occurs to a power of 2 or higher; that is, each monomial is a constant times a product of distinct variables. For example f(x,y,z) = 3xy + 2.5 y - 7z is a multilinear polynomial of degree 2 (because of the monomial 3xy) whereas f(x,y,z) = x² +4y is not. The degree of a multilinear polynomial is the maximum number of distinct variables occurring in any monomial.

Definition

Multilinear polynomials can be understood as a multilinear map (specifically, a multilinear form) applied to the vectors [1 x], [1 y], etc. The general form can be written as a tensor contraction:$$f(x)\; =\; \backslash sum\_^1\backslash sum\_^1\backslash cdots\backslash sum\_^1\; a\_x\_1^x\_2^\backslash cdots\; x\_n^$$

For example, in two variables:

Properties

A multilinear polynomial

f is linear (affine) when varying only one variable, x _{k} :$$f(x\_1,\; x\_2,\; ...,\; x\_k,\; ...,\; x\_n)\; =\; a\; x\_k\; +\; b$$where a and b do not depend on x _{k} . Note that b is generally not zero, so f is linear in the "shaped like a line" sense, but not in the "directly proportional" sense of a multilinear map.

All repeated second partial derivatives are zero:$$\backslash frac\; =\; 0$$In other words, its Hessian matrix is a symmetric hollow matrix.

\nabla ^{2f=0} , so f is a harmonic function. This implies f has maxima and minima only on the boundary of the domain.

More generally, every restriction of

f to a subset of its coordinates is also multilinear, so \nabla ^{2f=0} still holds when one or more variables are fixed. In other words, f is harmonic on every "slice" of the domain along coordinate axes.

On a rectangular domain

When the domain is rectangular in the coordinate axes (e.g. a hypercube),

f will have maxima and minima only on the vertices of the domain, i.e. the finite set of 2 ^{n} points with minimal and maximal coordinate values. The value of the function on these points completely determines the function, since the value on the edges of the boundary can be found by linear interpolation, and the value on the rest of the boundary and the interior is fixed by Laplace's equation, \nabla ^{2f=0} .

The value of the polynomial at an arbitrary point can be found by repeated linear interpolation along each coordinate axis. Equivalently, it is a weighted mean of the vertex values, where the weights are the Lagrange interpolation polynomials. These weights also constitute a set of generalized barycentric coordinates for the hyperrectangle. Geometrically, the point divides the domain into

2 ^{n} smaller hyperrectangles, and the weight of each vertex is the (fractional) volume of the hyperrectangle opposite it.

Algebraically, the multilinear interpolant on the hyperrectangle

[a _{i,} b _{i]} ^{n} ^{i =1} is:$$f(x)\; =\; \backslash sum\_v\; f(v)\; \backslash prod\_\; \backslash frac\; \backslash prod\_\; \backslash frac$$where the sum is taken over the vertices v . Equivalently,$$f(x)\; =\; \backslash frac\; \backslash sum\_v\; f(v)\; \backslash prod\_\; (x\_i-a\_i)\; \backslash prod\_\; (b\_i-x\_i)$$where V is the volume of the hyperrectangle.

The value at the center is the arithmetic mean of the value at the vertices, which is also the mean over the domain boundary, and the mean over the interior. The components of the gradient at the center are proportional to the balance of the vertex values along each coordinate axis.

The vertex values and the coefficients of the polynomial are related by a linear transformation (specifically, a Möbius transform if the domain is the unit hypercube

\{ 0 , 1 \} ^{n} , and a Walsh-Hadamard-Fourier transform if the domain is the symmetric hypercube \{ -1 , 1 \} ^{n} ).

Applications

Multilinear polynomials are the interpolants of multilinear or n-linear interpolation on a rectangular grid, a generalization of linear interpolation, bilinear interpolation and trilinear interpolation to an arbitrary number of variables. This is a specific form of multivariate interpolation, not to be confused with piecewise linear interpolation. The resulting polynomial is not a linear function of the coordinates (its degree can be higher than 1), but it is a linear function of the fitted data values.

The determinant, permanent and other immanants of a matrix are homogeneous multilinear polynomials in the elements of the matrix (and also multilinear forms in the rows or columns).

The multilinear polynomials in

n variables form a 2 ^{n} -dimensional vector space, which is also the basis used in the Fourier analysis of (pseudo-)Boolean functions. Every (pseudo-)Boolean function can be uniquely expressed as a multilinear polynomial (up to a choice of domain and codomain).

Multilinear polynomials are important in the study of polynomial identity testing.^[2]

See also

• Bilinear and trilinear interpolation, using multivariate polynomials with two or three variables
• Zhegalkin polynomial, a multilinear polynomial over

F _{2}

• Multilinear form and multilinear map, multilinear functions that are strictly linear (not affine) in each variable
• Linear form, a multivariate linear function
• Harmonic polynomial

References

1. 2010-10-01. The Interval Analysis of Multilinear Expressions. Electronic Notes in Theoretical Computer Science. en. 267. 2. 43–53. 10.1016/j.entcs.2010.09.017. 1571-0661. free. Laneve . Cosimo . Lascu . Tudor A. . Sordoni . Vania .
2. A. Giambruno, Mikhail Zaicev. Polynomial Identities and Asymptotic Methods. AMS Bookstore, 2005 . Section 1.3.