Isoperimetric inequality

The classical isoperimetric problem dates back to antiquity.^[2] The problem can be stated as follows: Among all closed curves in the plane of fixed perimeter, which curve (if any) maximizes the area of its enclosed region? This question can be shown to be equivalent to the following problem: Among all closed curves in the plane enclosing a fixed area, which curve (if any) minimizes the perimeter?

This problem is conceptually related to the principle of least action in physics, in that it can be restated: what is the principle of action which encloses the greatest area, with the greatest economy of effort?^{[citation needed]} The 15th-century philosopher and scientist, Cardinal Nicholas of Cusa, considered rotational action, the process by which a circle is generated, to be the most direct reflection, in the realm of sensory impressions, of the process by which the universe is created. German astronomer and astrologer Johannes Kepler invoked the isoperimetric principle in discussing the morphology of the solar system, in Mysterium Cosmographicum (The Sacred Mystery of the Cosmos, 1596).

Although the circle appears to be an obvious solution to the problem, proving this fact is rather difficult. The first progress toward the solution was made by Swiss geometer Jakob Steiner in 1838, using a geometric method later named Steiner symmetrisation.^[3] Steiner showed that if a solution existed, then it must be the circle. Steiner's proof was completed later by several other mathematicians.

Steiner begins with some geometric constructions which are easily understood; for example, it can be shown that any closed curve enclosing a region that is not fully convex can be modified to enclose more area, by "flipping" the concave areas so that they become convex. It can further be shown that any closed curve which is not fully symmetrical can be "tilted" so that it encloses more area. The one shape that is perfectly convex and symmetrical is the circle, although this, in itself, does not represent a rigorous proof of the isoperimetric theorem (see external links).

The solution to the isoperimetric problem is usually expressed in the form of an inequality that relates the length L of a closed curve and the area A of the planar region that it encloses. The isoperimetric inequality states that

${\displaystyle 4\pi A\leq L^{2},}$ 

and that the equality holds if and only if the curve is a circle. The area of a disk of radius R is πR² and the circumference of the circle is 2πR, so both sides of the inequality are equal to 4π²R² in this case.

Dozens of proofs of the isoperimetric inequality have been found. In 1902, Hurwitz published a short proof using the Fourier series that applies to arbitrary rectifiable curves (not assumed to be smooth). An elegant direct proof based on comparison of a smooth simple closed curve with an appropriate circle was given by E. Schmidt in 1938. It uses only the arc length formula, expression for the area of a plane region from Green's theorem, and the Cauchy–Schwarz inequality.

For a given closed curve, the isoperimetric quotient is defined as the ratio of its area and that of the circle having the same perimeter. This is equal to

${\displaystyle Q={\frac {4\pi A}{L^{2}}}}$ 

and the isoperimetric inequality says that Q ≤ 1. Equivalently, the isoperimetric ratio L²/A is at least 4π for every curve.

The isoperimetric quotient of a regular n-gon is

${\displaystyle Q_{n}={\frac {\pi }{n\tan(\pi /n)}}.}$ 

Let ${\displaystyle C}$  be a smooth regular convex closed curve. Then the improved isoperimetric inequality states the following

${\displaystyle L^{2}\geqslant 4\pi A+8\pi \left|{\widetilde {A}}_{0.5}\right|,}$ 

where ${\displaystyle L,A,{\widetilde {A}}_{0.5}}$  denote the length of ${\displaystyle C}$ , the area of the region bounded by ${\displaystyle C}$  and the oriented area of the Wigner caustic of ${\displaystyle C}$ , respectively, and the equality holds if and only if ${\displaystyle C}$  is a curve of constant width.^[4]

Let C be a simple closed curve on a sphere of radius 1. Denote by L the length of C and by A the area enclosed by C. The spherical isoperimetric inequality states that

${\displaystyle L^{2}\geq A(4\pi -A),}$ 

and that the equality holds if and only if the curve is a circle. There are, in fact, two ways to measure the spherical area enclosed by a simple closed curve, but the inequality is symmetric with the respect to taking the complement.

This inequality was discovered by Paul Lévy (1919) who also extended it to higher dimensions and general surfaces.^[5]

In the more general case of arbitrary radius R, it is known^[6] that

${\displaystyle L^{2}\geq 4\pi A-{\frac {A^{2}}{R^{2}}}.}$ 

The isoperimetric inequality states that a sphere has the smallest surface area per given volume. Given a bounded open set ${\displaystyle S\subset \mathbb {R} ^{n}}$  with ${\displaystyle C^{1}}$  boundary, having surface area ${\displaystyle \operatorname {per} (S)}$  and volume ${\displaystyle \operatorname {vol} (S)}$ , the isoperimetric inequality states

${\displaystyle \operatorname {per} (S)\geq n\operatorname {vol} (S)^{(n-1)/n}\,\operatorname {vol} (B_{1})^{1/n},}$ 

