Alphabeta Math
LemmaStatement: Literature-sourcedProof: 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.

Caccioppoli inequality for truncated subsolutions

Statement

Assume Countable Choice and the Axiom of Choice. Let n≥2, let Ω⊆Rn be open, and let 0<θ≤Ma2, and let A=(aij) be measurable with aij=aji and θ∣ξ∣2≤∑i,j=1naij(x)ξiξj≤Ma2∣ξ∣2for a.e. x∈Ω and all ξ∈Rn. Write L0u:=−Di(aijDju) and a0(u,v):=∫ΩaijDju Div dx for real u,v∈H1(Ω). Let f∈Lloc2(Ω) and let u∈H1(Ω;R) satisfy the local weak subsolution inequality a0(u,φ)≤∫Ωf φ dxfor every nonnegative φ∈Cc∞(Ω). Then for every k∈R and every η∈Cc∞(Ω) with 0≤η≤1, ∫Ωη2∣D(u−k)+∣2dx≤4Ma2θ∫Ω(u−k)+2∣Dη∣2dx+2θ∫Ωη2(u−k)+f+dx, and for concentric balls Br(x0)⋐BR(x0)⋐Ω, 0<r<R, ∫Br(x0)∣D(u−k)+∣2dx≤C(n,θ,Ma)(1(R−r)2∫BR(x0)(u−k)+2dx+∫BR(x0)(u−k)+f+dx). All integrands are restricted to the superlevel set {u>k}, where (u−k)+>0; the estimate is uniform in k and in the localisation.

Facts & Assumptions

Given: Countable Choice and the Axiom of Choice; an open Ω⊆Rn, n≥2; constants 0<θ≤Ma2; a measurable symmetric coefficient field A=(aij) with θ∣ξ∣2≤⟨Aξ,ξ⟩≤Ma2∣ξ∣2 a.e.; f∈Lloc2(Ω); and a real class u∈H1(Ω;R) with a0(u,φ)≤∫Ωfφ for every nonnegative φ∈Cc∞(Ω).

[F1]

Assume Countable Choice and the Axiom of Choice. For k∈R and u∈H1(Ω;R), the class uk:=(u−k)+ lies in Hloc1(Ω;R) with Duk=1{u>k}Du, and Duk=0 a.e. on {u≤k}. Global H1(Ω) membership is not asserted for arbitrary k on an infinite-measure domain. For η∈Cc∞(Ω) the product η2uk lies in H01(Ω), is nonnegative, and satisfies D(η2uk)=2ηukDη+η2Duk a.e. (Positive-part truncation calculus and admissible cut-off weak tests, Weak subsolutions and supersolutions of a divergence-form equation).

[F2]

Assume Countable Choice. Every element of H1(Ω) has weak first derivatives in L2(Ω), the weak derivative is linear, and products of L2 classes with bounded measurable coefficients are integrable on compact sets (Integer-order Sobolev spaces and their norms).

[F3]

Bumps: for 0<r<R there is η∈Cc∞(BR(x0)) with 0≤η≤1, η=1 on Br(x0) and ∣Dη∣≤CU/(R−r) for a universal constant CU; the explicit radial bump η(x)=σ((s2−∣x−x0∣2)/(s2−r2)), s=(r+R)/2, of A smooth bump between concentric Euclidean balls and Compactly supported scaled Euclidean bumps provides it, since on the support ∣x−x0∣≤s and the chain rule give ∣Dη∣≤∥σ′∥∞ 2s/(s2−r2)≤∥σ′∥∞ 4/(R−r).

[F4]

Young's inequality with conjugate exponents p=q=2 and weight: for a,b≥0 and ε>0, 2ab≤εa2+b2/ε (Young's inequality for conjugate real exponents); Cauchy–Schwarz in L2 gives ∣∫gh∣≤(∫g2)1/2(∫h2)1/2 (Holder's inequality for integrals, including the endpoint cases).

Proof

technique · direct; insert the truncated test function into the subsolution inequality, expand, and absorb the cross term by Young's inequality
1.1givenF1F2F4algebra

Fix k and η∈Cc∞(Ω) with 0≤η≤1, and put uk:=(u−k)+ and v:=η2uk. By [F1], v∈H01(Ω) is nonnegative; since f∈Lloc2 and the support is compact, density extends the local subsolution inequality to this test. Thus a0(u,v)≤∫Ωη2ukf+ dx. Expanding and using Duk=1{u>k}Du, define S2:=∫Ωη2 aijDjukDiuk dx. The correct identity is S2=a0(u,v)−2∫Ωηuk aijDjukDiη dx≤∫Ωη2ukf+dx+2∣∫Ωηuk aijDjukDiη dx∣. The matrix Cauchy--Schwarz inequality and A≤Ma2I bound the last term by 2∣Ma∣S(∫Ωuk2∣Dη∣2dx)1/2.

2.1step 1.1F4algebra

By Young's inequality 2∣Ma∣Sb≤12S2+2Ma2b2 with b=(∫Ωuk2∣Dη∣2)1/2, step 1.1 gives S2≤2∫Ωη2ukf+dx+4Ma2∫Ωuk2∣Dη∣2dx. Ellipticity gives S2≥θ∫Ωη2∣Duk∣2dx, and therefore ∫Ωη2∣Duk∣2dx≤4Ma2θ∫Ωuk2∣Dη∣2dx+2θ∫Ωη2ukf+dx. This is the first estimate.

3.1step 2.1F3∎

For the ball form let 0<r<R with BR(x0)⋐Ω and choose the bump η of [F3], so that 0≤η≤1, η=1 on Br(x0), supp⁡η⊆BR(x0) and ∣Dη∣≤CU/(R−r). Applying step 2.1 gives the second estimate, with C(n,θ,Ma):=max⁡{4Ma2CU2/θ, 2/θ}. Both estimates are uniform in k, and no choice principle beyond the declared Countable Choice and Axiom of Choice is used.

Depends on

Used by

Dependency tree · two levels

67 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