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.

The Artin Action on a Free Group

1 · Prerequisites

2 · Summary

This page constructs the Artin representation ρ:Bn→Aut⁡(Fn), proves faithfulness under AC, and characterizes its image. The closed unit disk has the canonical real-axis punctures Qn, boundary basepoint d=(0,1), straight stems, and positive counterclockwise meridians x1,…,xn. Products of automorphisms use ordinary function composition: the leftmost factor is outermost and the rightmost factor acts first.

The standard flower is a based deformation retract, with free meridian basis and vanishing higher homotopy groups. Its compact cut-disk construction also shows that the positively oriented boundary represents x1⋯xn. A based self-map inducing the identity on the fundamental group is based-homotopic to the identity. These results are choice-free. Separate arc lemmas prove plane-arc neighborhoods, relative homotopy-to-isotopy, and simultaneous stem straightening under AC; smooth relative isotopy extension uses countable choice. Cutting the full stem system includes completion at each puncture tip and carries the declared AC hypothesis.

The homeomorphism lemma used for faithfulness follows a different route: trivial action first fixes the punctures and provides compact stem homotopies. Induction fills the last puncture, uses the point-pushing kernel theorem, and detects the remaining point-motion loop by a compact tether square. It concludes that the homeomorphism is isotopic to the identity relative to the boundary and all punctures. Its proof uses AC through point pushing and finite point-motion extension; the general arc-isotopy and simultaneous straightening lemmas are not prerequisites of this argument.

The frozen algebraic substitutions are xi↦xixi+1xi−1 and xi+1↦xi, fixing the other letters. They satisfy the braid relations, so von Dyck's theorem gives ρ. The supported positive anticlockwise half rotation realizes these substitutions on the meridian basis; they are inverse to Artin's original letter convention. The geometric identification, the homeomorphism lemma, and completeness of the Artin presentation give faithfulness under AC.

Every braid automorphism permutes the conjugacy classes of the positive basis generators and fixes the ordered boundary product. Conversely, Artin's choice-free cancellation induction produces a braid word for every automorphism with these two properties. At a qualifying adjacent junction, one middle letter is cancelled; postcomposition by the appropriate Artin generator or its inverse strictly decreases the total conjugator length. Together with faithfulness this identifies the image and gives uniqueness of the representing braid. Comparing reduced basis images then solves the braid word problem. The companion page computes the B3 action and the full twist xi↦δxiδ−1, where δ=x1⋯xn, and shows that endpoint permutation is incomplete and peripheral preservation alone does not suffice.

3 · Logical flowchart

4 · Definitions, theorems and proofs

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-6.1-sol)Open item page →

Standard meridians of a punctured disk

Definition

Let n∈N, let D2={z∈C:∣z∣≤1} and Qn=(q1,…,qn) be the closed unit disk and the base configuration of Boundary-fixed mapping class group of a punctured disk, so that q1<⋯<qn are distinct points of the real axis of int⁡D2. Fix the boundary basepoint d:=(0,1)∈∂D2. For 1≤i≤n let si ⁣:[0,1]→D2 be the straight stem si(t):=(1−t) d+t qi, the straight segment from d to qi, and choose a round circle Ci in D2∖Qn centred at qi, of radius 0<εi<d(qi,∂D2) so small that the closed disks Bi bounded by the circles are pairwise disjoint, that each circle meets only its own stem, and that it meets si exactly once, at pi:=si(1−εi/Li) where Li:=∣d−qi∣, and meets no other stem sj with j≠i. Write ci ⁣:[0,1]→D2∖Qn for Ci traversed once positively (counterclockwise), from pi back to pi. The standard meridian loops are the loops based at d xi:=si ci si−1,1≤i≤n, read as si from d to pi, then ci, then si from pi back to d (Based loops and the fundamental group). Further, ∂ denotes the positively oriented boundary loop ∂(t):=d e2πit,t∈[0,1], of D2 based at d: it traverses ∂D2 once counterclockwise, starting and ending at d.

Existence and independence of the choices. The straight segments si leave d in pairwise distinct directions (the points q1,…,qn are distinct and lie strictly below d) and meet one another only at d; the segments si meet the real axis only at their endpoints qi. An explicit choice-free family is given by εi=14min⁡({1−∣qi∣}∪{∣qi−qj∣,∣qi−qj∣1+qj2:j≠i}). The finite set inside the minimum is nonempty and contains only positive numbers. The distance from qi to the line through d,qj is ∣qi−qj∣/1+qj2, so Bi misses every other stem. Also εi+εj≤∣qi−qj∣/2<∣qi−qj∣, proving disjointness of the closed disks, and εi<1−∣qi∣ keeps each disk inside D2. The radius is less than ∣d−qi∣, giving exactly the displayed contact with its own stem. For n=1 the minimum has only its boundary-margin entry; for n=0 the family is empty. Any family satisfying these conditions may be fixed; this formula witnesses its existence without any choice axiom.

The class [xi]∈π1(D2∖Qn,d) is independent of all admissible radii, including the old broader convention requiring only avoidance of the other stems. Such a circle encloses no qj with j≠i: otherwise the other stem from d, which lies outside the circle, to qj would cross it (or have qj on it). Thus the larger disk of any two admissible concentric circles still contains no other puncture. Interpolate their radii and their tether contact points radially; this is a based lasso homotopy in D2∖Qn (Homotopies of continuous maps, homotopies relative to a subspace, and path homotopies relative to the endpoints). It does not require the intermediate circle to be disjoint from the other circles, so the class argument does not circularly assume the newly explicit representative convention. Fix once and for all one such family of circles; every statement on this page uses that fixed family.

Frozen conventions of the page. The stems and the basepoint transport are fixed once and for all by the choices above; the stems are indexed so that the positively oriented boundary loop ∂, as seen from d, meets the directions of the stems in the order s1,s2,…,sn. Products of braid automorphisms use ordinary function composition: the leftmost factor is the outermost map, so the rightmost factor acts first. No relation of the braid presentation and no choice principle is used in this definition.

Remarks

  • The index convention is a property of the labelling of the punctures: the directions of the stems from d occur in the same cyclic order as the punctures on the real axis, so that tracing the counterclockwise boundary from d meets the angular positions of s1,…,sn in increasing index order.
  • The loops x1,…,xn are the loops denoted x1,…,xn in Figure 3 of Boundary-fixed mapping class group of a punctured disk's source (Gonzalez-Meneses, section 1.6) and correspond to Artin's generators t1,…,tn of the free group of the punctured disk.
LemmaStatement: Literature-sourcedProof: AI-adaptedOpen item page →

The standard flower is a deformation retract with free meridian basis

Statement

For each standard meridian let ti be its truncated tether from d to pi∈Ci, namely the restriction of si to [0,1−εi/∣d−qi∣]. The standard flower is the finite graph W={d}∪⋃i=1n(ti∪Ci)⊆D2∖Qn. Then W is a deformation retract of D2∖Qn, fixing d; π1(W,d) is free with basis [x1],…,[xn]; and πj(W,d)=0 for all j≥2. The tethers are edges of a tree, not parts of embedded circle summands through d.

Facts & Assumptions

Given: the disk, punctures, circles and truncated tethers above, as in Standard meridians of a punctured disk. Let Bi be the closed disk bounded by Ci, S=D2∖⋃iint⁡Bi, and T=⋃iti. The graph T is a finite tree with root d.

[F1]

Collapsing a CW subcomplex with a contraction fixing its contraction point is a based homotopy equivalence (CW quotients and collapse of a contractible subcomplex).

[F4]

Maps of simply connected spheres lift to a based covering space; Lifting criterion for maps from path-connected locally path-connected spaces applies to the spheres of Sn is simply connected for every n≥2.

[F5]

Finite polygonal arcs have disk-and-band neighborhoods; simple polygonal regions are disks, and prescribed PL boundary homeomorphisms extend by finite triangulations (Finite polygonal disk parametrizations and boundary surgery). Its constructions use only finite choices and ordered-field coordinates.

Proof

1.1givenconstruct

Removing the noncompact puncture neighborhoods. In Bi∖{qi} write z=qi+reiθ, 0<r≤εi, and send it at time u to qi+((1−u)r+uεi)eiθ. Keep the complement of the disk interiors fixed. This formula is continuous on X=D2∖Qn (no extension to qi is asserted), fixes Ci, and ends in S. The finitely many formulas agree on their boundary circles, so they give a strong deformation retraction X→S fixing the truncated flower W.

1.2givenF5construct

Cutting the compact holed disk. Open S along the ti, separating the sectors at d. The resulting compact surface K is a disk: thicken the straight tethers into thin rectangular strips from the outer boundary to their respective circular holes; the remaining planar region has a single Jordan polygonal boundary with circular detours. First flatten the outer circle near d while fixing every tether. For small ∣x∣ write its top as yb(x)=1−x2 and put w(x)=∣x∣/2. At a point of the tether to qi≠0 one has x=tqi, y=1−t=1−∣x∣/∣qi∣≤1−∣x∣, since ∣qi∣<1; a tether with qi=0 lies on x=0. For sufficiently small nonzero ∣x∣, 1−yb(x)<∣x∣/2, so yb(x)−w(x)>1−∣x∣ and the collar yb(x)−w(x)<y<yb(x)+w(x) misses every tether. On each vertical fiber map yb(x) to yb(x)+χ(x)(1−yb(x)), fixing its two collar endpoints and interpolating linearly on the two pieces; take χ=1 near zero and χ=0 outside a slightly larger small interval. Since 0≤1−yb(x)<w(x), these fiber maps are increasing. At x=0 use the identity; the displacement bound 1−yb(x)→0 proves continuity of both maps and inverses there. The outer boundary becomes flat near d and all tethers stay fixed. Away from that flat segment the outer boundary is at positive distance from the flower, so finitely many ordinary boundary collar charts replace its remaining circular pieces by close polygonal chords, fixing the flower. Next straighten each inner circular boundary portion by an explicit radial collar map: choose a sufficiently fine inscribed polygon with the tether contact as one vertex, let R(θ)>0 be its radial boundary function, and on the outer annular collar interpolate monotonically from radius R(θ) at the old circle radius to the unchanged outer collar radius. Choose the polygon fine enough that the interpolation stays strictly increasing. On the tether direction R equals the original circle radius, so the tether is fixed. All boundaries are now finite polygons and the tethers remain straight. Open their narrow vertex disks and edge strips using [F5]; the boundary trace is a single simple polygon, and [F5] supplies its disk parametrization by finite diagonal splitting. No general Jordan–Schönflies extension or arbitrary plane-arc theorem is used for this fixed circular/straight geometry. This supplies a disk coordinate compatible with the side collars, so opening the zero-width tethers has the same disk topology. Its boundary is the union of the single outer arc A and its complementary closed arc P. The arc P consists, in order, of all the tether shores and all the circles opened at their tether endpoints. For n≥1, A and P meet just at their two endpoints, and all paired shores lie in P. The quotient κ:K→S identifies matching tether shores and the sector copies of d, and its image of P is precisely W.

2.1F5step 1.1step 1.2construct

The quotient-compatible retraction. In the disk coordinate of step 1.2 take (K,P) to ([0,1]2,[0,1]×{0}), using the prescribed PL boundary extension of [F5], and returning through the explicit collar coordinates of step 1.2. The homotopy (x,y)↦(x,(1−u)y) strongly retracts the square onto its bottom edge. Transport it to K, where it fixes P pointwise. For paired points z,z′ one has κ(Ru(z))=κ(z)=κ(z′)=κ(Ru(z′)), since both lie in P. Thus (z,u)↦κ(Ru(z)) descends through κ×id⁡I. This is a quotient map because K×I is compact and S×I is Hausdorff. The descended continuous homotopy strongly retracts S onto W. Composing with step 1.1 proves the deformation-retract clause. When n=0, take W={d} and use the straight-line contraction of D2 to d.

3.1F1F2step 2.1

The meridian basis. Contract the finite tether tree T to d along its edges, fixing d. By [F1], the collapse c:W→W/T is a based homotopy equivalence. The quotient graph W/T is a wedge of the n circles Ci, and c∘xi traverses its i-th circle once positively. Hence [F2] gives a free basis [xi] of π1(W,d) and an isomorphism to π1(X,d). The flower itself is a lollipop graph, rather than homeomorphic to the wedge.

4.1F2F3F4step 3.1construct∎

Higher homotopy. The universal cover of the wedge graph has vertices the reduced words and an edge from w to wxi for every i. Local stars map homeomorphically to the star of its wedge vertex, so this is a covering; uniqueness of reduced words [F3] implies the cover is a tree. Give each edge length one and contract along the unique geodesic to the root, sending distance r to (1−u)r. The locally finite graph metric gives the graph topology, and this contraction is continuous and fixes the root. For j≥2, [F4] lifts any based sphere map to this contractible tree, where it contracts; projecting makes the original map nullhomotopic. Thus the wedge has vanishing higher homotopy, and [F2] with the based equivalence of step 3.1 gives the same for W. All coordinate selections and triangulations concern finitely many supplied straight segments and circles; no choice axiom is used.

TheoremStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-6.1-sol)Open item page →

The punctured-disk fundamental group is free on the standard meridians

Statement

Let Fn=⟨x1,…,xn⟩ be the free group of Free group on a set of generators on n letters. The assignment xi↦[xi] extends to a group isomorphism Fn→π1(D2∖Qn,d); equivalently, the classes [x1],…,[xn] of the standard meridians of Standard meridians of a punctured disk form a free basis of π1(D2∖Qn,d).

Facts & Assumptions

Given: n∈N, the punctured disk X=D2∖Qn, the basepoint d, the standard meridians xi and the flower W of Standard meridians of a punctured disk.

[F1]

W is a deformation retract of X with retraction fixing d, and π1(W,d) is free with basis [x1],…,[xn] (The standard flower is a deformation retract with free meridian basis).

[F2]

A deformation retraction onto a subspace A containing the basepoint induces, through inclusion and retraction, mutually inverse isomorphisms between π1(A,a) and π1(X,a) (A retract induces an injection on fundamental groups, and a deformation retract induces an isomorphism).

[F3]

The free group Fn on the set {x1,…,xn} has the universal property: for every group G and every function u:{x1,…,xn}→G there is a unique homomorphism u^:Fn→G with u^(xi)=u(xi); reduced words form such a free group (Free group on a set of generators, Reduced words form the free group on an alphabet). Free groups on the same set are uniquely isomorphic over the set (Free groups on the same set are uniquely isomorphic compatibly with their generators).

Proof

technique · direct
1.1F1F2F3

The universal-property map. Let u:{x1,…,xn}→π1(X,d), u(xi):=[xi]. By [F3] there is a unique homomorphism u^:Fn→π1(X,d) with u^(xi)=[xi]. The inclusion i:W↪X and the retraction ρ:X→W of [F1] are based at d, and by [F2] the induced maps i∗:π1(W,d)→π1(X,d) and ρ∗ are mutually inverse isomorphisms.

1.2F1F3

