Alphabeta Math
TheoremStatement: 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.

Lifting criterion for maps from path-connected locally path-connected spaces

Statement

Let Y be path-connected and locally path-connected, let f:(Y,y0)→(B,b0) be based, and let p:(E,e0)→(B,b0) be a covering. A based lift f~:(Y,y0)→(E,e0) exists if and only if f∗π1(Y,y0)⊆p∗π1(E,e0); when it exists it is unique.

Facts & Assumptions

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

[F1]

Let p:E→B be a covering, let α:I→B be a path, and let e0∈E satisfy p(e0)=α(0). There is a unique path α~:I→E with α~(0)=e0 and p∘α~=α. (Existence and uniqueness of path lifts through a covering map).

[F2]

Endpoint-fixed homotopic paths in the base have lifts with the same endpoint whenever their lifts begin at the same point. (The endpoint of a lifted path depends only on its endpoint-fixed homotopy class).

[F3]

Let Y be connected and let f,g:Y→E be lifts through the same covering of the same map Y→B. If f(y0)=g(y0) for some y0∈Y, then f=g. (Two lifts from a connected space that agree at one point agree everywhere).

[F4]

Let f:X→Y be continuous and let x0∈X. Composition sends a loop α at x0 to the loop f∘α at f(x0). Using the loop classes and fundamental group of def-based-loops-and-fundamental-group, the proposed induced homomorphism is f∗:π1(X,x0)⟶π1(Y,f(x0)),f∗([α]):=[f∘α]. The next theorem proves that this value is independent of the representative, that it is a group homomorphism in the sense of def-group-homomorphism, and that induced maps respect identities, composition and homotopies that fix the basepoint. (The homomorphism on fundamental groups induced by a pointed continuous map).

[F5]

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).

[F6]

Let f:(X,x0)→(Y,y0) be continuous with f(x0)=y0. Then f∗([α])=[f∘α] is a well-defined group homomorphism, and for pointed continuous maps id⁡∗=id⁡ and (g∘f)∗=g∗∘f∗ (Induced fundamental-group maps are well defined, functorial and invariant under based homotopy).

Proof

technique · direct
1.1givenF5F1F2F4F6

For a based map f:(Y,y0)→(X,x0) with Y path-connected and locally path-connected, necessity follows by functoriality: if a based lift f~ exists then f=p∘f~, so f∗=p∗∘f~∗ by the composition law of [F6], whence f∗π1(Y,y0)⊆p∗π1(E,e0). [F4] is the definition of the induced map and expressly leaves functoriality to [F6].

2.1step 1.1F1F2F5

For sufficiency, define the candidate lift at y by lifting f along any path from y0; the subgroup inclusion makes the endpoint independent of the chosen path.

3.1step 2.1F5F1F2

Local path-connectedness and an evenly covered neighbourhood make the candidate continuous.

4.1step 3.1F3F5

Uniqueness follows from connectedness.

5.1step 4.1∎

The preceding construction and implications establish the assertion.

Depends on

Used by

Dependency tree · two levels

28 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