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.