[Paper Review] The Calabi-Yau conjectures for embedded surfaces
This paper proves the Calabi-Yau conjectures for embedded minimal surfaces in ℝ³ by establishing a chord arc bound that implies properness: any complete embedded minimal disk must be proper, meaning its intrinsic distance to infinity implies extrinsic distance to infinity. The key result is a quantitative estimate relating intrinsic and extrinsic distances under curvature normalization, resolving long-standing conjectures about unboundedness and projections of embedded minimal surfaces.
In this paper we will prove the Calabi-Yau conjectures for embedded surfaces. In fact, we will prove considerably more. The Calabi-Yau conjectures about surfaces date back to the 1960s. Much work has been done on them over the past four decades. In particular, examples of Jorge-Xavier from 1980 and Nadirashvili from 1996 showed that the immersed versions were false; we will show here that for embedded surfaces, i.e., injective immersions, they are in fact true.
Motivation & Objective
- To resolve the Calabi-Yau conjectures for embedded minimal surfaces in ℝ³, which assert that such surfaces must be unbounded and have unbounded projections in every (n−2)-dimensional subspace.
- To establish a chord arc bound that controls intrinsic distances in terms of extrinsic distances, under a curvature normalization condition.
- To prove that complete embedded minimal disks in ℝ³ are necessarily proper, thereby excluding compact or bounded embeddings.
- To answer Yau’s 2000 question on the geometry of complete minimal surfaces properly immersed in the unit ball, showing such surfaces cannot be embedded.
- To extend the one-sided curvature estimate to intrinsic balls, providing a new intrinsic version of a key estimate in minimal surface theory.
Proposed method
- Introduce a chord arc bound: for an embedded minimal disk Σ, if sup_B_{r₀} |A|² > r₀⁻², then C·dist_Σ(x,0) < |x| + r₀ for x ∈ B_R(0).
- Use the curvature normalization sup_B_{r₀} |A|² > r₀⁻² as a necessary condition to prevent trivial scaling collapse.
- Apply the one-sided curvature estimate from [CM6] to intrinsic balls, deriving a curvature bound in terms of intrinsic radius.
- Use multi-valued graphs (N-valued graphs over the universal cover of the punctured plane) to model helicoid-like behavior and control geometry.
- Apply a contradiction argument via separation of sheets in multi-valued graphs and finite total curvature to rule out non-proper behavior.
- Use the Gauss equation to relate |A|² to intrinsic curvature, ensuring the normalization is geometrically meaningful.
Experimental results
Research questions
- RQ1Can a complete embedded minimal surface in ℝ³ be bounded or properly immersed in a bounded domain like the unit ball?
- RQ2Does every complete embedded minimal disk in ℝ³ have unbounded intrinsic and extrinsic diameter?
- RQ3Is there a quantitative geometric condition (e.g., chord arc bound) that implies properness for embedded minimal surfaces?
- RQ4Can the one-sided curvature estimate be extended from extrinsic to intrinsic balls?
- RQ5What is the asymptotic geometry of embedded minimal surfaces with finite topology or finite total curvature?
Key findings
- A complete embedded minimal disk in ℝ³ must be proper: as intrinsic distance from the origin tends to infinity, so does the extrinsic distance.
- The chord arc bound (0.1) provides a quantitative control: C·dist_Σ(x,0) < |x| + r₀ whenever sup_B_{r₀} |A|² > r₀⁻².
- The intrinsic one-sided curvature estimate (0.3) holds: if an embedded minimal disk lies above {x₃ > 0} and |x| < εR in an intrinsic ball of radius 2R, then sup_B_R(x) |A|² ≤ R⁻².
- Nadirashvili’s example of a complete immersed minimal disk in the unit ball cannot be embedded, resolving a key open question.
- Embedded minimal surfaces with finite topology are proper, as each end is properly embedded and asymptotic to a plane or catenoid.
- Finite total curvature of an end implies asymptoticity to a plane or half-catenoid, and such ends satisfy the chord arc bound.
Better researchstarts right now
From reading papers to final review, dramatically reduce your research time.
No credit card · Free plan available
This review was created by AI and reviewed by human editors.