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.
is a covering map with translated interval sheets
Statement
is a covering map. More explicitly, for every , let
Then is an open neighbourhood of ,
and every restriction is a homeomorphism.
Facts & Assumptions
Given: The quotient map and a real representative of an arbitrary quotient class.
The quotient map is open, and every interval shorter than one embeds in . Moreover, for open (The quotient map is open, and every interval shorter than one embeds in ).
A covering map is a continuous surjection such that every has an open neighbourhood for which is a disjoint union of open sheets , and each restriction is a homeomorphism (Covering maps, evenly covered neighbourhoods, fibres, sheets, and trivial coverings).
Proof
The interval has length . Its image is open by [L1] and contains .
By the saturation formula in [L1], . These open intervals are pairwise disjoint: if belonged to and , then , and an integer of absolute value below one is zero, so .
Every translate has length , so [L1] makes a homeomorphism onto its image; its image is . The map is already a continuous surjection because it is a quotient projection, and steps 1.1 and 1.2 give an open neighbourhood with a disjoint union of open sheets. Thus every clause of [L2] holds, and is a covering map.
Depends on
Used by
Dependency tree · next 3 levels
Direct dependencies and their dependencies through the next three levels: 44 results over 10 levels. An arrow runs from a result to what uses it, and this result sits at the bottom with a heavier outline. Click the chart to enlarge it.
Sources
- Allen Hatcher, Algebraic Topology, Ch. 1, Section 1.1 (standard reference, not scraped)
- J. Peter May, A Concise Course in Algebraic Topology, Ch. 1, Section 5 (standard reference, not scraped)