Isoperimetry

From Wikipedia, the free encyclopedia

(Redirected from Isoperimetric inequality)
Jump to: navigation, search

Isoperimetry literally means "having an equal perimeter". In mathematics, isoperimetry is the general study of geometric figures having equal boundaries.

Contents

If a region is not convex, a "dent" in its boundary can be "flipped" to increase the area of the region while keeping the perimeter unchanged.
If a region is not convex, a "dent" in its boundary can be "flipped" to increase the area of the region while keeping the perimeter unchanged.
An elongated shape can be made more round while keeping its perimeter fixed and increasing its area.
An elongated shape can be made more round while keeping its perimeter fixed and increasing its area.

The classical isoperimetric problem dates back to antiquity. 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.[citation needed] 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 theorem is usually stated in the form of an inequality that relates the perimeter and area of a closed curve in the plane. If P is the perimeter of the curve and A is the area of the region enclosed by the curve, then the inequality states that

4\pi A \le P^2.

For the case of a circle of radius r, we have A = πr2 and P = 2πr, and substituting these into the inequality shows that the circle does indeed maximize the area among all curves of fixed perimeter. In fact, the circle is the only curve that maximizes the area.

A stronger version of the inequality is Bonnesen's inequality, giving an estimate on the isoperimetric defect.

There are dozens of proofs of this classic inequality. Several of these are discussed in the Treiberg paper below. In 1901, Hurwitz gave a purely analytic proof of the classical isoperimetric inequality based on Fourier series and Green's theorem.

Modern formulations of isoperimetric problems are sometimes given in terms of sub-Riemannian geometry; Dido's problem specifically finds expression in terms of the Heisenberg group: given an arc connecting two points, the "height" z of a point in the Heisenberg group corresponds to the area subtended by the arc.

The isoperimetric theorem generalises to higher dimensional spaces: the domain with volume 1 with the minimal surface area is always a ball.

Let \scriptstyle(X,\, \mu,\, d) be a metric measure space (d is a metric on X and μ is a Borel measure). For \scriptstyle A \,\subset\, X, let

\mu^+(A) = \liminf_{\varepsilon \to 0} \frac{\mu(A_\varepsilon) - \mu(A)}{\varepsilon},

where

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

is the ε-extension of A.

(The number \scriptstyle \mu^+(A) is called the boundary measure of A in the sense of Minkowski, associated with μ.)

Then the (Minkowski) isoperimetric problem in A asks how small can \scriptstyle\mu^+(A) be, if μ(A) is given. More formally, the function \scriptstyle I(a) \,=\, \inf \{ \mu^+(A) \, | \, \mu(A)\, =\, a\} is called the isoperimetric profile of \scriptstyle(X,\, \mu,\, d).

For example, if \scriptstyle X\, =\, \mathbf{R}^2, \scriptstyle\mu\, =\, \text{Vol}_2 is the Lebesgue measure and d the Euclidean metric, the problem coincides with the isoperimetric problem in the plane, discussed above.

Advanced Search
Included Web Search Engines


Safe Search

close

Top Matching Results

Occasionally Search.com will highlight specialized results that are based on the context of your query. Examples of specialized results include specific links to news, images, or video.

Top Matching Results may highlight information from other Search.com pages, content from the CNET Network of sites, or third party content. The listings are based purely on relevance. Search.com does not receive payment for listings in this section but our partners that provide this data may get paid for listing these products.

Sponsored Links

This section contains paid listings which have been purchased by companies that want to have their sites appear for specific search terms and related content. These listings are administered, sorted and maintained by a third party and are not endorsed by Search.com.

Search Results

Search.com sends your search query to several search engines at one time and integrates the results into one list which has been sorted by relevance using Search.com's proprietary algorithm. You can customize the list of search engines included in your metasearch from the preferences.

The search engines that are used in your metasearch may allow companies to pay to have their Web sites included within the results. To view the Paid Inclusion policy for a specific search engine, please visit their Web site. Search.com does not accept payment or share revenue with any search engine partner for listings in this section.