Alphabeta Math
LemmaStatement: 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 fundamental lemma of the calculus of variations

Statement

Assume Countable Choice (The Axiom of Countable Choice (ACω)). Let Ω⊆Rn be open, n≥1, and let g∈Lloc1(Ω;C) (Locally integrable functions as regular distributions) satisfy ∫Ωg φ dx=0for every φ∈Cc∞(Ω) (Test function space d of an open set). Then g=0 almost everywhere on Ω. Moreover, if g is real-valued and ∫Ωgφ dx≥0 for every nonnegative φ∈Cc∞(Ω), then g≥0 almost everywhere.

Facts & Assumptions

Given: Countable Choice; an open set Ω⊆Rn, n≥1, and g∈Lloc1(Ω;C). Part (a) assumes ∫Ωgφ dx=0 for every φ∈Cc∞(Ω); part (b) assumes g real-valued and ∫Ωgφ dx≥0 for every nonnegative φ∈Cc∞(Ω). The measure-theoretic suppliers used below are stated under the Axiom of Countable Choice (The Axiom of Countable Choice (ACω)), the ambient convention of the Lebesgue framework cited here.

[F1]

Choose a nonnegative smooth bump b equal to one on B‾1/4(0) and supported inside B1/2(0) (Compactly supported scaled Euclidean bumps). Its integral c is finite by boundedness and compact support, and positive because the inner ball contains a box of positive measure (Assuming countable choice, L(Rn) is a sigma-algebra containing every elementary set and λn is a complete measure extending elementary volume). Then ρ:=b/c is nonnegative, smooth, compactly supported in B1(0) and has integral one. It is majorised by the bounded nonincreasing function Φ(t):=∥ρ∥∞1[0,1](t), whose radial integral is finite. Radiality of ρ itself is unnecessary.

[F2]

For f∈L1(Rn) and a Lebesgue point x of f with value a=f(x), and for any measurable kernel K with ∫K=1 and ∣K(y)∣≤Φ(∣y∣) as in [F1], one has ∫ε−nK(y/ε)f(x−y) dy→a as ε↓0 (Lebesgue-point convergence for radial-majorized kernels).

[F3]

The Lebesgue set of a class in Lloc1(Rn) is defined by the averages λ(B(x,r))−1∫B(x,r)∣f(y)−f(x)∣ dy→0, and under the Axiom of Countable Choice it has full Lebesgue measure (Lebesgue points and the Lebesgue set of an Lloc1 class, Almost every point is a Lebesgue point of a locally integrable function).

[F4]

A ball is contained in a half-open cube of side 2r centred at the same point, whose Lebesgue measure is (2r)n; by monotonicity of the measure, λ(B(x,r))≤2nrn (Assuming countable choice, L(Rn) is a sigma-algebra containing every elementary set and λn is a complete measure extending elementary volume).

Proof

technique · direct; the sign statement is proved with a mollifier kernel at almost every point, and the vanishing statement follows by applying the sign statement to $g$ and $-g$
1.1givenalgebra

The vanishing statement follows from the sign statement. Assume part (b) proved and first take g real-valued. Applying it to g gives g≥0 almost everywhere; applying it to −g, whose pairing with every nonnegative φ equals −∫Ωgφ=0≥0, gives −g≥0 almost everywhere. Hence g=0 almost everywhere. For complex g, the vanishing pairing with every real test implies vanishing pairings for Re⁡g and Im⁡g; applying this real argument to each gives part (a). So it suffices to prove the sign statement, and from the next step on we assume g real-valued and ∫Ωgφ≥0 for every nonnegative φ∈Cc∞(Ω).

1.2algebra

Exhaustion of Ω and localisation. For integers k≥1 put Ωk:={x∈Ω:∣x∣<k and dist⁡(x,Rn∖Ω)>1/k}, with dist⁡(x,∅)=+∞. Each Ωk is open (both conditions are open or strict), its closure is bounded and contained in Ω, so Ωk‾ is a compact subset of Ω; moreover Ωk⊆Ωk+1 and ⋃kΩk=Ω, because for x∈Ω openness gives dist⁡(x,Rn∖Ω)>0 and one may take k>max⁡{∣x∣,1/dist⁡(x,Rn∖Ω)}.

2.1step 1.2

The localised functions are integrable on Rn. Let gk:=g 1Ωk, extended by zero outside Ωk. Since Ωk‾ is a compact subset of Ω and g∈Lloc1(Ω), one has ∫Rn∣gk∣=∫Ωk∣g∣<∞, so gk∈L1(Rn).

3.1F3step 2.1

Almost every point is a Lebesgue point of every gk. By [F3] applied to gk there is a Lebesgue null set Nk⊆Rn such that every z∉Nk is a Lebesgue point of gk; the union N:=⋃kNk is again null, being a countable union of null sets.

4.1F3F4step 3.1

At points of Ω∖N the Lebesgue averages are small. Fix z∈Ω∖N and k with z∈Ωk. Then z∉Nk, so for Ak(r):=∫B(z,r)∣gk(y)−gk(z)∣ dy the Lebesgue point property gives Ak(r)/λ(B(z,r))→0; combined with [F4] this yields Ak(r)/rn≤2nAk(r)/λ(B(z,r))→0, that is Ak(r)=o(rn). Moreover gk(z)=g(z), since z∈Ωk.

5.1F1F2step 4.1

Kernel convergence. By step 4.1 the point z is a Lebesgue point of gk with gk(z)=g(z) and Ak(r)=o(rn), so applying [F2] with f=gk, x=z, a=gk(z) and the kernel K=ρ of [F1] gives, for r↓0, the limit r−n∫Rnρ(y/r) gk(z−y) dy⟶g(z), since [F1] realises ρ as a compactly supported kernel with the required bounded nonincreasing majorant.

6.1F1givenstep 4.1

Admissible test functions. Fix z∈Ω∖N and k with z∈Ωk as in step 4.1. For 0<r<dist⁡(z,Rn∖Ωk) the function φr(w):=r−nρ((z−w)/r) lies in Cc∞(Ω): it is smooth in w, nonnegative, and has support in B(z,r)⊆Ω. Changing variables w=z−y gives ∫Ωg(w)φr(w) dw=∫r−nρ(y/r)g(z−y) dy, and g=gk on the support of this test. Thus the integral equals the mollified gk in step 5.1, and the hypothesis of part (b) gives ∫Ωgφr≥0.

7.1step 5.1step 6.1step 1.1∎

Conclusion of the sign statement. For z∈Ω∖N and r↓0, step 6.1 keeps the quantities ∫Ωgφr nonnegative while step 5.1 identifies their limit as g(z); hence g(z)≥0. Since N is null, g≥0 almost everywhere on Ω, and by step 1.1 this also gives g=0 almost everywhere under the hypotheses of part (a).

Depends on

Used by

Dependency tree · two levels

51 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