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 with a scale-correct forcing term

Statement

Assume Countable Choice and the Axiom of Choice. Let n≥2, let Ω⊆Rn be open, let A and L0 be as in De Giorgi local boundedness of homogeneous subsolutions, and let f∈Llocq(Ω) with q>n/2. Let u∈H1(Ω;R) satisfy u≥0 a.e. and a0(u,φ)≤∫Ωf φ dxfor every nonnegative φ∈Cc∞(Ω;R). Then 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+R 2−n/q∥f+∥Lq(BR(x0))], with C=C(n,q,θ,Ma,ρ,p) independent of R and x0. The factor R2−n/q is dictated by dilation of the equation: the forcing term has the dimension of u for every q. The strict threshold q>n/2 is an integrability hypothesis for this boundedness estimate, not a condition for dimensional consistency; the n=2 case admits any q>1 with the critical Sobolev embedding in place of the 2∗ embedding.

Facts & Assumptions

Given: Countable Choice and the Axiom of Choice; an open set Ω⊆Rn, n≥2; constants 0<θ≤Ma2; measurable symmetric coefficients A with θ∣ξ∣2≤⟨A(x)ξ,ξ⟩≤Ma2∣ξ∣2; the principal operator L0u=−Di(aijDju) with form a0; a source f∈Llocq(Ω), q>n/2; a nonnegative u∈H1(Ω;R) with a0(u,φ)≤∫Ωfφ dx for all nonnegative φ∈Cc∞(Ω;R); a ball BR(x0)⋐Ω and 0<ρ<1.

[F1]

Assume Countable Choice and the Axiom of Choice. Sobolev positive-part calculus: for w∈H1(Ω;R), w+∈H1 with Dw+=1{w>0}Dw and Dw=0 a.e. on {w=0}; multiplication by a compactly supported smooth factor obeys the weak product rule. If a0(w,v)≤0 for every nonnegative v∈H01(Ω), then w+ is a weak subsolution of the principal operator, so a0(w+,v)≤0 for every nonnegative v∈H01(Ω). Here is the admissible truncation proof. For ϕ∈Cc∞(Ω), ϕ≥0, set ηϵ(t)=min⁡{1,t+/ϵ}. The chain and product rules give ψϵ=ϕηϵ(w)∈H1 with compact support in Ω, hence ψϵ∈H01(Ω); it is nonnegative, and Diψϵ=ηϵ(w)Diϕ+ϵ−1ϕ1{0<w<ϵ}Diw (the level-set endpoints contribute zero because Sobolev gradients vanish a.e. on a level set). Thus a0(w,ψϵ)=∫Ωηϵ(w)aijDjwDiϕ dx+1ϵ∫{0<w<ϵ}ϕ aijDjwDiw dx≤0. The second integral is nonnegative by symmetry, ellipticity, and ϕ≥0, so the first is nonpositive. As ϵ↓0, ηϵ(w)→1{w>0} pointwise and is bounded by 1; dominated convergence applies because A is bounded and ∣Dw∣∣Dϕ∣ is integrable on supp⁡ϕ. Using Dw+=1{w>0}Dw gives a0(w+,ϕ)≤0. To extend from smooth tests to every nonnegative v∈H01, choose zj∈Cc∞(Ω) with zj→v in H1 and pass to a subsequence with zj→v a.e. The positive-part gradient formulas give Dzj+−Dv=1{zj>0}(Dzj−Dv)+(1{zj>0}−1{v>0})Dv. The first term tends to zero in L2; the second does too by dominated convergence, since its indicator tends to zero on {v>0} and Dv=0 a.e. on {v=0}. Also zj+→v in L2 by the 1-Lipschitz property, hence zj+→v in H1. Each nonzero zj+ has compact support in Ω; zero-extend it and convolve with a nonnegative unit-mass radial mollifier, chosen with support radius smaller than dist⁡(supp⁡zj+,∂Ω) (if zj+=0, keep the zero function). The mollified functions are nonnegative and in Cc∞(Ω), and converge to zj+ in H1 by approximate-identity convergence applied to the function and its weak gradient. A diagonal choice gives nonnegative smooth tests converging to v. Boundedness of a0(w,⋅) passes the inequality to v. In particular, no product of an indicator with an arbitrary test is asserted to lie in H01. (Positive-part truncation calculus and admissible cut-off weak tests, Positive, negative, and truncated Sobolev functions, Chain rule for globally Lipschitz scalar maps of Sobolev functions, Weak Leibniz rule with a smooth factor, Compactly supported Sobolev functions extend by zero in every integer order, A radial mollifier family in Rn, A smooth bump between concentric Euclidean balls, The mollifier family generated by a unit-mass smooth bump, Interior mollification commutes with weak derivatives, Every L1 approximate identity converges to the identity in Lp for 1≤p<∞, Dominated convergence, Zero-boundary Sobolev space as a norm closure, Integer-order Sobolev spaces and their norms, The elliptic form is well defined and bounded on H1, Uniformly elliptic divergence-form operators and their sesquilinear forms, Weak subsolutions and supersolutions of a divergence-form equation).

