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.
A finite harmonic Taylor series and its Cauchy bound
Example
Assume Countable Choice and . Use one-based coordinate labels for . The polynomial is harmonic on every Euclidean ball, its Taylor expansion about any point terminates at degree two and agrees with everywhere, and its derivatives satisfy the factorial Cauchy estimates on every compactly contained ball.
Facts & Assumptions
Given: Countable Choice, an integer , a point , and radii with .
Harmonic functions are real analytic, with Taylor coefficients ; if lies in the domain and , then (Harmonic functions are real analytic).
Countable Choice is the standing hypothesis (The Axiom of Countable Choice ()).
Verification
Work under [F2]. Write for . Its coordinate partials are , and for , so the second coordinate partials are , and all others vanish; hence , and is harmonic on every Euclidean ball.
Expand about : writing , , and there is no term of degree three or higher. Hence for , the Taylor series terminates at degree two, and it equals at every point (the finite sum is the expansion above), in agreement with the general real-analytic representation of [F1].
Factorial Cauchy bound. For let ; the polynomial is harmonic on all of by step 1.1, so [F1] gives for every multi-index. For the derivative is actually zero. The finite expansion of step 2.1 checks the normalization directly: its coefficient is .
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
29 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
- John K. Hunter, Notes on Partial Differential Equations (2014) (standard reference, not scraped)