The basis map. By [F1], π1(W,d) is free on the classes [x1],…,[xn], so the assignment xi↦[xi]∈π1(W,d) extends by [F3] to an isomorphism ϕ:Fn→π1(W,d): it is the unique homomorphism with ϕ(xi)=[xi], and the universal property applied to the inverses shows it is bijective (equivalently, Fn and π1(W,d) are free on the same set, so [F3]'s uniqueness clause gives the isomorphism).

1.3F2F3

The case n=0. For n=0 the configuration is empty, D2∖Q0=D2 is contractible (the straight-line homotopy to the origin), the empty basis is a basis of the trivial group, and the unique map from the trivial free group is an isomorphism; the argument above also covers this case with empty index sets.

2.1step 1.1step 1.2F2F3

Comparison. The composite i∗∘ϕ:Fn→π1(X,d) is a homomorphism with xi↦i∗[xi]=[xi], since i is the inclusion of the subspace containing the loops xi. By the uniqueness clause of [F3] applied to u, i∗∘ϕ=u^. Since i∗ and ϕ are bijections, u^ is a group isomorphism.

3.1step 2.1step 1.3∎

Conclusion. Steps 1.1, 1.2 and 2.1 exhibit the isomorphism u^:Fn→π1(D2∖Qn,d) with xi↦[xi], and step 1.3 covers the empty case; hence [x1],…,[xn] is a free basis of π1(D2∖Qn,d).

Remarks

  • The identification is the one fixed on the whole page: the letters x1,…,xn of Fn are from now on identified with the classes of the standard meridian loops, and every braid automorphism is computed on this basis.
  • Asphericity is a separate clause of the flower lemma. The free-basis theorem uses the based deformation retraction and the finite tether-tree collapse; the boundary-product and action calculations use compact cut-disk geometry.
LemmaStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-6.1-sol)Open item page →

The standard stem system cuts the punctured disk open to a disk

Statement

Assume AC. Cutting D2∖Qn open along the standard stem system s1,…,sn of Standard meridians of a punctured disk, with each puncture end completed by its slit-tip point, yields a compact connected surface H homeomorphic to the closed disk D2. Each slit has two boundary sides meeting at its puncture tip; the outer boundary is opened at d into boundary arcs. A homeomorphism of D2 fixing ∂D2, Qn, and all the stems pointwise lifts to a homeomorphism of H fixing ∂H pointwise, and conversely such a homeomorphism of H reglues to a homeomorphism of D2.

Facts & Assumptions

Given: AC, the disk and the finite standard stem system of Standard meridians of a punctured disk. Cutting includes the indicated end completion; the uncompleted cut of the punctured surface is obtained by deleting the puncture tips from H.

[F1]

A Jordan curve bounds a closed disk, with a prescribed boundary parametrization extending to a disk homeomorphism, under the stated AC (Jordan–Schönflies extension for plane curves, The Axiom of Choice).

Proof

1.1givenconstruct

A concrete model of a slit tip. Choose pairwise disjoint small round disks Bi about the punctures, meeting only their own stems. In polar coordinates about qi, put the stem radius at angle 0. The cut of Bi∖{qi} is (0,Ri]×[0,2π], not a compact annulus or disk. Adjoin its missing tip by forming Ei=([0,Ri]×[0,2π])/({0}×[0,2π]): the whole zero-radius edge is collapsed to one point. This is a closed disk (a rectangle with one edge collapsed, equivalently a triangle), whose boundary is the outer circular arc and the two radial sides joined at the tip. The map (r,θ)↦qi+reiθ extends continuously to the tip and, on identifying the two radial sides, gives the filled disk Bi. Deleting the tip before regluing gives Bi∖{qi}.

2.1F1step 1.1construct

The outer piece. Put Ω=D2∖⋃iint⁡Bi. Open it along the truncated stems from d to Ci=∂Bi, separating all sectors at their common endpoint d. To see that the result is a disk, first thicken each truncated stem to a narrow strip, with strips disjoint away from a small half-disk at d. The region left between these strips and the Bi has one polygonal Jordan boundary: tracing it visits the outer boundary once and makes one detour along both sides of each strip and around its associated hole. It is a closed disk by [F1]. Shrinking the strip widths gives the same cut topology, since each strip-side collar has a rectangular coordinate chart and changing its width is a homeomorphism. Each opened Ci is a closed boundary arc Ai; at d there are n+1 sector copies when n>0, rather than just two copies for the whole star. For n=0 the outer piece is D2.

3.1step 1.1step 2.1construct

Attaching the completed tips. Glue the circular boundary arc of Ei to Ai with matching radial-side endpoints. Gluing two disks along a proper closed boundary arc gives a disk: map the two disks to the upper and lower half-disks, with the glued arcs as their common diameter, and use these maps on the quotient. Applying this construction finitely many times to the outer disk and the Ei yields a compact disk H. Its boundary consists of the outer boundary arc and the two sides of every stem, with each pair joined at qi and with consecutive sides joined at the appropriate sector copy of d.

4.1step 3.1construct

The quotient and its topology. Identify matching points on each pair of stem sides, including the copies of d. The quotient map π:H→D2 is the ordinary coordinate map off the cuts and the polar map of step 1.1 at a tip. It is a continuous surjection whose fibers are exactly these prescribed identifications; compactness of H and the Hausdorff property of D2 show that its quotient is the filled disk D2. Removing the images qi of the added tips recovers X=D2∖Qn. Thus the compact disk assertion concerns the completed cut, with both filled and punctured quotients accounted for.

5.1givenstep 1.1step 4.1

Lifting maps. A homeomorphism f as in the statement preserves each local side of every stem: an orientation-reversing map would reverse the outer boundary, which f fixes pointwise, and an orientation-preserving map fixing an oriented stem cannot interchange its sides. Thus it lifts on the open cut surface, fixing both stem-side copies and all sector copies of d. Near a tip, continuity of f at qi implies that points with radius tending to zero have image radius tending to zero, uniformly in their angle; the collapsed-edge model therefore extends the lift continuously by fixing the tip. The same argument applies to f−1, so the lift is a boundary-fixed homeomorphism of H.

6.1step 4.1step 5.1construct∎

Regluing maps and isotopies. A boundary-fixed homeomorphism g of H respects every fiber of π and induces a homeomorphism of the filled disk, with inverse induced by g−1. It fixes the outer boundary, stems and punctures pointwise. If G:H×I→H is a boundary-fixed isotopy, the map (z,t)↦π(G(z,t)) is constant on the fibers of π×id⁡I; this map is a quotient map because its domain is compact and its target is Hausdorff. It therefore induces a continuous isotopy D2×I→D2, including at every puncture uniformly in time. This proves the asserted correspondence and the isotopy version needed by consumers.

LemmaStatement: Literature-sourcedProof: AI-adaptedOpen item page →

The oriented boundary loop represents the ordered product of the standard meridians

Statement

With the conventions of Standard meridians of a punctured disk, the positively oriented boundary loop ∂ represents the ordered product [∂]=[x1][x2]⋯[xn] in π1(D2∖Qn,d).

Facts & Assumptions

Given: the boundary loop and standard meridians of Standard meridians of a punctured disk.

[F1]

The standard flower W consists of the truncated tethers ti and the circles Ci; its tethers form a tree rooted at d (The standard flower is a deformation retract with free meridian basis).

[F3]

Simple polygonal regions are disks; polygonal vertex disks and edge strips give compatible side coordinates, and prescribed PL boundary homeomorphisms extend over polygonal disks (Finite polygonal disk parametrizations and boundary surgery).

Proof

1.1givenF1F3construct

Constructing the cut disk. Suppose n≥1 and put S=D2∖⋃iint⁡Bi. We establish the needed cut geometry directly. Near d, the top outer boundary is yb(x)=1−x2, whereas every nonvertical tether has y=1−∣x∣/∣qi∣≤1−∣x∣. Use the collar between yb(x)±∣x∣/2, which misses the tethers for small nonzero ∣x∣ because 1−yb(x)<∣x∣/2. On each vertical fiber send yb(x) to yb(x)+χ(x)(1−yb(x)), where χ=1 near zero and vanishes outside a small interval; fix the collar endpoints and interpolate linearly. The target lies strictly between those endpoints, so each fiber map is increasing. Extend by the identity outside the collar and on x=0; the displacement tends to zero there, proving continuity of the map and its inverse, including on the vertical tether if present. This flattens the outer boundary near d and fixes all tethers. Away from this segment the outer boundary has positive distance from them, so finite circle collar charts replace it by polygonal chords. For each inner circle choose a fine inscribed polygon with pi as a vertex. If Ri(θ) is its radial boundary function, map radius εi to Ri(θ) and a slightly larger collar radius to itself by increasing linear interpolation. The collars can be disjoint and miss other tethers; on its own tether direction Ri=εi, so that tether stays fixed. Thus all boundaries become polygons while the tethers stay straight. Open each tether using the vertex-sector and edge-strip coordinates of [F3], separating the sectors at d. The boundary trace follows the outer boundary once and makes one detour down and back along each slit and around its hole. This is a single simple polygon after the shores have been separated: distinct tethers have disjoint interiors, distinct holes are disjoint and meet only their own tether, and the finitely many sectors at d are distinct. By [F3] its enclosed region is a disk. The side and sector coordinates identify this region with the zero-width cut surface K, giving K disk topology. Its boundary splits into the outer arc A and the complementary arc P; P contains all tether shores and all opened inner circles. Regluing the paired shores and sector copies of d gives a continuous quotient κ:K→S, with κ(P)=W.

2.1F2F3step 1.1construct

The two boundary paths of the cut disk. Orient A by the positive outer boundary traversal, from its initial sector copy of d to its terminal sector copy. Orient the complementary arc P in the same initial-to-terminal direction, opposite to its direction as a piece of the oriented boundary of K. In a convex disk coordinate for K, linear interpolation between these paths gives a homotopy relative to their endpoints. Composing with κ and the inclusion S↪X gives a based homotopy between ∂ and the image of P.

3.1givenF1F2step 1.1step 2.1construct

Tracing P after regluing. With this direction, P runs out along the first tether, counterclockwise around its circle, back along its other shore, and repeats for each tether in order. The sign follows from boundary orientation: inner circles of the oriented holed disk are clockwise, whereas P traverses them opposite to that boundary direction. Its order is 1,…,n: from d=(0,1) the positive outer boundary starts toward the left, and the distinct downward tether rays to q1<⋯<qn occur from left to right. After quotienting the paired shores, these successive paths are exactly ticiti−1=xi. Hence the image of P is the concatenation x1⋯xn, up to harmless parametrization and constant intervals.

4.1F2step 1.1step 2.1step 3.1∎

Conclusion. The based homotopy of step 2.1 and the traversal of step 3.1 imply the asserted identity by [F2]. For n=0 the straight-line homotopy from ∂(t) to d contracts the boundary relative to its basepoint, giving the empty product; for n=1 the same cut-disk argument is the positive outer/inner circle homotopy in the annulus. All collar charts, polygonal subdivisions and strips are finite, so no choice principle is used.

LemmaStatement: Literature-sourcedProof: AI-adaptedOpen item page →

A based self-map of the punctured disk inducing the identity on the fundamental group is based-homotopic to the identity

Statement

Let f:D2∖Qn→D2∖Qn be continuous with f(d)=d and f∗=id⁡ on π1(D2∖Qn,d). Then f is homotopic to the identity relative to d. No choice principle is used.

Facts & Assumptions

Given: the based map f and X=D2∖Qn.

[F1]

The truncated flower W is a based deformation retract of X; collapsing its tether tree to d is a based homotopy equivalence c:W→R, where R is a wedge of n circles (The standard flower is a deformation retract with free meridian basis, CW quotients and collapse of a contractible subcomplex, The wedge of a family of pointed spaces).

[F2]

Proof

1.1F1F2given

Passing to an actual wedge. Combine the deformation retraction with the collapse equivalence of [F1]. They give based maps a:X→R, b:R→X with ba≃id⁡X and ab≃id⁡R relative to their basepoints. For g=afb:R→R, [F2] and f∗=id⁡ imply g∗=a∗f∗b∗=a∗b∗=id⁡.

2.1F3step 1.1construct

Homotoping the wedge map. Restrict g to each actual circle summand of R. Its based-loop class equals that summand's standard generator because g∗=id⁡. By [F3], it has a based homotopy to that summand's inclusion. The finitely many homotopies agree at the wedge vertex at every time and hence glue continuously on the finite quotient R×I. They give g≃id⁡R relative to the vertex.

3.1F1F2F3step 2.1∎

Returning to the punctured disk. Compose the based homotopies to obtain f≃bafba=bga≃ba≃id⁡X, all relative to d. For n=0 the wedge is a point and the same argument is the based contraction of the disk. This is a homotopy of maps on X; it claims no extension to any puncture. Only finitely many based-loop homotopies and the specified finite graph equivalences occur, so no choice principle is used.

LemmaStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-6.1-sol)Open item page →

Plane arc extension and rectangular neighborhoods

Statement

Assume AC. If a:[0,1]↪R2 is an embedding, there is a plane homeomorphism G with G(a(t))=(t,0) for every t∈[0,1]. Consequently the arc has a rectangular neighborhood along its interior and half-rectangle sector neighborhoods at its endpoints, obtained by transporting those neighborhoods of the straight interval.

Facts & Assumptions

Given: AC and the embedded arc a, with distinct endpoints A=a(0) and B=a(1).

[F1]

Under AC, any prescribed homeomorphism between Jordan curves extends across their disk regions and to the plane (Jordan–Schönflies extension for plane curves, The Axiom of Choice). The spherical version follows by stereographic coordinates with poles off the curves; a plane homeomorphism extends at infinity because its inverse takes compact sets to compact sets.

[F2]

Singular homology is homotopy invariant, has natural exact pair sequences, and satisfies CW excision (Singular homology satisfies homotopy exactness and excision). The integral top homology of S1 and S2 is Z, by Homology of spheres.

Proof

1.1givenconstruct

The normalized arc and its double lift. Identify the plane with C and its compactification with the sphere. The Möbius homeomorphism M(z)=(z−A)/(z−B) takes the endpoints to 0,∞. Its value at the original plane-infinity is 1, which is not on the normalized arc b=M∘a. For 0<t<1, b(t) lies in C∗. Lift its argument continuously on that interval and set c(t)=∣b(t)∣1/2exp⁡(iarg⁡(b(t))/2). Such an argument is obtained by continuing the elementary local argument on successive compact subintervals. Then c(t)2=b(t), and c is injective since b is. Extend c at the endpoints by c(0)=0,c(1)=∞: convergence of its modulus proves continuity even if its angle has no endpoint limit. The two arcs c and −c have disjoint interiors; equality c(t)=−c(u) would give b(t)=b(u), hence t=u and c(t)=0, impossible in the interior. Their union J is a Jordan curve on the sphere. The involution τ(z)=−z fixes 0,∞ and exchanges these two arcs.

2.1F1F2step 1.1

Why the involution exchanges the complementary disks. By [F1], the two closed complementary regions of J are disks. Parametrize J by c(t) on one semicircle and −c(t) on the other, with equal t at reflected circle parameters. Its restriction τ∣J is therefore circle reflection and acts as −1 on H1(J;Z) (reverse the oriented circle cycle). In contrast τ is a sphere rotation homotopic to the identity through z↦eiπuz, so its action on H2(S2;Z) is +1. If it preserved one complementary disk U, it would preserve the other disk V. Give the sphere its two-disk CW structure using [F1]. The pair sequence gives an isomorphism H2(S2)→H2(S2,V‾) since V‾ is contractible. CW excision identifies this relative group with H2(U‾,J), and its boundary map to H1(J) is an isomorphism since U‾ is a disk. Naturality [F2] would then force the action of τ on H1(J) to be +1, a contradiction. Hence τ exchanges the two complementary disks.

3.1F1step 1.1step 2.1construct

