We give a well-known argument that follows a general recipe of arguments in measure theory; namely, it establishes a simple case by direct analysis, uses induction to establish a finitary extension of that special case, and then uses general machinery to obtain the general case as a limit. A discussion of this history of this proof can be found in Theorem 4.1 in Gardner's survey on Brunn–Minkowski.

We prove the version of the Brunn–Minkowski theorem that only requires ${\textstyle A,B,A+B}$ to be measurable and non-empty.

• The case that A and B are axis aligned boxes:

By translation invariance of volumes, it suffices to take ${\textstyle A=\prod _{i=1}^{n}[0,a_{i}],B=\prod _{i=1}^{n}[0,b_{i}]}$. Then ${\textstyle A+B=\prod _{i=1}^{n}[0,a_{i}+b_{i}]}$. In this special case, the Brunn–Minkowski inequality asserts that ${\textstyle \prod (a_{i}+b_{i})^{1/n}\geq \prod a_{i}^{1/n}+\prod b_{i}^{1/n}}$. After dividing both sides by ${\textstyle \prod (a_{i}+b_{i})^{1/n}}$ , this follows from the AM–GM inequality: ${\textstyle (\prod {\frac {a_{i}}{a_{i}+b_{i}}})^{1/n}+(\prod {\frac {b_{i}}{a_{i}+b_{i}}})^{1/n}\leq \sum {\frac {1}{n}}{\frac {a_{i}+b_{i}}{a_{i}+b_{i}}}=1}$.

• The case where A and B are both disjoint unions of finitely many such boxes:

We will use induction on the total number of boxes, where the previous calculation establishes the base case of two boxes. First, we observe that there is an axis aligned hyperplane H that such that each side of H contains an entire box of A. To see this, it suffices to reduce to the case where A consists of two boxes, and then calculate that the negation of this statement implies that the two boxes have a point in common.

For a body X, we let ${\textstyle X^{-},X^{+}}$ denote the intersections of X with the "right" and "left" halfspaces defined by H. Noting again that the statement of Brunn–Minkowski is translation invariant, we then translate B so that ${\textstyle {\frac {\mu (A^{+})}{\mu (B^{+})}}={\frac {\mu (A^{-})}{\mu (B^{-})}}}$; such a translation exists by the intermediate value theorem because ${\textstyle t\to \mu ((B+tv)^{+})}$ is a continuous function, if v is perpendicular to H ${\textstyle {\frac {\mu ((B+tv)^{+})}{\mu ((B+tv)^{-})}}}$ has limiting values 0 and ${\textstyle \infty }$ as ${\displaystyle t\to -\infty ,t\to \infty }$, so takes on ${\textstyle {\frac {\mu (A^{+})}{\mu (A^{-})}}}$ at some point.

We now have the pieces in place to complete the induction step. First, observe that ${\textstyle A^{+}+B^{+}}$ and ${\displaystyle A^{-}+B^{-}}$ are disjoint subsets of ${\textstyle A+B}$, and so ${\textstyle \mu (A+B)\geq \mu (A^{+}+B^{+})+\mu (A^{-}+B^{-}).}$ Now, ${\textstyle A^{+},A^{-}}$ both have one fewer box than A, while ${\textstyle B^{+},B^{-}}$ each have at most as many boxes as B. Thus, we can apply the induction hypothesis: ${\textstyle \mu (A^{+}+B^{+})\geq (\mu (A^{+})^{1/n}+\mu (B^{+})^{1/n})^{n}}$ and ${\textstyle \mu (A^{-}+B^{-})\geq (\mu (A^{-})^{1/n}+\mu (B^{-})^{1/n})^{n}}$.

Elementary algebra shows that if ${\textstyle {\frac {\mu (A^{+})}{\mu (B^{+})}}={\frac {\mu (A^{-})}{\mu (B^{-})}}}$, then also ${\textstyle {\frac {\mu (A^{+})}{\mu (B^{+})}}={\frac {\mu (A^{-})}{\mu (B^{-})}}={\frac {\mu (A)}{\mu (B)}}}$, so we can calculate:

