Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-generatedPipeline-generatedverified 2026-10-22 (gpt-6.1-sol)
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.

String-link end inclusions identify finite nilpotent peripheral quotients

Statement

Assume AC. Let τ be an r-component based string link with r≥1, exterior Xτ, and endpoint punctured disks P−,P+. Use compatible jointly transported stem accesses for the positive endpoint meridians to identify π1(P−) and π1(P+) with the free group Fr=⟨x1,…,xr⟩, and let ι±:π1(P±)→π1(Xτ) be the based end homomorphisms, including the chosen top connecting path. For every integer q≥1, each induced map ι±,q:Fr/ΓqFr⟶π1(Xτ)/Γqπ1(Xτ) is an isomorphism. Their composite ι−,q−1ι+,q is the based nilpotent comparison of the labeled top and bottom peripheral systems.

Arbitrary independently based positive endpoint meridians are retained as well: the map from the free symbol group Fr sending xi to that chosen meridian need not identify the full fundamental group, but its composites with the end maps still induce the displayed isomorphisms on every finite lower-central quotient. Their inverse/composite is the comparison for those exact choices, and the conjugating access differences are part of the data.

Facts & Assumptions

Given: Full AC and the based string-link data in the statement.

[A1]

Full AC, written AC, is The Axiom of Choice. The local Stallings supplier uses this axiom for its group-homology branch.

[F1]

Each endpoint group is free of rank r, with the compatible positive meridian basis; independently based meridians are the recorded conjugates and give the same homology basis. The exterior inclusion maps are isomorphisms on H1 and epimorphisms on H2. String-link exterior homology and end-meridian maps

[F2]

The natural degree-one Hurewicz maps identify group H1 with abelianization. The first Hurewicz map is abelianization

[F3]

For a path-connected CW complex, the classifying map to the classifying space of its fundamental group is onto on H2. Classifying maps are surjective on second homology

[F4]

Classifying maps commute up to based homotopy with maps of path-connected CW complexes and their induced fundamental-group homomorphisms. Classifying maps are natural up to based homotopy

[F5]

A group homomorphism inducing an isomorphism on H1(−;Z) and an epimorphism on H2(−;Z) induces isomorphisms on every finite lower-central quotient, under the stated AC branch. Integral Stallings theorem for finite lower-central quotients

[F6]

Compact smooth manifolds with corners admit finite CW triangulations under AC. Finite smooth triangulation of compact corners, relative to admissible boundary data

Proof

Given: The endpoint inclusions f±:P±↪Xτ.

1.1F1F2given

By [F1], each f± induces an isomorphism on topological H1 and an epimorphism on topological H2. Naturality of [F2] identifies the H1 map with the map between the abelianizations of π1(P±) and π1(Xτ). Thus each group homomorphism (f±)∗ is an isomorphism on group H1.

2.1F1F3F4F6step 1.1choose

By [F6], P± and Xτ have CW structures, so choose classifying maps c±:P±→Bπ1(P±) and cX:Xτ→Bπ1(Xτ). For either sign and any y∈H2(π1(Xτ);Z), choose z∈H2(Xτ;Z) with (cX)∗(z)=y using [F3]. By [F1] choose w∈H2(P±;Z) with (f±)∗(w)=z. Write ϕ±=(f±)∗. Naturality [F4] gives (Bϕ±)∗((c±)∗(w))=(cX)∗((f±)∗(w))=y. Thus every class y in H2(π1(Xτ);Z) is in the image of the induced group-homology map H2(π1(P±);Z)→H2(π1(Xτ);Z).

3.1A1F5step 1.1step 2.1

By [F5], each (f±)∗ now satisfies both Stallings hypotheses. Applying it separately to f− and f+ proves that each induced map on Fr/Γq is an isomorphism for every finite q≥1.

4.1A1step 3.1algebra

Since both end maps are isomorphisms at every such q, their inverse/composite is defined and is an isomorphism. The meridian labels and basing path are carried through the same maps, so this is exactly the stated peripheral comparison. The proof uses full AC only through the classifying-space and Stallings suppliers; no additional choice is used in the elementwise quotient argument.

5.1A1F1F2F3F5step 3.1constructalgebra∎

Choose arbitrary independently based positive endpoint meridians. Their map a:Fr→π1(P±) is the identity on the ordered H1 basis by [F1] and [F2]. Also H2(π1(P±);Z)=0: [F1] gives H2(P±)=0, and [F3] maps that group onto the group-homology group. Thus a is onto on H2, independently of its source's H2. Apply [F5] to a. It induces an isomorphism at every finite lower-central quotient, even though a need not be an isomorphism on the full groups. Compose it with the already proved end isomorphism of step 3.1. This proves the arbitrary-basing branch and its stated inverse/composite, using exactly the selected meridian conjugations rather than an incorrect free-basis assertion.

Depends on

Used by

Dependency tree · two levels

57 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