An equivariant relative extension. Set r(t)=t/(1−t), with r(0)=0,r(1)=∞, and prescribe f(c(t))=r(t) and f(−c(t))=−r(t). This is a homeomorphism J→R∪{∞} commuting with τ. Choose one source disk U and extend f from its boundary to the closed upper hemisphere by [F1]: take the stereographic pole in the other source disk and a target pole in the lower hemisphere, so both relevant regions are bounded Jordan disks in their plane charts. Call this extension F+. On the other source disk define F−=τ∘F+∘τ. Step 2.1 ensures this definition has the right domain and maps it to the lower hemisphere. On J it agrees with F+ because fτ=τf. Pasting the two maps and their inverses gives a sphere homeomorphism F commuting with τ and fixing 0,∞.

4.1F3step 1.1step 3.1construct

Descending and restoring the plane point. The quotient of the sphere by τ is the sphere through the map p(z)=z2, with p(∞)=∞. Its fibers are exactly {z,−z}, and compactness makes p a quotient map. Therefore F and F−1 descend to inverse sphere homeomorphisms g with g(b(t))=r(t)2. The point v=g(1) lies outside the positive real ray [0,∞], because 1∉b([0,1]). Move v to −1 by a homeomorphism L fixing that ray pointwise. Here is an explicit existence construction: the ray complement is the slit plane with polar angle in (0,2π). Rotate the polar angle of v within this interval to π, then change its radius along the negative real axis to reach −1. Approximate this compact path by a finite polygonal path inside the open slit plane. Choose δ>0 less than one third of the distance from this compact polygonal path to the closed positive ray. Subdivide its finitely many segments so each displacement w has length below δ/4. At the current path vertex x0, use η(x)=max⁡(0,1−∥x−x0∥/δ) and the map x↦x+wη(x). It moves x0 to the next vertex, is supported in the closed δ-ball about x0, and ∥w∥Lip⁡(η)<1/4. The finitely many supports form a compact subset of the ray complement. They are injective by this bound and surjective by [F3] applied to the contraction equation x=y−wη(x), Their inverses are Lipschitz with constant at most 1/(1−∥w∥Lip⁡(η)), by the same lower distance bound. Thus finite small translations move the point along the path and fix its complement. This constructs L supported away from the ray. Define the Möbius homeomorphism T(z)=z/(1+z), with T(−1)=∞ and T(∞)=1. Now TLgM fixes the original sphere-infinity, since its successive images are 1,v,−1,∞, hence restricts to a plane homeomorphism, and takes a(t) to r(t)2/(1+r(t)2).

5.1F1step 4.1construct∎

The prescribed parameter and neighborhoods. The increasing homeomorphism λ(t)=r(t)2/(1+r(t)2) of [0,1] has fixed endpoints. Extend λ−1 to an increasing homeomorphism Λ of R equal to the identity outside [0,1]. Postcompose step 4.1 with (x,y)↦(Λ(x),y) to obtain G(a(t))=(t,0). Transport straight rectangular and endpoint-sector neighborhoods by G−1. This proves the conclusion, with AC used precisely in the relative Jordan–Schönflies extensions of steps 2.1 and 3.1. No collar was inferred merely from connectivity of an arc complement.

LemmaStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-6.1-sol)Open item page →

Homotopic simple proper arcs in the punctured disk are isotopic relative to their endpoints

Statement

Assume AC. Let α,β be simple proper arcs in the punctured disk with the same endpoints, each on ∂D2 or at a puncture, homotopic relative to endpoints through proper arcs. Then they are isotopic relative to endpoints as unoriented arc images. For distinct ordered endpoints their given parametrizations can also be joined by an isotopy of parametrized arcs. Here an arc with a puncture endpoint is understood via its continuous extension to [0,1] in the filled disk; the homotopy is continuous on [0,1]×I there, its endpoints are fixed, and its interior avoids Qn∪∂D2. Restricting away from a puncture endpoint gives the proper arc in D2∖Qn.

Facts & Assumptions

Given: AC and two simple arcs and a relative-endpoint homotopy with the compact extension specified in the statement. The intermediate proper arcs in this homotopy need not be simple.

[F1]

Relative homotopy is the relation of Homotopies of continuous maps, homotopies relative to a subspace, and path homotopies relative to the endpoints. Marked points and boundary endpoints have the conventions of Standard meridians of a punctured disk.

[F2]

Under AC, every compact embedded plane arc has a prescribed straightening homeomorphism and hence rectangular and endpoint-sector neighborhoods (Plane arc extension and rectangular neighborhoods, The Axiom of Choice).

[F3]

Under AC, prescribed Jordan boundary maps extend over the disk regions (Jordan–Schönflies extension for plane curves).

[F4]

Every continuous disk self-map has a fixed point (Brouwer fixed point theorem).

[F5]

Boundary-fixed disk homeomorphisms admit the Alexander isotopy (Alexander contraction of the boundary-fixed disk homeomorphism group). The compact holed disk admits the explicit finite tether cut and free meridian graph of The standard flower is a deformation retract with free meridian basis.

[F6]

A plane embedded interval has polygonally connected complement (Arc complements and accessible Jordan boundary points). A finite 2-connected graph has a rooted ear decomposition from a prescribed cycle (Finite plane graph ear and face facts).

[F7]

Under AC, smooth collision-free finite point motions extend to boundary-fixed smooth disk isotopies (Smooth finite point motions extend to disk isotopies). Every boundary-fixed punctured-disk mapping class has a diffeomorphism representative (Braid group as boundary-fixed punctured-disk mapping classes, statement part 3). This supplier is proved by evaluation and finite point motions, independently of general arc isotopy.

Proof

1.1F2F3F6construct

A relative graph containing each arc. We first treat one supplied arc a. If its endpoints are distinct, extend each interior marked endpoint to a distinct point of the outer circle by an auxiliary arc, disjoint from a and all other marked points. The access at an interior endpoint comes from [F2]'s rectangular neighborhood: leave that endpoint in an unused sector inside a small disk missing all other marked points. The required complement inside the disk is connected. Indeed [F6] connects points in the plane minus the compact arc; replace the finitely many excursions of a polygonal path outside the round disk by outer-boundary paths avoiding its possible boundary endpoint, then push those compact paths slightly inward. Their distance from the original arc is positive. Remove other marked points by small finite detours. Joining the endpoint-access germs by a polygonal path and retaining the portion between its last contact with the initial germ and first subsequent contact with the terminal germ gives a simple auxiliary arc; loop erasure handles the polygonal portion. After the first auxiliary arc, the union is again an embedded interval with only one boundary endpoint, so the same argument supplies the second. The resulting crosscut together with the outer circle is a finite 2-connected plane graph. For coincident endpoints, the arc image is a Jordan loop. If the loop lies in the interior, add two disjoint bridges to distinct outer-boundary points, with distinct loop contacts; if it meets the outer boundary at its common endpoint, add one bridge with different contacts. Access at a loop contact comes from [F3]'s circle coordinates. To justify the second bridge, straighten the inner Jordan loop by [F3]; after the first bridge its complement in the disk is connected by the interval argument above. Polygonal paths there can be moved outside the straightened inner circle by detours along that circle with its bridge contact omitted. Those compact circle arcs have positive distance from the bridge and outer boundary. The same detour argument proves connectivity of the region between a loop touching the outer circle and that circle, omitting their one contact. Thus the bridges exist in the required complementary region. Subdivide the cycles and paths to remove loop edges and parallel edges. In each case deleting any vertex leaves the graph connected, so it is 2-connected.

2.1F3F6F7step 1.1construct

A marked-set-relative smooth representative. Reproduce the rooted ear decomposition of this graph from the outer circle in a target disk, using polygonal ears. At each stage an ear lies in one source Jordan face; its union with either boundary path gives two Jordan curves, so [F3] splits that face into two disks. Choose a polygonal target crosscut in the corresponding target face, subdivide it at the new vertices, and repeat. This constructs the same finite planar graph with the same face incidence and cyclic orders; prescribe the identity on the outer circle and corresponding parametrizations on all edges. Place target copies of the other marked points in their corresponding faces. The finitely many target marked points can be moved to the prescribed Qn by [F7]: choose fresh intermediate buffer points, move the points one at a time along polygonal paths avoiding the stationary points, then move the buffers to their assigned targets. Round and smoothly reparametrize each finite path to be constant at the joins. Separation and the boundary margin stay positive, so [F7] applies. The resulting target graph is piecewise smooth and has the prescribed marked vertices and face labels. Extend the graph map over each Jordan face by [F3]; the extensions agree on the graph, so they paste to a boundary-fixed disk homeomorphism. In each target face correct its images of the remaining marked points by the same buffer construction, using small supported Lipschitz translations inside that face as in the plane-arc supplier's point-normalization construction. These corrections fix the entire graph. We obtain a homeomorphism h fixing every marked point and the outer boundary, and carrying a to a piecewise smooth arc e. By [F7], the class of h−1 has a diffeomorphism representative g and an isotopy from h−1 to g fixing the outer boundary and preserving Qn setwise. Each individual point track is constant because it lies in the discrete set Qn and starts at that same point. Applying this isotopy to e gives a relative-endpoint isotopy from a to the piecewise smooth arc g(e). No topological isotopy-extension theorem was assumed.

3.1F2F3step 2.1construct

Finite transverse position with fixed endpoints. Perform step 2.1 for both arcs. At an interior marked endpoint separate their finitely many tangent germs by a small rotation z↦q+eitθχ(∣z−q∣)(z−q), with cutoff supported in a small disk missing the other marks. At a boundary endpoint use a boundary-flattening coordinate (x,y) with y≥0 and the small shear (x,y)↦(x+tbyχ(x,y),y); the Lipschitz bound of the supported displacement can be made below one, as in the point-translation construction, and y=0 is fixed. Pick the rotation angle or shear coefficient outside the finitely many values aligning tangent germs. Endpoint germs enter the disk transversely in the graph construction, so these shears separate them. Each regular smooth germ is a graph over its tangent coordinate; multiplying its graph height by a cutoff interpolation straightens a smaller terminal germ without changing the endpoint or leaving its narrow interior cone. This is an isotopy of embedded arcs and extends by the corresponding small normal-coordinate displacement. Now the germs are distinct straight rays. On the compact remaining parts, finite normal strips and sufficiently fine polygonal interpolation give embedded piecewise polygonal representatives; the near-parameter injectivity follows from the graph coordinate, and far-parameter pieces have positive separation by compactness. Interpolate the graph heights in those strips, retaining the endpoint rays. A generic finite perturbation of their vertices avoids tangencies and overlapping edges. The two arcs now have finitely many transverse interior intersections and disjoint fixed endpoint germs. All changes fix the endpoints and avoid the other marked points.

4.1F1F4F5step 3.1construct

Ordinary bigons and the projection argument. The homotopy class has a representative disjoint in its interior from the fixed arc: push that arc to one side in its narrow strip, fixing its endpoints. Thus a homotopy reducing intersection to zero exists. First normalize its terminal strips. By compact-square continuity, a common strip 0<u<ε maps into a small disk about its endpoint q containing no other mark. For an interior endpoint, lift its angle continuously on the contractible rectangle (0,ε]×I, and write H(u,t)−q=R(u,t)eiΘ(u,t) with R>0. Reparametrize the initial and final straight germs so their radii are linear in u. With a cutoff η(u) equal to1 for u≤ε/2 and0 for u≥3ε/4, interpolate the radius to uR(ε,t)/ε and angle to Θ(ε,t). At t=0,1 these models already equal the straight germs, so the modification fixes both endpoint arcs; positivity avoids q and both original and model radii tend uniformly to0. In a boundary half-disk use the same interpolation with angle in (0,π), so the interior stays inside. Treat each terminal strip separately even at coincident ends. Approximate the positive radius and real lifted angle of the resulting straight-germ family by finitely piecewise linear functions of t, keeping their end values and using a generic angle perturbation. The bounded angle range then meets the fixed endpoint ray in only finitely many isolated times. On the remaining compact parameter square all images have positive distance from the forbidden marked points and boundary. Triangulating that square and making a sufficiently small generic perturbation of its finitely many vertex images, with the prescribed terminal-germ boundary data retained, makes the homotopy piecewise transverse. Thus its inverse-image intersections have a finite polygonal description, including the endpoint sectors. A returning component of the inverse image gives a nullhomotopic loop with one side in each arc. Use the cover formed by gluing copies of the compact holed cut disk along paired shores, indexed by reduced meridian words, and append the lifted puncture collars; its adjacency tree gives a simply connected cover. Compact pieces meet only finitely many cut disks and bounded collar rectangles. Enlarge this finite subtree to include every corner star met by the piece. Successive gluing along boundary intervals produces a disk neighborhood, or a half-disk neighborhood at an actual outer-boundary point; thus the compact lifted Jordan curves and their bounded regions lie in a disk exhaustion where the plane Jordan theorem applies. The families of lifted arcs are locally finite: properness bounds their parameter ranges over a compact set away from deleted ends, and finitely many covering charts then admit only finitely many lifts meeting a smaller compact neighborhood. Lift the nullhomotopic loop. Inside a compact disk neighborhood choose an innermost bigon across ALL lifts of both arcs. If another lift enters such a disk, an outermost component of its intersection with the disk, together with the appropriate existing side, cuts off a smaller bigon; repeat this reduction. Transverse position and local finiteness give finitely many intersections in that compact disk, so the reduction terminates with no other lifted arc entering its interior. Its boundary projects injectively: each side is embedded, the two corner signs are opposite, and an identification between different sides would give another transverse lifted crossing on a side. One branch of that transverse curve would enter the disk, contradicting the innermost choice. For a nonidentity deck map ϕ, its boundary and the original boundary are disjoint: if x=ϕ(y) were on both, injectivity of the boundary projection would give x=y, contradicting the fixed-point-free deck action at an actual covering point. This excludes shared sides and tangencies as well as crossings. If disk interiors overlapped, disjoint Jordan boundaries would imply ϕ(D)⊂D or ϕ−1(D)⊂D. [F4] would give a deck fixed point, again impossible. Hence the entire disk projects injectively and is a compact puncture-free ordinary bigon in the actual punctured surface.

5.1F3F4F5step 3.1step 4.1construct

Endpoint-sector bigons use a different actual surface. A returning inverse-image component ending at a fixed endpoint q bounds a parameter sector adjacent to that endpoint edge, with the opposite endpoint edge omitted. If q is a puncture, fill just q and keep every other puncture deleted; if q is a boundary point, no puncture is filled. The homotopy on this sector maps into that surface because all its nonendpoint tracks avoid every marked point, and its endpoint edge is constantly q. Lift this compact sector to the simply connected cover of that surface. The lift of q is an actual surface point, not an ideal end. Choose an innermost disk between the two lifted arc sides; either it is an ordinary bigon, or it has that lift of q as one corner. At this corner the chosen endpoint germs are distinct, and their projections hit q nowhere else. The same finite-subtree disk exhaustion and outermost-subdisk reduction across all lifts apply in this filled surface; properness is retained at every other deleted end and the filled corner has an ordinary covering chart. The boundary-injectivity and disjoint-deck-boundary argument of step 4.1 then applies, and [F4] now applies on this actual filled surface. The projected disk contains no other puncture, and contains q only at its boundary corner: injectivity of the whole disk excludes a second interior preimage of q. Thus this is a legitimate endpoint-sector disk in the filled model. No fixed-point-free assertion was made about a completed puncture tip in the original punctured cover. A half-bigon using an outer-boundary interval between two different fixed endpoints is not removed; only a sector at the single fixed endpoint is used here.

