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.
Two admissible continuation chains along one path admit a common refinement
Statement
Let be a path and let be a holomorphic germ at . If
- over , and
- over
are admissible continuation chains for along , then there is a subdivision
such that for each the subpath lies in some and in some . In particular the two chains admit a common refinement by restricting representatives to these smaller subintervals.
Facts & Assumptions
Given: A path and two admissible continuation chains for the same initial germ along .
An admissible continuation chain is given by a finite subdivision of and function elements covering the corresponding subpath images (Analytic continuation along a path by admissible chains).
Every open cover of a compact metric space has a Lebesgue number (Every open cover of a compact metric space has a Lebesgue number: a such that every nonempty subset of diameter less than lies inside a single member of the cover).
Proof
By [L1], each set is open in , and the containment gives . Hence the finite family is an open cover of . Likewise is an open cover of .
Apply [L2] to the compact interval and the two open covers and . Let be corresponding Lebesgue numbers, put , and choose a subdivision whose mesh is less than . Then every interval has diameter less than both and .
For each , the interval has diameter less than and less than , so the Lebesgue-number property gives indices with and . Equivalently, . Restricting and to these smaller intervals produces the required common refinement.
Depends on
Used by
Dependency tree · two levels
19 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
- Lars V. Ahlfors, Complex Analysis, 3rd ed., Ch. 8 §1.4 (standard reference, not scraped)
- Henry Wilton, Riemann Surfaces lecture notes, §9.2 (standard reference, not scraped)