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.

Integer Milnor coefficients and closed-link residues

Definition

Assume AC for the string-link quotient branch. Use the closed-link residue definition one finite maximum index length at a time, so its based word-lift data are finite.

Let τ be a based r-component string link with r≥1 and bottom meridian symbol group Fr=⟨x1,…,xr⟩, exterior group G=π1(Xτ), and based string-link longitudes λ1,…,λr. With compatible stem accesses this free group identifies the full endpoint fundamental group. For arbitrary independently based meridians, use instead its meridian map on each finite nilpotent quotient, which is still an isomorphism by the end-identification theorem; no full-group free-basis assertion is made. Longitudes retain their specified parallel and access data. For a multi-index I=(i1,…,ik,j) with k≥1 and each index in {1,…,r}, let wj,k∈Fr/Γk+1Fr be the unique class whose image under the bottom-end nilpotent isomorphism is the class of λj in G/Γk+1G. Define the integer coefficient μτ(I)=[Xi1⋯Xik] E(wj,k)∈Z, where the bracket means the coefficient of that word in the finite Magnus expansion through degree k. The commutator-degree lemma makes this coefficient independent of the representative of wj,k.

For a closed labeled link L, choose a common basing and its preferred zero-self-meridian longitudes. For every component j and every finite q≥2, choose a lift wj,q∈Fr/ΓqFr of the class of its longitude in G/ΓqG, where G=π1(EL) and Fr is free on the component meridian symbols. Such lifts exist because those meridians generate every finite nilpotent quotient. For I=(i1,…,ik,j), define the based coefficient μLb(I) by taking the coefficient of Xi1⋯Xik in E(wj,k+1) through degree k. Let ΔIb be the nonnegative greatest common divisor of the finite set of all μLb(J) for sequences J of lengths from 2 to ∣I∣−1 that occur as subsequences of cyclic permutations of I. The gcd of an empty set is 0. Define the based residue candidate μˉLb(I):=μLb(I)(modΔIb)∈Z/ΔIbZ, with Z/0Z=Z. Independence of the basing and word lifts is not part of this definition; it is a separate theorem. A based Borromean example with I=(1,2,3) uses this convention.

Remarks

The length of I is k+1; its final index names the longitude component, and the preceding indices name the Magnus word. The gcd convention records exactly the lower-order data used in the classical residue definition. The isotopy theorem later proves that the based residue candidate is independent of its choices.

Depends on

Used by

Dependency tree · two levels

29 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