Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-08-16
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.

For a nonempty path-connected locally path-connected semilocally simply connected space, the path-class projection is a covering map

Statement

If X is nonempty, path-connected, locally path-connected, and semilocally simply connected, then after a basepoint is fixed the path-class basic sets define a topology on X~ for which the endpoint projection p:X~→X is a covering map.

Facts & Assumptions

Given: The objects, hypotheses, and choice principles stated above.

[F1]

Fix a path-connected space X and x0∈X. Let X~ be the set of endpoint-fixed homotopy classes [α] of paths beginning at x0, and put p([α])=α(1). If U is an open path-connected neighbourhood of α(1) on which the inclusion-induced fundamental-group map is trivial, define B([α],U) to consist of the classes [α∗γ] with γ a path in U beginning at α(1). These sets are the proposed basic neighbourhoods for the path-class model (def-homotopy-relative-and-path-homotopy, def-semilocally-simply-connected-space, def-path-connected). (The based path-class model and basic sets for a universal cover).

[F2]

A covering map is a continuous surjection p:E→B such that every b∈B has an open neighbourhood U for which p−1(U) is a disjoint union of open sets Vj, called sheets, and each restriction p∣Vj:Vj→U is a homeomorphism (def-continuous-map-top, def-homeomorphism-and-open-maps, def-disjoint-union-topology). Such a U is evenly covered, and p−1(b) is the fibre over b. A covering is trivial when it is isomorphic over B to a product projection B×F→B with F discrete. (Covering maps, evenly covered neighbourhoods, fibres, sheets, and trivial coverings).

[F3]

A space X is semilocally simply connected at x∈X when there is a neighbourhood U of x and a basepoint-preserving inclusion (U,x)↪(X,x) whose induced map on fundamental groups is trivial (def-neighbourhood-top, def-induced-homomorphism-on-fundamental-groups, def-based-loops-and-fundamental-group). It is semilocally simply connected when this holds at every point. The neighbourhood need not itself be simply connected. (Semilocally simply connected spaces with explicit basepoint convention).

[F4]

Let (X,T) be a topological space (def-topological-space) and let x∈X. Subsets carry the subspace topology (def-subspace-topology-top); connectedness is def-connected-space and path-connectedness is def-path-connected. X is locally connected at x when for every open U with x∈U there is an open connected V with x∈V⊆U, and locally connected when this holds at every point; X is locally path-connected at x when for every open U with x∈U there is an open path-connected V with x∈V⊆U, and locally path-connected when this holds at every point. (Locally connected and locally path-connected spaces: a neighbourhood base of open connected, respectively open path-connected, sets at every point).

Proof

technique · direct
1.1givenF1F3F2F4

Refine each semilocally simply connected neighbourhood to an open path-connected one.

2.1step 1.1F1F3F2

For a path class ending at its centre, append paths in that neighbourhood to obtain a basic sheet.

3.1step 2.1F1F3F2

Triviality of the inclusion-induced fundamental group makes the endpoint description independent of the appended path, and distinct initial classes give disjoint sheets.

4.1step 3.1F1F2F3

Verify that these basic sets form a topology and map homeomorphically onto the chosen neighbourhood.

5.1step 4.1∎

The preceding construction and implications establish the assertion.

Depends on

Used by

Dependency tree · two levels

17 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