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

Finite nilpotent link quotients are generated by component meridians

Statement

Let L=K1∪⋯∪Kr be a nonempty labeled oriented link in S3, let G=π1(EL), and choose one based positive meridian mi∈G for each component. For every integer q≥1, the homomorphism from the free group Fr=⟨x1,…,xr⟩ defined by xi↦mi induces a surjection Fr⟶G/ΓqG.

Facts & Assumptions

Given: The link, its chosen product tubes, and based component meridians.

[F1]

The positive component meridians form a basis of H1(EL;Z). String-link exterior homology and end-meridian maps

[F2]

The degree-one Hurewicz map identifies G/Γ2G with H1(EL;Z). The first Hurewicz map is abelianization

[F3]

The lower-central series is Γ1G=G and Γk+1G=[G,ΓkG]. Lower-central series and Magnus expansion for links

[F4]

Commutators add lower-central weights, and their induced pairings on graded quotients are biadditive. Lower-central commutators add weights

Proof

Given: G and its selected meridians m1,…,mr.

1.1F1F2given

Let H=⟨m1,…,mr⟩. By [F1] and [F2], the images of these meridians generate G/Γ2G, so G=HΓ2G.

2.1F1F3F4step 1.1induction

For every k≥2, the quotient ΓkG/Γk+1G is generated by iterated commutators of weight k in the selected meridians. For k=2, [F4] makes the pairing G/Γ2×G/Γ2→Γ2/Γ3 biadditive, so [F1] implies this layer is generated by brackets of the mi. If the claim holds at weight k, then [F3] writes the next layer as generated by brackets of a degree-one class with a weight-k class; [F4] makes that pairing biadditive, so [F1] again reduces the degree-one entries to the mi, and the induction hypothesis reduces the other entries to brackets of those meridians. Each such iterated commutator is a word in H lying in Γk+1G, so its class is in the image of H∩Γk+1G in the graded layer.

3.1step 1.1step 2.1algebrainduction∎

The conclusion of step 2.1 implies ΓkG⊆HΓk+1G for every k≥2, because each generator of the graded layer is represented by a word in the mi that lies in H. Starting from G=HΓ2G in step 1.1 and applying these inclusions successively gives G=HΓqG for every finite q. Therefore the image of H, and hence of the free group map in the statement, is all of G/ΓqG. For q=1 the quotient is trivial.

Depends on

Used by

Dependency tree · two levels

31 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