6.1F3F5step 4.1step 5.1construct

Finite ambient reductions. For an ordinary bigon, prescribe the arc push across a slightly enlarged compact disk neighborhood, fixing its outer boundary. The moving subarc is a crosscut there, so its two complementary Jordan pieces extend the prescription by [F3]. The Alexander isotopy [F5] gives the ambient disk move. At a marked endpoint corner choose a slightly enlarged disk neighborhood containing that endpoint in its interior and no other marked point. Extend the moving arc from that endpoint by an auxiliary arc to the neighborhood boundary, on a free side, as in step 1.1; this makes a crosscut. Do the same for its prescribed image after the sector push. The relative graph/face construction of step 2.1, with the endpoint vertex mapped to itself and the outer boundary mapped identically, gives the required neighborhood homeomorphism. Choose its disk coordinate centered at this fixed marked point, using [F3]’s pointed extension, and apply the Alexander formula; that center stays fixed throughout. At a boundary endpoint use a half-disk neighborhood and keep its outer-boundary edge fixed. These moves fix all other marked points and the outer boundary. Each ordinary move removes two transverse corners and each endpoint-sector move removes one interior corner. Consequently the finite number of interior intersections decreases until the arc interiors are disjoint.

7.1F3F5step 2.1step 3.1step 6.1construct∎

The last disk and parametrization. For distinct endpoints, the disjoint arcs form a Jordan curve in the filled disk. Their relative homotopy gives winding number zero about every marked point other than the endpoints, so its bounded region contains none. By [F3] take its endpoints to (−1,0),(1,0) and its two sides to the upper and lower semicircles. The arcs (x,(1−2t)1−x2) give an isotopy from one side to the other with fixed endpoints. For coincident ends, the two Jordan loops meet only at their common endpoint. Their winding numbers about the other marks agree. If their bounded disks are disjoint, both disks contain no other mark, so shrink the loops toward the common endpoint in disk coordinates by positive homotheties centered at that boundary point. The images remain simple and never collapse to a point. Match the two resulting small images inside a common endpoint neighborhood by the relative graph/face homeomorphism construction of step 2.1, and then [F5]’s Alexander isotopy: center the coordinate at an interior marked endpoint, or keep the boundary edge fixed at an outer endpoint. If they are nested, the region between them contains no mark; split the common contact into two boundary copies in the polygonal representatives. Its completed cut is a polygonal disk, and the same disk-side isotopy descends after identifying those fixed copies. These are isotopies of unoriented images. For distinct ordered endpoints, the final parametrization differs from the target by an increasing endpoint-fixing homeomorphism f of [0,1]; interpolation (1−t)f+tid⁡ corrects it through embedded parametrized arcs. Compose the finite moves with steps 2.1 and 3.1. Compact-domain continuity includes each filled puncture endpoint. AC is used precisely through the plane-arc neighborhoods, relative Jordan extensions, finite point-motion extensions and smooth representative clause. This proves the asserted general topological conclusion.

Remarks

The bigon and homotopy arguments are the arc versions of Farb–Margalit, Lemma 1.8 and Proposition 1.10, explicitly stated for arcs in section 1.2.7. Minimal position means the absence of removable bigons; it does not imply the existence of a bigon whenever intersections remain. Homotopy is used above to establish that the minimum intersection number is zero.

The unoriented convention is essential at coincident endpoints. For example, z(u)=14(1−e2πiu) and its reverse have their only occurrence of 0 at the two endpoints. Writing their positive radii as 12sin⁡(πu), interpolating their lifted polar angles through the constant angle gives a compact proper homotopy fixing 0 and avoiding it in the interior. It passes through a nonsimple out-and-back path. The two parametrizations cannot be isotopic through embedded based loops because their Jordan orientations differ; their unoriented images are the same. This is the image convention explicitly used by Farb–Margalit in section 1.2.7. All stem consumers have distinct ordered endpoints, so their parametrization conclusion uses the adjustment above.

LemmaStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-6.1-sol)Open item page →

Smooth relative isotopy extension for disk arcs with puncture endpoints

Statement

Assume the countable axiom of choice ACω (The Axiom of Countable Choice (ACω)). Let F:[0,1]×[0,1]→D2 be a smooth map such that:

  1. for every s, the map u↦F(u,s) is a smooth embedding of [0,1] with fixed endpoints p0:=F(0,0), p1:=F(1,0) that lie either on ∂D2 or in a finite set P⊆int⁡D2, with the interiors of the arcs inside int⁡D2;
  2. the isotopy is stationary on collars of its endpoints;
  3. the moving part avoids P and a closed set C⊆D2.

Then there is a smooth ambient isotopy Φ:D2×[0,1]→D2 with Φ0=id, each Φs a homeomorphism fixing ∂D2, P and C pointwise, and Φs(F(u,0))=F(u,s) for all u,s; the finite-sequence clause of the published lemma carries over verbatim.

Facts & Assumptions

Given: The countable axiom of choice, the closed unit disc D2 with its standard smooth structure, and a smooth arc isotopy F satisfying the three displayed hypotheses, with endpoints either on the boundary or in the finite marked set.

[L1]

Assume ACω: for an embedded submanifold S of a smooth manifold M and a smooth vector field Y along S there are an open neighbourhood U of S in M and a smooth field Y~ on U with Y~∣S=Y; when S is closed in M the extension may be taken on all of M (A vector field along an embedded submanifold extends to a neighbourhood and globally when the submanifold is closed).

[L2]

Assume ACω: a closed subset A of a smooth manifold M contained in an open set U admits a smooth f:M→[0,1] that equals 1 on a neighbourhood of A and has supp⁡(f)⊆U (A smooth Urysohn lemma for a closed set in an open set).

[L3]

If J is a compact interval and Xt is a smooth time-dependent vector field on M whose supports over t∈J lie in a common compact set, then there is a global evolution operator Ψt,s:M→M for all s,t∈J (Compactly supported time-dependent vector fields have global evolution on a compact time interval).

[L4]

Under ACω a time-dependent vector field on M over an interval I is a smooth map X:I×M→TM with X(t,p)∈TpM, and an evolution operator satisfies ddrΨr,s(p)=Xr(Ψr,s(p)) with Ψs,s(p)=p (Time-dependent vector fields and their evolution operators).

[L5]

For a smooth time-dependent field on an open interval and every (s,p) there is a local evolution operator near (s,p) and t↦Ψt,s(q) is the unique solution of the ordinary differential equation with its prescribed initial value (Time-dependent vector fields have local smooth evolution operators).

[L6]

An embedded submanifold S⊆M is read through slice charts φ with φ(S∩U)=φ(U)∩(Rk×{0}), and carries the subspace topology (Embedded submanifolds and slice charts).

[L7]

For every n≥0 the Euclidean space Rn is a smooth n-manifold with the identity as global chart, and open subsets carry the restricted structure (Euclidean spaces and Euclidean open subsets as smooth manifolds).

[L8]

ACω selects one element from each member of an at most countable family of nonempty sets (The Axiom of Countable Choice (ACω)).

Proof

technique · direct
1.1L1L2L4L6L7L8

Extend the track and cut off its velocity. Since F is smooth on the compact square, extend it as an R2-valued smooth map Fˉ to an open rectangle containing [0,1]2. Shrink the rectangle so that each slice u↦Fˉ(u,s) remains an embedding on a slightly larger closed interval for s in a neighborhood of [0,1]; this follows from ∂uF≠0 on the compact square and uniform separation of pairs of arc parameters away from the diagonal. Then F^(u,s):=(Fˉ(u,s),s) is an injective immersion on that open rectangle. On a smaller compact rectangle it is a continuous injection into the Hausdorff space R2×R, hence an embedding; its restriction to the interior is an embedded surface Σ without boundary. Define the smooth field along it by W(F^(u,s)):=(∂sFˉ(u,s),0). The compact set K0:=F^([δ,1−δ]×[0,1]) is disjoint from the closed set B:=(∂D2∪P∪C)×R, by hypotheses 1 and 3; the interior endpoint collars are stationary and are excluded from this compact moving core. The extension lemma [L1] gives an open neighborhood N of Σ and a smooth field W~ on N restricting to W. Choose an open U0 with compact closure contained in N∖B and containing K0. By [L2] choose a smooth ρ:R2×R→[0,1] equal to 1 near K0 and supported in U0. The field V:=ρW~ on N, extended by zero outside N, is smooth and compactly supported. Its spatial component Xs(x):=pr⁡R2V(x,s) is a smooth time-dependent field on R2 whose support over s∈[0,1] lies in a common compact subset of int⁡D2∖(P∪C).

2.1L4L5givenstep 1.1

The stationary collars are fixed. Hypothesis 2 gives ∂sF(u,s)=0 for u∈[0,δ]∪[1−δ,1] and s∈[0,1]. At each such track point W~=W=0, so Xs(F(u,s))=0. The constant curve at F(u,0) therefore solves the flow equation; uniqueness gives Ψs,0(F(u,0))=F(u,0)=F(u,s) on both endpoint collars.

2.2L2L3L4L5step 1.1

The flow fixes the required sets and preserves the disc. The support of X lies in a compact subset of int⁡D2∖(P∪C), so X vanishes on a neighborhood of ∂D2∪P∪C. Uniqueness makes each of these points stationary under the flow, and no flow line crosses the boundary; thus every flow map carries D2 onto itself and fixes ∂D2, P, and C pointwise. Each Ψs,0 is smooth with inverse Ψ0,s, hence a diffeomorphism of D2; it is the identity for s=0.

3.1L3L4L5step 1.1step 2.1

The flow realizes the moving part. Let Ψs,0 be the global evolution operator of X over [0,1], which exists since its supports lie in a common compact set. Fix u∈[δ,1−δ] and put γ(s):=F(u,s). At F^(u,s)∈K0 one has ρ=1, so the spatial component satisfies Xs(γ(s))=∂sF(u,s)=γ′(s) for every s∈[0,1]. Thus γ solves the flow equation with γ(0)=F(u,0), and uniqueness gives Ψs,0(F(u,0))=F(u,s). For u outside this interval step 2.1 gives the same equality. Hence Ψs,0(F(u,0))=F(u,s) for all u∈[0,1].

4.1L3L4step 2.2step 3.1∎

Conclusion and finite composition. Setting Φs:=Ψs,0∣D2 gives the smooth isotopy Φ:D2×[0,1]→D2 of the statement with Φ0=id⁡, the pointwise stabilisations of step 2.2, and Φs(F(u,0))=F(u,s) for every admissible pair by step 3.1. Moreover step 3.1 makes the whole construction available for each member of a finite sequence of such data, and the map (s,x)↦Ψs,0(x) is smooth by [L3] and [L4]; a finite composite of these smooth isotopies again begins at the identity, fixes ∂D2, P and C pointwise at every time, and realizes the finite sequence of moves, which proves the final clause as well.

Remarks

  • The construction uses only the compact moving core, which is disjoint from the boundary and marked points. Stationary collars give zero velocity even when their endpoints are interior marks. No extension of the arc to the boundary is required.
  • The previous full straight-segment extension argument was invalid: a closed obstacle can separate an endpoint from the boundary, and a stationary added segment need not avoid the moving track. The velocity-field construction proves the original statement without those assertions.
  • The countable choice hypothesis is consumed through the declared vector-field extension and smooth cutoff suppliers. This lemma is not used by the repaired standard-stem straightening or faithfulness chain.
LemmaStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-6.1-sol)Open item page →

Trivial action on the standard meridians fixes the punctures and the stem arcs up to homotopy

Statement

Let h∈Homeo⁡+(D2,∂D2) preserve Qn setwise and induce the identity on π1(D2∖Qn,d). Then h(qi)=qi for every i, and h(si) is homotopic to si relative to endpoints. Relative homotopy uses continuous maps of the compact parameter square into the filled disk, with fixed endpoints d,qi and all other arc points avoiding Qn. No choice principle is used.

Facts & Assumptions

Given: X=D2∖Qn, the stems and meridians of Standard meridians of a punctured disk, and the stated h.

[F2]

Equality of two based loop classes means a continuous path homotopy relative to the basepoint (Based loops and the fundamental group).

Proof

1.1givenF1

Fixing the punctures. Let h(qi)=qσ(i). A positive small circle about qi is carried to a positive Jordan circle about qσ(i) containing no other marked point. Its lasso represents a conjugate of xσ(i): contract the circle inside its once-punctured neighborhood to a small circle and compare its tether with the standard tether. Abelianization in the free basis sends this conjugate to eσ(i), whereas the hypothesis h∗xi=xi sends it to ei. Hence σ(i)=i for each i.

1.2givenconstruct

Compactifying the tether calculation correctly. Fix i and abbreviate q=qi, s=si, a=h∘s. Take a small round disk B about q avoiding every other marked point. Continuity of a at its endpoint gives a terminal segment contained in B. In B∖{q} write that terminal segment as (r(u),θ(u)) using a continuous lift of its polar angle on the parameter interval. Replace it, relative to its initial point and q, by the radial segment: interpolate its angle to the initial angle and its positive radius to the linear radius of that segment. For parameters below 1 all radii remain positive; at 1 the radii tend uniformly to zero during the interpolation, since both original and linear radii do so. Thus this is a homotopy on the compact square, avoiding q except at the endpoint, even when θ(u) is unbounded. Adjust the terminal angle and a connecting path along a circle to obtain a representative consisting of a path P:d→p followed by the fixed radial tail p→q of s, for a point p on a sufficiently small circle C⊂B. Denote the truncated standard stem d→p by S. The connecting-circle adjustment has the same compact homotopy description.

2.1F1step 1.2algebra

Equality of meridians controls the tether. The lasso associated with a represents h∗xi=xi. In the terminal modification of step 1.2 the small circles are positive generators of π1(B∖{q}); changing the terminal tether conjugates that generator within this cyclic group and leaves it unchanged. Consequently [PCP−1]=[SCS−1]=xi. Put w=[PS−1]∈π1(X,d). Then wxiw−1=xi. In the free basis this forces w=xim for an integer m: in a reduced word write w=xiavxib, where v is empty or its first and last letters are neither xi nor xi−1. If v is nonempty, the subword vxiv−1 is reduced and retains a letter other than xi±1, even after adjoining the outer powers. It therefore cannot reduce to xi. Hence v is empty and w is a power of xi.

3.1F2step 1.2step 2.1construct

A peripheral power disappears at a marked endpoint. By [F2], w=xim implies a homotopy of paths with fixed endpoints in X from P to SCm (append S, then cancel the backtracking path). Attach the same radial tail p→q to this homotopy; its compact image in X stays away from the finite set Qn, and its unchanged tail supplies a continuous extension at q, uniformly in the homotopy parameter. Finally Cm followed by that tail is homotopic to the tail inside B, with p,q fixed: lift its polar angle along its parameter, interpolate it to the constant angle, and interpolate the radius to the positive linear radius ending at zero. The resulting paths avoid q in their interiors; uniform convergence of their radii to zero again proves continuity on the compact square. Thus a≃s in the relative-endpoint sense asserted. This concerns a peripheral power at the endpoint, and does not contract a nontrivial meridian loop inside X.

4.1step 1.1step 3.1∎

