# Isoperimetric inequality

Last updated

In mathematics, the isoperimetric inequality is a geometric inequality involving the perimeter of a set and its volume. In ${\displaystyle n}$-dimensional space ${\displaystyle \mathbb {R} ^{n}}$ the inequality lower bounds the surface area or perimeter ${\displaystyle \operatorname {per} (S)}$ of a set ${\displaystyle S\subset \mathbb {R} ^{n}}$ by its volume ${\displaystyle \operatorname {vol} (S)}$,

## Contents

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

where ${\displaystyle B_{1}\subset \mathbb {R} ^{n}}$ is a unit sphere. The equality holds only when ${\displaystyle S}$ is a sphere in ${\displaystyle \mathbb {R} ^{n}}$.

On a plane, i.e. when ${\displaystyle n=2}$, the isoperimetric inequality relates the square of the circumference of a closed curve and the area of a plane region it encloses. Isoperimetric literally means "having the same perimeter". Specifically in ${\displaystyle \mathbb {R} ^{2}}$, the isoperimetric inequality states, for the length L of a closed curve and the area A of the planar region that it encloses, that

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

and that equality holds if and only if the curve is a circle.

The isoperimetric problem is to determine a plane figure of the largest possible area whose boundary has a specified length. [1] The closely related Dido's problem asks for a region of the maximal area bounded by a straight line and a curvilinear arc whose endpoints belong to that line. It is named after Dido, the legendary founder and first queen of Carthage. The solution to the isoperimetric problem is given by a circle and was known already in Ancient Greece. However, the first mathematically rigorous proof of this fact was obtained only in the 19th century. Since then, many other proofs have been found.

The isoperimetric problem has been extended in multiple ways, for example, to curves on surfaces and to regions in higher-dimensional spaces. Perhaps the most familiar physical manifestation of the 3-dimensional isoperimetric inequality is the shape of a drop of water. Namely, a drop will typically assume a symmetric round shape. Since the amount of water in a drop is fixed, surface tension forces the drop into a shape which minimizes the surface area of the drop, namely a round sphere.

## The isoperimetric problem in the plane

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? 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).

## On a plane

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 πR2 and the circumference of the circle is 2πR, so both sides of the inequality are equal to 4π2R2 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 L2/A is at least 4π for every curve.

The isoperimetric quotient of a regular n-gon is

${\displaystyle Q_{n}={\frac {\pi }{n\tan {\tfrac {\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]

## On a sphere

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}}}.}$

## In Rn

The isoperimetric inequality states that a sphere has the smallest surface area per given volume. Given a bounded set ${\displaystyle S\subset \mathbb {R} ^{n}}$ with 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)^{\frac {n-1}{n}}\,\operatorname {vol} (B_{1})^{\frac {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}^{\frac {1}{n}}L^{n}({\bar {S}})^{\frac {n-1}{n}}\leq M_{*}^{n-1}(\partial S)}$

where ${\displaystyle M_{*}^{n-1}}$ is the (n-1)-dimensional Minkowski content, Ln 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|^{\frac {n}{n-1}}\right)^{\frac {n-1}{n}}\leq n^{-1}\omega _{n}^{-{\frac {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)^{\frac {n-1}{n}}\operatorname {vol} (B_{1})^{\frac {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.

## In a metric measure space

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).

## For graphs

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.

### Example: Isoperimetric inequalities for hypercubes

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]

#### Edge isoperimetric inequality

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}}$.

#### Vertex isoperimetric inequality

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]

## Isoperimetric inequality for triangles

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)^{\frac {2}{3}}.}$

## Notes

1. Blåsjö, Viktor (2005). "The Evolution of the Isoperimetric Problem". Amer. Math. Monthly. 112 (6): 526–566. doi:10.2307/30037526. JSTOR   30037526.
2. Olmo, Carlos Beltrán, Irene (4 January 2021). "Sobre mates y mitos". El País (in Spanish). Retrieved 14 January 2021.
3. J. Steiner, Einfacher Beweis der isoperimetrischen Hauptsätze, J. reine angew Math. 18, (1838), pp. 281296; and Gesammelte Werke Vol. 2, pp. 7791, Reimer, Berlin, (1882).
4. Zwierzyński, Michał (2016). "The improved isoperimetric inequality and the Wigner caustic of planar ovals". J. Math. Anal. Appl. 442 (2): 726–739. arXiv:. doi:10.1016/j.jmaa.2016.05.016. S2CID   119708226.
5. Gromov, Mikhail; Pansu, Pierre (2006). "Appendix C. Paul Levy's Isoperimetric Inequality". Metric Structures for Riemannian and Non-Riemannian Spaces. Modern Birkhäuser Classics. Dordrecht: Springer. p. 519. ISBN   9780817645830.
6. Osserman, Robert. "The Isoperimetric Inequality." Bulletin of the American Mathematical Society. 84.6 (1978) http://www.ams.org/journals/bull/1978-84-06/S0002-9904-1978-14553-4/S0002-9904-1978-14553-4.pdf
7. Definitions 4.2 and 4.3 of Hoory, Linial & Widgerson (2006)
8. See Bollobás (1986) and Section 4 in Hoory, Linial & Widgerson (2006)
9. Also stated in Hoory, Linial & Widgerson (2006)
10. Chakerian, G. D. "A Distorted View of Geometry." Ch. 7 in Mathematical Plums (R. Honsberger, editor). Washington, DC: Mathematical Association of America, 1979: 147.
11. Dragutin Svrtan and Darko Veljan, "Non-Euclidean Versions of Some Classical Triangle Inequalities", Forum Geometricorum 12, 2012, 197–209. http://forumgeom.fau.edu/FG2012volume12/FG201217.pdf

