Alphabeta Math
Pipeline-generated
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 invariants and link peripheral nilpotent quotients

1 · Prerequisites

2 · Logical flowchart

3 · Definitions, theorems and proofs

LemmaStatement: Literature-sourcedProof: AI-generatedverified 2026-10-22 (gpt-6.1-sol)Open item page →

Classifying maps are natural up to based homotopy

Statement

Assume AC. Let f:(X,x0)→(Y,y0) be a based map of path-connected CW complexes, let G=π1(X,x0) and H=π1(Y,y0), and put ϕ=f∗:G→H. Let cX:X→BG and cY:Y→BH be based classifying maps inducing the identity on the identified fundamental groups. There is a based map Bϕ:BG→BH inducing ϕ, and

Bϕ∘cX≃cY∘f

by a based homotopy. Consequently the induced maps on singular homology commute.

Facts & Assumptions

Given: Full AC, the based map f, the classifying maps cX,cY, and the CW models in the statement.

[A1]

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

[F1]

A classifying CW model is connected, has its specified fundamental group, and has zero higher homotopy groups. The classifying space of a discrete group is a K(G,1)

[F2]

Under AC, connected CW models K(G,1) exist for every group and the classifying-space construction is available for the stated groups. Existence and homotopy uniqueness of Eilenberg--Mac Lane spaces

[F3]

Homotopic maps induce the same homomorphism on singular homology. Homotopic maps induce the same map on singular homology

Proof

Given: The data above and [A1].

1.1A1F1F2givenconstruct

Take CW structures with the basepoints as vertices and choose a maximal tree T in the connected one-skeleton of BG, using [A1]. Send all vertices and T to the basepoint of BH. For each oriented edge e outside T, the tree paths to its endpoints turn e into a based loop; send e to a loop representing its image under ϕ. These loops generate π1(BG), and each two-cell attaching loop maps to the identity because ϕ is a homomorphism on G. Thus the map extends over the two-cells. For a cell of dimension k≥3, its attaching sphere extends because πk−1(BH)=0 by [F1]. AC chooses the tree, loop representatives, and cell extensions. The weak topology of the CW structure makes these compatible cellwise maps continuous, giving the required based map Bϕ.

2.1A1F1step 1.1givenconstruct

Write a=Bϕ∘cX and b=cY∘f, so a∗=b∗=ϕ. Choose a maximal tree in X(1) rooted at x0, and let αv be its path from x0 to each vertex v. Choose the vertex track from a(v) to b(v) to be a(αv)−1b(αv), with the track at x0 constant. For an edge e:v→w, the boundary of its homotopy square, conjugated by a(αv), represents a∗[αveαw−1] b∗[αveαw−1]−1=1. Hence every such square fills. For each k-cell with k≥2, the boundary of its homotopy prism is a sphere Sk→BH, which fills because πk(BH)=0 by [F1]. AC chooses the fillings and the CW weak topology assembles them into a continuous homotopy fixed at x0. Thus a≃b by a based homotopy.

3.1F3step 2.1∎

By [F3], the homotopy of step 2.1 gives (Bϕ)∗∘(cX)∗=(cY)∗∘f∗. This is the asserted naturality, including degree two.

LemmaStatement: Literature-sourcedProof: AI-generatedverified 2026-10-22 (gpt-6.1-sol)Open item page →

Classifying maps are surjective on second homology

Statement

Assume AC. Let X be a path-connected CW complex and let G=π1(X,x0). For any based classifying map c:X→BG inducing the identity on fundamental groups, the induced homomorphism c∗:H2(X;Z)⟶H2(BG;Z)=H2(G;Z) is surjective.

Statement references

Facts & Assumptions

Given: Full AC, a path-connected CW complex X, a basepoint x0, and G=π1(X,x0), and an arbitrary prescribed based classifying map c:X→BG inducing the identity on π1.

[A1]

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

[L1]

Full AC implies DC: apply AC to the family of nonempty successor sets of a serial relation, choose an initial element, and iterate the resulting choice function. The axiom of dependent choice: a relation in which every element is related to something admits an N-indexed chain

[F1]

Under AC, BG is a connected CW model with π1(BG)≅G and πk(BG)=0 for k>1. The classifying space of a discrete group is a K(G,1)

[F2]

The long exact sequence of a Serre fibration computes the homotopy groups of its fiber. Long exact sequence of homotopy groups of a fibration

[F3]

The homological Serre spectral sequence gives the exact five-term sequence for the homology of a fibration. Homological Serre spectral sequence, Five term exact sequence of a first quadrant homological spectral sequence

[F4]

A simply connected path-connected space has zero first homology by the degree-one Hurewicz theorem. The first Hurewicz map is abelianization

[F5]

Under AC there is a connected CW model K(G,1). Under DC with supplied projective-resolution data, derived group homology is naturally identified with algebraic bar homology. Existence and homotopy uniqueness of Eilenberg--Mac Lane spaces, Diagonal bar coinvariants compute group homology, The axiom of dependent choice: a relation in which every element is related to something admits an N-indexed chain

[F6]

