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.
Lower-central series and Magnus expansion for links
Definition
For any group , define its lower-central series by and , where is the subgroup generated by for and . For , let be the free group on the formal meridian symbols , with the free-group convention of its stated generators.
Let be the ring of formal integer sums over all finite words in the letters , with multiplication given by concatenation of words. This is the degree-complete ring for the word-length filtration; a series with invertible constant coefficient is a unit, with inverse determined recursively degree by degree. Filter it by total degree (word length), and let be the ideal of series with zero constant term. The Magnus expansion is the group homomorphism It sends to . For an integer , calculations through degree use the truncated ring . As a -module it has the finite monomial basis of words of length at most . In , the inverse of for is the finite sum .
For a based string link, may be used as formal symbols corresponding to the positive bottom-end meridians. No freeness or lower-central quotient isomorphism is asserted here; those properties require separate proofs.
Definition references
Remarks
The commutator convention is . Truncation to degree retains the constant and homogeneous terms of degrees at most .
Depends on
Used by
- Truncated Milnor invariants from a based link diagram Algorithm
- Integer Milnor coefficients and closed-link residues Definition
- The Borromean string link has nonzero triple Milnor invariant Example
- Finite nilpotent link quotients are generated by component meridians Lemma
- Finite nilpotent peripheral presentation from a link diagram Lemma
- Magnus coefficient changes under longitude conjugation depend on lower-order coefficients Lemma
- Magnus commutator degree and finite truncation Lemma
- Milnor basing indeterminacy and self-crossing scope Lemma
- String-link end inclusions identify finite nilpotent peripheral quotients Theorem
- Truncated Milnor computation terminates and matches peripheral quotients Theorem
Dependency tree · two levels
8 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)