The Nitsche--Hopf conjecture for minimal graphs
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 \(\) is the point above the center, then \[ W()2 |K()|<π22R2. \] Here \(K\) is the Gaussian curvature and \[ W=1+|∇ u|2=1n3 \] 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 \(W2|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 precisely, in the fixed-arc normalization the point corresponding to the center of the physical disk is a distinguished zero \(z\) of the harmonic projection. The equation \(f(z)=0\), written in harmonic-measure coordinates, reduces the sharp Hopf estimate to a scalar derivative inequality at the admissible zero of a monotone function \(GA,B\). We prove this scalar inequality on the full admissible parameter domain by a barrier argument and two explicit Bernstein-polynomial positivity certificates. Combined with the bicentric-quadrilateral comparison theorem of the first author and Melentijevi\'c, the Scherk-family estimate gives the sharp normalized Hopf estimate for arbitrary minimal graphs over disks. As a byproduct, we obtain the two-sided bound \[ π24≤ W2|K|≤ π22 \] throughout the normalized Scherk-type comparison family, evaluated at the distinguished point corresponding to the center.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.