Math 2.0

Convex and discrete geometry Convex geometric analysis and geometric inequalities Theorem

Alexandrov–Fenchel inequality

Builds on Mixed volumeConvex body

Statement

Let n≥2n \ge 2 and let K1,K2,…,KnK_1, K_2, \dots, K_n be nonempty compact convex subsets of ℝn\R^n (convex bodies). Let VV denote the mixed volume. Then V(K1,K2,K3,…,Kn)2≥V(K1,K1,K3,…,Kn) V(K2,K2,K3,…,Kn).V(K_1, K_2, K_3, \dots, K_n)^2 \ge V(K_1, K_1, K_3, \dots, K_n)\, V(K_2, K_2, K_3, \dots, K_n).

Remarks

The inequality was proved by Alexandrov, and independently by Fenchel, in the 1930s. Alexandrov's proofs treat polytopes or smooth bodies first, by induction on the dimension, and then pass to general bodies by approximation. Khovanskii and Teissier found a proof through the Hodge index theorem applied to toric varieties.

Example: for n=2n = 2 the inequality reads V(K,L)2≥area⁡(K)area⁡(L)V(K, L)^2 \ge \operatorname{area}(K) \operatorname{area}(L). With LL the unit disk, V(K,L)=12per⁡(K)V(K, L) = \frac12 \operatorname{per}(K), and one gets per⁡(K)2≥4πarea⁡(K)\operatorname{per}(K)^2 \ge 4 \pi \operatorname{area}(K), the planar isoperimetric inequality.

Going deeper

For a student

Applied with the remaining arguments chosen among K1K_1 and K2K_2, it shows that the sequence V(K1[i],K2[n−i])V(K_1[i], K_2[n - i]), for i=0,…,ni = 0, \dots, n, is log-concave in ii. It implies Minkowski's first inequality and the Brunn–Minkowski theorem for convex bodies. Stanley used it to prove that the numbers of linear extensions of a poset with a fixed element at a given position form a log-concave sequence. Its equality cases are understood only in special situations, and their full description is a hard problem.

Reading path

To understand this page from the ground up, read these 3 pages in order. The foundations come first.

Show the path as a graph
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Convex body concept
  2. Mixed volume concept
  3. Alexandrov–Fenchel inequality statement

Further reading

  1. Web https://en.wikipedia.org/wiki/Mixed_volume
About this page
TagD3AVHVYQW9
URIm2://D3AVHVYQW9
Kindstatement, theorem
WritingW0 stub
MSC52A39, 52A40
StatusThis copy of the site has no build data. Run m2 status D3AVHVYQW9.
AboutMixed volume
UsesMixed volume, Convex body

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • an inventory row: the row of the inventory that the node accounts for (0 of 1)
  • a source with a locator (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

No page links to this page yet.