Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-adaptedPipeline-generatedjudge pass (gpt-6.1-sol)
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.

The mean-zero Poincare inequality on bounded John domains

Statement

Assume the Axiom of Choice (The Axiom of Choice). Let n≥2, let Ω⊆Rn be a bounded John domain with admissible constant cJ, and let 1≤p<∞. There is a constant C(n,p,cJ) with ∥u−uΩ∥Lp(Ω)≤C(n,p,cJ)diam⁡(Ω)∥Du∥Lp(Ω) for every u∈W1,p(Ω;K), where uΩ=∣Ω∣−1∫Ωu. The factor diam⁡(Ω) is necessary: for the function u(x)=x1 on a ball of radius R with the centre as distinguished point, the ratio ∥u−uB∥Lp(B)/∥Du∥Lp(B) grows linearly in R, while the John constant of that pair is 1 for every R.

Facts & Assumptions

Given: The Axiom of Choice, whose Countable-Choice consequence is used for the measure-theoretic interfaces; a bounded John domain Ω with distinguished point x0 and admissible constant cJ; 1≤p<∞; a field K; and a class u∈W1,p(Ω;K).

[F1]

The John chain lemma: with r0=14dist⁡(x0,∂Ω) and B0=B(x0,r0) there is M=M(n,cJ) such that for every x∈Ω there are balls Bi=B(xi,ri)⊆Ω with ∣Bi∪Bi+1∣≤M∣Bi∩Bi+1∣, dist⁡(x,Bi)≤Mri, ri→0, xi→x, and multiplicity at most M (Bounded-overlap ball chains in a bounded John domain; x0,cJ as in John domains and the John constant).

[F2]

Ball oscillation and ball Poincare: for v∈W1,p(B), ∥v−vB∥Lp(B)≤C1(n,p)r∥Dv∥Lp(B) and ∫B∣v−vB∣≤C2(n)r∫B∣Dv∣ for a ball B=B(x,r) (Poincare inequality on a ball, Ball-mean oscillation bound by the Riesz potential of the gradient).

[F3]

At almost every Lebesgue point x of u, the centered averages Aru(x) converge to u(x) as r↓0 (Lebesgue differentiation theorem on Rn, The average of a locally integrable function over a Euclidean ball).

[F4]

The truncated Riesz kernel bound: for measurable Ω′⊆B(z0,ρ) and f∈Lp(Ω′), ∥∫Ω′∣x−y∣1−n∣f(y)∣dy∥Lp(Ω′)≤C(n)ρ∥f∥Lp(Ω′) (The truncated Riesz kernel is bounded on Lp of a bounded set).

[F5]
[F6]

Linear substitution scales Lebesgue measure by the absolute determinant (A linear map T of Rn sends Lebesgue measurable sets to Lebesgue measurable sets, with λn(T[E])=∣det⁡T∣ λn(E) when T is invertible and T[E] Lebesgue null when it is not); smooth classical derivatives are weak derivatives (Classical derivatives agree with weak derivatives), and balls have positive finite measure scaling with the nth power of the radius (Sphere and ball measures scale in Rn).

Proof

technique · direct
1.1F1F2F3algebra

Lebesgue points and the near case. Extend u by zero outside Ω; it is locally integrable. The cited differentiation theorem implies As(∣u−u(x)∣)(x)→0 at almost every x: apply it simultaneously to ∣u−a∣ for the countable dense set a∈Q (or Q+iQ), and bound lim sup⁡s↓0As(∣u−u(x)∣)(x)≤2∣a−u(x)∣; let a→u(x). Write B0=B(x0,r0) for the fixed central ball and B∗:=B(x0,2r0)⊂Ω. For almost every x∈B∗, [F2] gives ∣u(x)−uB∗∣≤C(n)∫B∗∣Du(y)∣∣x−y∣1−ndy. Also ∣uB∗−uB0∣≤∣B0∣−1∫B∗∣u−uB∗∣≤C(n)r01−n∫B∗∣Du∣ by the L1 ball Poincare estimate. Since ∣x−y∣≤4r0 for x,y∈B∗, this last bound is at most C(n)∫B∗∣Du(y)∣∣x−y∣1−ndy. Thus ∣u(x)−uB0∣≤C(n)∫Ω∣Du(y)∣∣x−y∣1−ndy in the near case, with the same fixed B0 for all x.

1.2F1F2F3givenalgebra

