Alphabeta Math
ExampleConstruction: Literature-sourcedVerification: AI-adaptedprecheck passaudited 2026-08-11
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 path between basepoints induces an isomorphism of fundamental groups

Example

If a path γ joins x0 to x1, conjugating loops by γ gives an isomorphism π1(X,x0)≅π1(X,x1).

Facts & Assumptions

Given: A space X and a path γ:x0→x1.

[L1]

Loop classes at a basepoint multiply by concatenation in traversal order, [α][β]=[α∗β], and form a group with identity the class of the constant loop and [α]−1=[αˉ] (Based loops and the fundamental group, Loop classes form the group π1(X,x0) under concatenation).

[L2]

A path in X from x to y is a continuous γ:I→X with γ(0)=x and γ(1)=y; its reversal is γˉ(t)=γ(1−t), and paths with matching endpoints concatenate by traversing each at double speed (Paths, path-connected spaces and path components).

[L3]

A path homotopy relative to the endpoints between paths α,β with the same initial and terminal points is a continuous H:I×I→X with H(s,0)=α(s), H(s,1)=β(s), H(0,t)=α(0) and H(1,t)=α(1) (Homotopies of continuous maps, homotopies relative to a subspace, and path homotopies relative to the endpoints); this relation is an equivalence relation (Homotopy relative to a fixed subspace, and path homotopy relative to endpoints, are equivalence relations).

[L4]

A map is continuous when its restrictions to the members of a finite closed cover are continuous and agree on overlaps (Continuity may be checked on any open cover, and on any finite closed cover; composites of continuous maps are continuous).

[L5]

A bijective group homomorphism is a group isomorphism (Group isomorphisms, automorphisms and the set Aut⁡(G)).

Verification

technique · direct
1.1

Concatenation respects path homotopy. Let α≃α′ rel endpoints by H, and let β≃β′ rel endpoints by K, with the terminal point of α equal to the initial point of β. Setting G(s,t)=H(2s,t) for s≤12 and G(s,t)=K(2s−1,t) for s≥12 gives a map on the two closed sets [0,12]×I and [12,1]×I, which cover I×I and meet where H(1,t) and K(0,t) are both the shared endpoint. Each piece is a composite of H or K with an affine map of I×I, so [L4] makes G continuous, and it is a path homotopy α∗β≃α′∗β′ rel endpoints.

L2L3L4
1.2

Reparametrisation does not change the class. Let φ:I→I be continuous with φ(0)=0 and φ(1)=1, and let λ be a path. Then H(s,t)=λ((1−t)φ(s)+ts) is continuous, starts at λ∘φ, ends at λ, and is constant at each endpoint, so λ∘φ≃λ rel endpoints. Both bracketings of a triple concatenation, and each concatenation of a path with a constant path at its own endpoint, differ from the path itself precisely by such a φ. Hence concatenation is associative and the constant paths act as identities, in both cases up to path homotopy rel endpoints.

L2L3
1.3

A path cancels its reversal. For a path λ from x to y, put H(s,t)=λ(2s(1−t)) for s≤12 and H(s,t)=λ(2(1−s)(1−t)) for s≥12. The two closed pieces agree at s=12, where both give λ(1−t), so [L4] makes H continuous. At t=0 it is λ∗λˉ and at t=1 it is the constant path at x, and H(0,t)=H(1,t)=x throughout. Thus λ∗λˉ≃cx rel endpoints, and applying this to λˉ gives λˉ∗λ≃cy.

L2L3L4
2.1

Define γ#:π1(X,x0)→π1(X,x1) by γ#([α])=[γˉ∗α∗γ], bracketed as (γˉ∗α)∗γ. The path γˉ runs from x1 to x0 and γ from x0 to x1, so this is a loop at x1. If α≃α′ rel endpoints, step 1.1 applied twice gives γˉ∗α∗γ≃γˉ∗α′∗γ, so γ# is independent of the representative.

step 1.1L1L2L3
3.1

Homomorphism. For loops α,β at x0, reassociating by step 1.2 turns (γˉ∗α∗γ)∗(γˉ∗β∗γ) into γˉ∗α∗(γ∗γˉ)∗β∗γ; step 1.3 replaces the middle γ∗γˉ by the constant path at x0, step 1.2 deletes that constant factor, and each replacement is licensed inside the larger concatenation by step 1.1. The result is γˉ∗(α∗β)∗γ, so γ#([α])γ#([β])=γ#([α][β]) by [L1].

step 1.1step 1.2step 1.3step 2.1L1
3.2

Two-sided inverse. The same construction applied to γˉ, whose reversal is γ, gives γˉ#:π1(X,x1)→π1(X,x0). Composing, γˉ#(γ#([α]))=[γ∗(γˉ∗α∗γ)∗γˉ], and steps 1.2 and 1.3 reduce the two inserted pairs γ∗γˉ and γ∗γˉ to constant paths, leaving [α]. The other composite is identical with the roles exchanged.

step 1.1step 1.2step 1.3step 2.1
4.1

Thus γ# is a homomorphism with a two-sided inverse, hence bijective, and [L5] makes it a group isomorphism π1(X,x0)≅π1(X,x1).

step 3.1step 3.2L5∎

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

27 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