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 be a nonempty labeled oriented link in , let , and choose one based positive meridian for each component. For every integer , the homomorphism from the free group defined by induces a surjection
Statement references
Facts & Assumptions
Given: The link, its chosen product tubes, and based component meridians.
The positive component meridians form a basis of . String-link exterior homology and end-meridian maps
The degree-one Hurewicz map identifies with . The first Hurewicz map is abelianization
The lower-central series is and . Lower-central series and Magnus expansion for links
Commutators add lower-central weights, and their induced pairings on graded quotients are biadditive. Lower-central commutators add weights
Proof
Given: and its selected meridians .
Let . By [F1] and [F2], the images of these meridians generate , so .
For every , the quotient is generated by iterated commutators of weight in the selected meridians. For , [F4] makes the pairing biadditive, so [F1] implies this layer is generated by brackets of the . If the claim holds at weight , then [F3] writes the next layer as generated by brackets of a degree-one class with a weight- class; [F4] makes that pairing biadditive, so [F1] again reduces the degree-one entries to the , and the induction hypothesis reduces the other entries to brackets of those meridians. Each such iterated commutator is a word in lying in , so its class is in the image of in the graded layer.
The conclusion of step 2.1 implies for every , because each generator of the graded layer is represented by a word in the that lies in . Starting from in step 1.1 and applying these inclusions successively gives for every finite . Therefore the image of , and hence of the free group map in the statement, is all of . For 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
- John Milnor, Link Groups (standard reference, not scraped)
- Ryan Stees, Milnor’s Invariants for Knots and Links in Closed Orientable 3-Manifolds (standard reference, not scraped)