Alphabeta Math
PropositionStatement: AI-generatedProof: AI-generated
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.

Covering-space actions and fundamental-groupoid quotients

Statement

Let a group N act on a nonempty, path-connected, locally path-connected space X by homeomorphisms, with every point having an open neighbourhood disjoint from all its nonidentity translates. Give B=X/N the quotient topology and write p:X→B for the orbit map. Then p is a regular covering: its deck transformations act transitively on each fibre. Its deck group is precisely N, acting as given.

The induced action on the fundamental groupoid Π1(X) sends points and endpoint-fixed path classes to their translates. Its orbit groupoid has object and arrow orbits, with composition defined by choosing representatives whose endpoints agree. Projection induces an isomorphism Π1(X)/N≅Π1(B). The induced functor Π1(X)→Π1(B) is a groupoid covering: for each point upstairs, it bijects the arrows starting there with the arrows starting at its image.

For x∈X, use first-path-first multiplication on fundamental groups. The endpoint of the lift of a loop at p(x) starting at x is nx for a unique n∈N; this defines the last map in the exact sequence 1→π1(X,x)→p∗π1(B,p(x))→N→1. No universal cover is used here. Semilocal simple connectedness is a separate local condition to be checked when invoking the usual universal-cover existence theorem.

Statement references

Facts & Assumptions

[F1]

The disjoint-neighbourhood condition is the definition of a covering-space action; it implies that the action is free. Covering-space actions by disjoint translates of neighbourhoods

[F2]

The orbit map of a covering-space action is a covering, and for path-connected total space its deck transformations are exactly the acting transformations. The orbit map of a covering-space action is a covering, with the acting group equal to the deck group when the total space is path-connected

[F3]

A fundamental groupoid has points as objects and endpoint-fixed path-homotopy classes as arrows, with composition by path concatenation. A groupoid has invertible arrows and a functor preserves sources, targets, identities and composition. Fundamental groupoid of a space Set-sized groupoids, functors and composition conversion

[F4]

A path in the base of a covering has a unique lift from each chosen point over its starting point. A homotopy has a unique lift extending a specified lift of its initial map. Existence and uniqueness of path lifts through a covering map Existence and uniqueness of homotopy lifts through a covering map

[F5]

A covering induces an injective homomorphism on based fundamental groups. A covering map induces an injective homomorphism on fundamental groups

[F6]

Semilocal simple connectedness is a local condition on the images of fundamental groups of neighbourhoods. Semilocally simply connected spaces with explicit basepoint convention

Proof

Given: The action, space, quotient and basepoint in the Statement.

Given: The hypotheses and the basepoint x in the Statement.

Goal: Establish the covering, groupoid identification and exact sequence.

Proof technique: direct.

1.1F1F2

By [F1] and [F2], p is a covering and its deck transformations are exactly the transformations from N. The action is free and every fibre is an orbit, so these transformations act freely and transitively on each fibre. Thus the covering is regular in the stated sense and N identifies with its deck group.

2.1step 1.1F3

Projection sends a path class upstairs to its projected class and is invariant under translation. Given two composable arrow orbits, translate a representative of the second so that its source equals the target of a representative of the first. Freeness gives a unique such translate; translating both representatives together changes the composite only by a common translate. Hence this rule gives a well-defined orbit groupoid, and projection defines a functor from it to Π1(B).

2.2step 1.1F4

For a based loop downstairs, [F4] gives a lift from x ending at a unique nx by step 1.1. Endpoint-fixed homotopy lifting makes n independent of the representative. If lifts of loops α and β end at nx and mx, respectively, then the lift of their first-path-first concatenation is the lift of α followed by the n-translate of the lift of β; it ends at nmx. Thus the endpoint map is a homomorphism.

3.1step 2.1F3F4

Each point of B is an orbit, and [F4] lifts every base path from a chosen point over its source. Thus the functor of step 2.1 is surjective on arrows. If two projected paths are endpoint-fixed homotopic, first translate one lift so their initial points agree. Lift the homotopy starting with the first path. Its initial endpoint remains fixed by uniqueness of path lifts; its final endpoint also remains fixed, since it lifts a constant path. The final lifted path is therefore the second path by uniqueness, and the two original arrow classes differ by a translation. The functor is consequently injective on arrows and is an isomorphism. The same lifting argument gives the asserted bijection on arrows starting at any specified point.

4.1step 2.2F5F6∎

Every n∈N occurs: path-connectedness supplies a path from x to nx, whose projection is a loop. The endpoint map has kernel exactly the projected classes of loops at x: a lifted loop has endpoint x, and conversely endpoint x makes the lifted path a loop. Finally p∗ is injective by [F5]. These facts prove exactness; no semilocal simple connectedness or universal cover was used. The separate condition in [F6] is relevant only to an additional universal-cover invocation.

Depends on

Used by · 3

Dependency tree · 2 levels

Each result is drawn at its shortest distance from this item. Arrows run from prerequisites to the items that use them; this item has a heavier outline. External source nodes link directly to the cited text. The view shows up to two dependency steps; open a prerequisite to continue.