Alphabeta Math
ExampleConstruction: Literature-sourcedVerification: AI-adaptedSession-authored (Fable 5 assisted)precheck 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 γ\gamma joins x0x_0 to x1x_1, conjugating loops by γ\gamma gives an isomorphism π1(X,x0)π1(X,x1)\pi_1(X,x_0)\cong\pi_1(X,x_1).

Facts & Assumptions

Given: A space XX and a path γ:x0x1\gamma:x_0\to x_1.

[L1]

Loop classes at a basepoint multiply by concatenation in traversal order, [α][β]=[αβ][\alpha][\beta]=[\alpha*\beta], and form a group with identity the class of the constant loop and [α]1=[αˉ][\alpha]^{-1}=[\bar\alpha] (Based loops and the fundamental group, Loop classes form the group π1(X,x0)\pi_1(X,x_0) under concatenation).

[L2]

A path in XX from xx to yy is a continuous γ:IX\gamma:I\to X with γ(0)=x\gamma(0)=x and γ(1)=y\gamma(1)=y; its reversal is γˉ(t)=γ(1t)\bar\gamma(t)=\gamma(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 α,β\alpha,\beta with the same initial and terminal points is a continuous H:I×IXH:I\times I\to X with H(s,0)=α(s)H(s,0)=\alpha(s), H(s,1)=β(s)H(s,1)=\beta(s), H(0,t)=α(0)H(0,t)=\alpha(0) and H(1,t)=α(1)H(1,t)=\alpha(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)\operatorname{Aut}(G)).

Verification

technique · direct
1.1

Concatenation respects path homotopy. Let αα\alpha\simeq\alpha' rel endpoints by HH, and let ββ\beta\simeq\beta' rel endpoints by KK, with the terminal point of α\alpha equal to the initial point of β\beta. Setting G(s,t)=H(2s,t)G(s,t)=H(2s,t) for s12s\le\tfrac12 and G(s,t)=K(2s1,t)G(s,t)=K(2s-1,t) for s12s\ge\tfrac12 gives a map on the two closed sets [0,12]×I[0,\tfrac12]\times I and [12,1]×I[\tfrac12,1]\times I, which cover I×II\times I and meet where H(1,t)H(1,t) and K(0,t)K(0,t) are both the shared endpoint. Each piece is a composite of HH or KK with an affine map of I×II\times I, so [L4] makes GG continuous, and it is a path homotopy αβαβ\alpha*\beta\simeq\alpha'*\beta' rel endpoints.

L2L3L4
1.2

Reparametrisation does not change the class. Let φ:II\varphi:I\to I be continuous with φ(0)=0\varphi(0)=0 and φ(1)=1\varphi(1)=1, and let λ\lambda be a path. Then H(s,t)=λ((1t)φ(s)+ts)H(s,t)=\lambda\bigl((1-t)\varphi(s)+ts\bigr) is continuous, starts at λφ\lambda\circ\varphi, ends at λ\lambda, and is constant at each endpoint, so λφλ\lambda\circ\varphi\simeq\lambda 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 φ\varphi. 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 λ\lambda from xx to yy, put H(s,t)=λ(2s(1t))H(s,t)=\lambda(2s(1-t)) for s12s\le\tfrac12 and H(s,t)=λ(2(1s)(1t))H(s,t)=\lambda(2(1-s)(1-t)) for s12s\ge\tfrac12. The two closed pieces agree at s=12s=\tfrac12, where both give λ(1t)\lambda(1-t), so [L4] makes HH continuous. At t=0t=0 it is λλˉ\lambda*\bar\lambda and at t=1t=1 it is the constant path at xx, and H(0,t)=H(1,t)=xH(0,t)=H(1,t)=x throughout. Thus λλˉcx\lambda*\bar\lambda\simeq c_x rel endpoints, and applying this to λˉ\bar\lambda gives λˉλcy\bar\lambda*\lambda\simeq c_y.

L2L3L4
2.1

Define γ#:π1(X,x0)π1(X,x1)\gamma_\#:\pi_1(X,x_0)\to\pi_1(X,x_1) by γ#([α])=[γˉαγ]\gamma_\#([\alpha])=[\bar\gamma*\alpha*\gamma], bracketed as (γˉα)γ(\bar\gamma*\alpha)*\gamma. The path γˉ\bar\gamma runs from x1x_1 to x0x_0 and γ\gamma from x0x_0 to x1x_1, so this is a loop at x1x_1. If αα\alpha\simeq\alpha' rel endpoints, step 1.1 applied twice gives γˉαγγˉαγ\bar\gamma*\alpha*\gamma\simeq\bar\gamma*\alpha'*\gamma, so γ#\gamma_\# is independent of the representative.

step 1.1L1L2L3
3.1

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

step 1.1step 1.2step 1.3step 2.1L1
3.2

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

step 1.1step 1.2step 1.3step 2.1
4.1

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

step 3.1step 3.2L5

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · next 3 levels

Direct dependencies and their dependencies through the next three levels: 91 results over 19 levels. An arrow runs from a result to what uses it, and this result sits at the bottom with a heavier outline. Click the chart to enlarge it.

Sources