Convex and discrete geometry Convex geometric analysis and geometric inequalities Theorem
Minkowski's first inequality
Builds on Mixed volumeConvex bodyLebesgue measure
Statement
Let and let be nonempty compact convex subsets of (convex bodies). Let be the mixed volume and write , with repeated times. Then where is Lebesgue measure. If and have nonempty interiors, equality holds if and only if and are homothetic.
Remarks
One derivation uses the Brunn–Minkowski theorem. If the inequality is trivial, so assume . The function is concave on , so . By the definition of mixed volumes, , so , which gives the inequality. It also follows from the Alexandrov–Fenchel inequality.
Example: take , the closed unit ball, of volume . Then is the surface area , and the inequality becomes , the isoperimetric inequality for convex bodies. For this is .
Going deeper
For a student
The inequality is a key step in the uniqueness part of the Minkowski problem: two convex bodies with the same surface area measure are translates of each other. It is the case of a chain of inequalities obtained from the Alexandrov–Fenchel inequality. Minkowski's second inequality, , is another case of that chain.
Reading path
To understand this page from the ground up, read these 7 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Borel sigma-algebra concept
- Convex body concept
- Euclidean space object
- Mixed volume concept
- Outer measure concept
- Lebesgue measure object
- Minkowski's first inequality statement
Further reading
About this page
| Tag | 9M8XJX4DQ7 |
|---|---|
| URI | m2://9M8XJX4DQ7 |
| Kind | statement, theorem |
| Writing | W0 stub |
| MSC | 52A39, 52A40 |
| Status | This copy of the site has no build data. Run m2 status 9M8XJX4DQ7. |
| About | Mixed volume |
| Uses | Mixed volume, Convex body, Lebesgue measure |
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.