External input: for a connected CW K(G,1), its universal cover T is a contractible free G-CW complex. Its augmented cellular chains C∗cell(T)→Z form a free left ZG-resolution, and their coinvariants are the cellular chains of the base. Brown, §1, printed pp. 4–5 and 7, gives this construction and the resulting identification of derived group homology with the singular homology of the base. Only that comparison is imported here. Brown, §1

Proof

Given: The data above and [A1].

1.1A1L1F1F5givenconstruct

Fix the arbitrary map c in the statement, rather than selecting a special classifying map. By [F1], its target is a connected CW K(G,1), so π2(BG)=0 and π1(c) is an isomorphism. For the derived-homology comparison in [F5], supply resolutions explicitly: over ZG, take the free module on the underlying set of a module M, map its basis element [m] to m, and repeat the same free-module construction on each successive kernel. The augmentations are onto and each image is the preceding kernel, so this is an exact free, hence projective, resolution for every M. This specified construction supplies the resolution convention; [A1] and [L1] supply DC.

2.1A1L1F1F5F6step 1.1constructalgebra

Apply the external comparison [F6] to this CW model BG. With T its universal cover, put P∗=C∗cell(T). Choosing an oriented lift of each cell, permitted by AC, exhibits P∗ as free over ZG. Contractibility makes its augmentation exact. Thus P∗ is a supplied resolution of the trivial left module; its comparison with the resolution in step 1.1 identifies the same derived group homology. Projection to BG identifies Z⊗ZGP∗ with C∗cell(BG), including their differentials. Taking homology, and using cellular-to-singular homology comparison as in [F6], gives Hn(G;Z)≅Hn(BG;Z).

2.2F1F2F4step 1.1algebra

Replace this prescribed c by its mapping-path Serre fibration p:E→BG, with E≃X and p corresponding to c. In [F2], the action on fiber components is transitive because E is connected, and the component of the based fiber point has stabilizer all of π1(BG) because π1(c) is onto. Thus the fiber F is path-connected. Since π2(BG)=0 and π1(c) is injective, the same exact sequence gives π1(F)=1. Hence H1(F;Z)=0 by [F4].

3.1F3step 2.1step 2.2algebra∎

Apply [F3] to F→E→BG. Since F is path-connected, its H0 local system is canonically the constant system Z. The five-term sequence therefore has consecutive terms H2(E;Z)⟶H2(BG;Z)⟶H0(BG;H1(F;Z)). The last group is zero by step 2.2. Exactness makes the first map, the edge homomorphism p∗, surjective. Under E≃X this map is c∗, and step 2.1 identifies its target with H2(G;Z), proving the assertion.

LemmaStatement: Literature-sourcedProof: AI-generatedjudge pass (gpt-6-luna)verified 2026-10-22 (gpt-6.1-sol)Open item page →

Cutting along a simply connected hypersurface adds one free generator

Statement

Let M be a connected smooth 3-manifold without boundary, and let S⊂M be a nonempty closed connected smooth embedded surface with π1(S)=1. Suppose there is an open neighborhood N of S such that N is path-connected and simply connected, and N∖S has exactly two path-connected simply connected components N− and N+. Suppose also that M∖S is path-connected and contains an embedded compact arc ν joining N− to N+, with an open tubular neighborhood T such that T∩N consists of exactly two disjoint open 3-balls, one in each side component. Then

π1(M)≅π1(M∖S)∗Z.

The cyclic factor is represented by a loop that joins the two sides of N and returns between them through M∖S.

Statement references

Facts & Assumptions

Given: The manifold, embedded surface, neighborhood, and path-connectivity and simple-connectivity hypotheses in the statement.

[F1]

For an open cover by two path-connected sets with path-connected intersection, the fundamental group of the union is the pushout of the two inclusion homomorphisms. Seifert–van Kampen identifies the fundamental group with a group pushout

Proof

Given: The data above.

1.1givenF1construct

Put U=M∖S and V=N∪T. These are path-connected open sets covering M. Their intersection consists of N−, N+, and the tube joining their end balls. Cover the intersection by the two side components with the respective half of the tube. Each set is path-connected and simply connected, and their overlap is a contractible middle tube. Hence [F1] gives π1(U∩V)=1.

2.1givenF1step 1.1construct

Join the centers of the two end balls by an embedded arc α in the connected smooth 3-manifold N, and let Q be a thin open tubular neighborhood of α in N, enlarged at its ends to meet those balls. The open sets N and W=T∪Q cover V. The set W is a thickened loop formed by the two tubes T and Q, so π1(W)≅Z; N∩W is Q together with the two end balls and is contractible. Since N is simply connected, [F1] gives π1(V)≅Z.

3.1F1step 1.1step 2.1algebra∎

Apply [F1] to the open cover M=U∪V. Step 1.1 gives π1(U∩V)=1, while π1(U)=π1(M∖S) and step 2.1 gives π1(V)=Z. The pushout is therefore the free product π1(M∖S)∗Z. A generator of the second factor is represented by α followed by ν−1, proving the stated description.

