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 peripheral presentation from a link diagram
Statement
Assume AC. Let a nonempty labeled oriented closed link have a based regular diagram with an underpass on every component. Choose an initial arc on each component, its positive meridian , and the common upper basing. Put and . For every there are explicit words representing the preferred longitudes in such that the meridian map identifies The words can be chosen coherently through each finite degree. They are obtained through the st approximation of the crossing-conjugation recursion, initialized by component meridians and using the preceding approximation for every over-arc. In particular this describes the kernel, rather than merely the surjectivity, of the component-meridian map. Quotienting further by commutators of arbitrary conjugates of each component meridian adds exactly those commutators to this presentation.
Statement references
Facts & Assumptions
Given: Full AC, the finite based diagram, and .
Full AC supplies the countable-choice hypotheses of the diagram suppliers. The Axiom of Choice
The strand generators and crossing relations give the exterior group, with relation in source-to-target order and its solved inverse in the other direction. Wirtinger presentation correctness for labeled links, Local meridian conjugacy at a labeled link crossing
The product of signed over-meridians in component traversal order is its blackboard parallel; multiplying by the initial meridian to minus the self-writhe gives its preferred longitude. Diagram word for a preferred peripheral longitude
Commutators of lower-central weights have weight at least , and the induced graded commutator pairing is biadditive. Lower-central commutators add weights
The lower-central and commutator conventions are and . Lower-central series and Magnus expansion for links
Proof
Given: Full AC, the finite based link diagram, its initial meridian arcs, and .
Cut the traversal of component just before its initial arc. For every other arc of that component let be the signed product of over-arc symbols encountered before ; for the initial arc set . The nonclosing relations in [F1] successively say . The final relation on that component is , with the full traversal product. This rewriting follows by induction along the traversal and does not treat an over-arc as an already eliminated free generator.
Define words in simultaneously by and , retaining at each initial arc. Substitution in a finite word preserves congruence modulo a normal subgroup. If the substituends change modulo , the conjugate of a weight-one generator changes only modulo , because by [F3]. Consequently : the case is equality in the abelianization, and this observation proves the induction. In , the true arc meridian equals modulo , by the same induction starting from conjugate meridians in the abelianization.
Put , and . Step 2.1 and [F2] show that these are longitude lifts in . The relation is equivalent to . Let be the quotient of by these relations and . Its root-meridian map to is defined because the true meridian and its true peripheral parallel commute on the boundary torus. Every arc meridian is the image of , so this map is onto.
Conversely assign every Wirtinger arc the image of in . If an undercrossing does not close its component, its conjugation equation follows from the consecutive partial traversal products evaluated at : those products give , and modulo by step 2.1. At the closing crossing the same argument leaves exactly , imposed in . Thus all crossing relations hold. By [F1] this gives , and it factors through because is a quotient of . The two maps are inverse: they fix every root generator of , and step 2.1 says their composite fixes every arc generator of . This proves the displayed presentation and the kernel assertion.
For a fixed finite maximum degree, the iterates in step 2.1 stabilize in every lower quotient; applying the same observation to the finite word proves coherence of . Finally, forming a further quotient adds the prescribed relations to the kernel. Surjectivity in step 3.1 means every conjugating element of has a lift in , so the added relations are exactly for words . Their entire normal closure is meant; the argument does not assert this infinite family is finite.
Depends on
- The Axiom of Choice
- Based string links and labeled link peripheral systems
- Lower-central series and Magnus expansion for links
- Wirtinger presentation correctness for labeled links
- Local meridian conjugacy at a labeled link crossing
- Diagram word for a preferred peripheral longitude
- Lower-central commutators add weights
Used by
Dependency tree · two levels
26 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
- Ryan Stees, Milnor’s Invariants for Knots and Links in Closed Orientable 3-Manifolds, §2.5 (standard reference, not scraped)
- John Milnor, Link Groups, §6 (standard reference, not scraped)