[F2]

Assume the Axiom of Choice. Lax-Milgram and coercivity: H1(B1) is Hilbert by Hk is a Hilbert space under the derivative-sum inner product. Its subspace H01(B1) is closed and linear by its closure definition: a Cauchy sequence there converges in H1(B1), and its limit still lies in the closure of the smooth tests. Thus the restricted derivative-sum inner product makes H01(B1) Hilbert. The form a0 is a bounded sesquilinear form on the Hilbert space H01(B1) with coercivity constant α=θ/(1+CP(B1)2), and for every bounded conjugate-linear functional G on H01(B1) there is a unique h∈H01(B1) with a0(h,v)=G(v) for all v∈H01(B1), the weak Dirichlet solution; it satisfies α∥h∥H01≤∥G∥H−1 (The Lax--Milgram theorem, Coercivity of the principal Dirichlet form, The elliptic form is well defined and bounded on H1, The negative Sobolev space H−1(Ω), Weak Dirichlet solutions for a divergence-form operator, Zero-boundary Sobolev space as a norm closure).

[F3]

Assume the Axiom of Choice. Embedding of H01 into the dual exponents of Lq: for n≥3 and 1≤r<2∗=2n/(n−2) there is Cr with ∥w∥Lr(B1)≤Cr∥w∥H01(B1) for all w∈H01(B1), by Holder and the Sobolev inequality; for n=2 the same holds for every finite r by the critical embedding W01,2(B1)↪Lr(B1) (The Sobolev inequality for zero-boundary Sobolev closures on open sets, The critical Sobolev embedding into every finite Lq, Holder's inequality for integrals, including the endpoint cases, The space Lp(μ) as the quotient by null functions).

[F4]

Assume the Axiom of Choice. The weak maximum principle with a source on the bounded C1 domain B1: if v∈H1(B1;R) satisfies a0(v,φ)≤∫B1gφ dx for every nonnegative φ∈H01(B1) with g∈Lq(B1), q>n/2, then ess sup⁡B1v≤sup⁡∂B1v++C0∥g+∥Lq(B1) with C0=C0(n,q,θ,Ma,B1); in particular for v∈H01(B1) one has ess sup⁡B1v≤C0∥g+∥Lq(B1), and if g≤0 then v≤0 a.e. (Weak maximum principle for coercive divergence-form equations, The Lp trace operator on a bounded C1 domain, The kernel of the trace is the closure of the test functions, Bounded C^k domains and boundary charts).

[F5]

Assume the Axiom of Choice. Homogeneous local boundedness: if w∈H1(B1;R) satisfies w≥0 a.e. and a0(w,v)≤0 for every nonnegative v∈H01(B1), then for every 0<s<1, every 0<σ<1 and every p>0, ess sup⁡Bσsw≤C1(1∣Bs∣∫Bswp dx)1/p; this is the homogeneous theorem applied on the compactly contained ball Bs⋐B1 (De Giorgi local boundedness of homogeneous subsolutions).

Proof

technique · direct; rescale the problem to the unit ball, remove the source by subtracting a barrier built with Lax-Milgram whose size is controlled by the weak maximum principle, apply the homogeneous local boundedness estimate to the positive part of the difference, and undo the rescalings
1.1givenalgebra

Scaling the problem to the unit ball. Define v(y):=u(x0+Ry) for y∈B1, AR(y):=A(x0+Ry) and g(y):=R2f(x0+Ry), so that g∈Lq(B1) with ∥g+∥Lq(B1)=R2−n/q∥f+∥Lq(BR(x0)) and 1∣B1∣∫B1vp dy=1∣BR(x0)∣∫BR(x0)up dx by the change of variables x=x0+Ry; the coefficients AR are again measurable, symmetric and uniformly elliptic with the same constants θ,Ma. Since f∈Lq(BR) and q>n/2, Sobolev and Holder extend the local inequality by density to nonnegative H01(BR) tests. For every such test φ∈H01(B1) the pullback φR(x):=φ((x−x0)/R) lies in H01(BR(x0)) with DφR(x)=R−1Dφ(y), hence a0R(v,φ)=R2−n∫BR(x0)aijDjuDiφR dx≤R2−n∫BR(x0)fφR dx=∫B1gφ dy, where a0R is the form of AR; so v≥0 satisfies the same subsolution inequality on B1 with source g.

2.1step 1.1F1F2F3F4F5

Removing a small source by a barrier. Let U∈H1(B1;R) satisfy U≥0 a.e. and a0(U,φ)≤∫B1gφ dx for all nonnegative φ∈H01(B1) with ∥g+∥Lq(B1)≤1; then for every 0<ρ<1, every p>0 and some C2=C2(n,q,θ,Ma,ρ,p) one has ess sup⁡BρU≤C2(1∣B1∣∫B1Up dx)1/p+C2. Indeed, by [F3] the functional φ↦∫B1g+φ dx is bounded on H01(B1), so by [F2] there is a unique h∈H01(B1) with a0(h,φ)=∫B1g+φ dx for all φ∈H01(B1). Since −h is a weak subsolution with source −g+≤0 and zero boundary values, [F4] gives h≥0; it also gives ess sup⁡B1h≤C0∥g+∥Lq(B1)≤C0. The difference w:=U−h satisfies a0(w,φ)≤−∫B1g−φ dx≤0 for all nonnegative φ∈H01(B1), so w+ is a nonnegative homogeneous weak subsolution by [F1]. Since h≥0 and U≥0, w+=(U−h)+≤U. Fix s:=(1+ρ)/2, so ρ<s<1, and apply [F5] to w+ on the outer ball Bs⋐B1 with inner ratio σ=ρ/s. This gives ess sup⁡Bρw+≤C(1∣Bs∣∫Bs(w+)p)1/p≤C′(1∣B1∣∫B1Up)1/p, where the volume ratio is absorbed into C′. Hence ess sup⁡BρU≤ess sup⁡Bρw++ess sup⁡B1h≤C2(1∣B1∣∫B1Up)1/p+C2.

3.1step 1.1step 2.1F5F6algebra∎

Undoing the rescaling and the normalisation. If ∥g+∥Lq(B1)=0 then v is itself a homogeneous weak subsolution and [F5] gives the claim directly with the forcing term absent. Otherwise put FR:=∥g+∥Lq(B1)>0 and U:=v/FR, so that U≥0, a0(U,φ)≤∫B1(g/FR)φ dx for all nonnegative φ∈H01(B1) and ∥(g/FR)+∥Lq(B1)=1; step 2.1 applied to U gives ess sup⁡BρU≤C2(1∣B1∣∫B1Up)1/p+C2, and multiplying by FR, ess sup⁡Bρv≤C2(1∣B1∣∫B1vp)1/p+C2FR. Substituting the identities of step 1.1 gives ess sup⁡BρR(x0)u≤C2(1∣BR(x0)∣∫BR(x0)up dx)1/p+C2R2−n/q∥f+∥Lq(BR(x0)), which is the asserted estimate with C:=max⁡{C2,1}; the constant depends only on n,q,θ,Ma,ρ,p, and the argument uses Countable Choice and the Axiom of Choice exactly through the cited suppliers.

Depends on

Used by

Dependency tree · two levels

177 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