Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-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.

Lower-central series and Magnus expansion for links

Definition

For any group G, define its lower-central series by Γ1G=G and Γq+1G=[G,ΓqG], where [G,H] is the subgroup generated by ghg−1h−1 for g∈G and h∈H. For r≥1, let Fr=⟨x1,…,xr⟩ be the free group on the formal meridian symbols xi, with the free-group convention of its stated generators.

Let Ar=Z⟨ ⁣⟨X1,…,Xr⟩ ⁣⟩ be the ring of formal integer sums ∑wawXw over all finite words w in the letters Xi, 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 m be the ideal of series with zero constant term. The Magnus expansion is the group homomorphism E:Fr⟶Z⟨ ⁣⟨X1,…,Xr⟩ ⁣⟩×,E(xi)=1+Xi. It sends xi−1 to (1+Xi)−1=∑k≥0(−1)kXik. For an integer d≥0, calculations through degree d use the truncated ring Rd=Ar/md+1. As a Z-module it has the finite monomial basis of words of length at most d. In Rd, the inverse of 1+A for A∈m is the finite sum 1−A+A2−⋯+(−A)d.

For a based string link, x1,…,xr 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.

Remarks

The commutator convention is [a,b]=aba−1b−1. Truncation to degree d retains the constant and homogeneous terms of degrees at most d.

Depends on

Used by

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