TheoremStatement: Literature-sourcedProof: AI-generatedjudge pass (gpt-6-luna)verified 2026-10-22 (gpt-6.1-sol)Open item page →

Homological Lyndon–Hochschild–Serre spectral sequence for group extensions

Statement

Assume the Axiom of Choice. For every short exact sequence of discrete groups 1⟶N⟶G⟶Q⟶1, the homological Serre spectral sequence of the induced map of classifying spaces has Ep,q2≅Hp ⁣(Q;Hq(N;Z))⟹Hp+q(G;Z). Here Hp(Q;M) denotes homology of BQ with the local coefficient system determined by the left Q-module M, and group homology uses the bar classifying spaces. The coefficient group Hq(N;Z) has the Q-action induced by conjugation by lifts in G, and convergence is strong with the finite Serre filtration in each total degree.

Facts & Assumptions

Given: Full AC and a short exact sequence 1→N→G→Q→1 of discrete groups.

[A1]

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

[L2]

Full AC implies DC: apply AC to the family of nonempty successor sets of a serial relation, choose one initial element, and recursively follow the resulting choice function. The axiom of dependent choice: a relation in which every element is related to something admits an N-indexed chain

[L1]

Under AC, Milnor's classifying space BG is a connected CW model with π1(BG)≅G and πk(BG)=0 for k>1. The classifying space of a discrete group is a K(G,1)

[F1]

The homotopy long exact sequence of a Serre fibration computes the homotopy groups of its fiber. Long exact sequence of homotopy groups of a fibration

[F2]

For a Serre fibration over a path-connected CW complex, the homological Serre spectral sequence has Ep,q2=Hp(B;Hq(F;Z)) and strongly converges to the homology of the total space. Homological Serre spectral sequence

[F3]

The homology of a classifying space with the local system determined by a module is the usual bar-model group homology; the derived-functor identification in the library assumes DC. Diagonal bar coinvariants compute group homology, The axiom of dependent choice: a relation in which every element is related to something admits an N-indexed chain

[F4]

Connected CW models with the same identified fundamental group and vanishing higher homotopy groups are homotopy equivalent under AC. Existence and homotopy uniqueness of Eilenberg--Mac Lane spaces

[F5]

External input: For a map between CW complexes, its mapping-path homotopy fiber has CW homotopy type. This is the homotopy-fiber consequence of Milnor's compact-domain mapping n-ad theorem, stated explicitly in Hatcher's §4.3; the hypotheses here are satisfied by the classifying CW models in step 1.1. [Hatcher §4.3, p. 408], [Milnor, Theorem 3, pp. 276–280]

[F6]

Classifying maps commute up to based homotopy with a based map and its induced fundamental-group homomorphism. Classifying maps are natural up to based homotopy

Proof

Given: The group extension and [A1].

1.1A1L1givenconstruct

Choose connected CW models from [L1]. Build a based map BG→BQ inducing G→Q by mapping the one-skeleton to loops representing the quotient images, filling each two-cell because its attaching word maps to the identity in Q, and extending over each higher cell because πk(BQ)=0 for k>1. The finite cell extensions are simultaneous over a set of cells; [A1] supplies those choices. Replace this map by its mapping-path fibration p:E→BQ; the total space E is homotopy equivalent to BG, and the fiber F is its homotopy fiber.

2.1L1F1F4F5step 1.1

The map on fundamental groups is the quotient G→Q. Exactness of [F1] gives π0(F)={∗}, π1(F)≅ker⁡(G→Q)=N, and πk(F)=0 for every k>1, because both BG and BQ have zero higher homotopy groups by [L1]. By the external input [F5], F has CW homotopy type. Choose a connected CW model F′≃F and identify π1(F′) with N. The uniqueness theorem [F4] gives F′≃BN, so Hq(F;Z)≅Hq(N;Z) for every q.

3.1L1F1F4F6step 2.1algebra

A lift g∈G of a loop class q∈Q=π1(BQ) transports the fiber fundamental group by n↦gng−1. Choose a based homotopy equivalence h:F′→F as in step 2.1 and a based homotopy inverse hˉ:F→F′, using the basepoint path supplied by the transport. The map Tg′=hˉ∘Tg∘h is a based self-map of F′ inducing cg(n)=gng−1 on π1(F′)≅N. By [F6], the classifying map c:F′→BN satisfies c∘Tg′≃B(cg)∘c, so the monodromy on Hq(F′) agrees under h with the bar-classifying-space map induced by cg. If a different lift is chosen, it differs by an element of N and changes this map by an inner automorphism of N. Inner conjugation is homotopic to the identity on the bar classifying space: the conjugation functor on the one-object category of N is naturally isomorphic to the identity by the conjugating element. Hence the induced action on Hq(F;Z)≅Hq(N;Z) depends only on q, and is exactly the stated Q-module action.

4.1F2step 2.1step 3.1

Apply [F2] to p:E→BQ. By step 2.1 the fiber homology is Hq(N;Z), and step 3.1 identifies its monodromy local system with the conjugation action. Therefore the E2 page is Hp(Q;Hq(N;Z)) and the spectral sequence strongly converges to Hp+q(E;Z).

