A generalization of Rado's theorem for almost graphical boundaries (Q2575660): Difference between revisions

Rado's theorem states that if \(\Omega\subset \mathbb R^2\) is a convex subset and \(\sigma\subset \mathbb R^3\) is a simple closed curve which is graphical over \(\partial\Omega\), then any minimal surface \(\Sigma\subset \mathbb R^3\) with \(\partial\Sigma= \sigma\) must be a disk which is graphical over \(\Omega\), and hence unique by the maximum principle. The authors generalize Rado's theorem for the case in which \(\sigma\) is not graphical, but satisfies some ``almost graphical'' condition. They show that, although \(\Sigma\) is obviously not graphical near its boundary, if they move far enough in from the boundary, \(\Sigma\) will be graphical. First, they consider the genus zero case, and then generalize to higher genus surfaces. Theorem: There exists a \(C> 0\) (not depending on \(\Sigma\)) such that if \(\Sigma\) is an embedded minimal surface of genus \(n\), \(n\geq 0\), with \(C\), \(h\)-almost graphical boundary \(\sigma= \partial\Sigma\subset\partial B_R\), then \(\Sigma\cap B_{R-(64n+ 30)h}\) is graphical.