Willmore Equation for Graphs
- Willmore equation for graphs is the Euler–Lagrange equation derived from the Willmore functional when surfaces are expressed as graphs, leading to a quasilinear fourth-order PDE.
- It reformulates geometric quantities like mean curvature, Gauss curvature, and the second fundamental form in graph variables, facilitating divergence and nondivergence analyses.
- The study encompasses Bernstein-type rigidity, low-regularity boundary value problems, and anisotropic numerical schemes, bridging geometric analysis with practical computational methods.
Searching arXiv for recent and foundational papers on the Willmore equation for graphs. The Willmore equation for graphs is the Euler–Lagrange equation associated with the Willmore functional when a surface in is represented nonparametrically as the graph of a height function. In the graphical setting, one studies surfaces of the form , with or , and rewrites the geometric equation in terms of , its gradient, and its Hessian. This produces a quasilinear fourth-order PDE whose structure can be expressed either intrinsically through the induced metric and the Laplace–Beltrami operator or explicitly in divergence form. The subject connects geometric analysis, elliptic and parabolic fourth-order PDE, symmetry reduction, Bernstein-type rigidity, boundary value problems, variational relaxation, and numerical approximation (Luo et al., 2011, Gulyak, 25 Sep 2025, Gulyak, 29 Mar 2026, Chen et al., 2014, Deckelnick et al., 2015, Oberhuber, 2011).
1. Geometric formulation for graphical surfaces
Let be represented as a graph
with smooth. In the notation used across the cited works, one writes and
so that 0 (Luo et al., 2011, Gulyak, 25 Sep 2025, Gulyak, 29 Mar 2026, Deckelnick et al., 2015). The induced metric is
1
with inverse
2
or equivalently
3
and the area element is
4
depending on the notation of the source (Luo et al., 2011, Gulyak, 25 Sep 2025, Gulyak, 29 Mar 2026, Deckelnick et al., 2015). With the upward orientation, the unit normal is
5
and for an entire graph the Gauss map image lies in the upper hemisphere 6 (Luo et al., 2011, Gulyak, 25 Sep 2025, Gulyak, 29 Mar 2026, Deckelnick et al., 2015).
The second fundamental form coefficients are
7
and the mean curvature is taken with the convention
8
so minimal graphs satisfy 9 (Luo et al., 2011). In graph variables,
0
and the Gauss curvature is
1
(Luo et al., 2011, Gulyak, 25 Sep 2025, Gulyak, 29 Mar 2026, Deckelnick et al., 2015). The squared norm of the second fundamental form satisfies the Gauss equation
2
in the convention of Luo and Sun (Luo et al., 2011). The trace-free second fundamental form 3 is not used directly in that note, but the standard decomposition recorded there is
4
hence
5
For a scalar function 6 on the graph, the Laplace–Beltrami operator is
7
and in particular Luo and Sun record for 8 the formula
9
(Luo et al., 2011, Gulyak, 25 Sep 2025).
2. Willmore functional and the graphical Euler–Lagrange equation
For a two-dimensional closed surface 0 with immersion 1, the Willmore functional is written in Luo–Sun as
2
while other cited graph papers write the graph energy as
3
or
4
reflecting different normalization conventions (Luo et al., 2011, Gulyak, 29 Mar 2026, Deckelnick et al., 2015). The convention 5 explains why the factor 6 appears in some formulations and why the graph formula for 7 carries no additional 8 (Luo et al., 2011).
The Willmore equation in 9 is
0
equivalently
1
and in the convention of (Luo et al., 2011) it is also equivalent to
2
(Luo et al., 2011, Gulyak, 25 Sep 2025, Gulyak, 29 Mar 2026). For graphs, this is a quasilinear fourth-order PDE for 3. A standard divergence formulation, derived in Deckelnick–Dziuk and used in several later works, is
4
with
5
(Luo et al., 2011, Gulyak, 25 Sep 2025, Gulyak, 29 Mar 2026, Chen et al., 2014).
This divergence identity is central because it exposes the PDE as a conservation law for a vector field built from 6. In the low-regularity boundary-value theory of (Gulyak, 25 Sep 2025), isolating the biharmonic term yields
7
where
8
9
and the pointwise bounds
0
hold (Gulyak, 25 Sep 2025). The same paper emphasizes that all monomials are at least cubic and that the highest derivatives enter at most quadratically in 1 and linearly in 2.
A complementary nondivergence expansion is used in the flow paper (Gulyak, 29 Mar 2026): 3 where the principal fourth-order part is
4
Its coefficients depend only on 5 via 6, and satisfy the ellipticity bound
7
Thus 8 is uniformly elliptic while 9 is bounded (Gulyak, 29 Mar 2026).
3. Entire graphs and Bernstein-type rigidity
A central rigidity result for the Willmore equation on graphs is the Bernstein-type theorem of Luo and Sun. They consider a smooth entire graph
0
satisfying the Willmore equation
1
and the integrability assumption
2
Their theorem states: “Every smooth, entire graphical solution of (2.1) with finite 3 norm of the mean curvature is a plane” (Luo et al., 2011).
The argument reduces the result to the earlier Chen–Lamm theorem that “Every smooth, entire graphical solution of (2.1) with finite 4 norm of the second fundamental form is a plane” (Luo et al., 2011). Luo and Sun prove that for any smooth entire graph in 5 with square integrable mean curvature,
6
Combined with
7
this yields
8
so 9 if and only if 0, and Chen–Lamm then applies (Luo et al., 2011).
The proof proceeds through two geometric ingredients. First, using the calibration argument of Colding–Minicozzi as cited in (Luo et al., 2011), one obtains quadratic area growth: 1 Second, because the Gauss map of a global graph takes values in the contractible upper hemisphere 2, the area form 3 on 4 satisfies 5 on 6, and
7
With a compactly supported cutoff 8, the estimate
9
is derived, and a logarithmic cutoff 0 satisfying
1
implies
2
This theorem is explicitly described in (Luo et al., 2011) as a Bernstein-type theorem for Willmore graphs, replacing the minimal surface condition by the Willmore Euler–Lagrange equation and assuming 3. Minimal graphs are included as the case 4.
4. Radial symmetry, ODE reduction, and inverted catenoids
For radially symmetric graphs 5, 6, Chen and Li derive a sharp reduction of the graphical Willmore equation to an ODE (Chen et al., 2014). Writing
7
the mean curvature becomes
8
and smoothness at the origin implies
9
The divergence-form graph equation becomes a radial divergence condition. If the associated radial scalar is denoted by 0, then
1
For smooth graphs on a full disk this forces 2, whereas on a punctured disk one obtains
3
for a constant 4 (Chen et al., 2014). In the smooth case, Chen and Li obtain the radial Willmore ODE
5
and in the punctured-disk case the inhomogeneous version
6
Their classification theorem states that if 7 is a smooth solution to the graphic Willmore equation on a disk centered at the origin, with 8 and mean curvature at 9 equal to 00, then either 01 and 02 is constant, or 03 and the graph is a spherical cap contained in the half-sphere of radius
04
given explicitly by
05
In particular, smooth radially symmetric entire Willmore graphs in 06 must be flat (Chen et al., 2014).
For smooth radial solutions on a punctured disk with 07, there exist a constant 08 and a function 09 such that
10
and the graph of 11 is contained in a translated graphical piece of an inverted catenoid uniquely determined by 12 and 13 (Chen et al., 2014). The inverted catenoid enters because minimal surfaces are mapped to Willmore surfaces under inversion. Chen and Li parametrize the catenoid by
14
apply inversion
15
and identify the punctured-disk radial Willmore graph with the outermost graphical piece 16 of the inverted catenoid, with
17
and 18 determined by matching the asymptotics (Chen et al., 2014).
The same paper shows that if
19
then a radial solution on the punctured disk extends across the puncture as a 20 function for any 21 and fits the inverted-catenoid model (Chen et al., 2014).
5. Boundary value problems and low-regularity existence theory
For graphs over bounded domains, the Willmore equation is naturally coupled to clamped boundary data. In the modern boundary-value literature, “clamped” means
22
so the boundary position and tangent half-planes are fixed along 23 (Gulyak, 29 Mar 2026, Gulyak, 25 Sep 2025). In the notation of (Gulyak, 25 Sep 2025), the quantity
24
represents the trace of 25 on 26 and enters the estimates.
A major recent development is the low-regularity theory of graphical Willmore boundary problems. In (Gulyak, 25 Sep 2025), the Willmore equation is rewritten in divergence form so that it can be treated in weighted second-order Sobolev spaces. The resulting framework weakens the regularity assumptions on both the boundary and the Dirichlet data to the 27-class while the solution remains smooth in the interior, and extends existence theory to domains with merely Lipschitz boundaries within a purely weighted Sobolev framework (Gulyak, 25 Sep 2025).
The same paper treats two regimes. For 28, 29, and 30, smallness is imposed on the slope: 31 with an a priori bound
32
Then there exists a solution
33
of the clamped problem for any 34 (Gulyak, 25 Sep 2025). For Lipschitz 35, the analysis is carried out in weighted Sobolev spaces
36
with clamped data in the trace space
37
and smallness required on
38
Under either a BMO-modulo-VMO smallness assumption on the outward normal field or a restricted 39 range depending on the Lipschitz constant, one obtains a variational solution
40
A distinct but related advance is the low-regularity flow theory for the Willmore flow of graphs with clamped boundary data (Gulyak, 29 Mar 2026). For a graph over a bounded domain, the 41-gradient flow of the Willmore energy is
42
with
43
in immersion form (Gulyak, 29 Mar 2026). The paper develops time-weighted parabolic Hölder spaces that allow derivatives above parabolic order 44 to blow up as 45 at controlled rates, thereby avoiding the classical fourth-order compatibility condition at 46 (Gulyak, 29 Mar 2026).
Its short-time existence theorem states that if 47, 48, and 49, then:
- if 50, there is a unique solution
51
- if 52 with 53, there exists a solution
54
for some 55 (Gulyak, 29 Mar 2026).
In the small-data Lipschitz regime, the same work proves global existence, uniform gradient bounds, and exponential convergence to a stationary solution. Specifically, if
56
then the flow admits a global solution and
57
Moreover, there exists a unique stationary solution 58 satisfying the elliptic Willmore equation with the prescribed boundary data, and for every 59,
60
6. Variational relaxation, boundary conditions, and generalized graph classes
The Willmore equation for graphs also appears as the Euler–Lagrange equation in variational problems with prescribed boundary data. In (Deckelnick et al., 2015), one considers a bounded 61 domain 62 with outward unit normal 63, and the graph functional
64
where
65
and the pure Willmore functional is
66
(Deckelnick et al., 2015). For smooth critical graphs, the interior Euler–Lagrange equation is given there as
67
This is the form adopted in that paper and differs from the normalization used in (Luo et al., 2011), a convention issue that those sources explicitly note.
Two boundary conditions are distinguished in (Deckelnick et al., 2015). The Dirichlet, or clamped, condition prescribes
68
Under these constraints, the first variation yields the interior Willmore equation and no additional natural boundary condition. The total Gaussian curvature is then determined by the boundary data and topology through Gauss–Bonnet: 69 where the geodesic curvature 70 of the boundary curve on the graph is explicitly determined by 71 (Deckelnick et al., 2015).
The Navier, or hinged, condition prescribes only
72
and the natural boundary condition is
73
with 74 the normal curvature of the boundary curve in the graph surface (Deckelnick et al., 2015).
A principal result of (Deckelnick et al., 2015) is that for 75-regular graphs, bounds for the Willmore energy imply area and diameter bounds. In particular, if 76 with 77, then there exists 78 depending on 79 and 80 such that
81
(Deckelnick et al., 2015). The paper then studies the 82-lower semicontinuous relaxation
83
If a sequence has bounded Willmore energy, then after passing to a subsequence it converges in 84 to some
85
and the absolutely continuous contribution
86
provides a lower bound: 87 (Deckelnick et al., 2015).
The same paper proves the existence of a minimizer
88
for the relaxed energy and shows that finite relaxed Willmore energy implies the attainment of the Dirichlet boundary data in an appropriate trace sense on the non-vertical part of the boundary (Deckelnick et al., 2015). A plausible implication is that the graphical Willmore theory naturally extends beyond the classical 89 graph class to limit configurations with vertical parts, although the paper formulates the structural statements carefully in BV language rather than as a generalized PDE theory.
7. Flow, anisotropy, and numerical formulations
The Willmore equation for graphs is also studied through its gradient flow and through anisotropic generalizations. In the anisotropic graph framework of (Oberhuber, 2011), one considers a rectangle 90 and a convex, positive, 91-homogeneous anisotropy 92. The anisotropic mean curvature is defined by
93
and the anisotropic Willmore functional is
94
Introducing
95
the stationary Euler–Lagrange equation is written in vector-conservative form as
96
where
97
For the isotropic density
98
this reduces to
99
with
00
(Oberhuber, 2011). This is the same structural identity as the isotropic graphical Willmore equation recorded in (Luo et al., 2011, Gulyak, 25 Sep 2025), and (Gulyak, 29 Mar 2026), written in the notation of the anisotropic paper.
The anisotropic Willmore flow is formulated as
01
coupled to
02
(Oberhuber, 2011). For zero Dirichlet boundary data, the paper proves the continuous energy equality
03
so the energy decays monotonically along the flow (Oberhuber, 2011). The same work defines weak solutions, derives a complementary finite volume discretization, reformulates it in finite-difference form, and proves the discrete energy equality
04
for zero Dirichlet data (Oberhuber, 2011).
The bounded-domain isotropic flow theory of (Gulyak, 29 Mar 2026) supplies the analytic counterpart to this numerical and anisotropic perspective. Along the flow with time-independent Dirichlet data, it proves
05
hence
06
(Gulyak, 29 Mar 2026). That identity is the precise gradient-flow energy law underlying the global convergence result.
Taken together, these works show that the Willmore equation for graphs admits several mutually reinforcing formulations: intrinsic geometric form via 07 and 08, divergence form suited to weak and low-regularity analysis, biharmonic-relative forms suited to elliptic estimates and fixed-point arguments, ODE reductions under radial symmetry, relaxed variational formulations in 09, and conservative parabolic forms suited to flow theory and structure-preserving numerics (Luo et al., 2011, Chen et al., 2014, Deckelnick et al., 2015, Oberhuber, 2011, Gulyak, 25 Sep 2025, Gulyak, 29 Mar 2026).