5.1A1L2F3F4step 1.1step 4.1∎

The total-space equivalence from step 1.1 identifies Hp+q(E;Z) with Hp+q(BG;Z). By [F4], this classifying CW model is homotopy equivalent to the bar model used in [F3], so its homology is Hp+q(G;Z). The base and fiber are connected CW models, so the Serre filtration is first quadrant and finite on each total-degree diagonal. AC supplies the DC hypothesis of [F3] by [L2]. The fiber action and Serre filtration introduce no further choice.

TheoremStatement: Literature-sourcedProof: AI-generatedverified 2026-10-22 (gpt-6.1-sol)Open item page →

Five-term homology sequence of a group extension

Statement

Assume AC. For every group extension 1⟶N⟶G⟶Q⟶1, the maps induced by inclusion, quotient, and transgression form an exact sequence H2(G;Z)⟶H2(Q;Z)⟶N/[G,N]⟶H1(G;Z)⟶H1(Q;Z)⟶0. Here [G,N] is the normal subgroup generated by the commutators gng−1n−1 with g∈G and n∈N. The sequence is natural under homomorphisms of short exact sequences, including its transgression.

Facts & Assumptions

Given: AC and the group extension.

[A1]

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

[L1]
[F1]

The extension has a strongly convergent homological spectral sequence with Ep,q2=Hp(Q;Hq(N;Z)) and abutment Hp+q(G;Z). Homological Lyndon–Hochschild–Serre spectral sequence for group extensions

[F2]

Every first-quadrant homological spectral sequence with finite abutment filtration has the exact five-term sequence H2→E2,02→E0,12→H1→E1,02→0. Five term exact sequence of a first quadrant homological spectral sequence

[F3]

Under DC and the supplied projective-resolution convention, the bar model computes group homology; in degree one, H1(N;Z) is generated by symbols [n] with relations [n1n2]=[n1]+[n2]. Diagonal bar coinvariants compute group homology

[F4]

The homological Serre spectral sequence, including its differentials, edge maps, and abutment filtration, is natural for maps of fibrations. Homological Serre spectral sequence

[F5]

Maps between connected CW complexes commute up to based homotopy with their classifying maps and the maps induced on fundamental groups. Classifying maps are natural up to based homotopy

Proof

Given: The extension and [A1].

1.1A1L1F1F2F3construct

Supply the resolution convention needed by [F3] as follows. For each relevant group K and left ZK-module M, take the free module on the underlying set of M, augment [m]↦m, and repeat on each successive kernel. Each augmentation is onto its kernel target, so the resulting complex is an exact free, hence projective, resolution, specified uniformly in M. By [A1] and [L1], DC also holds. Apply [F2] to [F1]. Since H0(N;Z)=Z with trivial Q-action, its terms are E2,02=H2(Q;Z), E0,12=H0(Q;H1(N;Z)), H1=H1(G;Z), and E1,02=H1(Q;Z). This gives an exact sequence with the coinvariant group in the middle.

1.2A1F1F3algebra

By [F3], H1(N;Z)=N/[N,N] under the map sending n to its class. The Q-coinvariants impose the relations [gng−1]=[n] for every lift g∈G and n∈N. Their subgroup in N/[N,N] is exactly [G,N]/[N,N], because [N,N]⊆[G,N]. Therefore H0(Q;H1(N;Z))≅N/[G,N].

2.1F1F2F4F5step 1.1step 1.2algebra∎

Substituting the identification of step 1.2 into step 1.1 gives the displayed sequence. To check naturality, take a homomorphism of extensions. The bar classifying-space maps give a commuting square from BG→BQ to BG′→BQ′; mapping-path replacement gives a map of their fibrations. Its fiber map induces the specified homomorphism N→N′ on fundamental groups. Under the fiber identifications with BN,BN′ in [F1], [F5] identifies its homology map with that induced by N→N′. By [F4], the map of spectral sequences commutes with d2, all edge maps, and the abutment filtration. The five-term splice in [F2] uses only these maps and the natural subquotient identifications, so its squares commute. Finally, step 1.2 sends each n to its class in the coinvariants, hence commutes with the homomorphism on N and its conjugation action. This proves naturality of the displayed sequence, including the transgression.

TheoremStatement: Literature-sourcedProof: AI-generatedverified 2026-10-22 (gpt-6.1-sol)Open item page →

Integral Stallings theorem for finite lower-central quotients

Statement

Assume AC. Let ϕ:A→B be a group homomorphism inducing an isomorphism H1(A;Z)→H1(B;Z) and an epimorphism H2(A;Z)→H2(B;Z). For a group X, define Γ1X=X and Γn+1X=[X,ΓnX]. Then for every finite n≥1, the induced homomorphism A/ΓnA⟶B/ΓnB is an isomorphism.

Facts & Assumptions

Given: AC and a group homomorphism ϕ:A→B satisfying the stated H1 and H2 hypotheses.

[A1]

Full AC, written AC, is The Axiom of Choice; it is inherited from the group-extension homology sequence supplier.

