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
- Abelian Categories
- Absolute and Conditional Convergence; Rearrangement; Products
- Binary Operations, Monoids, Groups and Subgroups
- Cardinal Arithmetic, Cofinality and the Alephs
- Categories, Functors and Natural Transformations
- Chain Complexes and Homology
- Chain Homotopy and the Homotopy Category
- Compactness
- Compactness in Metric Spaces
- Completeness, Completion, and Uniform Continuity
- Complex Norms and Realification
- Complexification, Realification and Real Structures
- Composition Series, the Jordan–Hölder Theorem and Solvable Groups
- Connectedness
- Constant Rank, Submersions, Immersions and Regular Level Sets
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Continuity, IVT, EVT, and Uniform Continuity
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Countability Axioms and Cardinal Functions
- Covering Spaces and Lifting
- Crossing signs, writhe, and linking number
- Cw Complexes and Cellular Homology
- Derived Functors
- Determinants of Matrices over a Commutative Ring
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Double Complexes Exact Couples and Convergence
- Dual Spaces, Bilinear and Quadratic Forms, and Sylvester's Law of Inertia
- Euclidean Ordinary Differential Equations with Smooth Dependence
- Exactness and the Member Calculus
- Ext and Balanced Resolutions
- Exterior Powers, Orientation and Hodge Duality
- Fibrations Fiber Bundles and Homotopy Exact Sequences
- Filters and Ultrafilters
- Finite Counting, Factorials and Binomial Coefficients
- Foundations of the Real Numbers for Analysis
- Free Groups and Presentations
- Free Modules, Exact Sequences, Projective and Injective Modules
- Free Products and Amalgamation
- Fubini and Change of Variables
- Function Space Topologies and the Exponential Law
- Gaussian Elimination, Elementary Matrices and Reduced Row Echelon Form
- Geometric Braids and Artin Generators
- Group Actions, Orbits, Stabilisers and Cayley's Theorem
- Group Cohomology as a Derived Functor
- Group Homology Transfer and Low-Degree Exact Sequences
- Group Homomorphisms and the Isomorphism Theorems
- Hall–Mal’cev Coordinates and Bass–Guivarc’h Growth
- Hausdorff via the Diagonal
- Hereditary and Productive Behaviour of the Separation Axioms
- Higher Homotopy Groups and Cofiber Sequences
- Homology Axioms Degree and Classical Applications
- Homotopy and Homotopy Equivalence
- Hurewicz Whitehead Freudenthal and Cw Approximation
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Inner Product Spaces, Gram-Schmidt, Projections and Adjoints
- Knot exteriors and peripheral systems
- Limits and Colimits
- Limits of Real Functions
- limsup, liminf, and Subsequential Limits
- Linear Independence, Bases and Dimension
- Linear Transformations, Rank-Nullity and Quotient Spaces
- Local Coefficients, Twisted Homology, and Duality
- Long Exact Sequences in Homology
- Manifolds with Boundary Collars and Orientations
- Matrices, the Matrix of a Linear Map, and Change of Basis
- Metric Spaces
- Mixed Partials, Taylor Formulae, and Extrema
- Modules, Submodules, Quotient Modules and the Isomorphism Theorems
- Monotone Functions, Discontinuities, and Continuity Sets
- Monotone Sequences, Bolzano-Weierstrass, and Cauchy Completeness
- Multivariable Alexander modules and chain models
- Normal Subgroups and Quotient Groups
- Normed and Banach Spaces
- Obstruction Theory, Postnikov Towers, and Classifying Spaces
- Order, Zorn's Lemma, and the Axiom of Choice
- Ordered and Unordered Configuration Spaces
- Ordinal Arithmetic and the First Uncountable Ordinal
- Ordinals, Cardinals, and Transfinite Recursion
- Oriented Links, Braid Closures, and Markov Equivalence
- Partitions of Unity and Paracompactness
- Picard-Lindelöf and First-Order Ordinary Differential Equations
- Polynomial Rings, the Division Algorithm and Roots
- Power Series and Real-Analytic Functions
- Preadditive and Additive Categories and Biproducts
- Projective and Injective Resolutions
- Properties of the Integral and the Working FTC
- Pure Braids, Fadell–Neuwirth, and Asphericity
- Rank Theorems and Embedded Submanifolds
- Reflective Subcategories and the Adjoint Functor Theorems
- Relations, Functions, and Quotients
- Relative Homology Excision and Mayer Vietoris
- Relative smooth triangulation and bundle fitting
- Rings, Subrings, Integral Domains and Fields
- Rⁿ as a Normed Space; Vector-Valued Functions
- Roots, Rational Powers, and Classical Inequalities
- Sard Theorem and Transversality
- Separation Axioms: the Hierarchy
- Sequences and Limits
- Sequences and Series of Functions; Uniform Convergence
- Series: Convergence and the Nonnegative Tests
- Simple Field Extensions and the Construction of the Complex Numbers
- Simplicial Complexes and Simplicial Homology
- Simplicial Subdivision and Simplicial Approximation
- Singular Chains and Singular Homology
- Singular Cohomology and Coefficient Theorems
- Smooth Manifolds and Smooth Maps
- Smooth Partitions of Unity and Exhaustions
- Smooth Vector Bundles and Sections
- Spectral Sequences
- Subobject Lattices Generators and the Grothendieck Axioms
- Subspaces, Products, and Quotients
- Suprema and Infima
- Symmetric Groups, Cycle Decomposition and the Sign Homomorphism
- Tangent Cotangent and the Differential
- Tensor Fields Exterior Algebra and Differential Forms
- Tensor Products of Modules
- The Cantor Set, Baire Category, and Measure Zero in ℝ
- The Complex Exponential and Euler's Formula
- The Derivative and the Mean Value Theorems
- The Determinant of a Linear Operator, Cofactors and Cramer's Rule
- The Diagram Lemmas in an Abelian Category
- The Exponential Function
- The Fundamental Group
- The Fundamental Group of the Circle
- The Fundamental Theorems of Calculus
- The Group Algebra and Representations of Finite Groups
- The Inverse and Implicit Function Theorems
- The Inverse Function Theorem Completed
- The Riemann Integral in Rᵐ and Jordan Content
- The Riemann Integral: Definition and Integrability
- The Seifert–van Kampen Theorem
- The Serre Spectral Sequence and Applications
- The Topology of Euclidean Space
- The Total Derivative in ℝᵐ → ℝⁿ
- The ZFC Axioms and the Basic Set Constructions
- Topological Spaces and Continuity
- Topology of ℝ
- Uniform Spaces: the Three Definitions
- Universal Coefficients and Kunneth Theorems
- Universal Properties, Representables and the Yoneda Lemma
- Vector Fields Flows and Lie Derivatives
- Vector Spaces, Linear Subspaces, Span and Direct Sums
- Whitney Embedding Tubular Neighbourhoods and Approximation
2 · Logical flowchart
3 · Definitions, theorems and proofs
Classifying maps are natural up to based homotopy
Statement
Assume AC. Let be a based map of path-connected CW complexes, let and , and put . Let and be based classifying maps inducing the identity on the identified fundamental groups. There is a based map inducing , and
by a based homotopy. Consequently the induced maps on singular homology commute.
Statement references
Facts & Assumptions
Given: Full AC, the based map , the classifying maps , and the CW models in the statement.
Full AC, written AC, is The Axiom of Choice.
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)
Under AC, connected CW models exist for every group and the classifying-space construction is available for the stated groups. Existence and homotopy uniqueness of Eilenberg--Mac Lane spaces
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].
Take CW structures with the basepoints as vertices and choose a maximal tree in the connected one-skeleton of , using [A1]. Send all vertices and to the basepoint of . For each oriented edge outside , the tree paths to its endpoints turn into a based loop; send to a loop representing its image under . These loops generate , and each two-cell attaching loop maps to the identity because is a homomorphism on . Thus the map extends over the two-cells. For a cell of dimension , its attaching sphere extends because 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 .
Write and , so . Choose a maximal tree in rooted at , and let be its path from to each vertex . Choose the vertex track from to to be , with the track at constant. For an edge , the boundary of its homotopy square, conjugated by , represents . Hence every such square fills. For each -cell with , the boundary of its homotopy prism is a sphere , which fills because by [F1]. AC chooses the fillings and the CW weak topology assembles them into a continuous homotopy fixed at . Thus by a based homotopy.
By [F3], the homotopy of step 2.1 gives . This is the asserted naturality, including degree two.
Classifying maps are surjective on second homology
Statement
Assume AC. Let be a path-connected CW complex and let . For any based classifying map inducing the identity on fundamental groups, the induced homomorphism is surjective.
Statement references
Facts & Assumptions
Given: Full AC, a path-connected CW complex , a basepoint , and , and an arbitrary prescribed based classifying map inducing the identity on .
Full AC, written AC, is The Axiom of Choice.
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 -indexed chain
Under AC, is a connected CW model with and for . The classifying space of a discrete group is a K(G,1)
The long exact sequence of a Serre fibration computes the homotopy groups of its fiber. Long exact sequence of homotopy groups of a fibration
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
A simply connected path-connected space has zero first homology by the degree-one Hurewicz theorem. The first Hurewicz map is abelianization
Under AC there is a connected CW model . 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 -indexed chain
External input: for a connected CW , its universal cover is a contractible free -CW complex. Its augmented cellular chains form a free left -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].
Fix the arbitrary map in the statement, rather than selecting a special classifying map. By [F1], its target is a connected CW , so and is an isomorphism. For the derived-homology comparison in [F5], supply resolutions explicitly: over , take the free module on the underlying set of a module , map its basis element to , 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 . This specified construction supplies the resolution convention; [A1] and [L1] supply DC.
Apply the external comparison [F6] to this CW model . With its universal cover, put . Choosing an oriented lift of each cell, permitted by AC, exhibits as free over . Contractibility makes its augmentation exact. Thus 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 identifies with , including their differentials. Taking homology, and using cellular-to-singular homology comparison as in [F6], gives .
Replace this prescribed by its mapping-path Serre fibration , with and corresponding to . In [F2], the action on fiber components is transitive because is connected, and the component of the based fiber point has stabilizer all of because is onto. Thus the fiber is path-connected. Since and is injective, the same exact sequence gives . Hence by [F4].
Apply [F3] to . Since is path-connected, its local system is canonically the constant system . The five-term sequence therefore has consecutive terms The last group is zero by step 2.2. Exactness makes the first map, the edge homomorphism , surjective. Under this map is , and step 2.1 identifies its target with , proving the assertion.
A regular link diagram admits a normalized height realization
Statement
Assume countable choice. Let be a finite regular oriented diagram of a nonempty labeled smooth link , and assume every component has at least one underpassing point. Then is ambient isotopic through links with the same projection and crossing data to a smooth height realization such that exactly at the underpassing parameters on component and at every other parameter.
Statement references
Facts & Assumptions
Given: Countable choice, a finite regular oriented diagram, its smooth embedded realization, and at least one underpassing parameter on each component.
Countable choice, written , is The Axiom of Countable Choice ().
A regular oriented diagram has a fixed planar projection which is an immersion with finitely many transverse double points and records which branch is over at each point. Regular oriented link diagrams
A smooth isotopy of a compact embedded link in a boundaryless smooth -manifold, constant near both ends of the time interval, extends to an ambient isotopy supported in any prescribed open neighborhood of its track under countable choice. A smooth isotopy of a compact manifold extends to an ambient isotopy, The Axiom of Countable Choice ()
Proof
Given: The diagram, its initial height functions, and [A1].
Parameterize component by , and let be its nonempty finite set of underpassing parameters. Define Every factor is smooth and nonnegative, and it vanishes exactly when in . Thus is smooth, vanishes exactly on , and is positive somewhere because a finite subset does not exhaust . Its maximum is positive by compactness. Set . Then , equality at holds exactly on , and all other heights are greater than .
At every projected double point, the overpassing parameter is not an underpassing parameter: regularity excludes triple points, so the two source parameters at that double point have distinct over/under roles. Hence the new height difference between the over and under branches is strictly positive. Let be the original height function and choose a smooth equal to near and near . The family is smooth and stationary near both endpoints. At each crossing its over-minus- under height is a convex combination of two positive numbers, so it remains positive. Since [F1] lists all projected multiple points, each is injective; its projection remains an immersion, so each compact-source map is a smooth embedding.
The track of the isotopy in step 2.1 is compact, so choose an open ball containing it and apply [F2] with that ball as the support neighborhood. The resulting ambient isotopy of has compact support and therefore extends by the identity at to an ambient isotopy of . It carries the original link to and fixes the planar projection and over/under data throughout, because every slice of has those same data. This proves the stated normalized realization.
Cutting along a simply connected hypersurface adds one free generator
Statement
Let be a connected smooth -manifold without boundary, and let be a nonempty closed connected smooth embedded surface with . Suppose there is an open neighborhood of such that is path-connected and simply connected, and has exactly two path-connected simply connected components and . Suppose also that is path-connected and contains an embedded compact arc joining to , with an open tubular neighborhood such that consists of exactly two disjoint open -balls, one in each side component. Then
The cyclic factor is represented by a loop that joins the two sides of and returns between them through .
Statement references
Facts & Assumptions
Given: The manifold, embedded surface, neighborhood, and path-connectivity and simple-connectivity hypotheses in the statement.
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.
Put and . These are path-connected open sets covering . Their intersection consists of , , 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 .
Join the centers of the two end balls by an embedded arc in the connected smooth -manifold , and let be a thin open tubular neighborhood of in , enlarged at its ends to meet those balls. The open sets and cover . The set is a thickened loop formed by the two tubes and , so ; is together with the two end balls and is contractible. Since is simply connected, [F1] gives .
Apply [F1] to the open cover . Step 1.1 gives , while and step 2.1 gives . The pushout is therefore the free product . A generator of the second factor is represented by followed by , proving the stated description.
Homological Lyndon–Hochschild–Serre spectral sequence for group extensions
Statement
Assume the Axiom of Choice. For every short exact sequence of discrete groups the homological Serre spectral sequence of the induced map of classifying spaces has Here denotes homology of with the local coefficient system determined by the left -module , and group homology uses the bar classifying spaces. The coefficient group has the -action induced by conjugation by lifts in , and convergence is strong with the finite Serre filtration in each total degree.
Statement references
Facts & Assumptions
Given: Full AC and a short exact sequence of discrete groups.
Full AC, written AC, is The Axiom of Choice.
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 -indexed chain
Under AC, Milnor's classifying space is a connected CW model with and for . The classifying space of a discrete group is a K(G,1)
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
For a Serre fibration over a path-connected CW complex, the homological Serre spectral sequence has and strongly converges to the homology of the total space. Homological Serre spectral sequence
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 -indexed chain
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
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]
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].
Choose connected CW models from [L1]. Build a based map inducing by mapping the one-skeleton to loops representing the quotient images, filling each two-cell because its attaching word maps to the identity in , and extending over each higher cell because for . The finite cell extensions are simultaneous over a set of cells; [A1] supplies those choices. Replace this map by its mapping-path fibration ; the total space is homotopy equivalent to , and the fiber is its homotopy fiber.
The map on fundamental groups is the quotient . Exactness of [F1] gives , , and for every , because both and have zero higher homotopy groups by [L1]. By the external input [F5], has CW homotopy type. Choose a connected CW model and identify with . The uniqueness theorem [F4] gives , so for every .
A lift of a loop class transports the fiber fundamental group by . Choose a based homotopy equivalence as in step 2.1 and a based homotopy inverse , using the basepoint path supplied by the transport. The map is a based self-map of inducing on . By [F6], the classifying map satisfies , so the monodromy on agrees under with the bar-classifying-space map induced by . If a different lift is chosen, it differs by an element of and changes this map by an inner automorphism of . Inner conjugation is homotopic to the identity on the bar classifying space: the conjugation functor on the one-object category of is naturally isomorphic to the identity by the conjugating element. Hence the induced action on depends only on , and is exactly the stated -module action.
Apply [F2] to . By step 2.1 the fiber homology is , and step 3.1 identifies its monodromy local system with the conjugation action. Therefore the page is and the spectral sequence strongly converges to .
The total-space equivalence from step 1.1 identifies with . By [F4], this classifying CW model is homotopy equivalent to the bar model used in [F3], so its homology is . 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.
Five-term homology sequence of a group extension
Statement
Assume AC. For every group extension the maps induced by inclusion, quotient, and transgression form an exact sequence Here is the normal subgroup generated by the commutators with and . The sequence is natural under homomorphisms of short exact sequences, including its transgression.
Statement references
Facts & Assumptions
Given: AC and the group extension.
Full AC, written AC, is The Axiom of Choice.
AC implies DC by choosing one successor at each stage of a serial relation. The axiom of dependent choice: a relation in which every element is related to something admits an -indexed chain
The extension has a strongly convergent homological spectral sequence with and abutment . Homological Lyndon–Hochschild–Serre spectral sequence for group extensions
Every first-quadrant homological spectral sequence with finite abutment filtration has the exact five-term sequence . Five term exact sequence of a first quadrant homological spectral sequence
Under DC and the supplied projective-resolution convention, the bar model computes group homology; in degree one, is generated by symbols with relations . Diagonal bar coinvariants compute group homology
The homological Serre spectral sequence, including its differentials, edge maps, and abutment filtration, is natural for maps of fibrations. Homological Serre spectral sequence
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].
Supply the resolution convention needed by [F3] as follows. For each relevant group and left -module , take the free module on the underlying set of , augment , 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 . By [A1] and [L1], DC also holds. Apply [F2] to [F1]. Since with trivial -action, its terms are , , , and . This gives an exact sequence with the coinvariant group in the middle.
By [F3], under the map sending to its class. The -coinvariants impose the relations for every lift and . Their subgroup in is exactly , because . Therefore .
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 to ; mapping-path replacement gives a map of their fibrations. Its fiber map induces the specified homomorphism on fundamental groups. Under the fiber identifications with in [F1], [F5] identifies its homology map with that induced by . By [F4], the map of spectral sequences commutes with , 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 to its class in the coinvariants, hence commutes with the homomorphism on and its conjugation action. This proves naturality of the displayed sequence, including the transgression.
Integral Stallings theorem for finite lower-central quotients
Statement
Assume AC. Let be a group homomorphism inducing an isomorphism and an epimorphism . For a group , define and . Then for every finite , the induced homomorphism is an isomorphism.
Statement references
Facts & Assumptions
Given: AC and a group homomorphism satisfying the stated and hypotheses.
Full AC, written AC, is The Axiom of Choice; it is inherited from the group-extension homology sequence supplier.
For every group extension , the exact sequence 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
AC implies DC by choosing one successor at each stage of a serial relation. The axiom of dependent choice: a relation in which every element is related to something admits an -indexed chain
Under DC with supplied projective-resolution data, the bar complex computes group homology. In the bar complex, degree one has generators and degree-two boundaries , so . Diagonal bar coinvariants compute group homology
Proof
Given: The group map and hypotheses above.
Supply the resolution convention for [F2] by taking, for every module over each relevant group ring, the free module on its underlying set, augmented , and repeating this construction on successive kernels. These surjections give an exact free resolution. By [A1] and [L1], DC also holds. The case is the map between two trivial quotients. For , the bar degree-one calculation in [F2] identifies with the assumed isomorphism on . These are the base cases.
Fix and assume is an isomorphism. Apply [F1] to the extensions and . Since for , the maps are isomorphisms. Exactness therefore makes the transgression onto, with kernel the image of . By definition .
Naturality of [F1] makes the map compatible with the two transgressions. It is an isomorphism because the quotient-group map is an isomorphism by the induction hypothesis. The epimorphism makes the image of in map onto the image of in . The induced map on the two cokernels is consequently an isomorphism. By step 1.2 and exactness, those cokernels are and .
The inclusions and quotient maps give exact central extensions because . 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 is an isomorphism.
Steps 1.1 and 3.1 prove by induction the isomorphism for every finite . 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.
Lower-central series and Magnus expansion for links
Definition
For any group , define its lower-central series by and , where is the subgroup generated by for and . For , let be the free group on the formal meridian symbols , with the free-group convention of its stated generators.
Let be the ring of formal integer sums over all finite words in the letters , 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 be the ideal of series with zero constant term. The Magnus expansion is the group homomorphism It sends to . For an integer , calculations through degree use the truncated ring . As a -module it has the finite monomial basis of words of length at most . In , the inverse of for is the finite sum .
For a based string link, 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.
Definition references
Remarks
The commutator convention is . Truncation to degree retains the constant and homogeneous terms of degrees at most .
The upper link-diagram region is free on strand meridians
Statement
Assume countable choice.
Let be a finite regular oriented diagram of a nonempty labeled link with crossings. Fix a smooth height realization such that exactly at the underpassing points and elsewhere, and assume each component has at least one underpassing point. Put Cut every component parameter circle at its underpassing points; the resulting open intervals are the strands. For each strand interval , its vertical sheet is Set . Choose a common basepoint in , and for each strand choose a positive meridian circle meeting only its own sheet once, with its access path in . Then is free on these based positive meridians . The inclusion also induces an isomorphism on fundamental groups.
Statement references
Facts & Assumptions
Given: The diagram, height realization, product-tube data, and based positive meridians specified in the statement.
Countable choice, written , is The Axiom of Countable Choice ().
The inclusion of the upper half-space with its point at infinity into is a homotopy equivalence by the variable-width level-sphere collar. A punctured-sphere cover from a labeled link diagram
For an open cover by two path-connected sets with path-connected intersection, Seifert–van Kampen identifies the fundamental group of the union with the pushout. Seifert–van Kampen identifies the fundamental group with a group pushout
Under countable choice, every closed smooth embedded submanifold has an open tubular neighborhood in its normal bundle. The tubular neighbourhood theorem in a smooth ambient manifold, The Axiom of Countable Choice ()
Cutting along a closed simply connected hypersurface with a two-sided simply connected tube and a one-tube corridor in the complement adds one free cyclic factor to the fundamental group. Cutting along a simply connected hypersurface adds one free generator
A positive meridian is the oriented boundary of a normal disk, with orientation fixed by the link tangent followed by disk orientation. Based string links and labeled link peripheral systems
Proof
Given: The diagram and height realization in the statement.
Let . By [F1], . A small neighborhood of in is the open upper half-ball together with its cone vertex , disjoint from ; other points of the level-sphere boundary have been deleted. The open cover has intersection , which is homeomorphic to and is contractible because the open hemisphere is an open disk. Since is also contractible, [F2] gives .
Each is the image of the open region with and ; this is an embedded open disk. At a projected double point, the underpassing branch has height and is absent from , while the overpassing branch has height greater than . Thus sheets over distinct intervals are disjoint. Each sheet is closed in : its only limit points outside itself lie on the excluded plane or on the excluded link. Hence it is a proper smooth embedded simply connected surface.
At a fixed vertical line, every point of lies above all link points on that line. Since every link height is at most , the straight homotopy () stays above those link points and contracts onto the plane . This plane is contained in , so is contractible.
For , put . Then and . At each stage is path-connected: it contains path-connected , and every point of an earlier sheet joins to along a short normal segment. Orient by its interval and height coordinates. The ambient orientation orients its normal line, so that line bundle is trivial; a bundle metric gives the unique positive unit vector in each fibre. By [A1, F3], choose a tubular neighborhood disjoint from the other sheets. Radial contraction shows the whole neighborhood and each of its two side components are simply connected. Choose a small positive meridian circle around an interior point of the th strand in a ball disjoint from all other sheets. It meets transversely once. Remove a short open arc about that intersection; the remaining compact arc lies in and joins the two sides of . Shrink the tubular neighborhood so that it meets this arc only in two end balls. This gives the corridor required by [F4], and its complement hypothesis holds because is path-connected.
The cut lemma [F4] gives . Its cyclic generator is represented by the short meridian arc crossing followed by the complementary arc from step 3.1. Joining this loop to the basepoint by its access path in gives exactly , with positive orientation fixed by [F5]. Since , induction yields that is free on . Step 1.1 identifies this with .
Remarks
The cross-section shows one sheet below a strand between two underpassing points. The embedded sheet is a disk strip, and its two side collars are the two components used in the van Kampen step; the proof uses these products, not the drawing.
\begin{tikzpicture}[scale=1.0,>=stealth]
\draw[thick] (-2,0) -- (2,0) node[right] {$z=-1$};
\draw[thick,->] (-1.5,2) .. controls (-0.5,2.3) and (0.5,2.3) .. (1.5,2);
\draw[dashed] (-1.5,0) .. controls (-0.5,0.5) and (0.5,0.5) .. (1.5,0);
\draw[dotted] (-1.5,0) -- (-1.5,2);
\draw[dotted] (1.5,0) -- (1.5,2);
\node at (-1.5,-0.25) {$p_-$};
\node at (1.5,-0.25) {$p_+$};
\node at (0,0.85) {$D_j$};
\node at (0,2.35) {strand};
\node at (0,-0.55) {level sphere};
\end{tikzpicture}
Finite nilpotent link quotients are generated by component meridians
Statement
Let be a nonempty labeled oriented link in , let , and choose one based positive meridian for each component. For every integer , the homomorphism from the free group defined by induces a surjection
Statement references
Facts & Assumptions
Given: The link, its chosen product tubes, and based component meridians.
The positive component meridians form a basis of . String-link exterior homology and end-meridian maps
The degree-one Hurewicz map identifies with . The first Hurewicz map is abelianization
The lower-central series is and . Lower-central series and Magnus expansion for links
Commutators add lower-central weights, and their induced pairings on graded quotients are biadditive. Lower-central commutators add weights
Proof
Given: and its selected meridians .
Let . By [F1] and [F2], the images of these meridians generate , so .
For every , the quotient is generated by iterated commutators of weight in the selected meridians. For , [F4] makes the pairing biadditive, so [F1] implies this layer is generated by brackets of the . If the claim holds at weight , then [F3] writes the next layer as generated by brackets of a degree-one class with a weight- class; [F4] makes that pairing biadditive, so [F1] again reduces the degree-one entries to the , and the induction hypothesis reduces the other entries to brackets of those meridians. Each such iterated commutator is a word in lying in , so its class is in the image of in the graded layer.
The conclusion of step 2.1 implies for every , because each generator of the graded layer is represented by a word in the that lies in . Starting from in step 1.1 and applying these inclusions successively gives for every finite . Therefore the image of , and hence of the free group map in the statement, is all of . For the quotient is trivial.
Magnus commutator degree and finite truncation
Statement
Let be the free group and the Magnus expansion from the preceding definition, with augmentation ideal . If and for , then
Consequently for every . In particular, reduction of modulo factors through and its coefficients through degree are independent of the representative word.
Statement references
Facts & Assumptions
Given: The free group, lower-central series, Magnus map, and augmentation ideal from the preceding definition.
The series map is a group homomorphism, , and . Lower-central series and Magnus expansion for links
Proof
Given: The free group , its Magnus expansion , and the filtered-ring data from the Definition.
In any filtered associative ring, write and with and . Since are units, By [F1], , and multiplication by units preserves this two-sided ideal. Therefore . This is a ring calculation conditional on the two degree bounds; no lower-central inclusion is assumed here.
By [F1], . Assume . For a generator of , [F1] gives and the induction hypothesis gives . The ring calculation in step 1.1 therefore puts its image in . Products and inverses remain in that subgroup: their images modulo the two-sided ideal are all . Thus , and induction proves the inclusion for every . Now for arbitrary and , the established inclusions give both hypotheses of step 1.1, which yields .
If two words represent the same element of , their quotient lies in . By step 2.1 its expansion is modulo . Multiplicativity of then makes the two truncated expansions equal, proving representative-independence of every coefficient of degree at most .
Magnus coefficient changes under longitude conjugation depend on lower-order coefficients
Statement
Let be the free group with Magnus expansion , let , and let be a nonempty word of length . The coefficient of in is an integer linear combination of coefficients of on proper contiguous subwords of . Thus, when is the prefix of a Milnor index , conjugating the longitude can change its degree- coefficient only by an integer combination of coefficients indexed by proper subsequences of .
Statement references
Facts & Assumptions
Given: The noncommutative formal-series ring, augmentation ideal , and Magnus expansion in the preceding definition.
Every Magnus expansion has constant term , its positive-degree part lies in , and multiplication concatenates words. Lower-central series and Magnus expansion for links
Proof
Given: The words , the Magnus expansion , and the formal-series ring from the Definition.
Write and with . Then Expand . The term with no on either side is and cancels the subtracted . Every remaining term is a product with .
A coefficient of degree in such a product uses a degree- monomial of , a degree- monomial of , and a degree- monomial of with and . The monomial therefore has degree and occupies a contiguous middle block of the target word , while the nonempty left or right block comes from . Summing the finitely many decompositions of expresses its coefficient as an integer linear combination of coefficients of on proper contiguous subwords. Appending the longitude index makes each such index a proper subsequence of .
String-link end inclusions identify finite nilpotent peripheral quotients
Statement
Assume AC. Let be an -component based string link with , exterior , and endpoint punctured disks . Use compatible jointly transported stem accesses for the positive endpoint meridians to identify and with the free group , and let be the based end homomorphisms, including the chosen top connecting path. For every integer , each induced map is an isomorphism. Their composite is the based nilpotent comparison of the labeled top and bottom peripheral systems.
Arbitrary independently based positive endpoint meridians are retained as well: the map from the free symbol group sending to that chosen meridian need not identify the full fundamental group, but its composites with the end maps still induce the displayed isomorphisms on every finite lower-central quotient. Their inverse/composite is the comparison for those exact choices, and the conjugating access differences are part of the data.
Statement references
Facts & Assumptions
Given: Full AC and the based string-link data in the statement.
Full AC, written AC, is The Axiom of Choice. The local Stallings supplier uses this axiom for its group-homology branch.
Each endpoint group is free of rank , with the compatible positive meridian basis; independently based meridians are the recorded conjugates and give the same homology basis. The exterior inclusion maps are isomorphisms on and epimorphisms on . String-link exterior homology and end-meridian maps
The natural degree-one Hurewicz maps identify group with abelianization. The first Hurewicz map is abelianization
For a path-connected CW complex, the classifying map to the classifying space of its fundamental group is onto on . Classifying maps are surjective on second homology
Classifying maps commute up to based homotopy with maps of path-connected CW complexes and their induced fundamental-group homomorphisms. Classifying maps are natural up to based homotopy
A group homomorphism inducing an isomorphism on and an epimorphism on induces isomorphisms on every finite lower-central quotient, under the stated AC branch. Integral Stallings theorem for finite lower-central quotients
Compact smooth manifolds with corners admit finite CW triangulations under AC. Finite smooth triangulation of compact corners, relative to admissible boundary data
Proof
Given: The endpoint inclusions .
By [F1], each induces an isomorphism on topological and an epimorphism on topological . Naturality of [F2] identifies the map with the map between the abelianizations of and . Thus each group homomorphism is an isomorphism on group .
By [F6], and have CW structures, so choose classifying maps and . For either sign and any , choose with using [F3]. By [F1] choose with . Write . Naturality [F4] gives Thus every class in is in the image of the induced group-homology map .
By [F5], each now satisfies both Stallings hypotheses. Applying it separately to and proves that each induced map on is an isomorphism for every finite .
Since both end maps are isomorphisms at every such , their inverse/composite is defined and is an isomorphism. The meridian labels and basing path are carried through the same maps, so this is exactly the stated peripheral comparison. The proof uses full AC only through the classifying-space and Stallings suppliers; no additional choice is used in the elementwise quotient argument.
Choose arbitrary independently based positive endpoint meridians. Their map is the identity on the ordered basis by [F1] and [F2]. Also : [F1] gives , and [F3] maps that group onto the group-homology group. Thus is onto on , independently of its source's . Apply [F5] to . It induces an isomorphism at every finite lower-central quotient, even though need not be an isomorphism on the full groups. Compose it with the already proved end isomorphism of step 3.1. This proves the arbitrary-basing branch and its stated inverse/composite, using exactly the selected meridian conjugations rather than an incorrect free-basis assertion.
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 -component string link with and bottom meridian symbol group , exterior group , and based string-link longitudes . 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 with and each index in , let be the unique class whose image under the bottom-end nilpotent isomorphism is the class of in . Define the integer coefficient where the bracket means the coefficient of that word in the finite Magnus expansion through degree . The commutator-degree lemma makes this coefficient independent of the representative of .
For a closed labeled link , choose a common basing and its preferred zero-self-meridian longitudes. For every component and every finite , choose a lift of the class of its longitude in , where and is free on the component meridian symbols. Such lifts exist because those meridians generate every finite nilpotent quotient. For , define the based coefficient by taking the coefficient of in through degree . Let be the nonnegative greatest common divisor of the finite set of all for sequences of lengths from to that occur as subsequences of cyclic permutations of . The gcd of an empty set is . Define the based residue candidate with . Independence of the basing and word lifts is not part of this definition; it is a separate theorem. A based Borromean example with uses this convention.
Definition references
Remarks
The length of is ; 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.
Wirtinger presentation correctness for labeled links
Statement
Assume countable choice.
Let be a finite regular oriented diagram of a nonempty labeled link, after inserting a small type-I curl on any component that has no underpassing point. Let be the positive meridians of the strands between successive underpassing points, with the compatible common-upper-collar accesses of the local crossing rule. At a crossing , write for the over-strand and for the source and target under-sides defined using the positive in-plane normal to the over-strand. Set Then the assignment of each generator to its based positive meridian induces an isomorphism Any one crossing relator may be omitted without changing the represented group. The theorem makes no claim that all relators are independent.
Arbitrary independently based positive strand meridians remain recorded: if is the access difference for strand , its actual class is in this reference presentation. This gives their exact group elements without claiming that the independently conjugated themselves freely generate the upper region or give the displayed uncorrected presentation. A common access change conjugates every generator and preserves the displayed presentation map.
Statement references
Facts & Assumptions
Given: The link diagram, its labels, crossing conventions, a smooth realization , and common based meridian paths. Here denotes the exterior of arbitrary specified pairwise-disjoint closed product tubes about the components of , with their product parametrizations; thus . Choose the group basepoint in . Compatible diagram meridians may first be represented in ; their images under the product-tube radial retraction are the based positive meridians in the displayed exterior group. These are auxiliary choices for the exterior and its marking, not extra restrictions on the link.
Countable choice, written , is The Axiom of Countable Choice ().
For the normalized realization, has an open cover whose upper piece is generated freely by the strand meridians, whose lower piece is contractible, and whose overlap is a punctured sphere with crossing circles normally generating its fundamental group even after one is omitted. For the specified product tubes the cover supplier also gives the radial deformation retraction , fixed on . A punctured-sphere cover from a labeled link diagram, The upper link-diagram region is free on strand meridians
The Seifert–van Kampen theorem identifies the fundamental group of a union with the pushout of the two inclusion maps from a path-connected overlap. Seifert–van Kampen identifies the fundamental group with a group pushout, A group pushout is the quotient of a free product by the amalgamating relations
Under the upper-region meridian basis, the image of a small puncture circle at crossing is conjugate to or ; these have the same normal closure. Local meridian conjugacy at a labeled link crossing
A group presentation is the quotient of the free group on the stated generators by the normal closure of the stated relators. Group presentation by generators and relations, Free group on a set of generators
A regular link diagram whose components have underpasses has an ambient-isotopic height realization with every underpass at height and all other points above . A regular link diagram admits a normalized height realization
Proof
Given: Countable choice, the link diagram and smooth realization, and the common based meridian paths in the Statement.
If a component has no underpassing point, insert a small type-I curl in a disk meeting only that component. The local curl is the boundary of a disk pushed into a ball disjoint from the rest of the link, so removing it by the reverse isotopy identifies the resulting link with the original. After this finite operation each component has an underpass. Apply [F5] to obtain the normalized height model required by the cover supplier. If is the resulting ambient isotopy's endpoint, transport each specified tube parametrization by , together with the basepoint and all based paths. Then is exactly the exterior of these transported tubes, and identifies its based positive meridians with the original ones. Work in this normalized model and retain the names .
By [A1, F1], the upper-region group is free on , the lower-region group is trivial, and the overlap group is normally generated by the crossing circles . Applying [F2] to the open cover of , the pushout with a trivial lower group is the quotient of the upper group by the normal closure of the images of these circles. This quotient initially computes . Use common basepoint-change paths when passing between the overlap basepoint and the reference upper basepoint; this conjugates all generator images by the same path, consistently with the given common basing.
By [F3], the normal closure in the upper group of the images of the crossing circles is the normal closure of the relators . By [F4], the pushout quotient is therefore the stated Wirtinger presentation of . Now apply the radial retraction from [F1]: in each punctured product tube, write a point as with and , and use for , fixing the exterior. These formulas agree with the identity at , so they give the based deformation retraction . It sends a positive small normal circle to the corresponding positive tube-boundary meridian, and fixes any already exterior-based loop. Thus composing the presentation isomorphism with gives exactly the stated isomorphism to with its positive-meridian marking; retracting the common basepoint-change paths gives the same based identification. Transporting back by restores the originally specified exterior.
The cover lemma also states that any of the crossing circles normally generate the overlap group. Replacing the full list by any list omitting one circle therefore gives the same normal closure in the upper group, hence the same group and, under the fixed isomorphism , the same marked exterior-group presentation from step 3.1.
For an arbitrary access to the same positive meridian circle reached by the reference access , set . Cancellation of reversed paths gives in the actual exterior group and hence, by step 3.1, in its reference presentation. If one common based loop is prepended to all accesses, this is simultaneous conjugation and so an inner automorphism of the target. Independent need not define an automorphism or even a generating tuple, which is why no such assertion is made. All geometric based meridian data are retained by these explicit words.
Truncated Milnor invariants from a based link diagram
Definition
Assume AC. The input is either (a) a based -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 -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 . 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 , the parallel endpoint differences , and its relative meridian winding . 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 , which may differ from the initial-meridian access . Arbitrary parallels are allowed in this branch, with the recorded . The input also includes a maximum index length . The output is the integer coefficients in string-link mode, or the based coefficients , their lower indeterminacy data , and residues in closed-link mode, for every index sequence with .
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 and work in the truncated noncommutative ring where is the ideal generated by the letters. Carry out the following finite procedure.
-
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 the component label .
-
First compute in the compatible reference root symbols , irrespective of the actual access choices. For every strand , initialize its meridian series by . For each degree , copy every into the constant and lower-degree part of , with new degree- terms initially zero, and reset each chosen root strand to . 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 and source and target under-arcs , use the already available and the current to set when the traversal is source-to-target, and set when it is target-to-source. Here discards monomials of degree greater than , and every inverse is the finite geometric series in the nilpotent ideal of .
-
For each component , traverse its undercrossings in order and form , where the factors are in traversal order and for source-to-target and for target-to-source. In string-link mode set . In closed-link mode set where is the sum of the determinant signs at self-crossings of component .
-
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 for the resulting unit series, and for the endpoint transport series. In string-link mode replace the compatible by In closed-link mode replace the compatible preferred series by where is the actual longitude access difference, independently of the initial-meridian difference . 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 With new letters , initialize and iterate Substitute 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 as .
-
For every with , read the coefficient of in . 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 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 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.
Definition references
Remarks
The per-degree passes use over-strand series only through degree : 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.
Finite nilpotent peripheral presentation from a link diagram
Statement
Assume AC. Let a nonempty labeled oriented closed link have a based regular diagram with an underpass on every component. Choose an initial arc on each component, its positive meridian , and the common upper basing. Put and . For every there are explicit words representing the preferred longitudes in such that the meridian map identifies The words can be chosen coherently through each finite degree. They are obtained through the st approximation of the crossing-conjugation recursion, initialized by component meridians and using the preceding approximation for every over-arc. In particular this describes the kernel, rather than merely the surjectivity, of the component-meridian map. Quotienting further by commutators of arbitrary conjugates of each component meridian adds exactly those commutators to this presentation.
Statement references
Facts & Assumptions
Given: Full AC, the finite based diagram, and .
Full AC supplies the countable-choice hypotheses of the diagram suppliers. The Axiom of Choice
The strand generators and crossing relations give the exterior group, with relation in source-to-target order and its solved inverse in the other direction. Wirtinger presentation correctness for labeled links, Local meridian conjugacy at a labeled link crossing
The product of signed over-meridians in component traversal order is its blackboard parallel; multiplying by the initial meridian to minus the self-writhe gives its preferred longitude. Diagram word for a preferred peripheral longitude
Commutators of lower-central weights have weight at least , and the induced graded commutator pairing is biadditive. Lower-central commutators add weights
The lower-central and commutator conventions are and . Lower-central series and Magnus expansion for links
Proof
Given: Full AC, the finite based link diagram, its initial meridian arcs, and .
Cut the traversal of component just before its initial arc. For every other arc of that component let be the signed product of over-arc symbols encountered before ; for the initial arc set . The nonclosing relations in [F1] successively say . The final relation on that component is , with the full traversal product. This rewriting follows by induction along the traversal and does not treat an over-arc as an already eliminated free generator.
Define words in simultaneously by and , retaining at each initial arc. Substitution in a finite word preserves congruence modulo a normal subgroup. If the substituends change modulo , the conjugate of a weight-one generator changes only modulo , because by [F3]. Consequently : the case is equality in the abelianization, and this observation proves the induction. In , the true arc meridian equals modulo , by the same induction starting from conjugate meridians in the abelianization.
Put , and . Step 2.1 and [F2] show that these are longitude lifts in . The relation is equivalent to . Let be the quotient of by these relations and . Its root-meridian map to is defined because the true meridian and its true peripheral parallel commute on the boundary torus. Every arc meridian is the image of , so this map is onto.
Conversely assign every Wirtinger arc the image of in . If an undercrossing does not close its component, its conjugation equation follows from the consecutive partial traversal products evaluated at : those products give , and modulo by step 2.1. At the closing crossing the same argument leaves exactly , imposed in . Thus all crossing relations hold. By [F1] this gives , and it factors through because is a quotient of . The two maps are inverse: they fix every root generator of , and step 2.1 says their composite fixes every arc generator of . This proves the displayed presentation and the kernel assertion.
For a fixed finite maximum degree, the iterates in step 2.1 stabilize in every lower quotient; applying the same observation to the finite word proves coherence of . Finally, forming a further quotient adds the prescribed relations to the kernel. Surjectivity in step 3.1 means every conjugating element of has a lift in , so the added relations are exactly for words . Their entire normal closure is meant; the argument does not assert this infinite family is finite.
Milnor basing indeterminacy and self-crossing scope
Statement
Assume AC. Let be a nonempty labeled oriented link in , let have length at least two, and let be any two based meridian-longitude word systems used in the preceding definition. Then the based residue candidates and agree under the canonical identification of their residue groups. If and are related by a finite sequence of self-crossing changes, the same residue is preserved whenever the entries of are pairwise distinct. No invariance for repeated-index sequences under self-crossing changes is asserted.
Statement references
Facts & Assumptions
Given: Full AC, the closed-link peripheral system, and finite based word-lift data through the length of .
Full AC, written AC, is The Axiom of Choice.
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
Conjugating one longitude changes a degree- coefficient by an integer combination of coefficients on proper contiguous subwords. Magnus coefficient changes under longitude conjugation depend on lower-order coefficients
The side-based meridian relation at a crossing is fixed by the local crossing chart. Local meridian conjugacy at a labeled link crossing
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
The finite nilpotent peripheral presentation has kernel normally generated by and , 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
The Magnus expansion of is modulo degree . Magnus commutator degree and finite truncation
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 ; write .
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 from [F5], through degree . For any index sequence , write for the corresponding coefficient of these words. Let be the ideal of generated by for all proper subsequences of cyclic permutations of of length at least two. Its nonnegative generator is the gcd in [F1]. Work in the ring with finitely many surviving monomials, obtained from by setting to zero every monomial whose index word is not a subsequence of . 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 are well-defined finite operations. Occurrences, including repeated indices, are retained in their original order; no assumption of distinct indices is used here.
For a self-crossing change on component , 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.
The coefficient of any surviving word in is zero in . Indeed put . The exact identity is Every summand contributing to a surviving word therefore contains one distinguished occurrence of and a nonempty block from , as well as possibly other blocks. If that block has index word , its coefficient is . The selected block and the distinguished occupy disjoint positions in a subsequence of ; starting just after that occurrence of and reading cyclically shows that is a subsequence of a cyclic permutation of . It is proper, since its length is at most . Hence , and the whole summand vanishes. The same argument applies if 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 through degree by [F6]. Therefore [F5] makes the coefficient of independent modulo of every lift of a fixed longitude in .
Under that reduced-group identification, the longitude of a component different from 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 , 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.
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 by [F4]. The resulting change of root variables is . 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 for ; each correction has the prescribed image because the graded map is the identity. For injectivity, an element in the kernel is successively in . 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.
Now suppose the entries of are distinct. In the ring of step 1.1 every monomial containing an index twice is zero. For any word , every term of contains . Products of two such positive-degree expressions are therefore zero when both refer to , and their units commute. The additional reduced-group relators 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 . If the changed component is , the further normal-meridian subgroup in step 2.2 is annihilated too, since does not occur in . Thus the two longitude coefficients agree modulo . If the changed component is not , their equality in the reduced group from step 2.2 already gives this conclusion.
In a variable substitution of this kind, is replaced by plus terms of degree at least two, every one of which contains an occurrence of : this follows by expanding . A coefficient of in the substituted longitude therefore differs from its old coefficient only by integer multiples of for proper subsequences of . These are generators of . 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 and the distinguished still form a proper cyclic subsequence of . Hence every permitted basing and lift change preserves the target coefficient modulo the ideal of the old proper coefficients.
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 , apply the induction hypothesis to every proper cyclic subsequence of . It says that its coefficient changes by an integer combination of coefficients on proper cyclic subsequences of , all of which are proper cyclic subsequences of . 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.
Induct again on the distinct index length. Length-two coefficients are preserved by step 3.2 with zero lower ideal. For larger , 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.
Truncated Milnor computation terminates and matches peripheral quotients
Statement
Assume AC and let the based diagram, peripheral data, and maximum index length satisfy the input conditions of the preceding algorithm. Put . The algorithm terminates after finitely many diagram, degree, and monomial operations. In string-link mode, its output for each with equals the integer coefficient of the based longitude in the bottom-end quotient . 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.
Statement references
Facts & Assumptions
Given: Full AC and a valid based diagram input with finite maximum length .
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
The procedure uses finitely many strand, crossing, degree, monomial, and subsequence scans. Truncated Milnor invariants from a based link diagram
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
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 for a string link and for the closed preferred longitude. The access-word inputs record those differences. Diagram word for a preferred peripheral longitude
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
The Magnus expansion through degree factors through the quotient by and its coefficients are representative-independent. Magnus commutator degree and finite truncation
The coefficient and based residue outputs are those specified in the preceding definition. Integer Milnor coefficients and closed-link residues
The lower-central convention is , and Magnus series are multiplicative. Lower-central series and Magnus expansion for links
Proof
Given: The algorithm input and the facts above.
Under [A1], the validation stage scans a finite diagram. The degree loop runs from to , each component traversal visits finitely many undercrossings, and each multiplication, inverse, and truncation in involves only finitely many monomials of degree at most . 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.
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 is conjugate to its root meridian, so its expansion in root symbols is . This is the initialization . 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.
Induct on , starting from step 1.2. Choose free words for the preceding arc approximations, representing the true compatible meridians modulo . Start each component at its root word , 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 changes its conjugation of a meridian only modulo , by [F7]. Induction along the traversal therefore makes every new arc word a lift of its true meridian modulo . Its expansion through degree uses the over-word only through degree : a discrepancy of degree commutes with the constant term of the conjugated series and first contributes in degree . 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 . In string-link mode [F4] identifies those lifts uniquely in ; 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.
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 ; multiplicativity makes exactly their expansions through degree . In string-link mode these are the unique bottom-end quotient classes by [F4].
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 , so its series is with of degree at least two. Substitution of two letter systems agreeing through degree into gives results agreeing through degree , 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 it solves 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 , 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.
Under the stated axiom branch [A1], for with , [F5] says the coefficient of depends only on the longitude class in 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 is exactly the based coefficient in [F6].
In closed-link mode, each lower coefficient used for 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.
Isotopy invariance and nonrepeating link-homotopy scope of Milnor invariants
Statement
Assume AC. Every integer Milnor coefficient of a based string link is invariant under smooth isotopy through string links fixing the endpoint collars, with the selected tubes, parallels, meridians, and access paths transported by a relative ambient extension of that isotopy. For closed labeled oriented links, the residue candidate is invariant under ambient isotopy. A link-homotopy is a finite sequence of ambient isotopies and local crossing changes in which the two branches at every crossing change belong to the same component. Under link-homotopy, is invariant when the entries of are pairwise distinct. No invariance for repeated-index sequences under link-homotopy is asserted.
Statement references
Facts & Assumptions
Given: Full AC, the based peripheral data, and the definitions of the integer and residue coefficients.
Full AC, written AC, is The Axiom of Choice.
Based string-link coefficients are extracted from unique longitude classes in finite nilpotent quotients using the Magnus expansion. Integer Milnor coefficients and closed-link residues, String-link end inclusions identify finite nilpotent peripheral quotients
For every index sequence, changing closed-link basings and finite longitude-word lifts preserves the residue and its lower-coefficient ideal. Self-crossing changes preserve these data for pairwise-distinct index sequences. Milnor basing indeterminacy and self-crossing scope
Ambient isotopy of oriented links carries exteriors, positive meridians, and peripheral tori to the corresponding data. Oriented links in the three-sphere and ambient isotopy, Based string links and labeled link peripheral systems
Full AC implies countable choice. AC implies DC implies countable choice, The Axiom of Choice, The Axiom of Countable Choice ()
Under countable choice, a smooth vector field along a closed embedded submanifold extends to a global smooth vector field. A vector field along an embedded submanifold extends to a neighbourhood and globally when the submanifold is closed
A compact set in an open set of a smooth manifold admits a smooth cutoff equal to one near the compact set and supported in the open set. A smooth Urysohn lemma for a closed set in an open set
A smooth time-dependent vector field with uniformly compact support has a global evolution on a compact time interval. Compactly supported time-dependent vector fields have global evolution on a compact time interval
Proof
Given: The isotopy or link-homotopy described in the statement.
Let be the given smooth isotopy through string links, fixed on common endpoint collars. Reparametrize it to be stationary near . Choose fixed disjoint smooth closure arcs outside , using the closure construction in the based-string-link definition, and adjoin them to the moving intervals. The result is a smooth family of closed links in , constant on the closure arcs and endpoint collars; extend it constantly in time outside . The map , , is an injective immersion and is proper: injectivity and immersion follow from the time coordinate and the embedding of each link slice, while the preimage of a compact set lies in a compact time interval times the finite union of circles. Thus its image is a closed embedded submanifold. The vector field along this graph is smooth and vanishes on the fixed closure arcs and endpoint collars. Since the motion is confined to a compact subinterval of each string component away from its endpoint collars, choose a compact set containing every point where this velocity can be nonzero. By [A1] and [L1], [F4] extends to a global smooth vector field on . Let be its component. By [F5] choose equal to one near and supported in , and replace by . This field still equals the prescribed velocity along the entire closed link: it is unchanged wherever the velocity is nonzero and is zero on the stationary arcs. Its supports lie in the compact set . Integrate it by [F6]. Uniqueness of the flow gives an ambient isotopy with ; its support in makes the identity near , so it preserves and fixes the endpoint collars, bottom basepoint, and side connector. This is the relative based isotopy-extension argument for string links.
Under [A1], an ambient isotopy of closed links induces the peripheral correspondence in [F3]. Applying that correspondence to the based word-lift data gives the transported based residue candidate. The first assertion of [F2] proves independence of every meridian basing and finite longitude-word lift, with exactly equal lower-coefficient ideals. Applying it to the transported word data proves that the two closed-link residues agree in the same residue group.
In the string-link case, take the target peripheral datum to be the transported datum required in the statement. Restricting gives a based homeomorphism of string-link exteriors that transports the selected tubes, positive meridians, parallels, and access paths. It fixes the endpoint basepoints and side connector, so the two end inclusions commute with the induced based group isomorphisms. By [F1], the longitude has a unique preimage in each finite bottom-end quotient; naturality carries that preimage to the corresponding class for the isotopic string link. The Magnus expansion is the same homomorphism on the transported meridian symbols, so every integer coefficient agrees.
Under [A1], a link-homotopy is generated by ambient isotopies and self-crossing changes. For pairwise-distinct indices, ambient isotopy is handled by step 1.2 and each self-crossing change is the second assertion of [F2]. Each move identifies the lower-coefficient ideals by [F2]; composing these finitely many equalities proves the asserted residue equality. No repeated-index conclusion is drawn.
4 · Examples, counterexamples and false statements
None yet.
Sources
- Davis and Kirk, Lecture Notes in Algebraic Topology
- Haynes Miller, MIT 18.906 Algebraic Topology II lecture notes
- John McCleary, Nontrivial fundamental groups, §8bis.2
- Kenneth S. Brown, Lectures on the Cohomology of Groups
- Ryan Stees, Milnor’s Invariants for Knots and Links in Closed Orientable 3-Manifolds
- John Milnor, Link Groups
- Stefan Friedl, Knot Theory, §5.1, The HNN-Gluing Theorem
- Allen Hatcher, Algebraic Topology
- John Milnor, On Spaces Having the Homotopy Type of a CW-Complex
- Stefan Friedl, Knot Theory, §5.3, proof of the Wirtinger Presentation Proposition
- Ryan Stees, Milnor’s Invariants for Knots and Links in Closed Orientable 3-Manifolds, §2.5
- John Milnor, Link Groups, §6