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.

Milnor basing indeterminacy and self-crossing scope

Statement

Assume AC. Let L be a nonempty labeled oriented link in S3, let I=(i1,…,ik,j) have length at least two, and let b,b′ be any two based meridian-longitude word systems used in the preceding definition. Then the based residue candidates μˉLb(I) and μˉLb′(I) agree under the canonical identification of their residue groups. If L and L′ are related by a finite sequence of self-crossing changes, the same residue is preserved whenever the entries of I are pairwise distinct. No invariance for repeated-index sequences under self-crossing changes is asserted.

Facts & Assumptions

Given: Full AC, the closed-link peripheral system, and finite based word-lift data through the length of I.

[A1]

Full AC, written AC, is The Axiom of Choice.

[F1]

Integer coefficients, based residue candidates, and the gcd of proper subsequences and their cyclic permutations are defined by the preceding definition. Integer Milnor coefficients and closed-link residues

[F2]

Conjugating one longitude changes a degree-m coefficient by an integer combination of coefficients on proper contiguous subwords. Magnus coefficient changes under longitude conjugation depend on lower-order coefficients

[F3]

The side-based meridian relation at a crossing is fixed by the local crossing chart. Local meridian conjugacy at a labeled link crossing

[F4]

Closed-link meridians lift to every finite nilpotent quotient, and the link group is computed by the crossing relations. Finite nilpotent link quotients are generated by component meridians, Wirtinger presentation correctness for labeled links

[F5]

The finite nilpotent peripheral presentation has kernel normally generated by ΓqF and [xa,la,q], for coherent diagram longitude words. Adding commutators of conjugate component meridians gives exactly the corresponding reduced-group quotient. Finite nilpotent peripheral presentation from a link diagram

[F6]

The Magnus expansion of ΓqF is 1 modulo degree q. Magnus commutator degree and finite truncation

[F7]

Lower-central commutators add weights and induce biadditive pairings on graded layers. Lower-central commutators add weights

Proof

Given: The link, finite peripheral word systems, and I=(i1,…,ik,j); write w=i1⋯ik.

1.1A1F1F4F5givenconstruct

Choose a finite regular diagram of the link. If a component has no underpass, insert a small type-I curl on a short arc in a ball meeting no other component, as in the local disk-push construction of the link-presentation theorem in [F4]. There are finitely many components, so the balls may be chosen disjoint and away from the common basepoint; the supported ambient isotopies carry the original chosen tubes, positive meridians, preferred longitudes and all access paths to their images. On each peripheral torus this transport preserves degree one and zero self-meridian coordinate. The induced based group isomorphism carries every original meridian to its transported meridian, so each original finite free word remains literally the same word and is still a lift of the corresponding transported longitude in every finite nilpotent quotient. This reduction imposes no upper-basing or coherence condition on the original word systems. The augmented diagram now has an underpass on every component, including originally crossingless components; its canonical upper basing will be compared with arbitrary transported basings and lifts by the subsequent variable-substitution and coefficient-ideal argument. First use the geometric root meridians and coherent longitude words la from [F5], through degree k. For any index sequence J, write c(J) for the corresponding coefficient of these words. Let DI be the ideal of Z generated by c(J) for all proper subsequences of cyclic permutations of I of length at least two. Its nonnegative generator is the gcd in [F1]. Work in the ring RI with finitely many surviving monomials, obtained from (Z/DI)⟨X1,…,Xr⟩ by setting to zero every monomial whose index word is not a subsequence of w. The discarded words span a two-sided ideal: adjoining letters cannot turn a word that is not a subsequence into one that is. Thus multiplication and inversion of series with constant term 1 are well-defined finite operations. Occurrences, including repeated indices, are retained in their original order; no assumption of distinct indices is used here.

1.2F3F4F5givenconstruct

For a self-crossing change on component a, quotient the diagram group by the normal closure of all commutators of two conjugates of its meridian, doing this for every component. These quotients on the two sides of the crossing change have identical based presentations. To see this locally, cut both branches into incoming and outgoing arc symbols. The branch that is over has equal incoming and outgoing symbols. On the under-branch the Wirtinger equation conjugates its incoming meridian by the over-meridian; both are conjugates of the same component meridian and commute in this quotient, so its outgoing symbol also equals its incoming symbol. Switching the crossing interchanges which branch uses which argument and leaves precisely the same two equalities. All other crossing relations, and root paths chosen outside this small ball, are unchanged. Thus the identification preserves the component meridians, with no assertion of an isomorphism of the original unreduced groups.

2.1F5F6step 1.1algebra

The coefficient of any surviving word in E([xa,la])−1 is zero in RI. Indeed put E(la)=1+La. The exact identity is E([xa,la])−1=(XaLa−LaXa)(1+Xa)−1(1+La)−1. Every summand contributing to a surviving word therefore contains one distinguished occurrence of a and a nonempty block from La, as well as possibly other blocks. If that block has index word B, its coefficient is c(Ba). The selected block and the distinguished a occupy disjoint positions in a subsequence of w; starting just after that occurrence of a and reading cyclically shows that Ba is a subsequence of a cyclic permutation of I. It is proper, since its length is at most k<∣I∣. Hence c(Ba)∈DI, and the whole summand vanishes. The same argument applies if (1+La)−1 is expanded elsewhere in the expression; the distinguished block can always be taken from the displayed first factor. This proves the assertion for each relator, its inverse, conjugates and finite products. Also E(Γk+1F)=1 through degree k by [F6]. Therefore [F5] makes the coefficient of Xw independent modulo DI of every lift of a fixed longitude in G/Γk+1G.

