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.
Polynomials are not complete in the supremum norm on a compact interval
Example
Let be real numbers, and let be the real polynomial functions on with the supremum norm. Then is not complete. Its completion is .
Facts & Assumptions
Given: Real numbers , the midpoint , and the function on .
The real Stone-Weierstrass theorem makes the polynomial algebra dense in for the supremum norm (Real Stone--Weierstrass theorem for compact metric spaces).
The space is Banach for the supremum norm ( is Banach when is compact metric).
Any two completions of a normed space are uniquely linearly isometric (Any two completions of a normed space are uniquely linearly isometric).
Verification
By [L1], the polynomial algebra is dense in , so in particular the continuous function lies in its supremum-norm closure.
The function is not a polynomial on : if a polynomial agreed with , then on it would satisfy , and on it would satisfy . So the polynomial would vanish on the interval , hence be identically zero, and similarly would be identically zero, forcing for all , impossible because .
Steps 1.1 and 1.2 show that is dense and proper in the Banach space , so it is not complete.
Since is Banach by [L2] and contains densely, [L3] identifies the completion of with .
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
12 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
- Gerald Teschl, Topics in Real and Functional Analysis (standard reference, not scraped)
- Stone-Weierstrass Theorem (University of Chicago) (standard reference, not scraped)