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.
Trivial coverings are products with a discrete fibre
Example
If is any space and is a nonempty discrete space, the projection is a trivial covering with fibre . If , the same holds for ; for nonempty , an empty fibre would violate surjectivity.
Facts & Assumptions
Given: The objects, hypotheses, and choice principles stated above.
A covering map is a continuous surjection such that every has an open neighbourhood for which is a disjoint union of open sets , called sheets, and each restriction is a homeomorphism (def-continuous-map-top, def-homeomorphism-and-open-maps, def-disjoint-union-topology). Such a is evenly covered, and is the fibre over . A covering is trivial when it is isomorphic over to a product projection with discrete. (Covering maps, evenly covered neighbourhoods, fibres, sheets, and trivial coverings).
The product set. Let be a set and let be a set for each . The product is and we write , the -th coordinate of . Two elements of the product are equal exactly when they agree at every index, functions being equal when they have the same domain and the same values. For the -th projection is . The product topology on is the initial topology of the projections: the topology generated by the subbasis . Finite intersections of subbasic sets form a basis for it, and they are exactly the boxes with every open in and for all but finitely many . (The product set of functions choosing a point in each factor, the projections, the box topology, and the product topology as the initial topology of the projections; the empty product is a one-point space).
Throughout, a topology is as in def-topological-space, and finite, at most countable and uncountable are as in def-countable, so that "countable" always means "at most countable" and every finite set is countable. Let be a set. The six families below are topologies on ; that each really satisfies (T1), (T2) and (T3) is discharged in full after the list. Among those six is the discrete topology , in which every subset is open and hence every subset is also closed. (The discrete, indiscrete, cofinite, cocountable, particular-point and Sierpinski topologies).
Verification
For any space and discrete set , verify that the projection is a covering, with every open subset of the base evenly covered.
Identify its sheets and fibre, including : the projection then fails surjectivity unless , so state the nonempty-fibre convention explicitly.
The preceding construction and implications establish the assertion.
Depends on
- Covering maps, evenly covered neighbourhoods, fibres, sheets, and trivial coverings
- The product set $\prod_{i \in I} X_i$ of functions choosing a point in each factor, the projections, the box topology, and the product topology as the initial topology of the projections; the empty product is a one-point space
- The discrete, indiscrete, cofinite, cocountable, particular-point and Sierpinski topologies
Used by
Dependency tree · next 3 levels
Direct dependencies and their dependencies through the next three levels: 51 results over 20 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, §1.3 (standard reference, not scraped)
- Marco Gualtieri, MAT1300 Week 4 Term 2, §1.6 (standard reference, not scraped)
- Omar Antolín Camarena, Proper local homeomorphisms and covering maps (standard reference, not scraped)