The flux of the minimal surface equation for a graph has a positive definite symmetric matrix derivative. Its eigenvalues are in the direction of and orthogonally; at every eigenvalue is one. On it satisfies
Thus an averaged linearization of a nonlinear divergence-form equation is uniformly elliptic where the relevant gradients are bounded. Pointwise positivity alone does not supply a uniform bound on an unbounded gradient range.
Gradient maximum principle for a minimal graph Created 2026-10-05 Updated 2026-10-06
For a solution of the minimal surface equation for a graph on the closure of a bounded domain,
Write with . Its differentiated operator , where , satisfies
The weak maximum principle for elliptic operators gives the result. Interior Schauder estimates justify differentiating a solution initially assumed only .
If a smooth minimal surface equation for a graph solution on is homogeneous of degree one, with , then its graph extends to a plane through zero. Its gradient is homogeneous of degree zero, so attains a global maximum on the unit sphere. The strong maximum principle for elliptic operators makes it constant. The differentiated equation in the gradient maximum principle for a minimal graph then forces , and degree-one homogeneity removes the affine constant. This argument applies to cones that are graphs of smooth functions away from their vertex; it is not a claim that every minimal surface cone is flat.
Write the minimal surface equation for a graph as in its weak formulation, where . For negative increments use the same difference quotient convention, so
For , the function is an admissible test function in . Commuting the first partial derivative with translation, then applying discrete integration by parts, gives
The fundamental theorem of calculus along a line segment gives the averaged linearization of a nonlinear divergence-form equation
Thus the backward difference quotient solves a linear equation in divergence form:
To verify the ellipticity of the minimal surface flux, compute
and hence
The eigenvalue parallel to is ; every orthogonal eigenvalue is . The same lower and upper bounds pass to the averaged symmetric matrix whenever both endpoint gradients have norm at most :
The printed hypothesis supplies such an on each relatively compact subset, uniformly for sufficiently small . It therefore establishes a locally uniformly elliptic operator. A single lower bound on all of additionally requires bounded gradients there and at the shifted points; this is automatic for bounded and fixed , but is not supplied on an arbitrary open set.
Integration by parts gives the minimal surface equation for a graph in nondivergence form:
Its eigenvalues are between and one. On each relatively compact subdomain, is bounded, so it is a uniformly elliptic operator. Since , its coefficient functions are locally Lipschitz. The interior Schauder estimate gives regularity for every ; differentiating and repeatedly applying regularity estimates gives .
Differentiate in direction . Each satisfies , with
For this yields
If , the principal coefficients are uniformly elliptic globally and the drift is bounded. The weak maximum principle for elliptic operators bounds by its boundary maximum. Boundary values are limits of interior values by continuity, proving the gradient maximum principle for a minimal graph:
Let , so has zero Dirichlet boundary condition. Using the supplied form of the minimal surface equation for a graph, set
For and , the difference bound implies
and
The shifted arguments stay in the permitted radius-two ball, and . The Laplacian with zero Dirichlet boundary condition has trivial null space by the maximum principle for harmonic functions. Choose small enough that and , for the constants in part (c) with . Its small-data existence for a nonlinear elliptic Dirichlet problem supplies , and solves the minimal surface equation for a graph with the required boundary values.
For a compactly supported variation , differentiation of the area functional at gives the first variation
After integration by parts, this is the minimal surface equation for a graph
For one has . The equation is invariant under this scaling, so solves it on for every .
The first variation of the graph area functional is
Thus the minimal surface equation for a graph is
or, in nondivergence form,
Differentiate the divergence equation with respect to . Then satisfies
where
The inverse first-fundamental-form matrix is
Thus vanishes exactly when
This is the minimal surface equation for a graph.
Part c supplies a bounded slope condition constant . Choose . Parts a and d give a constrained minimizer with , and part b makes it a minimizer over all of .
For , the Euler-Lagrange equation is the minimal surface equation for a graph
The Lipschitz bound confines to a compact set on which is uniformly positive definite, so the equation is uniformly elliptic. Interior regularity gives first, and repeated Schauder estimates then give smoothness in the interior.