Conclusion. Step 1.1 proves that every puncture is fixed, and step 3.1 supplies the asserted compact relative-endpoint homotopy for each stem. The radii, paths and homotopies involve finitely many given arcs and explicit polar interpolations; no infinite selection or choice axiom is used. The intermediate paths need not be embeddings; upgrading this homotopy to an isotopy is a separate proper-arc result.

Remarks

A based homotopy of maps X→X need not extend to puncture ends. The proof instead constructs the endpoint homotopy directly, and checks uniform convergence in the radial coordinate. It never evaluates a map or homotopy on a point outside its domain.

LemmaStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-6.1-sol)Open item page →

A standard stem arc system can be straightened by a boundary- and puncture-fixed ambient isotopy

Statement

Assume AC. Let h∈Homeo⁡+(D2,∂D2) fix every qi, and suppose each h(si) is isotopic to si relative to endpoints. Then h is isotopic relative to ∂D2∪Qn to a homeomorphism h′ with h′(si(t))=si(t) for every i,t.

Facts & Assumptions

Given: AC, the finite standard stems of Standard meridians of a punctured disk, and the stated h.

[F1]

Relative homotopy of simple proper arcs implies relative isotopy, by the finite bigon and final-disk construction under AC of Homotopic simple proper arcs in the punctured disk are isotopic relative to their endpoints.

[F2]

The completed full slit surface is a compact disk, with the quotient and isotopy correspondence of The standard stem system cuts the punctured disk open to a disk.

[F3]

A boundary-fixed disk homeomorphism is joined to the identity by the Alexander contraction (Alexander contraction of the boundary-fixed disk homeomorphism group). In a disk coordinate centered at a fixed interior marked point, the same formula fixes that point throughout.

[F4]

Under AC, smooth finite collision-free point motions extend to boundary-fixed disk isotopies (Smooth finite point motions extend to disk isotopies, AC implies DC implies countable choice).

Proof

1.1F1F3construct

Relative versions of the elementary arc moves. The bigon moves and the final puncture-free disk move in [F1] can be performed by ambient isotopies. In a slightly enlarged neighborhood of the moving disk, prescribe an orientation-preserving homeomorphism taking its first arc to its second, and equal to the identity on the neighborhood boundary; disk coordinates extend this prescription across the two complementary disks. [F3] joins this homeomorphism to the identity, with support in that neighborhood. For an endpoint at a marked point, center the coordinate there and use the marked-point version of the same formula; for an outer-boundary endpoint use a half-disk neighborhood and keep its outer edge fixed. These moves fix the outer boundary and all marked points. They work just as well in a surface already cut along some fixed arcs: the boundary of that surface is fixed throughout, and regluing its paired sides gives an ambient isotopy on the filled disk. All neighborhoods and isotopies are compact, so regluing is continuous at their endpoints.

1.2givenbaseconstruct

Inductive goal. For k=0,…,n construct an ambient isotopy relative to ∂D2∪Qn whose final composition with h carries si onto si as a set for every i≤k. The identity isotopy gives k=0. Earlier stems need be kept pointwise fixed by each new correcting isotopy, though their parametrizations under the composite will be corrected at the end.

2.1F2step 1.2ihconstruct

The actual partial cut. Assume the goal for k−1, and call the current homeomorphism g. Cut the filled disk along s1,…,sk−1, completing their marked endpoints as in [F2], and then remove only the remaining punctures. Call the result Y. The outer-strip construction of [F2] with only these k−1 stems gives a compact disk with n−k+1 remaining marked points before removal. Thus Y is a punctured disk, not a simply connected disk. The arcs a=g(sk) and b=sk lift to Y with the same initial sector copy of d: g preserves orientation and each earlier stem as a set, so it preserves the sector containing all the remaining standard stems. Their other endpoint is qk.

3.1givenF2step 2.1construct

Why the homotopy survives this cut. The quotient projection is not a map Y→X at the completed tips of the earlier punctures. Delete those finitely many boundary tips to obtain Y0. In disjoint boundary collar charts away from dk and the remaining punctures, push slightly inward near each deleted tip, leaving dk fixed. This homotopy maps Y into Y0 at its final time and preserves Y0 throughout, so Y0↪Y induces a based fundamental-group isomorphism. The cut quotient restricts to a based map Y0→X. It identifies π1(Y,dk) with the free subgroup generated by xk,…,xn: remove small disks around the remaining punctures and cut along their remaining truncated stems. The resulting region is a disk; reattaching its paired stem-side collars adds exactly one loop for each remaining puncture. The flower retraction and finite tree collapse give these loops as a free basis; their quotient images in X are the corresponding standard lassos, independent by The punctured-disk fundamental group is free on the standard meridians. Now truncate a,b near qk and join their truncated endpoints to the same p in its small punctured disk. The resulting paths A,B:dk→p avoid the deleted tips. Their assumed compact endpoint homotopy in X gives [AB−1]∈⟨xk⟩: uniform continuity makes a common terminal strip lie in that small disk, and its endpoint connectors differ by an integer winding around qk. Injectivity of the induced map gives the same peripheral relation in Y. Append radial tails and absorb that winding by interpolating polar angles and positive radii to a radial tail. The radii tend to zero uniformly in time, giving a compact relative-endpoint homotopy in Y.

4.1F1F4step 1.1step 1.2step 3.1ih

Straightening the next arc in the partial cut. Choose a closed-disk coordinate for the completed partial cut of step 2.1, prescribing its boundary parametrization so that each opened shore retains its label. Its remaining marked points form an arbitrary finite configuration. Transport that configuration to the canonical one by smooth finite point motions and [F4] (use distinct buffer points and move one point at a time before smoothing the joins). Apply [F1] to the two transported arcs, with the transported compact homotopy of step 3.1, and return through those fixed coordinates. Perform its moves ambiently as in step 1.1, fixing every boundary side of Y and every remaining marked point. These moves run from a to b, rather than from b to a. Regluing gives an ambient isotopy of D2 relative to ∂D2∪Qn and all earlier stems, whose final map sends g(sk) onto sk. Compose it with the preceding corrections. This establishes the inductive goal at k, and the finite induction yields a map g preserving all stems as sets.

5.1F2step 4.1construct

Correcting the parametrizations simultaneously. For this final g, write g(si(u))=si(fi(u)), where each fi is an increasing homeomorphism of [0,1] fixing both endpoints. On each of the two copies of si in the full completed cut disk H prescribe the same boundary motion si(v)↦si((1−t)v+tfi−1(v)), and keep its outer boundary arc fixed. These increasing maps agree at every tip and sector endpoint, and give a continuous boundary-circle isotopy bt starting at the identity. In a disk coordinate extend it by rz↦rbt(z) for ∣z∣=1 and 0≤r≤1. At the center this is continuous uniformly in t. Each extension is a homeomorphism, respects the paired slit-side fibers, and hence descends through the compact quotient to an isotopy of the filled disk fixing the outer boundary and punctures. At t=1 its composition with g fixes every si(u) pointwise.

6.1step 4.1step 5.1discharge-induction∎

Conclusion. The finite composition of step 4.1 and the parametrization correction of step 5.1 is the required isotopy from h to h′. For n=0 there is nothing to straighten. AC is used in the general plane-arc and relative Jordan disk route and through countable-choice finite point motions; the completed circular/straight finite cut requires no additional Choice; no smoothing of a topological isotopy and no unsupported avoidance of previously fixed stems is required.

LemmaStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-6.1-sol)Open item page →

A boundary-fixed punctured-disk homeomorphism acting trivially on the fundamental group is isotopic to the identity

Statement

Assume AC. Let h∈Homeo⁡+(D2,∂D2) preserve Qn setwise and act as the identity on π1(D2∖Qn,d). Then h is isotopic to idD2 relative to ∂D2 and Qn.

Facts & Assumptions

Given: AC, the canonical configuration Qn, and a boundary-fixed homeomorphism h preserving it setwise and inducing the identity on the based fundamental group of X=D2∖Qn.

[F1]

Trivial induced action fixes every puncture and gives, for every standard stem, a homotopy on the compact square with fixed endpoints d,qi, avoiding all marked points at other arc parameters (Trivial action on the standard meridians fixes the punctures and the stem arcs up to homotopy, Standard meridians of a punctured disk).

[F2]

Under AC, the kernel of forgetting qn in the pure mapping class group is the image of Push⁡n:π1(Yn,qn)→PMod⁡(D2,Qn;∂D2), where Yn=int⁡D2∖{q1,…,qn−1}. The target of forgetting uses the actual truncation Qn′, rather than the canonical rank-(n−1) configuration (Point pushing is the kernel of forgetting the last disk puncture).

[F3]

The point push of a loop γ is represented by the inverse endpoint of an ambient isotopy lifting its motion, and depends only on its based homotopy class (Point pushing the last puncture).

[F4]

Smooth separated finite point motions extend to boundary-fixed disk isotopies under countable choice, implied by AC (Smooth finite point motions extend to disk isotopies, AC implies DC implies countable choice, The Axiom of Choice). Isotopy relative to a marked set is exactly equality of the corresponding mapping classes (Boundary-fixed mapping class group of a punctured disk).

[F5]

At n=1 the geometric braid group is trivial, and the boundary-fixed one-puncture mapping class group is isomorphic to it (Pure geometric braids and ordered configuration loops, Braid group as boundary-fixed punctured-disk mapping classes).

[F6]

The boundary-fixed disk homeomorphism group is contractible by the Alexander formula (Alexander contraction of the boundary-fixed disk homeomorphism group).

Proof

1.1givenF1F5F6base

Base case and purity. For n=0 the conclusion is the boundary-fixed disk Alexander contraction of [F6]; for n=1 it follows from [F5]. For n≥2, [F1] first shows that h fixes every qi, so its class lies in the pure mapping class group and the forgetting map of [F2] applies. We prove the assertion by induction on n.

2.1F4step 1.1ihconstruct

Filling the last puncture and applying induction at the correct configuration. Put Z=D2∖{q1,…,qn−1} and let j:X↪Z. The induced j∗ is surjective: any loop in Z is homotopic rel d to a finite polygonal loop avoiding the finite marked set, and a further small detour removes any passage through the single extra point qn. The homotopy and detour stay in Z. Since h∗j∗=j∗h∗ and h∗∣π1(X,d)=id⁡, this surjectivity implies h∗∣π1(Z,d)=id⁡. To transport the truncation Qn′ to the canonical rank-(n−1) tuple C=(cj), use the explicit motion qj↦(1+t/n)qj+t/(4n), j<n, on the real axis; it ends at cj=(2j−n)/(4n), preserves order, and remains in the interior. Reparametrize smoothly to be constant near the time endpoints and apply [F4], giving a boundary-fixed endpoint homeomorphism R with R(Qn′)=C. The map RhR−1 induces the identity on the fundamental group of the canonical (n−1)-punctured disk. Induction therefore makes its mapping class trivial; conjugating the isotopy back shows that h is isotopic to the identity relative to the actual truncation Qn′. Thus [h] lies in the forgetting kernel of [F2].

3.1F2F3F4step 2.1construct

An actual point-motion representative of the kernel. By [F2], write [h]=Push⁡n([γ]) for a loop γ in Yn based at qn. A compact loop avoiding the finite set of other marked points can be replaced in its based class by a finite polygonal loop, then rounded smoothly and made constant near the time endpoints; each replacement stays in small disks missing those points. Apply [F4] to this last-point motion and the constant motions of all the other points. It gives a jointly continuous ambient isotopy Ht with H0=id⁡, Ht(qj)=qj for j<n, and Ht(qn)=γ(t). Put k=H1. By [F3], [k]=[h]−1 relative to the boundary and all Qn, so k∗=id⁡ on π1(X,d): a marked-set isotopy restricts to a based homotopy on X, and the inverse class of h also induces the identity.

4.1F1step 3.1construct

The compact tether square detects the moving-point loop. Let s=sn. The map B(u,t)=Ht(s(u)) is a continuous map of the compact square into Z: its image never meets qj for j<n, since Ht fixes those points and is injective. Its left edge is the constant d, its lower edge is s, its right edge is γ, and its upper edge is k∘s. Its boundary relation is therefore s⋅γ⋅(k∘s)−1≃1 in Z. Independently, apply [F1] to the endpoint homeomorphism k, whose induced action is the identity. This gives a compact relative-endpoint homotopy k∘s≃s with fixed endpoints d,qn. Filling qn makes this an ordinary relative path homotopy in Z. Substitute it into the boundary relation to obtain s⋅γ⋅s−1≃1, hence [γ]=1 in π1(Z,qn) by basepoint transport along s. This uses the compact endpoint homotopy supplied by [F1], not an extension of an arbitrary homotopy on X.

5.1F3F4step 3.1step 4.1discharge-induction∎

Returning to the interior and closing induction. The loop γ lies in the interior and has compact image. Choose r0<1 so that all its points and all qj have norm less than r0. Compress the outer collar radially by r↦r for r≤r0 and r↦r0+(r−r0)/2 for r≥r0. This continuous map sends Z into Yn, fixes γ and qn, and avoids the other marked points because it changes only the outer collar. Composing the nullhomotopy from step 4.1 with it shows [γ]=1 already in π1(Yn,qn). [F3] now gives [h]=Push⁡n(1)=1. By [F4] this is precisely an isotopy to the identity relative to ∂D2∪Qn. The induction is complete. AC is used through the point-pushing kernel theorem and point-motion extensions; no general arc-tameness or arc-isotopy theorem is needed in this proof.

DefinitionDefinition: Literature-sourcedProof: AI-adaptedjudge pass (gpt-6.1-sol)Open item page →

Artin automorphisms of the free group

Definition

Let Fn=⟨x1,…,xn⟩ be the free group of Free group on a set of generators, identified with π1(D2∖Qn,d) through the standard meridians by The punctured-disk fundamental group is free on the standard meridians. For 1≤i≤n−1, ρ(σi)∈Aut⁡(Fn) is the automorphism given on the basis by ρ(σi)(xi)=xixi+1xi−1,ρ(σi)(xi+1)=xi,ρ(σi)(xj)=xj (j∉{i,i+1}). Its inverse is ρ(σi)−1(xi)=xi+1,ρ(σi)−1(xi+1)=xi+1−1xixi+1,ρ(σi)−1(xj)=xj (j∉{i,i+1}). Products use ordinary function composition: the leftmost factor is the outermost map and the rightmost factor acts first. Also ρ(σi−1):=ρ(σi)−1.

The assignments are automorphisms, and the displayed formulas are inverse. By the universal property of the free group (Free group on a set of generators, Reduced words form the free group on an alphabet) the displayed values on the free basis extend to a unique endomorphism ρ(σi):Fn→Fn, and likewise the displayed inverse formulas extend to an endomorphism θ:Fn→Fn. Substituting, θ(ρ(σi)(xi))=θ(xixi+1xi−1)=θ(xi) θ(xi+1) θ(xi)−1=xi+1 (xi+1−1xixi+1) xi+1−1=xi, θ(ρ(σi)(xi+1))=θ(xi)=xi+1, and both composites fix every other basis element; so θ∘ρ(σi)=id⁡Fn on a basis, hence as endomorphisms. Symmetrically ρ(σi)∘θ=id⁡Fn. Therefore ρ(σi) is a bijection with the displayed inverse, i.e. an automorphism (Group isomorphisms, automorphisms and the set Aut⁡(G)).

