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.

A finite interior ball chain propagates weak Harnack bounds

Statement

Assume Countable Choice and the Axiom of Choice. Let n≥3, let Ω⊆Rn be open and connected, let A,L0 be as in De Giorgi local boundedness of homogeneous subsolutions, let F∈Llocq(Ω) with q>n/2, and let u∈H1(Ω;R) with u≥0 a.e. be a weak solution of L0u=−F (Harnack inequality for nonnegative weak solutions). Let K⋐Ω be compact and connected with positive Lebesgue measure. Then there are a number N=N(K,Ω) and balls BR1(x1),…,BRN(xN)⋐Ω with ⋃j=1NBRj/2(xj)⊇K together with a constant C=C(n,q,θ,Ma,K,Ω) such that ess sup⁡Ku≤C(ess inf⁡Ku+∑j=1NRj 2−n/q∥F∥Lq(B2Rj(xj))). The connectedness of K makes the finite cover's overlap graph connected, and the constant grows with N; the forcing sum is finite because the cover is finite.

Facts & Assumptions

Given: Countable Choice and the Axiom of Choice; a connected open set Ω⊆Rn; uniformly elliptic measurable symmetric coefficients A with constants θ,Ma; a source F∈Llocq(Ω), q>n/2; a nonnegative weak solution u∈H1(Ω;R) of L0u=−F; a compact connected set K⋐Ω with positive Lebesgue measure.

[F1]

Assume the Axiom of Choice. Harnack inequality on doubled balls: for every ball BR(x) with B2R(x)⋐Ω, ess sup⁡BR/2(x)u≤C1(ess inf⁡BR/2(x)u+R2−n/q∥F∥Lq(B2R(x))) with C1=C1(n,q,θ,Ma) (Harnack inequality for nonnegative weak solutions, Weak subsolutions and supersolutions of a divergence-form equation).

[F2]

Assume the Axiom of Choice. Compactness and containment: since K is compact and Ω is open, dist⁡(K,Rn∖Ω)>0, so a finite family of balls B2Ri(xi)⋐Ω, xi∈K, can be chosen with the half-balls BRi/2(xi) covering K (Heine-Borel in Rn: with the Euclidean metric a subset of Rn is compact if and only if it is closed and bounded, and the proof by bisection uses no choice principle; the same holds on the real line).

[F3]

Since K is connected, the finite cover by the relative open sets K∩BRi/2(xi) has a connected intersection graph: otherwise the unions corresponding to two components of the graph would separate K. If two such relative open sets intersect, the corresponding open balls intersect in a nonempty open set and hence in a set of positive Lebesgue measure (Separation of a topological space, connected and disconnected spaces, clopen sets, and connected subsets).

[F4]

Assume Countable Choice. The zero extension of u∈L2(Ω) lies in L2(Rn)⊂Lloc1(Rn); applying the cited Lebesgue-point theorem and restricting to Ω gives a full-measure Lebesgue set (Lebesgue points and the Lebesgue set of an Lloc1 class, Almost every point is a Lebesgue point of a locally integrable function). At a Lebesgue point x in a ball B, ess inf⁡Bu≤u(x)≤ess sup⁡Bu: if either inequality failed, the averages of ∣u(y)−u(x)∣ over sufficiently small balls centered at x would stay bounded below by a positive constant.

[F5]

For two measurable balls Bi,Bj with ∣Bi∩Bj∣>0, ess inf⁡Biu≤ess sup⁡Bju; otherwise a real number strictly between them would be both an almost-everywhere lower bound on Bi and an almost-everywhere upper bound on Bj, impossible on their positive-measure intersection (The essential supremum of a measurable function with respect to a measure).

[F6]

If Mj≤C1(Mj+1+gj) for j=1,…,N−1 and C1≥1, then M1≤C1N(MN+∑j=1N−1gj) by expanding the finite recurrence. [algebra]

Proof

technique · direct; cover $K$ by finitely many doubled balls whose half-balls have a connected overlap graph, propagate Harnack along a graph path, and use Lebesgue-point values at the endpoints to compare the essential extrema on $K$
1.1givenF2F3

The finite cover and connected overlap graph. By [F2] choose finitely many balls BRi(xi), xi∈K, with B2Ri(xi)⋐Ω whose half-balls cover K. By [F3] their intersection graph is connected. Let G:=∑i=1Ngi, where gi:=Ri2−n/q∥F∥Lq(B2Ri(xi)); this sum is finite because the cover is finite and F∈Llocq(Ω).

2.1step 1.1F1F3F4F5F6

Endpoint estimate along a graph path. Put C0:=max⁡{1,C1}, where C1 is the local Harnack constant in [F1]. Let x,y∈K be Lebesgue points of u, and choose cover half-balls BRi/2(xi) and BRj/2(xj) containing them. By [F3] there is a path i=i0,i1,…,iℓ=j in the finite intersection graph, with ℓ≤N−1. Write Ms:=ess sup⁡BRis/2(xis)u and ms:=ess inf⁡BRis/2(xis)u. For s<ℓ, the Harnack bound [F1] and the correctly oriented overlap comparison [F5] give Ms≤C0(ms+gis)≤C0(Ms+1+gis). Iterating by [F6] and applying [F1] on the last ball gives u(x)≤M0≤C0ℓ+1(u(y)+∑s=0ℓgis)≤C0N(u(y)+G), because [F4] gives u(x)≤M0 and mℓ≤u(y) at Lebesgue points.

3.1step 2.1F4algebra∎

Conclusion for essential extrema on K. The set of Lebesgue points in K has full measure in K by [F4]. For any ε>0, the positive-measure hypothesis on K and the definition of essential infimum give a Lebesgue point y∈K with u(y)<ess inf⁡Ku+ε. Applying step 2.1 with this fixed y gives u(x)≤C0N(ess inf⁡Ku+ε+G) for almost every Lebesgue point x∈K. Taking the essential supremum over K and then letting ε↓0 proves the stated inequality with C:=C0N.

Depends on

Used by

Dependency tree · two levels

100 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