Alphabeta Math
TheoremStatement: 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.

De Giorgi local boundedness of homogeneous subsolutions

Statement

Assume Countable Choice and the Axiom of Choice. Let n≥2, let Ω⊆Rn be open, let 0<θ≤Ma2, let A=(aij) be measurable symmetric with θ∣ξ∣2≤∑aij(x)ξiξj≤Ma2∣ξ∣2 for a.e. x and all ξ, and let L0u=−Di(aijDju). Let u∈H1(Ω;R) satisfy u≥0 a.e. and a0(u,v)≤0for every v∈H01(Ω), v≥0 a.e., i.e. u is a nonnegative weak subsolution of L0u=0 (Weak subsolutions and supersolutions of a divergence-form equation). Then u is locally bounded, and for every ball BR(x0)⋐Ω, every 0<ρ<1 and every p>0, ess sup⁡BρR(x0)u≤C(1∣BR(x0)∣∫BR(x0)up dx)1/p,C=C(n,θ,Ma,ρ,p). For n=2 the same statement holds with the critical Sobolev embedding in place of the 2∗ embedding. The constant is scale invariant: it does not depend on R or x0.

Facts & Assumptions

Given: Countable Choice and the Axiom of Choice; an open Ω⊆Rn, n≥2; constants 0<θ≤Ma2; a measurable symmetric coefficient field A with θ∣ξ∣2≤⟨Aξ,ξ⟩≤Ma2∣ξ∣2 a.e.; a nonnegative class u∈H1(Ω;R) with a0(u,v)≤0 for every nonnegative v∈H01(Ω); a ball BR(x0)⋐Ω.

[F1]

Assume Countable Choice and the Axiom of Choice. a0(w,v)=∫ΩaijDjwDiv dx is defined for w,v∈H1(Ω;R), and the subsolution inequality is the one of Weak subsolutions and supersolutions of a divergence-form equation with f=0; for η∈Cc∞(Ω) and k∈R the class η2(u−k)+ is an admissible nonnegative test (Positive-part truncation calculus and admissible cut-off weak tests).

[F2]

Assume Countable Choice and the Axiom of Choice. Truncated Caccioppoli estimate: for k∈R, f=0 and concentric balls Br⋐BR, ∫Br∣D(u−k)+∣2≤C0(R−r)−2∫BR(u−k)+2 with C0=C0(θ,Ma) (Caccioppoli inequality for truncated subsolutions).

[F3]

Assume Countable Choice and the Axiom of Choice. Level-set step: if u∈H1(BR) and ∫Bρ∣D(u−k)+∣2≤C0(R−ρ)−2∫BR(u−k)+2 holds for all 0<ρ<R and all levels k, then for n≥3, ∫Br(u−k)+2≤C(n,C0)(R−r)−2(k−h)−4/n(∫BR(u−h)+2)1+2/n. For n=2 and each 0<δ<1, the power and integral exponent use 2δ and 1+δ, and the radius factor is R2−2δ(R−r)−2; the constant may depend on δ (Sobolev level-set step: energy decay with explicit level gap and radius loss).

[F4]

Nonlinear iteration: if δ>0, C≥1, B≥1 and Yj+1≤CBjYj1+δ with Y0≤C−1/δ(2B)−1/δ2, then Yj≤Y0λj→0 with λ=(2B)−1/δ (The nonlinear geometric iteration: an explicit threshold forces convergence to zero).

[F5]