${\displaystyle {\begin{aligned}\mu (A+B)\geq \mu (A^{+}+B^{+})+\mu (A^{-}+B^{-})\geq (\mu (A^{+})^{1/n}+\mu (B^{+})^{1/n})^{n}+(\mu (A^{-})^{1/n}+\mu (B^{-})^{1/n})^{n}\\=\mu (B^{+})(1+{\frac {\mu (A^{+})^{1/n}}{\mu (B^{+})^{1/n}}})^{n}+\mu (B^{-})(1+{\frac {\mu (A^{-})^{1/n}}{\mu (B^{-})^{1/n}}})^{n}=(1+{\frac {\mu (A)^{1/n}}{\mu (B)^{1/n}}})^{n}(\mu (B^{+})+\mu (B^{-}))=(\mu (B)^{1/n}+\mu (A)^{1/n})^{n}\end{aligned}}}$

• The case that A and B are bounded open sets:

In this setting, both bodies can be approximated arbitrarily well by unions of disjoint axis aligned rectangles contained in their interior; this follows from general facts about the Lebesgue measure of open sets. That is, we have a sequence of bodies ${\textstyle A_{k}\subseteq A}$, which are disjoint unions of finitely many axis aligned rectangles, where ${\textstyle \mu (A\setminus A_{k})\leq 1/k}$, and likewise ${\textstyle B_{k}\subseteq B}$. Then we have that ${\textstyle A+B\supseteq A_{k}+B_{k}}$, so ${\textstyle \mu (A+B)^{1/n}\geq \mu (A_{k}+B_{k})^{1/n}\geq \mu (A_{k})^{1/n}+\mu (B_{k})^{1/n}}$. The right hand side converges to ${\textstyle \mu (A)^{1/n}+\mu (B)^{1/n}}$ as ${\textstyle k\to \infty }$, establishing this special case.

• The case that A and B are compact sets:

For a compact body X, define ${\textstyle X_{\epsilon }=X+B(0,\epsilon )}$ to be the ${\textstyle \epsilon }$-thickening of X. Here each ${\textstyle B(0,\epsilon )}$ is the open ball of radius ${\textstyle \epsilon }$, so that ${\textstyle X_{\epsilon }}$ is a bounded, open set. We note that ${\textstyle \bigcap _{\epsilon >0}X_{\epsilon }={\text{cl}}(X)}$, so that if X is compact, then ${\textstyle \lim _{\epsilon \to 0}\mu (X_{\epsilon })=\mu (X)}$. By using associativity and commutativity of Minkowski sum, along with the previous case, we can calculate that ${\textstyle \mu ((A+B)_{2\epsilon })^{1/n}=\mu (A_{\epsilon }+B_{\epsilon })^{1/n}\geq \mu (A_{\epsilon })^{1/n}+\mu (B_{\epsilon })^{1/n}}$. Sending ${\textstyle \epsilon }$ to 0 establishes the result.

• The case of bounded measurable sets:

Recall that by the regularity theorem for Lebesgue measure for any bounded measurable set X, and for any ${\textstyle k>\geq }$, there is a compact set ${\textstyle X_{k}\subseteq X}$ with ${\textstyle \mu (X\setminus X_{k})<1/k}$. Thus, ${\textstyle \mu (A+B)\geq \mu (A_{k}+B_{k})\geq (\mu (A_{k})^{1/n}+\mu (B_{k})^{1/n})^{n}}$ for all k, using the case of Brunn–Minkowski shown for compact sets. Sending ${\textstyle k\to \infty }$ establishes the result.

• The case of measurable sets:

We let ${\textstyle A_{k}=[-k,k]^{n}\cap A,B_{k}=[-k,k]^{n}\cap B}$, and again argue using the previous case that ${\textstyle \mu (A+B)\geq \mu (A_{k}+B_{k})\geq (\mu (A_{k})^{1/n}+\mu (B_{k})^{1/n})^{n}}$, hence the result follows by sending k to infinity.

We give a proof of the Brunn–Minkowski inequality as a corollary to the Prékopa–Leindler inequality, a functional version of the BM inequality. We will first prove PL, and then show that PL implies a multiplicative version of BM, then show that multiplicative BM implies additive BM. The argument here is simpler than the proof via cuboids, in particular, we only need to prove the BM inequality in one dimensions. This happens because the more general statement of the PL-inequality than the BM-inequality allows for an induction argument.