Convention note. The displayed formulas are Artin's equations (14) and (15) with the letter σi and its inverse interchanged; under the frozen geometric conventions of this library the positive half twist is the anticlockwise supported half rotation (see def-elementary-geometric-half-twist and thm-braid-group-is-the-boundary-fixed-mapping-class-group-of-the-punctured-disk), and prop-the-geometric-action-on-meridians-is-the-artin-representation proves that its action on the standard meridians is exactly the substitution frozen above. The interchange is a convention, not a change of mathematical content: ρ and Artin's substitution generate the same subgroup of Aut⁡(Fn) and satisfy the same braid relations, and the companion page shows that the mirror (clockwise) half rotation realizes Artin's displayed formulas verbatim.

Remarks

  • For n=1 there is no index i with 1≤i≤n−1, so there is no Artin automorphism and the statements making use of them are vacuous.
  • ρ(σi) fixes xj for all j∉{i,i+1}: its support is the pair of adjacent letters. This is the algebraic shadow of the fact that the half twist is supported in the disc Ui around the adjacent punctures.
LemmaStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-6.1-sol)Open item page →

The Artin automorphisms satisfy the braid relations

Statement

For the automorphisms of Artin automorphisms of the free group: if ∣i−j∣>1 then ρ(σi)ρ(σj)=ρ(σj)ρ(σi); if ∣i−j∣=1 then ρ(σi)ρ(σj)ρ(σi)=ρ(σj)ρ(σi)ρ(σj).

Facts & Assumptions

Given: n∈N, the free group Fn=⟨x1,…,xn⟩, and the automorphisms ρ(σi), 1≤i≤n−1, of Artin automorphisms of the free group, with ρ(σi)(xi)=xixi+1xi−1,ρ(σi)(xi+1)=xi,ρ(σi)(xj)=xj (j∉{i,i+1}), ρ(σi)−1(xi)=xi+1,ρ(σi)−1(xi+1)=xi+1−1xixi+1.

[F1]

The elements x1,…,xn form a free basis of Fn; two endomorphisms agree if they agree on a free basis, and equality of elements is decided by equality of reduced words (Free group on a set of generators, Reduced words form the free group on an alphabet).

Proof

technique · direct computation on the basis
1.1F1given

Far commutation. Let ∣i−j∣>1. The two substitutions involve disjoint pairs of letters. For k∉{i,i+1,j,j+1} both composites fix xk; for k∈{i,i+1} both send xk to ρ(σi)(xk), because ρ(σj) fixes every letter of that word, and similarly for k∈{j,j+1}. Thus the composites agree on every basis letter and are equal by [F1].

1.2given

Adjacent case, the composite ρ(σi)ρ(σi+1)ρ(σi). Let ∣i−j∣=1; after swapping the names of i,j if necessary this is the triple (xi,xi+1,xi+2), and the composite fixes every other basis letter. Composing the displayed substitutions (the rightmost letter acts first) gives ρ(σi)ρ(σi+1)ρ(σi)(xi)=xi xi+1xi+2xi+1−1 xi−1, ρ(σi)ρ(σi+1)ρ(σi)(xi+1)=xi xi+1 xi−1, ρ(σi)ρ(σi+1)ρ(σi)(xi+2)=xi.

2.1givenstep 1.2

The other composite has the same values. Apply ρ(σi+1), then ρ(σi), then ρ(σi+1). The successive images of xi are xi, xixi+1xi−1, and xixi+1xi+2xi+1−1xi−1. Those of xi+1 are xi+1xi+2xi+1−1, xixi+2xi−1, and xixi+1xi−1; those of xi+2 are xi+1, xi, and xi. Every other basis letter is fixed. These are the values of step 1.2.

3.1F1step 1.2step 2.1

Comparison. A direct reduction using the formulas confirms the identity of the two triples of reduced words of steps 1.2 and 2.1: both composite automorphisms send xi↦xixi+1xi+2xi+1−1xi−1,xi+1↦xixi+1xi−1,xi+2↦xi.

4.1F1step 1.1step 3.1∎

Conclusion. Steps 1.1 and 3.1 show that the two composites agree on every basis element in the far and the adjacent case respectively; by [F1] they are equal as automorphisms, which is the asserted braid relations. The computation used the displayed formulas only and made no case distinction beyond the two stated.

Remarks

  • No choice principle is used; the verificaton is finite and effective.
DefinitionDefinition: Literature-sourcedProof: AI-adaptedjudge pass (gpt-6.1-sol)Open item page →

The Artin representation on a free group

Definition

By The Artin automorphisms satisfy the braid relations the assignment σi↦ρ(σi) satisfies the defining relations of the presented braid group Bn of The braid group by Artin presentation, so von Dyck's theorem Von Dyck's theorem: maps of generators that satisfy the relators extend uniquely from a presented group yields a unique homomorphism ρ:Bn⟶Aut⁡(Fn). This is the Artin representation; it is the frozen convention for every later statement of the page.

Uniqueness and effectivity. The homomorphism is unique because it is prescribed on the generating set {σ1,…,σn−1}, and it is computed on a braid word by composing the finitely many automorphisms ρ(σi)±1 attached to its letters, as frozen in Artin automorphisms of the free group. No choice principle and no geometric input are used in the construction; von Dyck's theorem Von Dyck's theorem: maps of generators that satisfy the relators extend uniquely from a presented group supplies existence and uniqueness of the extension.

Remarks

  • For n≤1 the group Bn is trivial, so ρ is the unique homomorphism from the trivial group and the assertion is vacuous.
  • The construction uses the abstract presentation only; that the abstract group is the mapping class group of the punctured disk, and that its generator acts by the frozen Nielsen substitutions, is proved separately in prop-the-geometric-action-on-meridians-is-the-artin-representation.
PropositionStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-6.1-sol)Open item page →

The geometric action on meridians is the Artin representation

Statement

Assume AC. Let Gn be the geometric braid group, φn:Bn→Gn the published surjection of The Artin presentation surjects onto the geometric braid group, and Ψ:Gn⟶Mod⁡(D2,Qn;∂D2) the isomorphism of Braid group as boundary-fixed punctured-disk mapping classes. Identifying π1(D2∖Qn,d) with Fn by the standard meridians of Standard meridians of a punctured disk, the automorphism of Fn induced by the mapping class Ψ(φn(β)) equals ρ(β) for every braid word β. In particular the geometric half twist σi acts as the Nielsen automorphism of Artin automorphisms of the free group.

Facts & Assumptions

Given: AC, the number n, the punctured disk X=D2∖Qn with basepoint d, the geometric braid group Gn with its surjection φn and the isomorphism Ψ, and the standard meridian loops x1,…,xn with the identification Fn≅π1(X,d), xj↦[xj].

[F1]

The published identification. Ψ is a group isomorphism, and for 1≤i≤n−1 the image of the standard positive geometric half twist σi under Ψ∘φn is the mapping class of the explicit boundary-fixed homeomorphism Hi constructed in the published proof, which is supported in the support disc Ui of the adjacent pair and exchanges qi and qi+1; the construction rotates the support disc about the midpoint mi through the half turn whose total angle is π. (Braid group as boundary-fixed punctured-disk mapping classes, The Artin presentation surjects onto the geometric braid group.)

[F2]

Positivity and the size of the support disc. The support disc Ui={w:∥w−mi∥2<3h/2} contains exactly the two base points qi,qi+1, each at distance h from mi; the standard positive half twist turns the moving pair anticlockwise about mi, the label i passing below its midpoint mi and the label i+1 above. Hence the homeomorphism Hi of [F1] acts on Ui as the half rotation of the pair about mi that carries qi through the lower half-plane to qi+1 and qi+1 through the upper half-plane to qi. (The elementary geometric half twist, its support disc, and its opposite.)

[F3]

Standard meridians and their freedom of radius. The stems sj are the straight segments from d=(0,1) to the points qj of the standard-meridian definition; the loops xj=sjcjsj−1 are based at d, and the class [xj] is independent of the admissible radius of the circle Cj; the assignment xj↦[xj] is an isomorphism Fn→π1(X,d) (Standard meridians of a punctured disk, The punctured-disk fundamental group is free on the standard meridians).

[F4]

Functoriality of the induced map. A pointed continuous map induces a group homomorphism on π1, homotopic pointed maps induce the same homomorphism, id⁡∗=id⁡, and (g∘f)∗=g∗∘f∗; hence the operation [f]↦f∗ is a well-defined group homomorphism from the mapping class group of boundary-fixed homeomorphisms to Aut⁡(π1(X,d)) (Induced fundamental-group maps are well defined, functorial and invariant under based homotopy).

[F5]

The Artin representation. ρ:Bn→Aut⁡(Fn) is the unique group homomorphism with ρ(σi)(xi)=xixi+1xi−1,ρ(σi)(xi+1)=xi,ρ(σi)(xj)=xj (j∉{i,i+1}), and Bn is generated by σ1,…,σn−1 (The Artin representation on a free group, Artin automorphisms of the free group).

[F6]

A convenient slit system for reading loops. Use the vertical downward segments ℓj from qj to the lower outer boundary, instead of the standard upper tethers. Their interiors are pairwise disjoint, and every standard truncated tether avoids them. Remove small puncture disks and open along the remaining parts of these downward segments. The thin-strip disk construction of The standard stem system cuts the punctured disk open to a disk applies to these disjoint straight cuts as well: it gives a compact disk, with each removed circle opened into a boundary arc. A transverse based loop is therefore read by its signed slit crossings. To justify the rule, split it at the crossings and contract each intervening path in that disk; gluing back one paired side gives its standard lasso, reached from d above the cuts. A crossing from left to right over the downward slit is positive, since a positive small meridian crosses it in that direction. Thus it contributes xj, and the opposite crossing contributes xj−1. All loop segments remain in the holed disk; no puncture tip is traversed.

[F7]

The boundary class equals x1⋯xn (The oriented boundary loop represents the ordered product of the standard meridians). A boundary-fixed homeomorphism fixes that class. In the published half-rotation formula of [F1], Hi is (r,θ)↦(r,θ+πχ(r)) about mi, with 0≤χ≤1, χ=1 for r≤5h/4, and χ=0 for r≥11h/8.

Proof

1.1F1F3F4

The induced action is a homomorphism on braids. By [F1] the composite Ψ∘φn:Bn→Mod⁡(D2,Qn;∂D2) is a group homomorphism, and by [F4] the assignment [f]↦f∗ is a group homomorphism to Aut⁡(π1(X,d)), which under the identification of [F3] is Aut⁡(Fn). Hence Θ:β⟼(the automorphism induced by Ψ(φn(β))) is a group homomorphism Bn→Aut⁡(Fn).

1.2F1F5

Reduction to the half twists. By [F5] Bn is generated by σ1,…,σn−1 and ρ is the unique homomorphism carrying σi to the displayed substitution; two homomorphisms from the presented group Bn that agree on all generators agree on Bn. It therefore suffices to prove (Hi)∗=ρ(σi) for every i, where (Hi)∗ is the automorphism of Fn induced by the homeomorphism Hi of [F1].

1.3F1F2F6F7construct

The transported right tether avoids every other downward slit. Write the right stem as z(t)=(1−t)d+tqi+1 and put y=1−t. Whenever it meets Ui, 0<y<3h/2. Its horizontal coordinate relative to mi is h−yqi+1>h−(3h/2)(1/4)=5h/8>0, since ∣qi+1∣<1/4. Thus its polar angle about mi satisfies 0<θ<π/2. Under Hi, its angle becomes Θ=θ+πχ(r), so 0<Θ<3π/2. The downward slit from qi+1=mi+(h,0) could be crossed only at a point with horizontal coordinate h relative to mi and negative vertical coordinate; that would require an angle in (3π/2,2π), impossible in this range. Every other slit except ℓi has horizontal distance at least 3h from mi and avoids Ui. Outside Ui the stem stays above the real axis and is unchanged. Hence the transported right tether can cross only ℓi. This argument uses actual truncated tethers ending at a small circle, so no concatenation passes through a deleted puncture.

2.1F1F3step 1.2

Every meridian with j∉{i,i+1} is fixed. The x-coordinates of mi and qj differ by ∣2(i−j)+1∣ h≥3h, and ∣x(qj)∣<1/4; hence the distance from mi to the line through d and qj, namely ∣x(mi)−x(qj)∣/1+x(qj)2, exceeds 3h⋅4/17>3h/2, so the stem sj avoids the open support disc Ui and dist⁡(qj,Ui)≥3h−3h/2=3h/2>0. Choose, by the radius independence of [F3], a lasso xj′ homotopic rel d to xj whose circle has radius less than 3h/2 around qj; then xj′ avoids Ui, and since Hi is the identity outside Ui by [F1], Hi∘xj′=xj′ pointwise. Hence (Hi)∗[xj]=[xj]=ρ(σi)(xj).

3.1F3F5F6F7step 2.1step 1.3algebra

The right meridian and then the left meridian. Choose the circle for xi+1 sufficiently small to lie wholly in the core r<5h/4. It maps under Hi to a positive round circle about qi, and crosses ℓi once positively and no other downward slit. By step 1.3 the preceding tether has a crossing word xim for some integer m, after a small general-position perturbation supported away from the other slits. Its returning tether gives xi−m. [F6] therefore reads the actual based loop Hi∘xi+1 as ximxixi−m=xi. The other meridians are fixed by step 2.1, and [F7] says the whole ordered product is fixed. Cancelling its unchanged prefix and suffix gives (Hi)∗(xi)(Hi)∗(xi+1)=xixi+1. Substitution of (Hi)∗(xi+1)=xi yields (Hi)∗(xi)=xixi+1xi−1. These are exactly the formulas of [F5].

4.1F1F5step 1.1step 1.2step 2.1step 1.3step 3.1∎

Comparison and conclusion. Steps 2.1 and 3.1 show (Hi)∗(xj)=ρ(σi)(xj) for every j and every i, and two endomorphisms agreeing on the free basis x1,…,xn agree as automorphisms; hence (Hi)∗=ρ(σi). By step 1.2 the homomorphism Θ of step 1.1 and the Artin representation ρ agree on the generators of Bn, so Θ(β)=ρ(β) for every braid word β, which is the first assertion; the case β=σi is the second. AC is used through the published isomorphism and half-twist identification of [F1] and the slit-disk construction of [F6].

Remarks

  • The proposition is the point where the algebraic convention of Artin automorphisms of the free group is matched to the frozen geometric conventions of this library: the positive (anticlockwise) half twist induces the substitution xi↦xixi+1xi−1, xi+1↦xi, which is Artin's substitution with the letter and its inverse interchanged. The mirror (clockwise) half rotation realizes Artin's original formulas verbatim.
  • The read-off in steps 2.1, 3.1 and 4.1 uses only the support disc and the stems; it shows at the same time that the induced action fixes x1⋯xn, as it must, since Hi fixes ∂D2 pointwise.
TheoremStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-6.1-sol)Open item page →

The Artin representation is faithful

Statement

Assume AC. For every n≥1 the Artin representation ρ:Bn→Aut⁡(Fn) of The Artin representation on a free group is injective; equivalently, a braid word acts trivially on Fn only if it represents the trivial braid.

Facts & Assumptions

Given: AC, the number n≥1, the abstract braid group Bn on σ1,…,σn−1, the geometric braid group Gn with the surjection φn:Bn→Gn and the isomorphism Ψ:Gn⟶Mod⁡(D2,Qn;∂D2) of The Artin presentation surjects onto the geometric braid group and Braid group as boundary-fixed punctured-disk mapping classes, and the identification of Fn with π1(D2∖Qn,d) by the standard meridians (The Artin representation on a free group, The braid group by Artin presentation).