where ${\displaystyle B_{1}\subset \mathbb {R} ^{n}}$  is a unit ball. The equality holds when ${\displaystyle S}$  is a ball in ${\displaystyle \mathbb {R} ^{n}}$ . Under additional restrictions on the set (such as convexity, regularity, smooth boundary), the equality holds for a ball only. But in full generality the situation is more complicated. The relevant result of Schmidt (1949, Sect. 20.7) (for a simpler proof see Baebler (1957)) is clarified in Hadwiger (1957, Sect. 5.2.5) as follows. An extremal set consists of a ball and a "corona" that contributes neither to the volume nor to the surface area. That is, the equality holds for a compact set ${\displaystyle S}$  if and only if ${\displaystyle S}$  contains a closed ball ${\displaystyle B}$  such that ${\displaystyle \operatorname {vol} (B)=\operatorname {vol} (S)}$  and ${\displaystyle \operatorname {per} (B)=\operatorname {per} (S).}$  For example, the "corona" may be a curve.

The proof of the inequality follows directly from Brunn–Minkowski inequality between a set ${\displaystyle S}$  and a ball with radius ${\displaystyle \epsilon }$ , i.e. ${\displaystyle B_{\epsilon }=\epsilon B_{1}}$ . By taking Brunn–Minkowski inequality to the power ${\displaystyle n}$ , subtracting ${\displaystyle \operatorname {vol} (S)}$  from both sides, dividing them by ${\displaystyle \epsilon }$ , and taking the limit as ${\displaystyle \epsilon \to 0.}$  (Osserman (1978); Federer (1969, §3.2.43)).

In full generality (Federer 1969, §3.2.43), the isoperimetric inequality states that for any set ${\displaystyle S\subset \mathbb {R} ^{n}}$  whose closure has finite Lebesgue measure

${\displaystyle n\,\omega _{n}^{1/n}L^{n}({\bar {S}})^{(n-1)/n}\leq M_{*}^{n-1}(\partial S)}$ 

where ${\displaystyle M_{*}^{n-1}}$  is the (n-1)-dimensional Minkowski content, Lⁿ is the n-dimensional Lebesgue measure, and ω_n is the volume of the unit ball in ${\displaystyle \mathbb {R} ^{n}}$ . If the boundary of S is rectifiable, then the Minkowski content is the (n-1)-dimensional Hausdorff measure.

The n-dimensional isoperimetric inequality is equivalent (for sufficiently smooth domains) to the Sobolev inequality on ${\displaystyle \mathbb {R} ^{n}}$  with optimal constant:

${\displaystyle \left(\int _{\mathbb {R} ^{n}}|u|^{n/(n-1)}\right)^{(n-1)/n}\leq n^{-1}\omega _{n}^{-1/n}\int _{\mathbb {R} ^{n}}|\nabla u|}$ 

for all ${\displaystyle u\in W^{1,1}(\mathbb {R} ^{n})}$ .

Hadamard manifolds are complete simply connected manifolds with nonpositive curvature. Thus they generalize the Euclidean space ${\displaystyle \mathbb {R} ^{n}}$ , which is a Hadamard manifold with curvature zero. In 1970's and early 80's, Thierry Aubin, Misha Gromov, Yuri Burago, and Viktor Zalgaller conjectured that the Euclidean isoperimetric inequality

${\displaystyle \operatorname {per} (S)\geq n\operatorname {vol} (S)^{(n-1)/n}\operatorname {vol} (B_{1})^{1/n}}$ 

holds for bounded sets ${\displaystyle S}$  in Hadamard manifolds, which has become known as the Cartan–Hadamard conjecture. In dimension 2 this had already been established in 1926 by André Weil, who was a student of Hadamard at the time. In dimensions 3 and 4 the conjecture was proved by Bruce Kleiner in 1992, and Chris Croke in 1984 respectively.

Most of the work on isoperimetric problem has been done in the context of smooth regions in Euclidean spaces, or more generally, in Riemannian manifolds. However, the isoperimetric problem can be formulated in much greater generality, using the notion of Minkowski content. Let ${\displaystyle (X,\mu ,d)}$  be a metric measure space: X is a metric space with metric d, and μ is a Borel measure on X. The boundary measure, or Minkowski content, of a measurable subset A of X is defined as the lim inf

${\displaystyle \mu ^{+}(A)=\liminf _{\varepsilon \to 0+}{\frac {\mu (A_{\varepsilon })-\mu (A)}{\varepsilon }},}$ 

where

${\displaystyle A_{\varepsilon }=\{x\in X|d(x,A)\leq \varepsilon \}}$ 

is the ε-extension of A.