[F1]

For every group extension 1→N→G→Q→1, the exact sequence H2(G)→H2(Q)→N/[G,N]→H1(G)→H1(Q)→0 is natural in maps of extensions, including its transgression (the supplier proves this naturality using maps of classifying-space fibrations). Five-term homology sequence of a group extension

[L1]
[F2]

Under DC with supplied projective-resolution data, the bar complex computes group homology. In the bar complex, degree one has generators [x] and degree-two boundaries [y]−[xy]+[x], so H1(X;Z)≅X/[X,X]. Diagonal bar coinvariants compute group homology

Proof

Given: The group map and hypotheses above.

1.1A1L1F2givenconstruct

Supply the resolution convention for [F2] by taking, for every module over each relevant group ring, the free module on its underlying set, augmented [m]↦m, and repeating this construction on successive kernels. These surjections give an exact free resolution. By [A1] and [L1], DC also holds. The case n=1 is the map between two trivial quotients. For n=2, the bar degree-one calculation in [F2] identifies A/Γ2A→B/Γ2B with the assumed isomorphism on H1. These are the base cases.

1.2A1F1F2givenalgebra

Fix n≥2 and assume A/ΓnA→B/ΓnB is an isomorphism. Apply [F1] to the extensions 1→ΓnA→A→A/ΓnA→1 and 1→ΓnB→B→B/ΓnB→1. Since ΓnX⊆[X,X] for n≥2, the maps H1(X)→H1(X/ΓnX) are isomorphisms. Exactness therefore makes the transgression H2(X/ΓnX)→ΓnX/[X,ΓnX] onto, with kernel the image of H2(X). By definition [X,ΓnX]=Γn+1X.

2.1F1step 1.2algebra

Naturality of [F1] makes the map H2(A/ΓnA)→H2(B/ΓnB) compatible with the two transgressions. It is an isomorphism because the quotient-group map is an isomorphism by the induction hypothesis. The epimorphism H2(A)→H2(B) makes the image of H2(A) in H2(A/ΓnA) map onto the image of H2(B) in H2(B/ΓnB). The induced map on the two cokernels is consequently an isomorphism. By step 1.2 and exactness, those cokernels are ΓnA/Γn+1A and ΓnB/Γn+1B.

3.1step 2.1algebrachoose

The inclusions and quotient maps give exact central extensions 1→ΓnX/Γn+1X→X/Γn+1X→X/ΓnX→1,X=A,B, because [X,ΓnX]=Γn+1X. The maps on the kernel and quotient terms are isomorphisms by step 2.1 and the induction hypothesis. The middle map is injective: an element in its kernel projects to the identity in the quotient, hence lies in the kernel term, where injectivity holds. It is surjective: for a target element, lift its quotient class through the quotient isomorphism and then correct the chosen middle lift by a kernel element using the kernel isomorphism. Thus A/Γn+1A→B/Γn+1B is an isomorphism.

4.1A1step 1.1step 3.1∎

Steps 1.1 and 3.1 prove by induction the isomorphism for every finite n. Apart from the inherited AC used to obtain the homology sequence [F1], the induction uses only exactness and a single element lift at a time; no additional choice principle is used.

LemmaStatement: Literature-sourcedProof: AI-generatedverified 2026-10-22 (gpt-6.1-sol)Open item page →

Magnus commutator degree and finite truncation

Statement

Let Fr be the free group and E the Magnus expansion from the preceding definition, with augmentation ideal m. If u∈ΓpFr and v∈ΓqFr for p,q≥1, then

E([u,v])∈1+mp+q.

Consequently E(ΓqFr)⊆1+mq for every q≥1. In particular, reduction of E modulo md+1 factors through Fr/Γd+1Fr and its coefficients through degree d are independent of the representative word.

Facts & Assumptions

Given: The free group, lower-central series, Magnus map, and augmentation ideal from the preceding definition.

[F1]

The series map E is a group homomorphism, E(Fr)⊆1+m, and mamb⊆ma+b. Lower-central series and Magnus expansion for links

Proof

Given: The free group Fr, its Magnus expansion E, and the filtered-ring data from the Definition.

1.1F1algebra

In any filtered associative ring, write U=1+a and V=1+b with a∈mp and b∈mq. Since U,V are units, [U,V]−1=(UV−VU)U−1V−1=(ab−ba)U−1V−1. By [F1], ab−ba∈mp+q, and multiplication by units preserves this two-sided ideal. Therefore [U,V]∈1+mp+q. This is a ring calculation conditional on the two degree bounds; no lower-central inclusion is assumed here.

2.1F1step 1.1algebrainduction

By [F1], E(Γ1Fr)=E(Fr)⊆1+m. Assume E(ΓqFr)⊆1+mq. For a generator [u,v] of Γq+1Fr=[Fr,ΓqFr], [F1] gives E(u)−1∈m and the induction hypothesis gives E(v)−1∈mq. The ring calculation in step 1.1 therefore puts its image in 1+mq+1. Products and inverses remain in that subgroup: their images modulo the two-sided ideal mq+1 are all 1. Thus E(Γq+1Fr)⊆1+mq+1, and induction proves the inclusion for every q. Now for arbitrary u∈ΓpFr and v∈ΓqFr, the established inclusions give both hypotheses of step 1.1, which yields E([u,v])∈1+mp+q.

