Alphabeta Math
PropositionStatement: Literature-sourcedProof: AI-adaptedSession-authored (Fable 5 assisted)precheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-21
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.

A based morphism between connected coverings exists exactly when the induced subgroups are included

Statement

Let B be path-connected and locally path-connected, and let

pi:(Ei,ei)(B,b0)(i=1,2)

be based coverings with connected total spaces. There is a based map of covering spaces f:(E1,e1)(E2,e2) over B if and only if

(p1)π1(E1,e1)(p2)π1(E2,e2).

When it exists, f is unique and is itself a surjective covering map.

Facts & Assumptions

Given: The based connected coverings and base hypotheses in the Statement.

[F1]

If Y is path-connected and locally path-connected, a based lift h~:(Y,y0)(E,e0) through a covering exists exactly when hπ1(Y,y0)pπ1(E,e0), and it is then unique (Lifting criterion for maps from path-connected locally path-connected spaces).

[F2]

For a covering, local path-connectedness holds in the total space exactly when it holds in the base (Local path-connectedness lifts and descends along covering maps).

[F3]

Two lifts from a connected space that agree at one point are equal (Two lifts from a connected space that agree at one point agree everywhere).

[F4]

Over an evenly covered neighbourhood, each sheet maps homeomorphically to that neighbourhood (Covering maps, evenly covered neighbourhoods, fibres, sheets, and trivial coverings).

[F5]
[F6]

Every path in the base has a unique lift from a prescribed point in the fibre (Existence and uniqueness of path lifts through a covering map).

[F7]

Induced fundamental-group homomorphisms respect composition (Induced fundamental-group maps are well defined, functorial and invariant under based homotopy).

Proof

technique · direct
1.1

For the forward implication, [F7] applied to p2f=p1 gives the displayed subgroup inclusion. For the reverse implication, [F2] makes E1 locally path-connected and [F5] makes it path-connected. Apply [F1] to the map p1:E1B and the covering p2:E2B; the inclusion produces a based lift f:E1E2, and p2f=p1 says exactly that it is a map of coverings.

F1F2F5F7
2.1

Uniqueness is part of [F1], and also follows from [F3] because any two such maps lift p1 and agree at e1.

step 1.1F1F3
3.1

First, f is surjective. Indeed, [F2] and [F5] make E2 path-connected. Join f(e1) to any zE2 by a path, project that path through p2, and lift the projection through p1 from e1. The image of this lift under f is a lift with the original initial point, so uniqueness in [F6] makes it the original path and its endpoint maps to z. Now fix bB. Intersect evenly covered neighbourhoods of b for p1 and p2, then use local path-connectedness to choose a path-connected open neighbourhood O inside that intersection. For a p1-sheet U over O, choose xU and let V be the p2-sheet containing f(x). The maps fU and (p2V)1p1U are lifts of p1U through p2, agree at x, and have connected domain U; hence [F3] makes them equal. Thus fU:UV is a homeomorphism. Conversely, every point of f1(V) lies in one such U. Hence f1(V) is the disjoint union of exactly those p1-sheets sent to V, each mapped homeomorphically onto V. Surjectivity makes this family nonempty for every V, so every point of E2 has an evenly covered neighbourhood and [F4] makes f a covering map.

step 1.1F2F3F4F5F6

Depends on

Used by

Dependency tree · two levels

29 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