The isoperimetric problem in X asks how small can ${\displaystyle \mu ^{+}(A)}$  be for a given μ(A). If X is the Euclidean plane with the usual distance and the Lebesgue measure then this question generalizes the classical isoperimetric problem to planar regions whose boundary is not necessarily smooth, although the answer turns out to be the same.

The function

${\displaystyle I(a)=\inf\{\mu ^{+}(A)|\mu (A)=a\}}$ 

is called the isoperimetric profile of the metric measure space ${\displaystyle (X,\mu ,d)}$ . Isoperimetric profiles have been studied for Cayley graphs of discrete groups and for special classes of Riemannian manifolds (where usually only regions A with regular boundary are considered).

In graph theory, isoperimetric inequalities are at the heart of the study of expander graphs, which are sparse graphs that have strong connectivity properties. Expander constructions have spawned research in pure and applied mathematics, with several applications to complexity theory, design of robust computer networks, and the theory of error-correcting codes.^[7]

Isoperimetric inequalities for graphs relate the size of vertex subsets to the size of their boundary, which is usually measured by the number of edges leaving the subset (edge expansion) or by the number of neighbouring vertices (vertex expansion). For a graph ${\displaystyle G}$  and a number ${\displaystyle k}$ , the following are two standard isoperimetric parameters for graphs.^[8]

• The edge isoperimetric parameter: $${\displaystyle \Phi _{E}(G,k)=\min _{S\subseteq V}\left\{|E(S,{\overline {S}})|:|S|=k\right\}}$$ 
• The vertex isoperimetric parameter: $${\displaystyle \Phi _{V}(G,k)=\min _{S\subseteq V}\left\{|\Gamma (S)\setminus S|:|S|=k\right\}}$$ 

Here ${\displaystyle E(S,{\overline {S}})}$  denotes the set of edges leaving ${\displaystyle S}$  and ${\displaystyle \Gamma (S)}$  denotes the set of vertices that have a neighbour in ${\displaystyle S}$ . The isoperimetric problem consists of understanding how the parameters ${\displaystyle \Phi _{E}}$  and ${\displaystyle \Phi _{V}}$  behave for natural families of graphs.

The ${\displaystyle d}$ -dimensional hypercube ${\displaystyle Q_{d}}$  is the graph whose vertices are all Boolean vectors of length ${\displaystyle d}$ , that is, the set ${\displaystyle \{0,1\}^{d}}$ . Two such vectors are connected by an edge in ${\displaystyle Q_{d}}$  if they are equal up to a single bit flip, that is, their Hamming distance is exactly one. The following are the isoperimetric inequalities for the Boolean hypercube.^[9]

The edge isoperimetric inequality of the hypercube is ${\displaystyle \Phi _{E}(Q_{d},k)\geq k(d-\log _{2}k)}$ . This bound is tight, as is witnessed by each set ${\displaystyle S}$  that is the set of vertices of any subcube of ${\displaystyle Q_{d}}$ .

Harper's theorem^[10] says that Hamming balls have the smallest vertex boundary among all sets of a given size. Hamming balls are sets that contain all points of Hamming weight at most ${\displaystyle r}$  and no points of Hamming weight larger than ${\displaystyle r+1}$  for some integer ${\displaystyle r}$ . This theorem implies that any set ${\displaystyle S\subseteq V}$  with

${\displaystyle |S|\geq \sum _{i=0}^{r}{d \choose i}}$ 

satisfies

${\displaystyle |S\cup \Gamma (S)|\geq \sum _{i=0}^{r+1}{d \choose i}.}$ ^[11]

As a special case, consider set sizes ${\displaystyle k=|S|}$  of the form

${\displaystyle k={d \choose 0}+{d \choose 1}+\dots +{d \choose r}}$ 

for some integer ${\displaystyle r}$ . Then the above implies that the exact vertex isoperimetric parameter is

${\displaystyle \Phi _{V}(Q_{d},k)={d \choose r+1}.}$ ^[12]

The isoperimetric inequality for triangles in terms of perimeter p and area T states that^[13]

${\displaystyle p^{2}\geq 12{\sqrt {3}}\cdot T,}$ 

with equality for the equilateral triangle. This is implied, via the AM–GM inequality, by a stronger inequality which has also been called the isoperimetric inequality for triangles:^[14]

${\displaystyle T\leq {\frac {\sqrt {3}}{4}}(abc)^{2/3}.}$ 

• Blaschke–Lebesgue theorem
• Chaplygin problem: isoperimetric problem is a zero wind speed case of Chaplygin problem
• Curve-shortening flow
• Expander graph
• Gaussian isoperimetric inequality
• Isoperimetric dimension
• Isoperimetric point
• List of triangle inequalities
• Planar separator theorem
• Mixed volume

• History of the Isoperimetric Problem at Convergence
• Treiberg: Several proofs of the isoperimetric inequality
• Isoperimetric Theorem at cut-the-knot