Alphabeta Math
CorollaryStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6.1-sol)
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.

The classical Euler-Lagrange equation under regularity

Statement

Let the hypotheses of The weak Euler-Lagrange equation for integral functionals with fixed trace hold, and assume in addition that f∈C2(Ω‾×R×Rn) and u∈C2(Ω‾) (Ck maps and multi-index derivative notation in Euclidean space). Then w(x):=fξ(x,u(x),Du(x))∈C1(Ω;Rn) and −div⁡w+fs(x,u(x),Du(x))=0(x∈Ω), the classical Euler-Lagrange equation (Divergence and curl of a C1 vector field), with the first variation supplied by Differentiation of an integral functional under growth domination.

Facts & Assumptions

Given: The hypotheses of The weak Euler-Lagrange equation for integral functionals with fixed trace (a bounded C1 domain Ω, 1<p<∞, the Caratheodory integrand f with the stated growth bounds, a local minimiser u∈W1,p(Ω) of the integral functional among the functions of trace g with g in the trace range), together with f∈C2(Ω‾×R×Rn) and u∈C2(Ω‾). The measure-theoretic background is the Axiom-of-Countable-Choice framework of the published surface and divergence theory (The Axiom of Countable Choice (ACω)).

[F1]

For every φ∈W01,p(Ω), and in particular for every φ∈Cc∞(Ω), the weak Euler-Lagrange identity holds: ∫Ω(fξ(x,u,Du)⋅Dφ+fs(x,u,Du)φ) dx=0 (The weak Euler-Lagrange equation for integral functionals with fixed trace).

[F2]

Composites of Ck Euclidean maps are Ck (Ck Euclidean maps are closed under componentwise algebra and composition): since f∈C2 gives fs,fξ∈C1 and x↦(x,u(x),Du(x)) is C1 for u∈C2(Ω‾), the functions x↦fs(x,u(x),Du(x)) and w(x):=fξ(x,u(x),Du(x)) are of class C1 on Ω; consequently div⁡w is continuous and fs−div⁡w is continuous on Ω (Divergence and curl of a C1 vector field, Ck maps and multi-index derivative notation in Euclidean space).

[F3]

Divergence theorem: for a bounded C1 domain and F∈C1(Ω‾;Rn), ∫Ωdiv⁡F dx=∫∂ΩF⋅ν dσ (Divergence on a bounded C1 Euclidean domain); the first Green identity is the special case F=v Du of this identity (First Green identity).

[F4]

Fundamental lemma: if g∈Lloc1(Ω) satisfies ∫Ωgφ=0 for every φ∈Cc∞(Ω), then g=0 almost everywhere; a continuous such g vanishes everywhere (The fundamental lemma of the calculus of variations).

Proof

technique · direct, by testing the weak equation with compactly supported functions and integrating by parts
1.1F2given

Regularity of the coefficients. By [F2] the vector field w(x)=fξ(x,u(x),Du(x)) is of class C1 on the open set Ω, and the function x↦fs(x,u(x),Du(x)) is continuous; hence div⁡w is continuous and so is fs−div⁡w.

2.1F1step 1.1

The weak identity. Let φ∈Cc∞(Ω). Then φ∈W01,p(Ω), so [F1] gives ∫Ω(fξ(x,u,Du)⋅Dφ+fs(x,u,Du)φ) dx=0, that is ∫Ωw⋅Dφ dx=−∫Ωfsφ dx.

2.2F3step 1.1

Integration by parts with compact support. The field F:=φw is C1 and compactly supported in Ω; in particular F extends by zero to a C1 field on Ω‾, so [F3] may be applied to it. Since φ=0 on ∂Ω, the boundary term vanishes and ∫Ωdiv⁡(φw) dx=0. By the product rule div⁡(φw)=Dφ⋅w+φdiv⁡w, hence ∫Ωw⋅Dφ dx=−∫Ω(div⁡w)φ dx.

3.1step 2.1step 2.2

The combined identity. Substituting step 2.2 into step 2.1 gives ∫Ω(fs(x,u,Du)−div⁡w)φ dx=0 for every φ∈Cc∞(Ω).

4.1F4step 3.1∎

The fundamental lemma. The function g:=fs(x,u(x),Du(x))−div⁡w(x) is continuous on Ω by step 1.1 and is orthogonal to every test function by step 3.1; [F4] gives g=0 almost everywhere, and continuity upgrades this to g=0 everywhere on Ω. Hence −div⁡w+fs(x,u(x),Du(x))=0 on Ω, the classical Euler-Lagrange equation.

Depends on

Used by

Dependency tree · two levels

59 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