The Nitsche--Hopf conjecture for minimal graphs
Abstract
We prove the Nitsche--Hopf conjecture for non-parametric minimal graphs over disks. If is a minimal graph over a disk of radius , and if is the point above the center, then Here is the Gaussian curvature and 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 , but it does not by itself control the normalized quantity : the slope factor 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 of the harmonic projection. The equation , written in harmonic-measure coordinates, reduces the sharp Hopf estimate to a scalar derivative inequality at the admissible zero of a monotone function . 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 throughout the normalized Scherk-type comparison family, evaluated at the distinguished point corresponding to the center.
Keywords
Cite
@article{arxiv.2605.10140,
title = {The Nitsche--Hopf conjecture for minimal graphs},
author = {David Kalaj and Jian-Feng Zhu},
journal= {arXiv preprint arXiv:2605.10140},
year = {2026}
}
Comments
28 pages, some misprints eliminated