How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
Stationarity of the Euler-Lagrange equation does not imply a minimum
Statement refuted
Counterexample. Assume the Axiom of Choice (The Axiom of Choice). Let be a bounded domain and let Then is the only stationary point: its weak Euler-Lagrange (stationarity) equation reads for every , which forces and then almost everywhere by the Poincare inequality (The Poincare inequality for zero-boundary Sobolev closures on domains bounded in one direction). But is not bounded below: for any fixed nonzero one has as . So the Euler-Lagrange equation is a necessary condition only; the functional is concave, not convex, and Stationarity is sufficient for a global minimum of a convex differentiable functional does not apply.
Facts & Assumptions
Given: The Axiom of Choice; a bounded domain , the functional on , and the Lagrangian .
A stationary point of is a point whose first variation vanishes in every direction . The quadratic expansion below computes this variation directly for every . For , its vanishing is also the fixed-zero-trace weak Euler-Lagrange formula of The weak Euler-Lagrange equation for integral functionals with fixed trace, since , and the differentiation growth bounds hold.
On the full linear space , at a local minimiser the first variation vanishes (The first variation vanishes at an interior minimiser); the converse requires convexity and stationarity in the sense for all competitors, by Stationarity is sufficient for a global minimum of a convex differentiable functional.
Poincare's inequality controls the norm by the Dirichlet energy on (The Poincare inequality for zero-boundary Sobolev closures on domains bounded in one direction); in particular forces almost everywhere.
The Lagrangian is concave, not convex, in (Convex and strictly convex functionals on a convex subset of a real vector space).
Counterexample
The stationary equation. For one has and , so the exact expansion gives the bounded first variation by Holder (Holder's inequality for integrals, including the endpoint cases). Thus a point satisfies the weak Euler-Lagrange equation of [F1] exactly when for every .
is not a minimiser, not even locally. Fix any nonzero , which exists: choose a ball and a nonzero smooth bump supported inside it (Compactly supported scaled Euclidean bumps). Poincare [F3] gives , and consider . As this tends to , so is not bounded below on ; and for every one has , and as , so is not a local minimiser either.
The only stationary point. If is stationary, step 1.1 applies with the admissible test function , giving ; by [F3] this forces and hence almost everywhere. Conversely satisfies the equation because . So is the only stationary point of .
Conclusion. The only stationary point of fails to be a minimiser by step 1.2, so the Euler-Lagrange equation is a necessary condition only; the failure is consistent with [F2], since is concave in the gradient by [F4] and the convex stationarity-sufficiency theorem therefore does not apply.
Depends on
- The weak Euler-Lagrange equation for integral functionals with fixed trace
- Stationarity is sufficient for a global minimum of a convex differentiable functional
- The first variation vanishes at an interior minimiser
- Convex and strictly convex functionals on a convex subset of a real vector space
- The Poincare inequality for zero-boundary Sobolev closures on domains bounded in one direction
- Integer-order Sobolev spaces and their norms
- The Axiom of Choice
- Holder's inequality for integrals, including the endpoint cases
- Compactly supported scaled Euclidean bumps
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
52 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- Riccardo Cristoferi, Calculus of Variations: Lecture Notes, Carnegie Mellon University 2016 (complete 133-page notes) (standard reference, not scraped)
- Francesco Paolo Maiale (course by Giovanni Alberti), Lecture Notes Calculus of Variations A, University of Pisa (last update 21 August 2019; complete 149-page notes) (standard reference, not scraped)