3.1F1step 2.1algebra∎

If two words represent the same element of Fr/Γd+1Fr, their quotient lies in Γd+1Fr. By step 2.1 its expansion is 1 modulo md+1. Multiplicativity of E then makes the two truncated expansions equal, proving representative-independence of every coefficient of degree at most d.

LemmaStatement: Literature-sourcedProof: AI-generatedverified 2026-10-22 (gpt-6.1-sol)Open item page →

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).

DefinitionDefinition: Literature-sourcedProof: Not applicableverified 2026-10-22 (gpt-6.1-sol)Open item page →

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.

AlgorithmAlgorithm: Literature-sourcedProof: Not applicableverified 2026-10-22 (gpt-6.1-sol)Open item page →

Truncated Milnor invariants from a based link diagram

Definition

Assume AC. The input is either (a) a based r-component string-link diagram with its endpoint collars and product-tube parallels equal to the diagram's blackboard push-offs, or (b) a based finite regular diagram of a closed r-component labeled oriented link with chosen product tubes, one initial strand on each component, and a common basepoint and access paths. In either mode require r≥1. The finite input records its compatible common-upper-collar reference accesses. In the compatible branch the actual accesses are these, up to a common base-path change, and the parallels are the blackboard parallels already specified. In the arbitrary-choice branch it additionally records finite words in the compatible strand meridians for each access difference ge, the parallel endpoint differences h0,j,h1,j, and its relative meridian winding kj. These are word certificates for the chosen paths, part of the supplied based-word data; no evaluation of an unencoded smooth path is claimed. In closed-link mode the preferred longitude uses its own recorded access hj, which may differ from the initial-meridian access gj. Arbitrary parallels are allowed in this branch, with the recorded kj. The input also includes a maximum index length N≥2. The output is the integer coefficients μτ(I) in string-link mode, or the based coefficients μLb(I), their lower indeterminacy data ΔIb, and residues μˉLb(I) in closed-link mode, for every index sequence I with 2≤∣I∣≤N.

Throughout this procedure, a strand means a maximal Wirtinger arc between successive underpassing points, or between an endpoint and the nearest underpassing point in string-link mode. Obtain these arcs by joining the diagram edges straight through every overcrossing. A closed component without underpasses has one cyclic strand; a string component without underpasses has one endpoint-to-endpoint strand. Before step 1, identify all compatible edge-meridian symbols on each such arc with its one strand symbol, and make this substitution in every supplied word certificate. Record the chosen initial point on its resulting strand. All series in step 2 are assigned to these arcs, so crossing an overpass retains the same meridian series.

Set d=N−1 and work in the truncated noncommutative ring Rd=Z⟨X1,…,Xr⟩/md+1, where m is the ideal generated by the letters. Carry out the following finite procedure.

  1. Verify the finite crossing, orientation, over/under, and component data. If a closed-link component has no underpassing point, choose a crossing-free disk meeting only a short arc of that component and avoiding its chosen initial meridian point. Insert a small type-I curl there by the supported disk isotopy and record the resulting based diagram. Transport the basepoint, meridian circles, access paths, product tubes, parallels, and all supplied access, endpoint, and longitude word certificates through this isotopy. Before the curl, the component is one cyclic strand; the new underpass cuts it into one interval strand containing the chosen initial point. Identify that interval's reference meridian symbol with the transported old symbol. Every other strand is carried bijectively by the isotopy, with its reference symbol identified in the same way. In the finite certificates, apply this symbol substitution to every word; no unencoded path evaluation or additional certificate is required. Give every resulting strand a the component label j(a).

  2. First compute in the compatible reference root symbols xj, irrespective of the actual access choices. For every strand a, initialize its meridian series by Ya(1)=1+Xj(a). For each degree ℓ=2,…,d, copy every Ya(ℓ−1) into the constant and lower-degree part of Ya(ℓ), with new degree-ℓ terms initially zero, and reset each chosen root strand to 1+Xj. Then do one pass over each component in its oriented order. In closed-link mode start at the chosen initial strand and omit the final undercrossing back to that strand; in string-link mode start at the bottom endpoint and use every undercrossing through to the top endpoint. At an undercrossing with over-strand o and source and target under-arcs s,t, use the already available Yo(ℓ−1) and the current Ys(ℓ) to set Yt(ℓ)=trunc⁡ℓ((Yo(ℓ−1))−1Ys(ℓ)Yo(ℓ−1)) when the traversal is source-to-target, and set Ys(ℓ)=trunc⁡ℓ(Yo(ℓ−1)Yt(ℓ)(Yo(ℓ−1))−1) when it is target-to-source. Here trunc⁡ℓ discards monomials of degree greater than ℓ, and every inverse is the finite geometric series in the nilpotent ideal of Rd.

  3. For each component j, traverse its undercrossings in order and form Wj=∏c(Yo(c)(d))ϵc, where the factors are in traversal order and ϵc=+1 for source-to-target and −1 for target-to-source. In string-link mode set Λj=Wj. In closed-link mode set Λj=(1+Xj)−wr⁡j(D)Wj, where wr⁡j(D) is the sum of the determinant signs at self-crossings of component j.

  4. In the arbitrary-choice branch first use the strand-symbol identification of step 1, then evaluate each supplied transport word by the strand series from step 2. Write Ge for the resulting unit series, and H0,j,H1,j for the endpoint transport series. In string-link mode replace the compatible Λj=Wj by H0,j(1+Xj)kjWjH1,j−1. In closed-link mode replace the compatible preferred series by Hj(1+Xj)−wr⁡j(D)WjHj−1, where Hj=H0,j=H1,j is the actual longitude access difference, independently of the initial-meridian difference Gj. The arbitrary parallel winding cancels in the preferred correction. All powers and inverses are finite truncated operations. To express this result in the actual component-meridian symbols, form Gj(1+Xj)Gj−1=1+Xj+Rj(X),deg⁡Rj≥2. With new letters Vj, initialize Zj(1)=Vj and iterate Zj(s+1)=trunc⁡d(Vj−Rj(Z(s))),1≤s<d. Substitute Xj=Zj(d)(V) in the corrected longitude series. This is its expansion in the chosen actual meridians. For the compatible branch this step is the identity. Rename the final letters Vj as Xj.

  5. For every I=(i1,…,ik,j) with 1≤k≤d, read the coefficient of Xi1⋯Xik in Λj. In string-link mode return this integer. In closed-link mode, also compute the gcd of the coefficients for all proper subsequences of cyclic permutations of I of lengths at least two, with empty gcd equal to zero, and return the corresponding residue class.