## Related Research Articles

In probability theory, the expected value is a generalization of the weighted average. Informally, the expected value is the arithmetic mean of a large number of independently selected outcomes of a random variable.

In mathematics, the Lp spaces are function spaces defined using a natural generalization of the p-norm for finite-dimensional vector spaces. They are sometimes called Lebesgue spaces, named after Henri Lebesgue, although according to the Bourbaki group they were first introduced by Frigyes Riesz.

In the mathematical field of real analysis, the monotone convergence theorem is any of a number of related theorems proving the convergence of monotonic sequences that are also bounded. Informally, the theorems state that if a sequence is increasing and bounded above by a supremum, then the sequence will converge to the supremum; in the same way, if a sequence is decreasing and is bounded below by an infimum, it will converge to the infimum.

In probability theory, Chebyshev's inequality guarantees that, for a wide class of probability distributions, no more than a certain fraction of values can be more than a certain distance from the mean. Specifically, no more than 1/k2 of the distribution's values can be k or more standard deviations away from the mean. The rule is often called Chebyshev's theorem, about the range of standard deviations around the mean, in statistics. The inequality has great utility because it can be applied to any probability distribution in which the mean and variance are defined. For example, it can be used to prove the weak law of large numbers.

In probability theory, Markov's inequality gives an upper bound for the probability that a non-negative function of a random variable is greater than or equal to some positive constant. It is named after the Russian mathematician Andrey Markov, although it appeared earlier in the work of Pafnuty Chebyshev, and many sources, especially in analysis, refer to it as Chebyshev's inequality or Bienaymé's inequality.

In Riemannian geometry, the sectional curvature is one of the ways to describe the curvature of Riemannian manifolds. The sectional curvature Kp) depends on a two-dimensional linear subspace σp of the tangent space at a point p of the manifold. It can be defined geometrically as the Gaussian curvature of the surface which has the plane σp as a tangent plane at p, obtained from geodesics which start at p in the directions of σp. The sectional curvature is a real-valued function on the 2-Grassmannian bundle over the manifold.

In mathematics, Jensen's inequality, named after the Danish mathematician Johan Jensen, relates the value of a convex function of an integral to the integral of the convex function. It was proved by Jensen in 1906, building on an earlier proof of the same inequality for doubly-differentiable functions by Otto Hölder in 1889. Given its generality, the inequality appears in many forms depending on the context, some of which are presented below. In its simplest form the inequality states that the convex transformation of a mean is less than or equal to the mean applied after convex transformation; it is a simple corollary that the opposite is true of concave transformations.

In probability theory, a Chernoff bound is an exponentially decreasing upper bound on the tail of a random variable based on its moment generating function. The minimum of all such exponential bounds forms the Chernoff or Chernoff-Cramér bound, which may decay faster than exponential. It is especially useful for sums of independent random variables, such as sums of Bernoulli random variables.

In mathematics, the isoperimetric dimension of a manifold is a notion of dimension that tries to capture how the large-scale behavior of the manifold resembles that of a Euclidean space.

In mathematics, the Brunn–Minkowski theorem is an inequality relating the volumes of compact subsets of Euclidean space. The original version of the Brunn–Minkowski theorem applied to convex sets; the generalization to compact nonconvex sets stated here is due to Lazar Lyusternik (1935).

In mathematics, the Grothendieck inequality states that there is a universal constant with the following property. If Mij is an n × n matrix with

In differential geometry, Pu's inequality, proved by Pao Ming Pu, relates the area of an arbitrary Riemannian surface homeomorphic to the real projective plane with the lengths of the closed curves contained in it.

In mathematics, a space, where is a real number, is a specific type of metric space. Intuitively, triangles in a space are "slimmer" than corresponding "model triangles" in a standard space of constant curvature . In a space, the curvature is bounded from above by . A notable special case is ; complete spaces are known as "Hadamard spaces" after the French mathematician Jacques Hadamard.

In Riemannian geometry, the Cheeger isoperimetric constant of a compact Riemannian manifold M is a positive real number h(M) defined in terms of the minimal area of a hypersurface that divides M into two disjoint pieces. In 1970, Jeff Cheeger proved an inequality that related the first nontrivial eigenvalue of the Laplace–Beltrami operator on M to h(M). This proved to be a very influential idea in Riemannian geometry and global analysis and inspired an analogous theory for graphs.

Systolic geometry is a branch of differential geometry, a field within mathematics, studying problems such as the relationship between the area inside a closed curve C, and the length or perimeter of C. Since the area A may be small while the length l is large, when C looks elongated, the relationship can only take the form of an inequality. What is more, such an inequality would be an upper bound for A: there is no interesting lower bound just in terms of the length.

In extremal graph theory, the forbidden subgraph problem is the following problem: given a graph , find the maximal number of edges an -vertex graph can have such that it does not have a subgraph isomorphic to . In this context, is called a forbidden subgraph.

The exponential mechanism is a technique for designing differentially private algorithms. It was developed by Frank McSherry and Kunal Talwar in 2007. Their work was recognized as a co-winner of the 2009 PET Award for Outstanding Research in Privacy Enhancing Technologies.

In mathematical analysis, the Pólya–Szegő inequality states that the Sobolev energy of a function in a Sobolev space does not increase under symmetric decreasing rearrangement. The inequality is named after the mathematicians George Pólya and Gábor Szegő.

In mathematics and theoretical computer science, analysis of Boolean functions is the study of real-valued functions on or from a spectral perspective. The functions studied are often, but not always, Boolean-valued, making them Boolean functions. The area has found many applications in combinatorics, social choice theory, random graphs, and theoretical computer science, especially in hardness of approximation, property testing, and PAC learning.