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.

Magnus coefficient changes under longitude conjugation depend on lower-order coefficients

Statement

Let Fr be the free group with Magnus expansion E, let u,λ∈Fr, and let w be a nonempty word of length m. The coefficient of Xw in E(u−1λu)−E(λ) is an integer linear combination of coefficients of E(λ) on proper contiguous subwords of w. Thus, when w is the prefix of a Milnor index I=(w,j), conjugating the longitude can change its degree-m coefficient only by an integer combination of coefficients indexed by proper subsequences of I.

Facts & Assumptions

Given: The noncommutative formal-series ring, augmentation ideal m, and Magnus expansion in the preceding definition.

[F1]

Every Magnus expansion has constant term 1, its positive-degree part lies in m, and multiplication concatenates words. Lower-central series and Magnus expansion for links

Proof

Given: The words u,λ∈Fr, the Magnus expansion E, and the formal-series ring from the Definition.

1.1F1algebra

Write E(u)=1+U and E(λ)=1+V with U,V∈m. Then E(u−1λu)−E(λ)=(1+U)−1V(1+U)−V. Expand (1+U)−1=∑a≥0(−U)a. The term with no U on either side is V and cancels the subtracted V. Every remaining term is a product (−U)aVUb with a+b≥1.

2.1F1step 1.1algebra∎

A coefficient of degree m in such a product uses a degree-p monomial of Ua, a degree-s monomial of V, and a degree-q monomial of Ub with p+s+q=m and p+q≥1. The V monomial therefore has degree s<m and occupies a contiguous middle block of the target word w, while the nonempty left or right block comes from U. Summing the finitely many decompositions of w expresses its coefficient as an integer linear combination of coefficients of E(λ) on proper contiguous subwords. Appending the longitude index j makes each such index a proper subsequence of (w,j).

Depends on

Used by

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