[F1]

The geometric action is the Artin representation. Assume AC. For every braid word β, the automorphism of Fn induced by the mapping class Ψ(φn(β)) equals ρ(β); in particular, if ρ(β)=id⁡ then the homeomorphism representing Ψ(φn(β)) acts as the identity on π1(D2∖Qn,d). (The geometric action on meridians is the Artin representation.)

[F2]

Trivial action implies isotopy to the identity. Assume AC. Let h∈Homeo⁡+(D2,∂D2) preserve Qn setwise and act as the identity on π1(D2∖Qn,d); then h is isotopic to idD2 relative to ∂D2 and Qn. Hence such an h represents the identity element of Mod⁡(D2,Qn;∂D2). (A boundary-fixed punctured-disk homeomorphism acting trivially on the fundamental group is isotopic to the identity.)

[F3]

Completeness of the presentation. Assume AC. The published surjection φn is injective, hence an isomorphism; that is, a braid word whose geometric braid is trivial represents the trivial element of Bn. (The Artin presentation is complete for geometric braids.)

[F4]

The isomorphism Ψ. Ψ is a group isomorphism, so it is injective: if Ψ(φn(β)) is the identity mapping class, then φn(β)=1 in Gn. (Braid group as boundary-fixed punctured-disk mapping classes, AC used through the published isomorphism.)

Proof

technique · direct
1.1given

The case n=1. For n=1 there is no generator, B1 is the trivial group by The braid group by Artin presentation, and the unique map ρ:B1→Aut⁡(F1) is injective; the assertion holds vacuously.

1.2F1given

Assume a word acts trivially. Let n≥2 and let β be a braid word with ρ(β)=id⁡. By [F1] the mapping class Ψ(φn(β)) induces the identity automorphism of π1(D2∖Qn,d). Choose a homeomorphism h representing this mapping class (for instance the homeomorphism attached to β by the geometric construction underlying φn); then h fixes ∂D2 pointwise, preserves Qn setwise and acts as the identity on π1(D2∖Qn,d).

2.1F2step 1.2

Trivial action forces the identity mapping class. By [F2], applied under the present assumption AC, the homeomorphism h of step 1.2 is isotopic to the identity relative to ∂D2 and Qn; hence Ψ(φn(β))=1 in Mod⁡(D2,Qn;∂D2).

3.1F3F4step 2.1

Injectivity of the presentation. By [F4] the isomorphism Ψ is injective, so step 2.1 gives φn(β)=1 in Gn. By [F3], φn is injective, so the braid word β represents the trivial element of Bn.

4.1F1F2F3step 1.1step 3.1∎

Conclusion. Steps 1.1, 1.2, 2.1 and 3.1 show that every braid word acting trivially on Fn represents the trivial braid, which is exactly the injectivity of ρ. The converse (the trivial braid acts trivially) is immediate from ρ being a homomorphism, so injectivity holds for every n≥1. AC is used exactly through the three published or previously proved inputs [F1], [F2] and [F3], namely the geometric-action proposition, the isotopy-to-identity lemma and the completeness theorem, all of which assume AC; the final argument itself is elementary.

Remarks

  • The proof replaces Artin's original topological faithfulness argument by the route through the mapping class group: the geometric action identifies ρ with the action of Mod⁡(D2,Qn;∂D2) on π1, and a boundary-fixed homeomorphism acting trivially on π1 is isotopic to the identity by induction on the number of punctures and the point-pushing kernel theorem. The last point-motion loop is detected by a compact tether square after filling that puncture; no Markov theorem or general arc-tameness theorem is used.
  • Consequently ρ is an isomorphism onto its image, and Bn is isomorphic to the Artin braid subgroup of Aut⁡(Fn) characterized in thm-artins-characterization-of-the-braid-subgroup-of-aut-f-n.
LemmaStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-6.1-sol)Open item page →

Artin automorphisms permute meridian conjugacy classes and fix the boundary word

Statement

For every braid word β in the generators σ1±1,…,σn−1±1 and every i, the element ρ(β)(xi) is conjugate in Fn to one of the generators x1,…,xn, and ρ(β)(x1x2⋯xn)=x1x2⋯xn. Here x1⋯xn is the boundary word, i.e. the element represented by the positively oriented boundary loop ∂ by The oriented boundary loop represents the ordered product of the standard meridians. No choice principle is used.

Facts & Assumptions

Given: the free group Fn=⟨x1,…,xn⟩ with its reduced words, the generators ρ(σi)±1 of Artin automorphisms of the free group, the homomorphism ρ:Bn→Aut⁡(Fn) of The Artin representation on a free group, an arbitrary braid word β, and the boundary loop ∂ with its class of The oriented boundary loop represents the ordered product of the standard meridians.

[F1]

The generator substitutions. For 1≤i≤n−1, ρ(σi)(xi)=xixi+1xi−1,ρ(σi)(xi+1)=xi,ρ(σi)(xj)=xj (j∉{i,i+1}), so ρ(σi) sends xi to the conjugate xi xi+1 xi−1 of xi+1, sends xi+1 to the generator xi, and fixes every other generator; and ρ(σi)(xixi+1)=(xixi+1xi−1) xi=xixi+1, so ρ(σi) fixes the ordered product. The inverse ρ(σi)−1 has image formulas ρ(σi)−1(xi)=xi+1, ρ(σi)−1(xi+1)=xi+1−1xixi+1 and fixes all other generators, so it too carries every basis letter to a conjugate of a generator and fixes the ordered product. (Artin automorphisms of the free group.)

[F2]

The representation. ρ is a group homomorphism, so ρ(β) is the composite of the automorphisms attached to the letters of β, with the leftmost letter the outermost map (the rightmost map is evaluated first), and ρ of the empty word is the identity. Two endomorphisms of Fn agree as soon as they agree on the free basis x1,…,xn, and equality of elements is decided by reduced words (The Artin representation on a free group, Free group on a set of generators, Reduced words form the free group on an alphabet).

[F3]

The boundary word. The class of the loop x1⋯xn is [x1]⋯[xn], and under the identification of π1(D2∖Qn,d) with Fn by the standard meridians it corresponds to the positively oriented boundary loop ∂ (The oriented boundary loop represents the ordered product of the standard meridians, Standard meridians of a punctured disk).

Proof

Proof technique: direct, by generators and preservation under composition and inversion.

1.1F1

The generator substitutions have the two properties. For each i and each sign, ρ(σi)±1 carries every basis letter xj to a conjugate of a generator: by [F1] the values are unchanged generators, xixi+1xi−1, or xi+1−1xixi+1, all of which are conjugates of generators (a generator is conjugate to itself via the empty word). Moreover ρ(σi)±1 fixes the ordered product δ=x1⋯xn: for ρ(σi) this is the last display of [F1], and for the inverse it follows by applying ρ(σi)−1 to the equality ρ(σi)(δ)=δ and using ρ(σi)−1ρ(σi)=id⁡.

1.2F1algebra

The two properties are preserved by composition and inversion. Let A,B∈Aut⁡(Fn) satisfy: A(xj) and B(xj) are conjugate to generators for every j, and A(δ)=B(δ)=δ. For the composite (A∘B), write B(xj)=Q−1xkQ with Q∈Fn; then (A∘B)(xj)=A(Q)−1 A(xk) A(Q), a conjugate of A(xk), which is a conjugate of a generator; and (A∘B)(δ)=A(B(δ))=A(δ)=δ. For the inverse, abelianisation sends each basis vector ek to some eπ(k); since the induced map is invertible, π is a permutation. Thus for every j there is a k with A(xk)=Q−1xjQ; applying A−1 and rearranging gives A−1(xj)=A−1(Q) xk A−1(Q)−1, a conjugate of a generator, and A−1(δ)=δ because A(δ)=δ.

2.1F2step 1.1step 1.2

Induction on the letters of the word. Let β be a braid word β1β2⋯βm with letters βk∈{σ1±1,…,σn−1±1}. If m=0, then β is the empty word and ρ(β)=id⁡, for which ρ(β)(xj)=xj is a conjugate of a generator and ρ(β)(δ)=δ. If m≥1, write β=β1β′; by [F2] ρ(β)=ρ(β1)∘ρ(β′), where ρ(β1)±1 is one of the automorphisms of step 1.1 and, by induction on m, ρ(β′) carries every basis letter to a conjugate of a generator and fixes δ. Step 1.2 applied to A=ρ(β1) and B=ρ(β′) then gives both properties for ρ(β).

3.1F3step 2.1∎

Conclusion. Steps 1.1, 1.2 and 2.1 show that every braid word β induces an automorphism carrying each xi to a conjugate of a generator and fixing δ=x1⋯xn; by [F3] this element is the one represented by the boundary loop ∂, which proves the statement. Every verification above was a finite computation with the displayed substitutions, so no choice principle is used.

Remarks

  • The two properties are exactly the necessary conditions of Artin's characterization of the braid subgroup of Aut⁡(Fn): see thm-artins-characterization-of-the-braid-subgroup-of-aut-f-n.
  • Only the direction from the word to the automorphism is asserted here; the converse, that every automorphism with the two properties comes from a braid word, is thm-every-peripheral-boundary-preserving-free-group-automorphism-is-an-artin-automorphism.
DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-6.1-sol)Open item page →

Peripheral-boundary-preserving automorphisms of F_n

Definition

Let n∈N and let Fn=⟨x1,…,xn⟩ be the free group of Free group on a set of generators on the n letters x1,…,xn, with reduced words and free reduction as in Reduced words form the free group on an alphabet. The ordered boundary product is the element δ:=x1x2⋯xn∈Fn, the word x1⋯xn; under the identification of xi with the class of the standard meridian of Standard meridians of a punctured disk it is the element represented by the positively oriented boundary loop (proved in lem-the-oriented-boundary-loop-represents-the-ordered-product-of-the-standard-meridians).

An automorphism A∈Aut⁡(Fn) (Group isomorphisms, automorphisms and the set Aut⁡(G)) is peripheral-boundary-preserving if

  1. (peripheral) for every i the element A(xi) is conjugate in Fn to one of the generators x1,…,xn; equivalently, after rewriting A(xi) in the reduced normal form of Reduced words form the free group on an alphabet, there are a permutation π of {1,…,n} and a reduced word Qi with A(xi)=Qi−1 xπ(i) Qi;and
  2. (boundary-preserving) A fixes the ordered boundary product, A(x1x2⋯xn)=x1x2⋯xn.

These are exactly the two hypotheses of Artin's characterization of the braid subgroup of Aut⁡(Fn).

The two formulations of condition 1 agree. If A(xi)=Qi−1xπ(i)Qi, its class in the abelianisation Fnab≅Zn is the class of xπ(i); conversely, an automorphism induces an automorphism of Zn, so if every A(xi) is conjugate to a generator, the assignment ei↦eπ(i) is an invertible self-map of the basis and π is a permutation. The element Qi is not unique, but it is unique up to left-multiplication by powers of the middle generator: if Q−1xjQ=R−1xjR then RQ−1 commutes with xj, hence lies in the centraliser ⟨xj⟩, so R=xjmQ for some integer m; thus the invariant content of condition 1 is "A(xi) is conjugate to a generator", and the displayed form is a normalised way of writing that conjugacy. Condition 2 fixes the ordered product itself, not merely its conjugacy class or its image in the abelianisation. No choice principle is used in this definition.

Remarks

  • For n≤1 the group Fn is trivial or infinite cyclic and the conditions are checked directly; the ordered product is x1 for n=1.
  • For n≥2 the conditions are independent. The basis transposition x1↔x2 preserves peripheral conjugacy classes and changes δ. Conversely, the substitution x1↦x1−1, x2↦x12x2, fixing the other generators, fixes δ and is an involution, hence an automorphism. Its image of x1 has abelianised class −e1, so it is not conjugate to any positive basis generator.
LemmaStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-6.1-sol)Open item page →

Artin's product-cancellation dichotomy

Statement

Let A be peripheral-boundary-preserving, and write Tj=A(xj)=Qj−1xπ(j)Qj as reduced words, with T1⋯Tn=x1⋯xn. In particular the displayed conjugator expressions have no internal cancellation. Exactly one of the following holds:

  1. No maximal junction cancellation of two adjacent factors cancels a middle letter. Then every Qj is empty, π is the identity, and A=id⁡.
  2. Some adjacent pair has such a cancellation. Choose the least index i with this property and stop its junction cancellation at the first cancelled middle letter. Put a=xπ(i), b=xπ(i+1), U=Qi, and V=Qi+1. If the left middle letter a is cancelled first, then V=RaU as a reduced concatenation; if the right middle letter b is cancelled first, then U=Rb−1V as a reduced concatenation.

Here cancelling a middle letter means deleting it with its inverse, not merely exposing it. The first cancelled middle letter is defined for the chosen junction; no order-independent first cancellation is asserted.

Facts & Assumptions

Given: The reduced conjugator expressions above and the exact product identity, with the peripheral and boundary conventions of Peripheral-boundary-preserving automorphisms of F_n.

[F1]

The product identity follows from the homomorphism and boundary condition (Peripheral-boundary-preserving automorphisms of F_n, Free group on a set of generators).

[F2]

Free reduction deletes adjacent inverse pairs, and the resulting reduced word is unique (Reduced words form the free group on an alphabet).

Proof

1.1F1F2construct

A first middle cancellation must come from original neighbours. Reduce the whole product by deleting adjacent inverse pairs, for example always the leftmost available pair. Before the first middle letter is cancelled, every factor retains its middle letter and therefore has a nonempty residue. Its surviving letters form an interval of the original reduced factor: a deletion inside such an interval is impossible, so deletions take place only at residue boundaries. No factor has disappeared, and these boundaries are between original neighbours. To cancel the left middle letter at the boundary of Ti,Ti+1, all of Qi on its right must first cancel against the initial letters of Qi+1−1; those letters cannot have been removed at the other boundary without first cancelling the right middle letter. The corresponding assertion holds for cancellation of the right middle letter. Thus any first middle cancellation in the whole product also occurs in a junction cancellation of an original adjacent pair.

2.1F1F2step 1.1

If no adjacent pair cancels a middle letter. Step 1.1 shows that no middle letter is cancelled in the whole reduction. All n middle letters therefore survive in its final word x1⋯xn of length n, leaving no conjugator letters and forcing their order to be x1,…,xn. The initial Q1−1 cannot be deleted: it is reduced, has no factor on its left, and cannot cancel across its surviving middle letter. Hence Q1 is empty. Inductively, if Q1,…,Qj−1 are empty, the initial letters of Qj−1 cannot cancel against the surviving earlier middle letters or across its own middle letter. Hence Qj is empty as well. Thus all conjugators vanish and π(j)=j, so A=id⁡. This includes n=0,1.

3.1F2step 2.1construct∎

The two explicit prefix forms. Otherwise choose the least qualifying i. At that junction the words are U−1aU and V−1bV. If a is the first middle letter cancelled, cancellation removes the entire suffix U of the left factor against the head U−1 of V−1, and the next letter of V−1 must be a−1. Equivalently V=RaU as a reduced word. If b is the first cancelled middle letter, the whole head V−1 has cancelled against the suffix V of U, and the preceding letter of U must be b−1; hence U=Rb−1V. The two positive middle letters cannot cancel each other, so the first deletion involves exactly one of them. Exhaustiveness and exclusivity follow by whether a qualifying junction exists.

Remarks

