The Nitsche--Hopf conjecture for minimal graphs
David Kalaj, Jian-Feng Zhu

TL;DR
This paper proves the sharp Nitsche--Hopf conjecture for minimal graphs over disks, establishing precise bounds on Gaussian curvature and the normal component, using harmonic projection and comparison theorems.
Contribution
It introduces a novel approach combining harmonic projection and comparison theorems to establish sharp curvature bounds for minimal graphs over disks.
Findings
Proved the sharp Nitsche--Hopf conjecture for minimal graphs.
Established two-sided bounds for the normalized quantity W^2|K|.
Connected the curvature bounds to harmonic projection and comparison theorems.
Abstract
We prove the Nitsche--Hopf conjecture for non-parametric minimal graphs over disks. If \(S\) is a minimal graph over a disk of radius \(R\), and if \(\xi\) is the point above the center, then \[ W(\xi)^2 |K(\xi)|<\frac{\pi^2}{2R^2}. \] Here \(K\) is the Gaussian curvature and \[ W=\sqrt{1+|\nabla u|^2}=\frac1{n_3} \] is the reciprocal of the vertical component of the upward unit normal. The constant is sharp, as shown by the horizontal tangent-plane extremal sequence of Finn and Osserman. The main difficulty is that the bicentric-quadrilateral comparison theorem for Gaussian curvature controls \(|K|\), but it does not by itself control the normalized quantity \(W^2|K|\): the slope factor \(W\) can be arbitrarily large. We show that the missing information is recovered inside the Scherk-type comparison family from the zero equation for the horizontal harmonic projection. More…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
