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 disc Poisson integral can miss the assigned value at a jump
Statement refuted
Let be for and for , so that . For define its bounded-data Poisson integral by . Then for every , so as .
Facts & Assumptions
Given: the unit circle boundary datum above and the disc Poisson kernel.
For and the Poisson kernel of the unit disc is ; writing with gives with (The Poisson kernel on the unit disc).
For the kernel satisfies for every and (The Poisson kernel is positive, has total mass one, and concentrates at a boundary point).
Counterexample
Define for , for , and for , with as in [F1]; this integral is finite because is bounded and the kernel is continuous on the compact circle. Since vanishes on and equals one on , . Also , because is not an interior point of .
Reflection symmetry. For every we have , so [F1] gives ; the substitution maps onto and preserves the Lebesgue measure. Hence .
Normalization. By [F2], ; splitting the integral at and using step 2.1, . Therefore for every .
Failure at the jump. The value is independent of , so as , while the datum assigns at the boundary point ; thus the Poisson integral of a bounded boundary function need not recover the assigned value at a discontinuity, and only continuity of the datum at the point would force it.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
5 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
- Per Kristen Jakobsen, An Introduction to Partial Differential Equations (2019) (standard reference, not scraped)
- Leon Simon, Lectures on PDE (2015 rough draft) (standard reference, not scraped)
- Thomas Schmidt, Partial Differential Equations I (2026) (standard reference, not scraped)