For a fixed sufficiently regular image edge set, the Mumford–Shah functional is a strictly convex quadratic energy on the Sobolev space of its complement. A first variation gives within each region and separate one-sided Neumann boundary conditions on free edges. A jump need not vanish across an edge. The weak solution is unique by the Lax-Milgram theorem; this does not prove uniqueness when the edge set is also optimized.
Higher-order Euler-Lagrange equation Created 2026-09-24 Updated 2026-09-24
For the functional
the vanishing of its first variation under fixed endpoint data gives
For bounded BV space data and , nested ROF level-set formulation minimizing sets cannot share an interface of positive surface measure away from data jumps. On regular graph patches, upward and downward first variations use the BV traces on a hypersurface. At contacts outside the forcing BV trace on a hypersurface agrees, whereas the two levels differ by . Graph regularity and contact differentiation give the contradiction. Bounded forcing is a hypothesis of this argument; arbitrary unbounded data are not covered by this statement.
For a variation preserving both endpoint values and slopes, at the endpoints. The first variation is
Integrate the last term twice and the middle term once. All boundary terms vanish, giving
The fundamental lemma of the calculus of variations yields the higher-order Euler-Lagrange equation
For the present functional this becomes . Its general solution is . The left endpoint gives and . The right endpoint then gives
The coefficient determinant is , so , . The stationary function is .
For any admissible perturbation , exact quadratic expansion, followed by the stationarity equation and integration by parts, gives
Apply the supplied Poincare inequality first to , then to , whose endpoint values also vanish:
Thus for every admissible perturbation, proving a global maximum through the clamped second-variation inequality.
Assume the self-adjoint interpretation of positive-definite operator from the preceding part. For and real , expand the quadratic functional:
The first variation therefore vanishes in every direction precisely when for every , or . This is its Euler-Lagrange equation and its weak formulation. For any weak solution , write . Self-adjointness and cancel the cross terms and give the exact identity
Strict positivity makes this difference positive unless , so every weak solution is the unique global minimizer, and conversely every minimizer is a weak solution. If is uniformly positive, the Lax-Milgram theorem additionally gives existence for every and . The identity above then gives the quantitative gap .
The hypotheses matter. On , let
Then for nonzero , but is minimized at , whereas . Thus real quadratic positivity without symmetry does not imply the requested variational assertion: the symmetric part determines a real quadratic functional.
Also, strict self-adjoint positivity does not imply existence for arbitrary . On , take and . The operator is bounded, self-adjoint and strictly positive, and ; a solution would have , which is not in . In fact the trial vectors with their first coordinates equal to one give . The printed conclusion about a weak solution is valid whenever that solution exists; an unconditional existence assertion needs uniform positivity.
Let be the configuration smooth manifold, and let be a smooth Lagrangian on its tangent bundle. For a path with fixed endpoints, its action is
The principle of stationary action requires the first variation to vanish for every fixed-endpoint variation. In a coordinate chart take , with . Differentiation under the integral and integration by parts give
Repeated coordinate indices are summed. The endpoint term vanishes. Since compactly supported variations can be chosen independently in each coordinate, the fundamental lemma of the calculus of variations yields the Euler-Lagrange equations
Conversely these equations make the displayed first variation zero for every fixed-endpoint variation. Variations localized in coordinate charts establish the same assertion for paths on . Thus the Euler-Lagrange equations are exactly the stationary-path condition, not necessarily a condition for an action minimum.