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 exhaustion metric induces exactly the topology of locally uniform convergence
Statement
Let be the canonical compact exhaustion of a plane domain , and let be a sequence of functions . Then Consequently the exhaustion metric induces exactly the topology of locally uniform convergence.
Facts & Assumptions
Given: The canonical exhaustion , the exhaustion metric , and a sequence .
The sets are compact, nested inside successive interiors, and exhaust (Every plane domain has the canonical nested compact exhaustion by distance and radius cutoffs).
On a plane domain, local uniform convergence is the same as uniform convergence on every compact subset (Locally uniform convergence on a plane domain is the already-published compact-convergence notion).
Proof
If , then each summand tends to , so uniformly on every .
Any compact set is contained in some because the interiors of the cover by [L1]. Step 1.1 then gives uniform convergence on every compact , and [L2] makes the convergence locally uniform.
Conversely, if locally uniformly, then [L2] gives uniform convergence on every , including the empty stages with zero supremum. A finite-head plus geometric-tail estimate then gives .
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
- Matthias Weber, Complex Analysis, Ch. 5 §§5.1-5.2 (standard reference, not scraped)
- Elias M. Stein and Rami Shakarchi, Complex Analysis, Ch. 2 §5.2 and Ch. 8 §3.2 (standard reference, not scraped)
- Sheldon Axler, Paul Bourdon, and Wade Ramey, Harmonic Function Theory, Ch. 2 (standard reference, not scraped)