Explicit Determination in RN of (N-1)-Dimensional Area Minimizing Surfaces with Arbitrary Boundaries
Abstract
Let N3 be an integer and B be a smooth, compact, oriented, (N-2)-dimensional boundary in RN. In 1960, H. Federer and W. Fleming proved that there is an (N-1)-dimensional integral current spanning surface of least area. The proof was by compactness methods and non-constructive. In 1970 H. Federer proved the definitive regularity result for such a codimension one minimizing surface. Thus it is a question of long standing whether there is a numerical algorithm that will closely approximate the area minimizing surface. The principal result of this paper is an algorithm that solves this problem. Specifically, given a neighborhood U around B in RN and a tolerance ε>0, we prove that one can explicitly compute in finite time an (N-1)-dimensional integral current T with the following approximation requirements: (1) spt(∂ T)⊂ U. (2) B and ∂ T are within distance ε in the Hausdorff distance. (3) B and ∂ T are within distance ε in the flat norm distance. (4) M(T)<ε+∈f\ M(S):∂ S=B\. (5) Every area minimizing current R with ∂ R=∂ T is within flat norm distance ε of T.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.