Alphabeta Math
CorollaryStatement: 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.

A simply connected overlap turns the van Kampen pushout into a free product

Statement

Under the hypotheses of Seifert–van Kampen identifies the fundamental group with a group pushout, if U∩V is simply connected, then the inclusion-induced homomorphisms give an isomorphism

π1(U,x0)∗π1(V,x0)≅π1(X,x0).

Facts & Assumptions

Given: A two-set van Kampen cover X=U∪V with simply connected overlap.

[L1]

The fundamental group of X is the group pushout of the two inclusion-induced maps from π1(U∩V,x0) (Seifert–van Kampen identifies the fundamental group with a group pushout).

[F1]

The free product with amalgamation over the trivial group is canonically isomorphic to the ordinary free product (Amalgamation over the trivial group is the ordinary free product).

[F2]

A simply connected space has a one-element fundamental group at every basepoint (Simply connected topological spaces).

Proof

technique · direct
1.1L1F2

By [F2], π1(U∩V,x0) is the trivial group, so the two maps in the pushout of [L1] are the unique homomorphisms from the trivial group.

2.1step 1.1L1F1∎

The two maps from the trivial group are injective, so [F1] identifies their pushout with π1(U,x0)∗π1(V,x0). Combining this with [L1] gives the displayed isomorphism.

Depends on

Used by

Dependency tree · two levels

14 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