Telescoping along the chain. Fix a Lebesgue point x∉B(x0,2r0) of u and a chain {Bi=B(xi,ri)} from [F1], with overlap and distance constant M. Since dist⁡(x,Bi)≤Mri, we have ∣xi−x∣≤(M+1)ri and hence Bi⊆B(x,(M+2)ri). The volume ratio is ∣B(x,(M+2)ri)∣/∣Bi∣=(M+2)n, so [F3] gives ∣uBi−u(x)∣≤1∣Bi∣∫Bi∣u(y)−u(x)∣ dy≤(M+2)nA(M+2)ri(∣u−u(x)∣)(x)⟶0. Thus uBi→u(x), and ∣u(x)−uB0∣≤∑i≥0∣uBi−uBi+1∣. Writing each difference of means as an average over the intersection and using ∣Bi∣,∣Bi+1∣≤M∣Bi∩Bi+1∣ from [F1], ∣uBi−uBi+1∣≤M(∫Bi∣u−uBi∣∣Bi∣+∫Bi+1∣u−uBi+1∣∣Bi+1∣). Applying the L1 ball Poincare inequality [F2] on each ball and using the radius comparability supplied by [F1] gives ∣uBi−uBi+1∣≤C3(n,cJ)∑j∈{i,i+1}rj∫Bj∣Du∣∣Bj∣.

2.1F1F5step 1.1step 1.2givenalgebra

The potential bound. From step 1.2, ∣u(x)−uB0∣≤C3∑iri∫Bi∣Du∣/∣Bi∣ (each ball counted with a bounded number of neighbours with comparable radii, the constant absorbed into C3). For y∈Bi the chain property dist⁡(x,Bi)≤Mri gives ∣x−y∣≤(M+2)ri, hence ∣Bi∣=ωn−1rin/n and ri/∣Bi∣=c(n)ri1−n≤c(n,M)∣x−y∣1−n; summing over i and using the multiplicity bound of [F1], ∑iri∫Bi∣Du∣/∣Bi∣≤c(n,M)∫Ω∣Du(y)∣ ∣x−y∣1−nN(x,y) dy≤c(n,M)∫Ω∣Du(y)∣ ∣x−y∣1−ndy with N(x,y)≤M the number of balls containing y; the exchange of sum and integral is Tonelli [F5]. The index i=0 needs the separate bound r0∫B0∣Du∣/∣B0∣≤c(n,cJ)∫B0∣Du(y)∣∣x−y∣1−ndy: the John condition at x gives diam⁡Ω≤8cJr0, so ∣x−y∣≤8cJr0 for y∈B0 and r01−n≤(8cJ)n−1∣x−y∣1−n. Together with step 1.1, this gives ∣u(x)−uB0∣≤C4(n,cJ)∫Ω∣Du(y)∣ ∣x−y∣1−ndy for almost every x∈Ω.

3.1F1F4F5step 2.1givenalgebra

Lp norms and the mean. Take Lp(Ω) norms in step 2.1 and apply the truncated kernel bound [F4] with Ω′=Ω⊆B(x0,diam⁡Ω) and f=∣Du∣: ∥u−uB0∥Lp(Ω)≤C5(n,cJ)diam⁡(Ω)∥Du∥Lp(Ω). Since uB0 is a constant, uΩ−uB0=∣Ω∣−1∫Ω(u−uB0), so by Holder [F5] ∣uB0−uΩ∣≤∣Ω∣−1∫Ω∣u−uB0∣≤∣Ω∣−1/p∥u−uB0∥Lp(Ω). Hence ∥u−uΩ∥Lp(Ω)≤∥u−uB0∥Lp(Ω)+∣Ω∣1/p∣uB0−uΩ∣≤2∥u−uB0∥Lp(Ω)≤C(n,p,cJ)diam⁡(Ω)∥Du∥Lp(Ω) with C(n,p,cJ):=2C5(n,cJ).

4.1F1F6algebra∎

Necessity of length scaling. On B=B(0,R) take u(x)=x1. By [F6] its weak gradient is e1, and reflection in the first coordinate gives uB=0. Substituting x=Ry yields ∥u∥Lp(B)=R1+n/p(∫B(0,1)∣y1∣pdy)1/p and ∥Du∥Lp(B)=Rn/p∣B(0,1)∣1/p. The first integral is finite and positive, since the unit ball contains a ball on which ∣y1∣ is bounded below by a positive number. Their ratio is therefore c(n,p)R with c(n,p)>0. The radial segment from any x to 0 satisfies R−∣γ(t)∣≥∣x∣−∣γ(t)∣=∣x−γ(t)∣, so this distinguished pair admits John constant 1 for every R. Thus no dimension-and-John-constant bound can omit the length factor.

Source notes

Kinnunen proves the Sobolev-Poincare inequality on John domains (Theorem 5.33, printed pp. 141-143) by exactly this chaining: the telescoping over ∣uBi−uBi+1∣, the ball Poincare inequality, the comparison ri≈∣x−y∣ on Bi, the multiplicity bound, and the truncated-kernel estimate. The present item states the Lp (rather than Lp∗) mean-zero form, which is what the surrounding page promises; the chaining argument is the same, and no Sobolev exponent is used. The endpoint index i=0 is absorbed with the John bound diam⁡Ω≤8cJr0.

Depends on

Used by

Dependency tree · two levels

104 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