In mathematics, the Brascamp–Lieb inequality is either of two inequalities. The first is a result in geometry concerning integrable functions on n-dimensional Euclidean space. It generalizes the Loomis–Whitney inequality and Hölder's inequality. The second is a result of probability theory which gives a concentration inequality for log-concave probability distributions. Both are named after Herm Jan Brascamp and Elliott H. Lieb.

The geometric inequality

Fix natural numbers m and n. For 1 ≤ i ≤ m, let ni ∈ N and let ci > 0 so that Choose non-negative, integrable functions and surjective linear maps Then the following inequality holds: where D is given by Another way to state this is that the constant D is what one would obtain by restricting attention to the case in which each f_{i} is a centered Gaussian function, namely.

Alternative forms

Consider a probability density function. This probability density function p(x) is said to be a log-concave measure if the \phi(x) function is convex. Such probability density functions have tails which decay exponentially fast, so most of the probability mass resides in a small region around the mode of p(x). The Brascamp–Lieb inequality gives another characterization of the compactness of p(x) by bounding the mean of any statistic S(x). Formally, let S(x) be any derivable function. The Brascamp–Lieb inequality reads: where H is the Hessian and \nabla is the Nabla symbol.

BCCT inequality

The inequality is generalized in 2008 to account for both continuous and discrete cases, and for all linear maps, with precise estimates on the constant. Definition: the Brascamp-Lieb datum (BL datum) For any with f_i \geq 0, define Now define the Brascamp-Lieb constant for the BL datum:

Discrete case

Setup: With this setup, we have (Theorem 2.4, Theorem 3.12 ) Note that the constant |T(G)| is not always tight.

BL polytope

Given BL datum (B, p), the conditions for are Thus, the subset of that satisfies the above two conditions is a closed convex polytope defined by linear inequalities. This is the BL polytope. Note that while there are infinitely many possible choices of subspace V of \R^d, there are only finitely many possible equations of, so the subset is a closed convex polytope. Similarly we can define the BL polytope for the discrete case.

Relationships to other inequalities

The geometric Brascamp–Lieb inequality

The case of the Brascamp–Lieb inequality in which all the ni are equal to 1 was proved earlier than the general case. In 1989, Keith Ball introduced a "geometric form" of this inequality. Suppose that are unit vectors in and are positive numbers satisfying for all, and that are positive measurable functions on \mathbb{R}. Then Thus, when the vectors (u_i) resolve the inner product the inequality has a particularly simple form: the constant is equal to 1 and the extremal Gaussian densities are identical. Ball used this inequality to estimate volume ratios and isoperimetric quotients for convex sets in and. There is also a geometric version of the more general inequality in which the maps B_i are orthogonal projections and where I is the identity operator on.

Hölder's inequality

Take ni = n, Bi = id, the identity map on, replacing fi by f1/ci i, and let ci = 1 / pi for 1 ≤ i ≤ m. Then and the log-concavity of the determinant of a positive definite matrix implies that D = 1. This yields Hölder's inequality in :

Poincaré inequality

The Brascamp–Lieb inequality is an extension of the Poincaré inequality which only concerns Gaussian probability distributions.

Cramér–Rao bound

The Brascamp–Lieb inequality is also related to the Cramér–Rao bound. While Brascamp–Lieb is an upper-bound, the Cramér–Rao bound lower-bounds the variance of. The Cramér–Rao bound states which is very similar to the Brascamp–Lieb inequality in the alternative form shown above.