Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-08-26
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 Poisson kernel is a boundary approximate identity

Statement

Let φ:∂D→R be continuous. Then

P[φ](reiα)⟶φ(eiα)(r→1−)

uniformly in α∈R.

Facts & Assumptions

Given: A continuous boundary datum φ:∂D→R.

[L1]

The Poisson kernel is positive, has total mass one, and its mass away from a fixed boundary point tends uniformly to zero as r→1− (The Poisson kernel is positive, has total mass one, and concentrates at a boundary point).

Proof

technique · direct
1.1givenchoose

Let ε>0. By uniform continuity of φ on the compact unit circle, choose δ∈(0,π] such that ∣φ(eit)−φ(eiα)∣<ε/2 whenever the circular distance from t to α is less than δ.

2.1L1step 1.1algebra

Writing z=reiα and subtracting φ(eiα) inside the Poisson integral, positivity and total mass one from [L1] give ∣P[φ](z)−φ(eiα)∣≤12π∫∣t−α∣<δPr(α−t)ε2 dt+12π∫∣t−α∣≥δPr(α−t) 2∥φ∥∞ dt.

3.1step 2.1L1

The first integral in step 2.1 is at most ε/2 because the kernel mass is 1, and the second is at most 2∥φ∥∞ times the far-arc mass from [L1], which is <ε/2 for all α once r is close enough to 1. Therefore ∣P[φ](reiα)−φ(eiα)∣<ε uniformly in α.

4.1step 3.1∎

Since ε was arbitrary, the convergence is uniform as r→1−.

Depends on

Used by

Dependency tree · two levels

6 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