• The multiplicative form of the BM inequality

First, we note that the Brunn–Minkowski inequality implies a multiplicative version, using the inequality ${\textstyle \lambda x+(1-\lambda )y\geq x^{\lambda }y^{\lambda }}$, which holds for ${\textstyle x,y\geq 0,\lambda \in [0,1]}$. In particular, ${\textstyle \mu (\lambda A+(1-\lambda )B)\geq (\lambda \mu (A)^{1/n}+(1-\lambda )\mu (B)^{1/n})^{n}\geq \mu (A)^{\lambda }\mu (B)^{1-\lambda }}$. The Prékopa–Leindler inequality is a functional generalization of this version of Brunn–Minkowski.

• Prékopa–Leindler inequality

Theorem (Prékopa–Leindler inequality): Fix ${\textstyle \lambda \in (0,1)}$. Let ${\textstyle f,g,h:\mathbb {R} ^{n}\to \mathbb {R} _{+}}$ be non-negative, measurable functions satisfying ${\textstyle h(\lambda x+(1-\lambda )y)\geq f(x)^{\lambda }g(y)^{1-\lambda }}$ for all ${\textstyle x,y\in \mathbb {R} ^{n}}$. Then ${\textstyle \int _{\mathbb {R} ^{n}}h(x)dx\geq (\int _{\mathbb {R} ^{n}}f(x)dx)^{\lambda }(\int _{\mathbb {R} ^{n}}g(x)dx)^{1-\lambda }}$.

Proof (Mostly following this lecture):

We will need the one dimensional version of BM, namely that if ${\textstyle A,B,A+B\subseteq \mathbb {R} }$ are measurable, then ${\textstyle \mu (A+B)\geq \mu (A)+\mu (B)}$. First, assuming that ${\textstyle A,B}$ are bounded, we shift ${\textstyle A,B}$ so that ${\textstyle A\cap B=\{0\}}$. Thus, ${\textstyle A+B\supset A\cup B}$, whence by almost disjointedness we have that ${\textstyle \mu (A+B)\geq \mu (A)+\mu (B)}$. We then pass to the unbounded case by filtering with the intervals ${\textstyle [-k,k].}$

We first show the ${\textstyle n=1}$ case of the PL inequality. Let ${\textstyle L_{h}(t)=\{x:h(x)\geq t\}}$, and note that ${\textstyle L_{h}(t)\supseteq \lambda L_{f}(t)+(1-\lambda )L_{g}(t)}$. Thus, by the one-dimensional version of Brunn–Minkowski, we have that ${\textstyle \mu (L_{h}(t))\geq \mu (\lambda L_{f}(t)+(1-\lambda )L_{g}(t))\geq \lambda \mu (L_{f}(t))+(1-\lambda )\mu (L_{g}(t))}$. We recall that if ${\textstyle f(x)}$ is non-negative, then Fubini's theorem implies ${\textstyle \int _{\mathbb {R} }h(x)dx=\int _{t\geq 0}\mu (L_{h}(t))dt}$. Then, we have that ${\textstyle \int _{\mathbb {R} }h(x)dx=\int _{t\geq 0}\mu (L_{h}(t))dt\geq \lambda \int _{t\geq 0}\mu (L_{f}(t))+(1-\lambda )\int _{t\geq 0}\mu (L_{g}(t))=\lambda \int _{\mathbb {R} }f(x)dx+(1-\lambda )\int _{\mathbb {R} }g(x)dx\geq (\int _{\mathbb {R} }f(x)dx)^{\lambda }(\int _{\mathbb {R} }g(x)dx)^{1-\lambda }}$, where in the last step we use the weighted AM–GM inequality, which asserts that ${\textstyle \lambda x+(1-\lambda )y\geq x^{\lambda }y^{1-\lambda }}$ for ${\textstyle \lambda \in (0,1),x,y\geq 0}$.

