Alphabeta Math
CounterexampleConstruction: Literature-sourcedVerification: AI-adaptedPipeline-generatedprecheck pass
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 Ω⊆Rn be a bounded C1 domain and let J(u)=−12∫Ω∣Du∣2 dx(u∈H01(Ω)). Then u=0 is the only stationary point: its weak Euler-Lagrange (stationarity) equation reads −∫ΩDu⋅Dφ dx=0 for every φ∈H01(Ω), which forces Du=0 and then u=0 almost everywhere by the Poincare inequality (The Poincare inequality for zero-boundary Sobolev closures on domains bounded in one direction). But J is not bounded below: for any fixed nonzero φ∈H01(Ω) one has J(tφ)=−t22∥Dφ∥22→−∞ as ∣t∣→∞. 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 C1 domain Ω⊆Rn, the functional J(u)=−12∫Ω∣Du∣2 dx on H01(Ω), and the Lagrangian f(x,s,ξ)=−12∣ξ∣2.

[F1]

A stationary point of J is a point u∈H01(Ω) whose first variation vanishes in every direction φ∈H01(Ω). The quadratic expansion below computes this variation directly for every n≥1. For n≥2, 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 fs=0, fξ=−ξ and the p=2 differentiation growth bounds hold.

[F2]

On the full linear space H01(Ω), 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 δI(u;v−u)≥0 for all competitors, by Stationarity is sufficient for a global minimum of a convex differentiable functional.

[F3]

Poincare's inequality controls the L2 norm by the Dirichlet energy on H01(Ω) (The Poincare inequality for zero-boundary Sobolev closures on domains bounded in one direction); in particular ∫Ω∣Du∣2=0 forces u=0 almost everywhere.

[F4]

The Lagrangian f(x,s,ξ)=−12∣ξ∣2 is concave, not convex, in ξ (Convex and strictly convex functionals on a convex subset of a real vector space).

Counterexample

technique · direct computation of the stationary equation and along the line $t\varphi$
1.1F1algebra

The stationary equation. For f(x,s,ξ)=−12∣ξ∣2 one has fξ(x,s,ξ)=−ξ and fs=0, so the exact expansion J(u+εφ)−J(u)=−ε∫Du⋅Dφ−12ε2∫∣Dφ∣2 gives the bounded first variation δJ(u;φ)=−∫Du⋅Dφ by Holder (Holder's inequality for integrals, including the endpoint cases). Thus a point u∈H01(Ω) satisfies the weak Euler-Lagrange equation of [F1] exactly when ∫ΩDu⋅Dφ dx=0 for every φ∈H01(Ω).

1.2F3algebra

0 is not a minimiser, not even locally. Fix any nonzero φ∈H01(Ω), which exists: choose a ball BR(a)⊆Ω and a nonzero smooth bump supported inside it (Compactly supported scaled Euclidean bumps). Poincare [F3] gives ∥Dφ∥2>0, and consider J(tφ)=−t22∫Ω∣Dφ∣2 dx. As ∣t∣→∞ this tends to −∞, so J is not bounded below on H01(Ω); and for every t≠0 one has J(tφ)<0=J(0), and ∥tφ∥H1=∣t∣∥φ∥H1→0 as t→0, so 0 is not a local minimiser either.

2.1F3step 1.1

The only stationary point. If u is stationary, step 1.1 applies with the admissible test function φ=u∈H01(Ω), giving ∫Ω∣Du∣2=0; by [F3] this forces Du=0 and hence u=0 almost everywhere. Conversely u=0 satisfies the equation because D0=0. So 0 is the only stationary point of J.

3.1F2F4step 2.1step 1.2∎

Conclusion. The only stationary point of J 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 J is concave in the gradient by [F4] and the convex stationarity-sufficiency theorem therefore does not apply.

Depends on

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