Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck 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.

Seifert–van Kampen identifies the fundamental group with a group pushout

Statement

Let X=U∪V, where U and V are open path-connected subsets of X, let U∩V be path-connected, and fix x0∈U∩V. For the inclusion-induced maps in the diagram

π1(U,x0)⟵π1(U∩V,x0)⟶π1(V,x0),

the group π1(X,x0), together with the two inclusion-induced homomorphisms, is a pushout (Pushouts of group homomorphisms). Equivalently, the canonical homomorphism from any pushout P of the displayed diagram to π1(X,x0) is an isomorphism. No injectivity of either map from the overlap group is assumed.

Facts & Assumptions

Given: The cover and basepoint in the Statement, a pushout P with factor maps iU,iV, and the inclusion-induced maps to π1(X,x0).

[L1]

Every loop class in π1(X,x0) has a finite factorization by inclusion-images of loop classes from U and V (Loops over a two-set path-connected open cover factor through the covering sets).

[L2]

All subordinate factorizations of homotopic based loops have one common value in P (Homotopic-loop factorizations have the same value in the group pushout).

[L3]

For arbitrary group homomorphisms K→G and K→H, the quotient of G∗H by the normal closure of the amalgamating relations is a pushout, so a pushout of the displayed diagram exists (A group pushout is the quotient of a free product by the amalgamating relations).

[F1]

Every compatible pair of homomorphisms out of the two factors of a group pushout factors through a unique homomorphism from the pushout (Pushouts of group homomorphisms).

[F2]

Pointed inclusions induce group homomorphisms on fundamental groups (The homomorphism on fundamental groups induced by a pointed continuous map).

Proof

technique · direct
1.1L3F1F2choose

Choose the pushout P supplied by [L3]. The two inclusion-induced homomorphisms from π1(U,x0) and π1(V,x0) to π1(X,x0) agree on π1(U∩V,x0), since both composites are induced by the same inclusion. By [F1], they therefore define a unique homomorphism Φ:P→π1(X,x0) satisfying ΦiU=(jU)∗ and ΦiV=(jV)∗.

1.2L1L2construct

For c∈π1(X,x0), let Ψ(c) be the element of P that is the value of some subordinate factorization of some loop representing c. Such a factorization exists by [L1], and [L2] says that all representatives and all their factorizations give the same value. Thus exactly one such element exists for each c, so this rule defines a function without selecting factorizations globally. Concatenating two factorizations concatenates their words, hence Ψ is a homomorphism.

2.1step 1.1step 1.2L1

If c is represented by a factorized loop, applying Φ to its pushout word restores the same product of inclusion-images, which is c by [L1]. Hence ΦΨ=id⁡π1(X,x0).

2.2step 1.1step 1.2F1

For a∈π1(U,x0), the one-factor factorization of its image gives Ψ((jU)∗a)=iU(a), and similarly on the V factor. Thus ΨΦ:P→P agrees with the identity after composition with both factor maps. Uniqueness in [F1] makes ΨΦ=id⁡P.

3.1step 2.1step 2.2∎

The homomorphisms Φ and Ψ are inverse, so Φ is an isomorphism and π1(X,x0) has the asserted pushout property.

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