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.
Magnus commutator degree and finite truncation
Statement
Let be the free group and the Magnus expansion from the preceding definition, with augmentation ideal . If and for , then
Consequently for every . In particular, reduction of modulo factors through and its coefficients through degree are independent of the representative word.
Statement references
Facts & Assumptions
Given: The free group, lower-central series, Magnus map, and augmentation ideal from the preceding definition.
The series map is a group homomorphism, , and . Lower-central series and Magnus expansion for links
Proof
Given: The free group , its Magnus expansion , and the filtered-ring data from the Definition.
In any filtered associative ring, write and with and . Since are units, By [F1], , and multiplication by units preserves this two-sided ideal. Therefore . This is a ring calculation conditional on the two degree bounds; no lower-central inclusion is assumed here.
By [F1], . Assume . For a generator of , [F1] gives and the induction hypothesis gives . The ring calculation in step 1.1 therefore puts its image in . Products and inverses remain in that subgroup: their images modulo the two-sided ideal are all . Thus , and induction proves the inclusion for every . Now for arbitrary and , the established inclusions give both hypotheses of step 1.1, which yields .
If two words represent the same element of , their quotient lies in . By step 2.1 its expansion is modulo . Multiplicativity of then makes the two truncated expansions equal, proving representative-independence of every coefficient of degree 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
- Milnor basing indeterminacy and self-crossing scope Lemma
- Truncated Milnor computation terminates and matches peripheral quotients Theorem
Dependency tree · two levels
3 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 (standard reference, not scraped)
- John Milnor, Link Groups (standard reference, not scraped)