Essential supremum and Lp means: a class w satisfies w≤T a.e. if and only if ess sup⁡w≤T. For every 0<p<q, Hölder applied to ∣w∣p and 1 with exponents q/p and q/(q−p) gives ∫E∣w∣p≤∣E∣1−p/q(∫E∣w∣q)p/q (The essential supremum is attained as the least essential bound, The essential supremum of a measurable function with respect to a measure, Holder's inequality for integrals, including the endpoint cases, The space Lp(μ) as the quotient by null functions, The average of a locally integrable function over a Euclidean ball).

[F6]

Assume the Axiom of Choice. The globally Lipschitz chain rule and weak product rule justify the compositions and cutoff tests. For a convex Lipschitz truncation PN, scalar convolution followed by subtracting the value at zero gives smooth convex nondecreasing approximants; their compositions converge in Hloc1 by the chain rule and dominated convergence. Monotone convergence applies to PN(u)↑uβ as N→∞ (Chain rule for globally Lipschitz scalar maps of Sobolev functions, Weak Leibniz rule with a smooth factor, Dominated convergence, Monotone convergence for the integral).

[F7]

Weighted Young inequality: if 0<p<2, then for X,Y≥0 and every ϵ>0, XY≤ϵX2/(2−p)+Cpϵ−(2−p)/pY2/p, with Cp depending only on p (Young's inequality for conjugate real exponents).

Proof

technique · derive the $L^2$ mean-to-supremum estimate by the dyadic De Giorgi level recurrence, obtain any smaller-ball ratio by a finite cover with an explicit radius-gap constant, then use convex power truncations for $p\ge2$ and a two-scale interpolation iteration for $0<p<2$
1.1givenF1F6algebra

Convex power truncations. Fix β≥1 and N≥1, and define the convex nondecreasing Lipschitz function PN(s):={0,s≤0,sβ,0<s≤N,Nβ+βNβ−1(s−N),s>N. It satisfies PN(0)=0 and PN(u)≥0 since u≥0. Let Gϵ be a smooth convolution of PN minus its value at zero. Then Gϵ(0)=0, Gϵ′≥0, Gϵ′′≥0, and the Lipschitz constants are uniformly bounded for this fixed N. For a nonnegative ϕ∈Cc∞(Ω), the test Gϵ′(u)ϕ is nonnegative and belongs to H01 on a bounded neighborhood of its support. Since the equation is homogeneous, density extends the subsolution inequality to this test. The chain and product rules give a0(Gϵ(u),ϕ)=a0(u,Gϵ′(u)ϕ)−∫ΩGϵ′′(u) aijDjuDiu ϕ dx≤0. As ϵ↓0, the compositions converge to PN(u) in Hloc1 by [F6], so the displayed inequality passes to PN(u) against each smooth nonnegative test. Thus PN(u) is a nonnegative local weak subsolution. No subsolution property of the smooth approximants is required.

1.2givenF2F3algebra

The dyadic recurrence. Assume ∫BRu2>0 (otherwise u=0 a.e. on BR), fix BR=BR(x0)⋐Ω and T>0, and put kj:=T(1−2−j), rj:=R(1/2+2−j−1), Yj:=∫Brj(u−kj)+2dx for j≥0. Set δ:=2/n if n≥3, and δ:=1/2 if n=2 (so the latter uses the finite exponent κ=4). Applying [F3] with outer radius rj and inner radius rj+1, and using rj−rj+1=R2−j−2 and kj+1−kj=T2−j−1, gives Yj+1≤C1B0jR−nδT−2δYj1+δ,B0:=22+2δ, where C1=C1(n,θ,Ma)≥1. For n=2, the scaled radius factor in [F3] contributes rj2−2δ(rj−rj+1)−2≤CR−2δ22j; for n≥3, nδ=2 and the same displayed scale follows directly.

2.1step 1.2F4F5

The iteration closes. Write Zj:=R−nT−2Yj. Then the recurrence of step 1.2 reads Zj+1≤C1B0jZj1+δ, with δ=2/n for n≥3 and δ=1/2 for n=2, and Z0=R−nT−2∫BRu2. By [F4], if R−nT−2∫BRu2≤C1−1/δ(2B0)−1/δ2 then Zj→0; choosing T:=c0(R−n∫BRu2)1/2 with c0:=C11/(2δ)(2B0)1/(2δ2) meets this condition. Then ∫BR/2(u−T)+2≤Yj→0, so u≤T a.e. on BR/2(x0) and hence, by [F5], ess sup⁡BR/2(x0)u≤c0(R−n∫BR(x0)u2)1/2=C2(1∣BR(x0)∣∫BR(x0)u2)1/2 with C2=C2(n,θ,Ma).

3.1step 2.1algebra

Every smaller-ball ratio with a gap bound. Fix 0<σ<1 and set d:=(1−σ)R/2. A finite collection of balls Bd/2(xℓ) with centers in BσR(x0) covers BσR(x0), and each outer ball Bd(xℓ) is compactly contained in BR(x0). Applying the half-ball L2 estimate of step 2.1 to each outer ball yields ess sup⁡Bd/2(xℓ)u≤C2(1∣Bd∣∫Bd(xℓ)u2)1/2≤C2(21−σ)n/2(1∣BR∣∫BRu2)1/2. Taking the finite union gives the same bound on BσR. This quantitative gap dependence controls the radius losses in the subsequent small-exponent argument. In particular, u is essentially bounded on each strictly smaller ball.

4.1step 1.1step 3.1F6

The case p≥2. If ∫BRup=∞ the estimate is automatic. Fix p≥2 and put β:=p/2. For each N≥1, wN:=PN(u) is a nonnegative local weak subsolution by step 1.1 and lies in H1(Ω) because PN is globally Lipschitz with PN(0)=0. The zero-source inequality extends to all nonnegative H01(Ω) tests, so the local boundedness theorem applies. The arbitrary-ratio p=2 estimate of step 3.1 gives ess sup⁡BρRwN≤C2(ρ)(1∣BR∣∫BRwN2)1/2. As N→∞, wN↑uβ and wN2↑u2β, so monotone convergence [F6] and monotonicity of essential supremum give ess sup⁡BρRuβ≤C2(ρ)(1∣BR∣∫BRup)1/2. Taking the β-th root proves the estimate, with constant C2(ρ)1/β.

4.2step 3.1F5F7algebra

The case 0<p<2. Put A:=(1∣BR∣∫BRup)1/p. If A=0, then u=0 a.e. on BR; otherwise 0<A<∞. Let s∗:=(1+ρ)/2, rj:=ρR+(s∗R−ρR)(1−2−j), and Mj:=ess sup⁡Brju. By step 3.1, Mj≤C∗(1−rj/R)−n/2(1∣BR∣∫BRu2)1/2<∞. Apply the p=2 estimate of step 3.1 to u on the outer ball Brj+1 with inner ratio rj/rj+1. Its explicit gap bound gives a constant Cj≤C4bj (because rj+1−rj is a fixed multiple of 2−jR), and Holder gives Mj≤CjMj+11−p/2Ap/2. For any ϵ>0, [F7] yields Mj≤ϵMj+1+C5ϵ−(2−p)/pCj2/pA. Choose ϵ with ϵb2/p<1 and iterate. The geometric series ∑j≥0ϵjCj2/p converges, while Mj≤M∗<∞ by step 3.1 on the fixed ball Bs∗R, so ϵjMj→0. Hence M0≤C6A, proving the desired estimate on BρR. This proves every 0<p<2 directly and requires no limit as the radius approaches R.

5.1step 4.1step 4.2∎

Conclusion. Steps 4.1 and 4.2 prove the estimate for every p>0; the constants depend only on n,θ,Ma,ρ,p, and scaling shows independence of R and x0.

Depends on

Used by

Dependency tree · two levels

115 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