Alphabeta Math
TheoremStatement: 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 integral gives the unique continuous harmonic extension on the closed unit disc

Statement

Let φ:∂D→R be continuous. Then its Poisson integral P[φ] is harmonic on D, extends continuously to D‾, agrees with φ on ∂D, and is the unique function with those properties.

Facts & Assumptions

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

[L1]

The Poisson integral is harmonic on D (Poisson integrals are harmonic on the unit disc).

[L2]

The Poisson integral converges to the boundary data uniformly as r→1− (The Poisson kernel is a boundary approximate identity).

[L3]

A bounded-domain continuous harmonic extension of fixed boundary data is unique (The bounded plane Dirichlet problem has at most one continuous harmonic solution).

Proof

technique · direct
1.1L1

By [L1], the function P[φ] is harmonic on D.

1.2L2

For z=reiα with 0≤r<1, [L2] gives P[φ](reiα)→φ(eiα) uniformly in α as r→1−. Therefore defining the boundary values of P[φ] by φ produces a continuous extension to D‾.

2.1step 1.1step 1.2L3∎

If u is any other continuous harmonic function on D‾ with u=φ on ∂D, then [L3] applied to u and the extended Poisson integral forces u=P[φ] on D‾.

Depends on

Used by

Dependency tree · two levels

10 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