All scans, including the supplied transport words and the d−1 inverse-substitution iterations, are over finite crossing, strand, degree, and index sets. The procedure makes no polynomial-time claim. If a finite-input validation fails, return invalid-input.

Remarks

The per-degree passes use over-strand series only through degree ℓ−1: their degree-ℓ terms cancel against the constant term of the conjugated meridian. The output records the based residue data; its independence of closed-link basing is the separate theorem on Milnor invariants.

LemmaStatement: Literature-sourcedProof: AI-generatedverified 2026-10-22 (gpt-6.1-sol)Open item page →

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.

TheoremStatement: Literature-sourcedProof: AI-generatedverified 2026-10-22 (gpt-6.1-sol)Open item page →

Truncated Milnor computation terminates and matches peripheral quotients

Statement

Assume AC and let the based diagram, peripheral data, and maximum index length N≥2 satisfy the input conditions of the preceding algorithm. Put d=N−1. The algorithm terminates after finitely many diagram, degree, and monomial operations. In string-link mode, its output for each I with 2≤∣I∣≤N equals the integer coefficient of the based longitude in the bottom-end quotient Fr/Γ∣I∣Fr. In closed-link mode, its output equals the based coefficient, gcd indeterminacy, and residue candidate defined from the chosen peripheral word lifts. It makes no polynomial-time claim.

Facts & Assumptions

Given: Full AC and a valid based diagram input with finite maximum length N.

[A1]

Full AC, written AC, supplies the choice branch in the string-link quotient theorem and implies the countable-choice hypothesis for crossing and framing data. The Axiom of Choice, String-link end inclusions identify finite nilpotent peripheral quotients

[F1]

The procedure uses finitely many strand, crossing, degree, monomial, and subsequence scans. Truncated Milnor invariants from a based link diagram

[F2]

In either closed-link or string-link mode, compatible crossing meridians satisfy the stated source-to-target conjugation relation. For closed links, the exterior group is presented by these relations on Wirtinger arcs between underpasses. No presentation theorem for string-link groups is used here. Local meridian conjugacy at a labeled link crossing, Wirtinger presentation correctness for labeled links

[F3]

For compatible accesses the literal diagram word is the blackboard parallel, with its self-writhe correction giving the closed preferred longitude. For arbitrary accesses the exact formulas are h0xjkWjh1−1 for a string link and hjxj−wr⁡jWjhj−1 for the closed preferred longitude. The access-word inputs record those differences. Diagram word for a preferred peripheral longitude

[F4]

Component meridians generate each finite closed-link nilpotent quotient, and both string-link end inclusions identify the corresponding finite nilpotent quotients. Finite nilpotent link quotients are generated by component meridians, String-link end inclusions identify finite nilpotent peripheral quotients

[F5]

The Magnus expansion through degree d factors through the quotient by Γd+1 and its coefficients are representative-independent. Magnus commutator degree and finite truncation

[F6]

The coefficient and based residue outputs are those specified in the preceding definition. Integer Milnor coefficients and closed-link residues

[F7]

The lower-central convention is Γs+1G=[G,ΓsG], and Magnus series are multiplicative. Lower-central series and Magnus expansion for links

Proof

Given: The algorithm input and the facts above.

1.1A1F1givenconstruct