2.2F3F5step 1.2construct

Under that reduced-group identification, the longitude of a component different from a is unchanged: its traversal has no undercrossing factor in the altered ball, and its other arc meridians have the common images in step 1.2. For component a, the local factor lost or gained is a conjugate of its own meridian. It disappears on further quotienting by the normal subgroup generated by that meridian. The self-writhe normalization also differs by a power of this same meridian, so the preferred longitudes agree in this further quotient. These statements follow from the actual ordered undercrossing product, not solely from the meridian crossing relation.

3.1F4F5F7step 2.1constructalgebra

Consider a different basing. Each new meridian is a conjugate of the old one, and each new longitude is also a conjugate of the old degree-one zero-self-meridian curve. The conjugating loops may be different if the two accesses were chosen independently; retain both recorded loops. Lift the finitely many conjugating loops to F/Γk+1F by [F4]. The resulting change of root variables is ϕ(xa)=ua−1xaua. This is an automorphism of the finite nilpotent free quotient. It is the identity on degree one, hence on every lower-central graded layer, whose commutators are generated by the degree-one generators by [F7]. To construct a preimage, correct a word successively in Γs/Γs+1 for s=1,…,k; each correction has the prescribed image because the graded map is the identity. For injectivity, an element in the kernel is successively in Γ2,…,Γk+1=1. Its inverse is again a substitution by conjugates of the same respective generators. Thus the new longitude words are obtained by inverse variable substitution, their own independently recorded longitude conjugations, and elements of the transformed canonical kernel described in [F5]. No assertion that an independently based new meridian and longitude commute is needed; [F5] describes the reference presentation before these separate output conjugations.

3.2F5F6step 2.1step 1.2step 2.2algebra

Now suppose the entries of I are distinct. In the ring RI of step 1.1 every monomial containing an index twice is zero. For any word u, every term of E(u−1xbu)−1 contains b. Products of two such positive-degree expressions are therefore zero when both refer to b, and their units commute. The additional reduced-group relators [u−1xbu,v−1xbv] are consequently annihilated. By [F5], the kernel of the map to the reduced nilpotent group consists exactly of these additional relators, the peripheral commutators already annihilated in step 2.1, and Γk+1F. If the changed component is j, the further normal-meridian subgroup in step 2.2 is annihilated too, since j does not occur in w. Thus the two longitude coefficients agree modulo DI. If the changed component is not j, their equality in the reduced group from step 2.2 already gives this conclusion.

4.1F2F5step 2.1step 3.1algebra

In a variable substitution of this kind, Xa is replaced by Xa plus terms of degree at least two, every one of which contains an occurrence of a: this follows by expanding E(ua)−1(1+Xa)E(ua)−1. A coefficient of Xw in the substituted longitude therefore differs from its old coefficient only by integer multiples of c(Bj) for proper subsequences B of w. These are generators of DI. A longitude conjugation has the same property by direct multiplication, or by [F2]: its constant term cancels and every correction uses a shorter longitude coefficient. The transformed kernel is also annihilated. In the argument of step 2.1, substituting conjugates preserves the distinguished occurrence of each original variable, so the selected B and the distinguished a still form a proper cyclic subsequence of I. Hence every permitted basing and lift change preserves the target coefficient modulo the ideal of the old proper coefficients.

5.1F1step 2.1step 4.1inductionalgebra

These assertions also identify the modulus exactly, including when it is zero. Induct on index length. At length two there are no lower coefficients; commutator kernels and all conjugation corrections start in degree two, so the degree-one coefficients agree as integers. For a longer I, apply the induction hypothesis to every proper cyclic subsequence J of I. It says that its coefficient changes by an integer combination of coefficients on proper cyclic subsequences of J, all of which are proper cyclic subsequences of I. Order these finitely many sequences by length. The new coefficients thus lie in the ideal of the old proper coefficients. Conversely solve the same triangular relations in increasing length to express each old coefficient in the ideal of the new proper coefficients. The two ideals, their nonnegative gcd generators, and hence their residue groups are equal. Step 3.1 then proves equality of the target residues. Independent choices of word lifts at the separate finite degrees in [F1] are covered by step 2.1 and this same triangular argument; no unmentioned coherence hypothesis is imposed on those inputs.

6.1A1F1step 5.1step 3.2inductionalgebra∎

Induct again on the distinct index length. Length-two coefficients are preserved by step 3.2 with zero lower ideal. For larger I, apply the lower-length conclusions to its proper cyclic subsequences. The triangular ideal argument of step 5.1 shows that the old and new proper-coefficient ideals are equal; step 3.2 therefore gives equality in the canonically identical residue group. Step 4.1 permits arbitrary basings and finite word lifts at either endpoint. Composing along the stipulated finite sequence proves the self-crossing assertion. For repeated indices the square-zero argument in step 3.2 is unavailable, and no such assertion has been made. This proves both claims with the inherited AC and no extra choice principle.

Depends on

Used by

Dependency tree · two levels

36 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