This is the cancellation split in Artin's proof of Theorem 16, printed p. 114. The prefix forms in step 3.1 give explicit shorter conjugators in lem-an-extremal-cancellation-shortens-an-artin-substitution.

LemmaStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-6.1-sol)Open item page →

An extremal cancellation shortens an Artin substitution

Statement

In case 2 of Artin's product-cancellation dichotomy, use its chosen adjacent pair and notation a,b,U,V,R. Put s=ρ(σi), with the convention of Artin automorphisms of the free group. If the left middle letter is cancelled first, set A′=A∘s; if the right middle letter is cancelled first, set A′=A∘s−1. In both cases A′ is peripheral-boundary-preserving and has a representation whose total reduced conjugator length is strictly less than that of A.

More precisely, its two new conjugators can be taken as red⁡(RU),U in the left case, and V,red⁡(RV) in the right case; all other conjugators are unchanged. A representation of minimum total length therefore satisfies ℓ(A′)<ℓ(A).

Facts & Assumptions

Given: The reduced expressions, the adjacent pair selected in the cancellation dichotomy, and the frozen Artin substitution s.

[F1]

The dichotomy gives V=RaU in the left case and U=Rb−1V in the right case, as reduced concatenations (Artin's product-cancellation dichotomy).

[F2]

The automorphism s sends xi to xixi+1xi−1 and xi+1 to xi; its inverse sends them to xi+1 and xi+1−1xixi+1 respectively, fixing all other basis letters (Artin automorphisms of the free group).

[F3]

Peripheral-boundary-preserving means permutation of positive basis conjugacy classes and exact preservation of δ=x1⋯xn (Peripheral-boundary-preserving automorphisms of F_n).

Proof

1.1F1F2algebra

Left middle letter. Here V=RaU. Postcomposition gives A′(xi)=TiTi+1Ti−1 and A′(xi+1)=Ti, where Ti=U−1aU and Ti+1=V−1bV. The first image has conjugator VTi−1=RaU U−1a−1U=RU around b, so A′(xi)=(RU)−1b(RU) and A′(xi+1)=U−1aU. Reducing RU gives conjugators of total length at most ∣R∣+2∣U∣, whereas the old pair has length ∣U∣+∣V∣=∣R∣+1+2∣U∣. The length falls by at least one.

1.2F1F2algebra

Right middle letter. Here U=Rb−1V. Postcomposition with the inverse gives A′(xi)=Ti+1 and A′(xi+1)=Ti+1−1TiTi+1. The second image has conjugator UTi+1=Rb−1V V−1bV=RV around a. Thus the new conjugators are V,red⁡(RV), of total length at most ∣R∣+2∣V∣, while ∣U∣+∣V∣=∣R∣+1+2∣V∣. Again the length falls by at least one; all other images are unchanged in either case.

2.1F2F3step 1.1step 1.2algebra∎

Admissibility and recovery. The displayed images swap the two middle generators and retain conjugates of every other generator, so they still permute the positive peripheral classes. Both s and s−1 fix δ, since s(xixi+1)=(xixi+1xi−1)xi=xixi+1 and the inverse fixes the same word. Consequently A′ fixes δ and is peripheral-boundary-preserving. In the left case A=A′∘s−1; in the right case A=A′∘s. The strict pair inequalities of steps 1.1 and 1.2 prove the total decrease; when the original representation is minimal they give ℓ(A′)≤ℓ(A)−1. No choice principle is used.

Remarks

These are Artin's two length reductions in the proof of Theorem 16, printed pp. 114–115, translated to the authored generator convention. Both operations change source basis letters by postcomposition; they do not apply a substitution to every target word by precomposition.

TheoremStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-6.1-sol)Open item page →

Every peripheral-boundary-preserving automorphism is an Artin automorphism

Statement

Every peripheral-boundary-preserving automorphism A∈Aut⁡(Fn) (Peripheral-boundary-preserving automorphisms of F_n) equals ρ(β) for some braid word β, and β may be chosen as a product of the generators σ1±1,…,σn−1±1. No choice principle is used.

Facts & Assumptions

Given: a peripheral-boundary-preserving automorphism A of Fn=⟨x1,…,xn⟩, written in the normalised reduced form A(xi)=Qi−1xπ(i)Qi(1≤i≤n) with reduced words Qi, and with A(x1⋯xn)=x1⋯xn.

[F1]

The length of A. By Peripheral-boundary-preserving automorphisms of F_n the conjugators Qi may be chosen shortest, and changing a conjugator by a power of its middle generator does not change the conjugacy class; hence the minimal total length ℓ(A):=min⁡∑i∣Qi∣ over all such representations is a well-defined nonnegative integer. A representation of total length ℓ(A) is called minimal. (Peripheral-boundary-preserving automorphisms of F_n, An extremal cancellation shortens an Artin substitution.)

[F2]

The dichotomy. In a reduced conjugator representation of ∏iQi−1xπ(i)Qi=x1⋯xn, either no adjacent junction cancellation deletes a middle letter, in which case A=id⁡ and every Qi is empty; or choose the least qualifying adjacent pair and its first cancelled middle letter (Artin's product-cancellation dichotomy).

[F3]

Shortening. In the second case of [F2], postcomposition by ρ(σi) or its inverse, according to which middle letter is cancelled first, gives a peripheral-boundary-preserving A′ with total conjugator length at least one smaller. Thus A=A′∘ρ(σi)ϵ for ϵ=±1 (An extremal cancellation shortens an Artin substitution, Artin automorphisms of the free group).

[F4]

The representation. ρ:Bn→Aut⁡(Fn) is a group homomorphism with ρ(σi) the explicit substitution of Artin automorphisms of the free group, so ρ(β′σiϵ)=ρ(β′)ρ(σi)ϵ and ρ(σiϵβ′)=ρ(σi)ϵρ(β′) for every braid word β′ and ϵ=±1; and ρ of the empty word is id⁡. (The Artin representation on a free group, The braid group by Artin presentation.)

[F5]

Reduced words. The words xπ(1)xπ(2)⋯xπ(n) and x1x2⋯xn are reduced, and reduced words represent the same element only if they are equal (Reduced words form the free group on an alphabet, Free group on a set of generators).

Proof

technique · strong induction on the minimal total length $\ell(A)$
1.1F1F4F5base

Base case: ℓ(A)=0. If ℓ(A)=0, some representation has all Qi=1, so A(xi)=xπ(i) for every i; the boundary condition gives xπ(1)⋯xπ(n)=x1⋯xn, and by [F5] the two reduced words are equal, so π=id⁡ and A=id⁡=ρ(empty word). This covers n=0, where F0 is trivial, and n=1, where every peripheral-boundary-preserving automorphism is the identity.

1.2ih

Induction hypothesis. Fix m≥1 and assume that every peripheral-boundary-preserving automorphism A′ with ℓ(A′)<m equals ρ(β′) for some braid word β′.

1.3F1F2

A minimal representation has a qualifying junction. Let A have ℓ(A)=m>0 and choose a representation of total length m. The first case of [F2] would give all Qi empty, contrary to m>0. Thus its second case selects an adjacent pair whose junction cancellation deletes a middle letter.

2.1F3step 1.2step 1.3

Shortening. By [F3] there is a peripheral-boundary-preserving A′ with ℓ(A′)≤m−1, and A=A′∘ρ(σi)ϵ for ϵ=±1. The induction hypothesis gives A′=ρ(β′).

3.1F4step 2.1

Recovering a braid word. By [F4], A=ρ(β′)∘ρ(σi)ϵ=ρ(β′σiϵ). This is a word in the required generators and their inverses.

4.1step 1.1step 1.2step 3.1discharge-induction∎

Discharge. The base case 1.1 settles ℓ(A)=0, and steps 1.3, 2.1 and 3.1 deduce the case ℓ(A)=m from the induction hypothesis of step 1.2 for all smaller lengths; by induction on the nonnegative integer ℓ(A) every peripheral-boundary-preserving automorphism is ρ(β) for a braid word β of the displayed form. Every argument used the explicit normal form, the finite cancellation analysis and the displayed substitutions, so no choice principle is used.

Remarks

  • This is the sufficiency half of Artin's characterization Artin's characterization of the braid subgroup of Aut(F_n); the necessity half is the choice-free lemma Artin automorphisms permute meridian conjugacy classes and fix the boundary word.
  • The proof uses neither completeness nor faithfulness of ρ: the braid word is produced by the induction, not recognised by an injectivity statement. This is why the theorem is choice-free while the full characterization consumes AC through faithfulness.
  • Artin's subset variant uses the ordered sub-product and the corresponding braid generators for that subset of ends. It is not an assertion that the original adjacent generators suffice when nonconsecutive indices are retained.
TheoremStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-6.1-sol)Open item page →

Artin's characterization of the braid subgroup of Aut(F_n)

Statement

Assume AC. The image of the Artin representation ρ:Bn→Aut⁡(Fn) of The Artin representation on a free group is exactly the set of peripheral-boundary-preserving automorphisms of Peripheral-boundary-preserving automorphisms of F_n; moreover ρ is injective, so each peripheral-boundary-preserving automorphism is ρ(β) for a unique braid β.

Facts & Assumptions

Given: AC, the free group Fn=⟨x1,…,xn⟩, the Artin representation ρ:Bn→Aut⁡(Fn), and the set of peripheral-boundary-preserving automorphisms of Fn.

[F1]

Necessity. For every braid word β, the automorphism ρ(β) sends each generator to a conjugate of a generator and fixes the ordered product x1⋯xn; hence ρ(β) is peripheral-boundary-preserving. This direction is choice-free. (Artin automorphisms permute meridian conjugacy classes and fix the boundary word, Peripheral-boundary-preserving automorphisms of F_n.)

[F2]

Sufficiency. Every peripheral-boundary-preserving automorphism of Fn equals ρ(β) for some braid word β, which may be chosen as a product of the generators and their inverses; this direction is choice-free. (Every peripheral-boundary-preserving automorphism is an Artin automorphism.)

[F3]

Injectivity. Assume AC. The Artin representation ρ is injective: a braid word acts trivially on Fn only if it represents the trivial braid. (The Artin representation is faithful.)

Proof

technique · direct, assembling necessity, sufficiency and injectivity
1.1F1

The image is contained in the set of peripheral-boundary-preserving automorphisms. Let β be any braid word. By [F1], ρ(β)(xi) is conjugate to a generator for every i and ρ(β)(x1⋯xn)=x1⋯xn, so ρ(β) is peripheral-boundary-preserving. Hence im⁡ρ⊆{peripheral-boundary-preserving automorphisms}.

1.2F2

The set of peripheral-boundary-preserving automorphisms is contained in the image. Let A be peripheral-boundary-preserving. By [F2] there is a braid word β with A=ρ(β); hence A∈im⁡ρ.

1.3F3

Uniqueness of the braid. Assume ρ(β1)=ρ(β2) for braid words β1,β2. Then ρ(β1β2−1)=ρ(β1)ρ(β2)−1=id⁡ because ρ is a homomorphism, so by injectivity [F3] the word β1β2−1 represents the trivial braid, that is, β1=β2 in Bn. Hence each element of the image is ρ(β) for a unique braid β.

2.1step 1.1step 1.2

Equality of the two sets. Steps 1.1 and 1.2 give im⁡ρ={A∈Aut⁡(Fn):A is peripheral-boundary-preserving}.

3.1F1F2F3step 2.1step 1.3∎

Conclusion. Step 2.1 identifies the image with the set of peripheral-boundary-preserving automorphisms and step 1.3 shows that the representing braid is unique, which is the characterization of Artin. The necessity and sufficiency directions [F1] and [F2] are choice-free; AC is consumed exactly through the injectivity statement [F3], as declared in the statement. For n≤1 both Fn-automorphism conditions are checked directly on the trivial or infinite cyclic group and the same conclusions hold with the trivial braid group.

Remarks

  • For n≥2 the two conditions are independent: the peripheral condition alone does not suffice (cex-permuting-meridian-conjugacy-classes-without-fixing-the-boundary-word-is-not-artin), and together they characterize the image of ρ.
  • Combining the characterization with faithfulness gives that the braid group is isomorphic to the peripheral-boundary-preserving subgroup of Aut⁡(Fn); this is the form in which Artin's theorem is usually quoted.
CorollaryStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-6.1-sol)Open item page →

The Artin action solves the braid word problem

Statement

Assume AC. Given two words in σ1±1,…,σn−1±1, the braids they represent are equal if and only if the corresponding automorphisms of Fn agree on the generators x1,…,xn. Since reduced words in a free group are unique and effectively computable, the word problem in Bn is solvable. No choice principle beyond AC is used.

Facts & Assumptions

Given: AC, the Artin braid group Bn on σ1,…,σn−1, the free group Fn=⟨x1,…,xn⟩ with its reduced words, and two braid words β1,β2 in the generators and their inverses.

[F1]

The representation. ρ:Bn→Aut⁡(Fn) is a well-defined group homomorphism, computed on a braid word by composing the automorphisms ρ(σi)±1 attached to its letters; ρ of the empty word is the identity, and ρ(σi)(xi)=xixi+1xi−1,ρ(σi)(xi+1)=xi,ρ(σi)(xj)=xj (j∉{i,i+1}). (The Artin representation on a free group, Artin automorphisms of the free group.)

[F2]

Faithfulness. Assume AC. ρ is injective: a braid word acts trivially on Fn only if it represents the trivial element of Bn. (The Artin representation is faithful.)

[F3]

Free groups and their word problem. An endomorphism of Fn is determined by its values on the basis x1,…,xn; reduced words are unique representatives of elements of Fn, and free reduction decides whether a word represents the identity, effectively. (Free group on a set of generators, Reduced words form the free group on an alphabet, The word problem for a finitely generated free group is solvable by free reduction.)

Proof

technique · direct
1.1F1F2F3algebra

The comparison criterion. Let β1,β2 be braid words. If β1=β2 in Bn, then ρ(β1)=ρ(β2) because ρ is a well-defined function, so the two automorphisms agree on every element of Fn, in particular on the generators. Conversely, if ρ(β1) and ρ(β2) agree on the generators, then by [F3] they agree as endomorphisms of Fn; hence ρ(β1β2−1)=ρ(β1)ρ(β2)−1=id⁡ by [F1], and by faithfulness [F2] the braid word β1β2−1 represents the trivial element, that is, β1=β2 in Bn.

1.2F1F3construct

Effectivity of the comparison. The n images ρ(β)(xj) of a braid word β are computed letter by letter, substituting the finitely many displayed formulas of [F1] for the at most finitely many letters of β and freely reducing; by [F3] the result is a unique reduced word representing the image. Comparing two braid words therefore amounts to computing and comparing 2n reduced words, a finite and effective procedure.

2.1F2step 1.1step 1.2∎

Decision procedure and conclusion. Steps 1.1 and 1.2 give: the braids represented by β1 and β2 are equal if and only if the two automorphisms agree on x1,…,xn, and this comparison is decided by the halting free-reduction algorithm. Hence the word problem in Bn is solvable. The only use of AC is through the faithfulness theorem [F2]; the computation of the images and the free reduction are choice-free, so no choice principle beyond AC is used.

Remarks

  • This is Artin's original solution of the word problem, historically the first known; it is by no means efficient, but it is effective.
  • For n≤1 the group Bn is trivial and both sides are trivial, so the criterion is vacuous; the substantive statement is for n≥2.

5 · Examples, counterexamples and false statements

None yet.

Sources