Under [A1], the validation stage scans a finite diagram. The degree loop runs from 2 to d, each component traversal visits finitely many undercrossings, and each multiplication, inverse, and truncation in Rd involves only finitely many monomials of degree at most d. The output stage scans finitely many index sequences and their finitely many proper subsequences and cyclic permutations. Thus every loop is finite and the procedure terminates.

1.2F1F2F4givenconstruct

Use the algorithm's maximal Wirtinger arcs: all consecutive diagram edges through an overpass have one reference meridian and one series. The preliminary symbol substitution therefore preserves every compatible certificate word. At degree one every meridian on component j is conjugate to its root meridian, so its expansion in root symbols is 1+Xj. This is the initialization Ya(1). If step 1 inserts a curl, the original underpass-free component had one cyclic arc and the new underpass cuts it into one interval arc. The supported isotopy transports its root, accesses, and all supplied words to that arc; every other arc is transported with the same symbol. Thus the post-curl certificates encode the same based data.

2.1F2F4F5F7step 1.2algebrainduction

Induct on ℓ, starting from step 1.2. Choose free words for the preceding arc approximations, representing the true compatible meridians modulo ΓℓG. Start each component at its root word xj, and follow its maximal arcs. At a nonclosing underpass, conjugate the current incoming word by the preceding over-word, with the sign prescribed by [F2]. Replacing the true over-meridian by a word congruent modulo ΓℓG changes its conjugation of a meridian only modulo [G,ΓℓG]=Γℓ+1G, by [F7]. Induction along the traversal therefore makes every new arc word a lift of its true meridian modulo Γℓ+1G. Its expansion through degree ℓ uses the over-word only through degree ℓ−1: a discrepancy of degree ℓ commutes with the constant term of the conjugated series and first contributes in degree ℓ+1. Thus its expansion is exactly the algorithm's update. The lower degrees agree with the preceding pass by the same argument one degree lower. This proves that the output arc series are expansions of explicit compatible lift words, correct in G/Γd+1G. In string-link mode [F4] identifies those lifts uniquely in Fr/Γd+1Fr; in closed-link mode only the selected lift words are asserted, without assigning a Magnus expansion to an arbitrary element of the closed-link group. No global string-link presentation is needed.

3.1F3F4step 2.1

By [F3], the ordered over-meridian product is the based string-link longitude or the closed blackboard parallel. In closed-link mode, the initial-meridian power removes its self-writhe. Substituting the arc lift words of step 2.1 gives explicit longitude lift words in G/Γd+1G; multiplicativity makes Λj exactly their expansions through degree d. In string-link mode these are the unique bottom-end quotient classes by [F4].

4.1F3F4F5step 2.1step 3.1constructinductionalgebra

In the arbitrary-choice branch, evaluating the finite transport words gives their actual compatible-coordinate expansions by step 2.1 and [F5]; when step 1 inserted a curl, these words have already been transported through the explicit old-to-new strand-symbol identification of step 1.2. The formulas of [F3] therefore give the actual selected longitude expansion before changing root variables. The actual root meridian is gjxjgj−1, so its series is 1+Xj+Rj with Rj of degree at least two. Substitution of two letter systems agreeing through degree s into Rj gives results agreeing through degree s+1, since each monomial has at least two letters. Hence the displayed iteration improves the inverse equation by one degree at each pass, starting correctly at degree one. At pass d it solves Zj+Rj(Z)=Vj exactly in the truncated ring. The same degree argument proves uniqueness, and consequently also the other composition identity. Thus it is the inverse formal change from compatible to actual meridian coordinates. This also agrees with the group-theoretic change on the finite nilpotent quotient: substitution by the conjugates has identity degree-one map and induces an isomorphism on each finite free nilpotent quotient: apply the arbitrary-basing branch of [F4] to the trivial string link, whose compatible endpoint group is Fr, with these exact independently conjugated meridians. Its Magnus series satisfies the same unique inverse equations. The corrected-and-substituted series is therefore exactly the longitude expansion in the chosen actual symbols, including independently based endpoints and all supplied relative winding. No full-group free-basis assertion or unrecorded access cancellation is used.

5.1A1F4F5F6step 3.1step 4.1

Under the stated axiom branch [A1], for I=(i1,…,ik,j) with k≤d, [F5] says the coefficient of Xi1⋯Xik depends only on the longitude class in Fr/Γk+1 and is independent of the chosen representative. In string-link mode, [F4] identifies that class uniquely via the bottom-end isomorphism. In closed-link mode, [F4] supplies the required component-meridian lift; the procedure uses the based lift determined by its root arcs and traversal. Thus the coefficient read from Λj is exactly the based coefficient in [F6].

6.1F1F6step 5.1∎

In closed-link mode, each lower coefficient used for ΔIb is computed by the same procedure at its own finite degree; the finite gcd and quotient operation are exactly those in [F6]. Hence the returned indeterminacy and residue candidate are correct for the selected based word-lift data. The theorem asserts no independence of those choices; that is the separate basing theorem.

4 · Examples, counterexamples and false statements

None yet.

Sources