Two dimensions are easier (Q330089)

From MaRDI portal





scientific article; zbMATH DE number 6642793
Language Label Description Also known as
default for all languages
No label defined
    English
    Two dimensions are easier
    scientific article; zbMATH DE number 6642793

      Statements

      Two dimensions are easier (English)
      0 references
      24 October 2016
      0 references
      The classical isoperimetric inequality states that among sets of given perimeter, the ball contains the maximal volume. Equivalently, a ball of given volume has minimal perimeter among sets of the same volume. In this paper, the author presents a short proof of the classical isoperimetric inequality in two dimensions. In two dimensions, one may assume that the set of minimal perimeter is connected and bounded, otherwise its perimeter is infinite. Moreover, in two dimensions the set of minimal perimeter is simply connected, because filling any holes reduces the perimeter and increases the area. Finally, in two dimensions one can take the convex hull of a minimizing domain, which does not increase the perimeter nor decrease the enclosed area, and see that optimal domains must be convex. Once the optimal domain is known to be convex, its boundary can be locally represented as a Lipschitz function and the existence of an optimal domain follows from Blaschke's selection theorem. From standard arguments in the calculus of variations, its boundary must have constant curvature. The author maximizes the area \(A(\Omega)\) subject to the length \(L(\partial\Omega)\) in polar coordinates. So among periodic functions \(r(\theta)\) one can look at the functional \(A+\lambda L\) with Euler-Lagrange equation to show that the curvature \(\kappa\) of \(\partial\Omega\) is constant, which implies that the optimal domain is a disc. For higher dimensions, the author presents six open problems.
      0 references
      0 references
      isoperimetric inequality
      0 references
      Cheeger set
      0 references
      Meissner bodies
      0 references
      Ulam floating
      0 references
      Euler elastica
      0 references
      farthest point distance function
      0 references
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references