Now we prove the ${\textstyle n>1}$ case. For ${\textstyle x,y\in \mathbb {R} ^{n-1},\alpha ,\beta \in \mathbb {R} }$, we pick ${\textstyle \lambda \in [0,1]}$ and set ${\textstyle \gamma =\lambda \alpha +(1-\lambda )\beta }$. For any c, we define ${\textstyle h_{c}(x)=h(x,c)}$, that is, defining a new function on n-1 variables by setting the last variable to be ${\textstyle c}$. Applying the hypothesis and doing nothing but formal manipulation of the definitions, we have that ${\textstyle h_{\gamma }(\lambda x+(1-\lambda )y)=h(\lambda x+(1-\lambda )y,\lambda \alpha +(1-\lambda )\beta ))=h(\lambda (x,\alpha )+(1-\lambda )(y,\beta ))\geq f(x,\alpha )^{\lambda }g(y,\beta )^{1-\lambda }=f_{\alpha }(x)^{\lambda }g_{\beta }(y)^{1-\lambda }}$.

Thus, by the inductive case applied to the functions ${\textstyle h_{\gamma },f_{\alpha },g_{\beta }}$, we obtain ${\textstyle \int _{\mathbb {R} ^{n-1}}h_{\gamma }(z)dz\geq (\int _{\mathbb {R} ^{n-1}}f_{\alpha }(z)dz)^{\lambda }(\int _{\mathbb {R} ^{n-1}}g_{\beta }(z)dz)^{1-\lambda }}$. We define ${\textstyle H(\gamma ):=\int _{\mathbb {R} ^{n-1}}h_{\gamma }(z)dz}$ and ${\textstyle F(\alpha ),G(\beta )}$ similarly. In this notation, the previous calculation can be rewritten as: ${\textstyle H(\lambda \alpha +(1-\lambda )\beta )\geq F(\alpha )^{\lambda }G(\beta )^{1-\lambda }}$. Since we have proven this for any fixed ${\textstyle \alpha ,\beta \in \mathbb {R} }$, this means that the function ${\textstyle H,F,G}$ satisfy the hypothesis for the one dimensional version of the PL theorem. Thus, we have that ${\textstyle \int _{\mathbb {R} }H(\gamma )d\gamma \geq (\int _{\mathbb {R} }F(\alpha )d\alpha )^{\lambda }(\int _{\mathbb {R} }F(\beta )d\beta )^{1-\lambda }}$, implying the claim by Fubini's theorem. QED

• PL implies multiplicative BM

The multiplicative version of Brunn–Minkowski follows from the PL inequality, by taking ${\textstyle h=1_{\lambda A+(1-\lambda )B},f=1_{A},g=1_{B}}$.

• Multiplicative BM implies Additive BM

We now explain how to derive the BM-inequality from the PL-inequality. First, by using the indicator functions for ${\textstyle A,B,\lambda A+(1-\lambda )B}$ Prékopa–Leindler inequality quickly gives the multiplicative version of Brunn–Minkowski: ${\textstyle \mu (\lambda A+(1-\lambda )B)\geq \mu (A)^{\lambda }\mu (B)^{1-\lambda }}$. We now show how the multiplicative BM-inequality implies the usual, additive version.

We assume that both A,B have positive volume, as otherwise the inequality is trivial, and normalize them to have volume 1 by setting ${\textstyle A'={\frac {A}{\mu (A)^{1/n}}},B'={\frac {B}{\mu (B)^{1/n}}}}$. We define ${\textstyle \lambda '={\frac {\lambda \mu (B)^{1/n}}{(1-\lambda )\mu (A)^{1/n}+\lambda \mu (B)^{1/n}}}}$; note that ${\textstyle 1-\lambda '={\frac {(1-\lambda )\mu (A)^{1/n}}{(1-\lambda )\mu (A)^{1/n}+\lambda \mu (B)^{1/n}}}}$. With these definitions, and using that ${\textstyle \mu (A')=\mu (B')=1}$, we calculate using the multiplicative Brunn–Minkowski inequality that:

${\displaystyle \mu ({\frac {(1-\lambda )A+\lambda B}{(1-\lambda )\mu (A)^{1/n}+\lambda \mu (B)^{1/n}}})=\mu ((1-\lambda ')A'+\lambda 'B)\geq \mu (A')^{1-\lambda '}\mu (B')^{\lambda '}=1.}$

The additive form of Brunn–Minkowski now follows by pulling the scaling out of the leftmost volume calculation and rearranging.