Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6-luna)
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.

Existence and uniqueness of periodic cell correctors

Statement

Assume a,λ,Λ,Y,V# are as in Uniformly elliptic periodic scalar diffusion data and Zero-mean periodic Sobolev cell space. For each p∈Rd, the equation in Periodic scalar cell problem has a unique solution χp∈V#. The map p↦χp is linear, and ∥∇χp∥L2(Y)≤(Λ/λ)∣p∣,∥χp∥L2(Y)≤d(Λ/λ)∣p∣.

Facts & Assumptions

Given: a is measurable with λ≤a≤Λ, the periodic cell equation, the cell Poincare inequality, Hilbert completeness and real Lax--Milgram under Countable Choice.

[F1]

Periodic scalar cell problem: the unknown lies in V# and satisfies ∫Ya(p+∇χp)⋅∇v=0 for all v∈V#.

[F2]

Mean-zero Poincare inequality on the periodic cell: V# is Hilbert in the gradient norm, and ∥v∥2≤d∥∇v∥2.

[F3]

The Sobolev space H1 is a Hilbert space: the periodic H1 closure, and its closed mean-zero subspace, are Hilbert under the H1 norm.

[F4]

The Lax--Milgram theorem: a bounded coercive real bilinear form on a Hilbert space has a unique variational solution and the usual norm estimate.

[F5]

Uniformly elliptic periodic scalar diffusion data: λ≤a≤Λ almost everywhere.

[A1]

The Axiom of Countable Choice (ACω): Countable Choice is the axiom used by the cited Hilbert and Lax--Milgram suppliers; no stronger choice axiom is invoked.

Proof

1.1F5F2F4F1F3A1algebra

On V# with gradient inner product, define b(u,v)=∫Ya∇u⋅∇v and Fp(v)=−∫Yap⋅∇v. By [F5] and Cauchy--Schwarz, ∣b(u,v)∣≤Λ∥∇u∥2∥∇v∥2, b(v,v)≥λ∥∇v∥22, and ∣Fp(v)∣≤Λ∣p∣∥∇v∥2. Thus [F2]–[F4] apply and give a unique χp with b(χp,v)=Fp(v) for every v. Rearranging is exactly [F1].

2.1F2F5step 1.1algebra

Test the equation with v=χp. Then λ∥∇χp∥22≤∫Ya∣∇χp∣2=−∫Yap⋅∇χp≤Λ∣p∣∥∇χp∥2. If the gradient norm is zero the estimate is immediate; otherwise divide by it. The L2 bound follows from [F2].

3.1step 1.1F1algebra∎

For p,q∈Rd and scalars s,t, the function sχp+tχq satisfies the cell equation with datum sp+tq, by linearity of the integral in both p and the corrector. Uniqueness in step 1.1 therefore gives χsp+tq=sχp+tχq.

Depends on

Used by

Dependency tree · two levels

42 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