Alphabeta Math
ExampleConstruction: Literature-sourcedVerification: AI-adaptedPipeline-generatedjudge pass (gpt-6.1-sol)audited 2026-10-02
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.

Quantitative concentration of the ball Poisson kernel

Example

Assume Countable Choice and n≥3. For p∈∂BR(a), δ>0 and x∈BR(a) with ∣x−p∣<δ/2, the Poisson kernel mass outside the cap {∣y−p∣<δ} is at most Cn,Rδ−n(R2−∣x−a∣2), with Cn,R=2nRn−2, hence tends to zero as x→p from inside. The cap mass consequently tends to one.

Facts & Assumptions

Given: Countable Choice, an integer n≥3, a centre a∈Rn, a radius R>0, a boundary point p∈∂BR(a), a number δ>0 and an interior point x∈BR(a) with ∣x−p∣<δ/2.

[F1]

The kernel is PR,a(x,y)=(R2−∣x−a∣2)/(Rωn−1∣x−y∣n), positive and continuous on BR(a)×∂BR(a), and ∫∂BR(a)PR,a(x,y) dSy=1 (Poisson kernel of a Euclidean ball, The ball Poisson kernel is positive and has unit mass).

[F2]

∂BR(a) is a compact C1 hypersurface; the surface integral of bounded Borel functions is finite, additive over a Borel partition and monotone (Surface integration on compact C1 hypersurfaces, Sphere and ball measures scale in Rn).

[F3]

For data g∈C(∂BR(a);C) and ∣x−p∣<δ/2 one has ∣Ug(x)−g(p)∣≤ωg,p(δ)+2n+1Rn−2δ−n∥g∥∞(R2−∣x−a∣2), where Ug is the Poisson integral of g (Cap and complement estimate for the ball Poisson integral).

[F4]

Countable Choice ACω is the standing hypothesis (The Axiom of Countable Choice (ACω)).

Verification

technique · direct
1.1givenF1F2F4

Work under [F4], put κ:=R2−∣x−a∣2 (positive because x is interior) and C:={y∈∂BR(a):∣y−p∣<δ}, D:=∂BR(a)∖C. By [F2] the two masses MC:=∫CPR,a(x,⋅) dS and MD:=∫DPR,a(x,⋅) dS are finite and add to ∫∂BR(a)PR,a(x,⋅) dS=1 by [F1].

2.1step 1.1F1algebra

For y∈D one has ∣y−p∣≥δ, hence ∣x−y∣≥∣y−p∣−∣x−p∣>δ/2 and 1/∣x−y∣n≤2nδ−n; therefore PR,a(x,y)≤κ2n/(Rωn−1δn) by [F1].

3.1step 2.1F2algebra

Integrating the bound of step 2.1 over D and using [F2] with ∣∂BR(a)∣=ωn−1Rn−1 gives MD≤(κ2n/(Rωn−1δn))ωn−1Rn−1=2nRn−2δ−nκ=Cn,Rδ−nκ.

4.1step 3.1F1algebra

Hence MC=1−MD≥1−Cn,Rδ−nκ by step 1.1, and MC≤1 by the unit-mass identity of [F1]; as κ=R2−∣x−a∣2→0 when x→p (because ∣p−a∣=R), the cap mass tends to one and the mass MD outside the cap tends to zero.

5.1step 3.1step 4.1F1F3∎

This computation is the mass-split content of the cap/complement estimate [F3] read on constant data: for g≡1 one has ωg,p=0, ∥g∥∞=1 and Ug(x)=1 by [F1], so [F3] reduces to the trivial inequality 0≤2n+1Rn−2δ−nκ; the genuine concentration information for kernel mass alone is exactly the bound of step 3.1 and the limit of step 4.1. Both assertions of the statement are therefore proved.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

26 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