betaFeedback

WorksMathematics

Prime Knots with Augmentation-Rank Gaps at Unbounded Bridge Number

Abstract

We construct explicit braid families containing infinitely many distinct hyperbolic prime knots of each bridge number b=5,6b=5,6 and each sufficiently large bb, with complex augmentation rank at most b−1b-1 and meridional rank bb. Alternating-group colorings force bb meridional generators, while two fixed meridian words let a local rank-one obstruction persist as the braid grows. An oriented diagram isotopy realizes the associated two-cusped exteriors as fillings of a single three-cusped exterior. Rigorous interval certificates establish hyperbolicity of that exterior and the two small-bridge exteriors used in the filling argument.

Introduction

How far can one get in determining the bridge number of a knot using rank-one meridian representations? For a knot K⊂S3K \subset S^3, the meridional rank mr⁡(K)\operatorname{mr}(K) is the least number of positive meridians generating its group, and the bridge number br⁡(K)\operatorname{br}(K) is the least number of maxima in a bridge presentation. The conventional complex augmentation rank ar⁡C(K)\operatorname{ar}_{\mathbb{C}}(K) uses the cord algebra with U=1U = 1 and meridian parameter different from 11. By Cornwell’s correspondence it is the maximum dimension of an irreducible complex representation in which a meridian is diagonalizable with eigenvalues 1,…,1,μ1,\ldots,1,\mu, where μ≠0,1\mu\ne0,1 [1 Theorem 1.2 and Definition 1.8]. Meridians are conjugate, so this condition holds for every meridian. The inequalities

ar⁡C(K)≤mr⁡(K)≤br⁡(K)\operatorname{ar}_{\mathbb{C}}(K) \le\operatorname{mr}(K) \le\operatorname{br}(K)

give two ways to bound bridge number from below. We construct prime knots of arbitrarily large bridge number for which the first bound falls short and the second is an equality.

Read braid words from left to right, from top to bottom, and write σi\sigma_i for the positive crossing at positions i,i+1i, i + 1. Let

U=σ1σ2σ3−2σ2σ3−2σ2σ12σ23σ3−1∈B4.U = \sigma_1\sigma_2\sigma_3^{-2}\sigma_2\sigma_3^{-2}\sigma_2\sigma_1^2\sigma_2^3\sigma_3^{-1} \in B_4.

For b≥5b \ge5, put d=b−2d = b - 2 and embed UU in BbB_b on the first four strands. Define

δb=σ2(σ3σ4σ3−1)σ5⋯σb−1,Kb,k=Uδb(d+1)(1+d2k)(k≥0).\delta_b = \sigma_2(\sigma_3\sigma_4\sigma_3^{-1})\sigma_5\cdots\sigma_{b-1}, \qquad K_{b,k} = U\delta_b^{(d+1)(1+d^2k)} \quad(k \ge0).

An empty product is the identity.

Theorem 1. For every integer b≥5b \ge5 and k≥0k \ge0, Kb,kK_{b,k} is a knot and

ar⁡C(Kb,k)≤b−1<mr⁡(Kb,k)=br⁡(Kb,k)=b.\operatorname{ar}_{\mathbb{C}}(K_{b,k}) \le b - 1 < \operatorname{mr}(K_{b,k}) = \operatorname{br}(K_{b,k}) = b.

For each b=5,6b = 5, 6 and each sufficiently large bb, all sufficiently large kk give hyperbolic prime knots, and infinitely many distinct knot types occur for that fixed bb.

Cornwell proved 2=arC⁡(K)<mr⁡(K)=32=\operatorname{arC}(K)<\operatorname{mr}(K)=3 for the four knots 8168_{16}, 8178_{17}, 109110_{91}, 109410_{94} and their mirrors. His rank-gap classification assumes crossing number at most ten and bridge number and braid index both equal to three, and its augmentation upper bounds use Gröbner bases of braid-specific equations [1 Corollary 1.12 and Theorem 5.3]. Theorem 1 gives infinite hyperbolic prime families at unbounded bridge number. Gao, Gu, Li and Wang prove arC⁡≤5<mr⁡=br⁡=6\operatorname{arC}\leq5<\operatorname{mr}=\operatorname{br}=6 for the untwisted Whitehead double of the square knot, using its satellite presentation for the augmentation bound and a finite quotient and cocycle calculation for the meridional bound [3 Theorem 1.3 and Section 6]. Here the rank-one obstruction persists under a family of braid tails, and the diagram isotopy produces hyperbolic examples without taking satellites or connected sums. The theorem gives an upper bound on augmentation rank. Its hyperbolicity cutoffs are existential, and the cutoff in kk is allowed to depend on bb.

The algebraic construction uses the same braid action in two ways. The braid after UU fixes the first and fourth meridians. After conjugating the labels on strands five through bb by the fourth label, this part of the braid acts by ordinary Hurwitz moves on the remaining entries. These moves preserve their ordered product. In an alternating group we can compute the order of this product explicitly and use it to close up a coloring that needs bb generators. In a rank-one representation, assuming that both the displacement vectors and their covectors are independent forces two matrix identities inside UU. Seven signed crossing relations then give a contradiction.

The two filling steps use different peripheral markings. The first filling uses the disk marking of a cusp of the fixed three-cusped exterior. The homeomorphism to the two-cusped parent is unmarked and transfers hyperbolicity. The second filling uses the original disk marking of the circle in that parent.

To obtain the two-cusped parent, put a circle around the strands carrying the Hurwitz moves. Varying kk amounts to filling that circle. The number of strands through it varies with bb, so a separate argument is needed to control the exteriors before filling. The diagram isotopy in Section 4 trades each extra threaded curl for a full twist between a knot arc and a circle arc. This identifies all the two-cusped exteriors with fillings of a single three-cusped manifold, to which we apply hyperbolic Dehn filling twice.

Alternating-group colorings

For any group, the Wirtinger rule at a positive braid crossing is T(a,c)=(c,c−1ac)T(a,c)=(c,c^{-1}ac); its inverse is T−1(a,c)=(aca−1,a)T^{-1}(a,c)=(aca^{-1},a). A tuple of labels at the top of a closed braid defines a homomorphism from the knot group exactly when the crossing rules return the tuple at the bottom. The image is generated by the top labels, because they generate the Wirtinger group.

Put g=σ3σ4σ3−1g=\sigma_{3}\sigma_{4}\sigma_{3}^{-1}. On the entries (a,C,e)(a,C,e) at positions 33, 44, 55, its action is

(CeC−1,C,e−1C−1aCe).(CeC^{-1},C,e^{-1}C^{-1}aCe).

In particular, gg fixes the fourth label and acts as TT on (a,CeC−1)(a,CeC^{-1}). The subgroup of BbB_b generated by σ2,σ5,…,σb−1\sigma_2,\sigma_5,\ldots,\sigma_{b-1} fixes entries one and four and acts by adjacent Hurwitz moves on the tuple

(M2,M3,CM5C−1,…,CMbC−1),C=M4.(1)(M_2,M_3,CM_5C^{-1},\ldots,CM_bC^{-1}),\qquad C=M_4. \tag*{(1)}

This follows for the last generators because simultaneous conjugation commutes with TT, and then holds for inverses as well. The product of the entries in (1) is invariant, since T(a,c)T(a,c) has product acac.

We use permutations composed from right to left. The top labels on 2b2b symbols are

x0=(01)(23),x1=(14)(23),x_0=(01)(23),\quad x_1=(14)(23),
x2=(05)(16),x3=(12)(67),x_2=(05)(16),\quad x_3=(12)(67),
x4=(08)(79),xj=(2j−2 2j)(2j−1 2j+1)(5≤j<b).x_4=(08)(79),\quad x_j=(2j-2\ 2j)(2j-1\ 2j+1)\quad(5\leq j<b).

The first four generate A8A_8. Indeed, x0x1x_0x_1 is a three-cycle on {0,1,4}\{0,1,4\}. By conjugating that cycle by x2x_2 and x3x_3, then conjugating the resulting cycles by x3x_3 and x0x_0, respectively, we obtain the additional supports

{4,5,6},{0,2,4},{4,5,7},{1,3,4}.\{4,5,6\},\quad\{0,2,4\},\quad\{4,5,7\},\quad\{1,3,4\}.

These cycles generate A8A_8. To see the enlargement at each step, an alternating group on an old set of at least three symbols together with a three-cycle on two old symbols and one new symbol generates the alternating group on the union. Conjugations and inverses give both orientations for every pair of old symbols, including when the old set has size three. If the cycle has just one old symbol, conjugate it by an old permutation moving that symbol. The product of the original cycle with the inverse conjugate gives a cycle on two old symbols and one new symbol, after which the other new symbol can also be added. The displayed supports can therefore be adjoined in order. Each xjx_j for j≥4j\geq4 consists of two transpositions (a u)(c v)(a\,u)(c\,v) with distinct old symbols a,ca,c and distinct new symbols u,vu,v. Conjugate it by an even old permutation fixing cc and moving aa, and multiply the two double transpositions. This gives a three-cycle on two old symbols and uu. Repeat with a,ua,u fixed and cc moved to adjoin vv. The full tuple generates A2bA_{2b}.

To check the coloring, let X=x1X=x_1, Y=x2Y=x_2, C=x3C=x_3. Applying the crossing rule through UU gives

(x0,a,h,C,x4,…,xb−1),a=(05)(14),h=(16)(23).(x_0,a,h,C,x_4,\ldots,x_{b-1}),\qquad a=(05)(14),\qquad h=(16)(23).

This four-strand calculation can also be read from the crossing relations in (2). With zi=Cxi+3C−1z_i=Cx_{i+3}C^{-1} for 1≤i≤d−21\leq i\leq d-2, the product of the middle tuple (a,h,z1,…,zd−2)(a,h,z_1,\ldots,z_{d-2}) is

p=(08 10 ⋯ 2b−2 5)(16 9 11 ⋯ 2b−1 4)(23).p=(08\,10\,\cdots\,2b-2\,5)(16\,9\,11\,\cdots\,2b-1\,4)(23).

In each displayed progression the terms run only up to the indicated endpoint. For b=5b=5 the product is the one computed below. For larger bb each additional factor inserts its two new symbols just before 55 and 44 in the respective cycles. The two long cycles have lengths dd and d+1d+1, so pp has order d(d+1)d(d+1). Reading the cycles gives

pXp−1=h,piYp−i=zi (1≤i≤d−2),pdYp−d=a.pXp^{-1}=h,\qquad p^iYp^{-i}=z_i\ (1\leq i\leq d-2),\qquad p^dYp^{-d}=a.

The adjacent moves in δb\delta_b act on (1) as the left shift that sends the first entry mm to p−1mpp^{-1}mp at the end. After dd shifts all labels have been conjugated by p−1p^{-1}. After d+1d+1 shifts the three displayed identities return the initial middle tuple (X,Y,z1,…,zd−2)(X,Y,z_1,\ldots,z_{d-2}). Adding d2(d+1)kd^2(d+1)k shifts has no effect because pp has order d(d+1)d(d+1).

Example. At b=5b=5 the middle tuple has length three and p=(085)(1694)(23)p=(085)(1694)(23). Four shifts close the coloring of U(σ2g)4U(\sigma_2g)^4, and a further 3636 shifts act trivially. This gives the exponent 4+36k4+36k on five strands.

The strand permutation of δb\delta_b is a dd-cycle on positions {2,3,5,…,b}\{2,3,5,\ldots,b\}; its exponent is 11 mod dd. The permutation of UU is (12)(34)(12)(34). The two transpositions insert the two omitted positions into that cycle, giving one knot component. Its group surjects onto A2bA_{2b} by the coloring just constructed. A double transposition moves two independent directions in the natural permutation representation over C\mathbb{C}. The following lower bound uses its two transposition edges. A set of at most b−1b-1 double transpositions has a support graph with at most 2b−22b-2 edges on 2b2b vertices. Each generator preserves the components of the graph, so such a set cannot generate a transitive group. The quotient forces mr⁡(Kb,k)≥b\operatorname{mr}(K_{b,k}) \ge b, since every positive meridian is conjugate to a top label. A closed bb-strand braid gives a bridge presentation with at most bb maxima, and the Wirtinger relations of a bridge presentation give one generating meridian per bridge. Thus mr⁡(Kb,k)=br⁡(Kb,k)=b\operatorname{mr}(K_{b,k}) = \operatorname{br}(K_{b,k}) = b.

The rank-one obstruction

We prove an upper bound for every knot obtained by following UU with a braid in the subgroup acting on (1)(1). That subgroup fixes the first and fourth meridian words. These two fixed positions suffice for the rank-one argument.

Lemma 2. Suppose that τ\tau belongs to ⟨σ2,g,σ5,…,σb−1⟩\langle\sigma_{2},g,\sigma_{5},\ldots,\sigma_{b-1}\rangle and Uτ^\widehat{U\tau} is a knot. Let its group act on a finite-dimensional space VV over a field so that each meridian has displacement of rank one. Write each meridian as M=I−ufM=I-uf, where u∈Vu\in V and f∈V∗f\in V^{*}. Then at least one of the spans of all the uu's and all the ff's has dimension at most b−1b-1, and both dimensions are at most bb.

Proof. Each of the two spans is already spanned by its bb top-strand vectors or covectors. The root span of the generating meridians is invariant under those generators and their inverses, and the covector span is invariant under right multiplication by the same matrices. Conjugating a generator therefore introduces neither a new root direction nor a new covector direction.

Suppose both spans have dimension bb. In particular both families of four vectors and covectors on the first four strands are separately independent. Set

μ=det⁡M≠0,f(u)=1−μ,M−1=I+μ−1uf.\mu=\det M\ne0,\qquad f(u)=1-\mu,\qquad M^{-1}=I+\mu^{-1}uf.

The first two identities hold for every meridian, with one common μ\mu. When Ma=I−uafaM_a=I-u_af_a, conjugation by a matrix JJ replaces its pair by (Jua,faJ−1)(Ju_a,f_aJ^{-1}). Two pairs for the same nonzero displacement differ by reciprocal scaling.

Here is the crossing trace through UU. We use arc subscripts on the matrices MiM_i in this proof. A row (o,a,c,ϵ)(o,a,c,\epsilon) represents Mc=MoϵMaMo−ϵM_c=M_o^{\epsilon}M_aM_o^{-\epsilon}. The input labels are (1,0,8,13)(1,0,8,13) and the output labels are (1,6,16,13)(1,6,16,13).

0∣012−1∣823−2∣31314+3∣1434+4∣489−5∣91415+6∣15910+7∣1045−8∣1001−9∣11011−10∣51112−11∣1256−12∣61213−13∣131516+(2)\begin{aligned} 0&\mid0\quad1\quad2\quad-\qquad1\mid8\quad2\quad3\quad-\\ 2&\mid3\quad13\quad14\quad+\qquad3\mid14\quad3\quad4\quad+\\ 4&\mid4\quad8\quad9\quad-\qquad5\mid9\quad14\quad15\quad+\\ 6&\mid15\quad9\quad10\quad+\qquad7\mid10\quad4\quad5\quad-\\ 8&\mid10\quad0\quad1\quad-\qquad9\mid1\quad10\quad11\quad-\\ 10&\mid5\quad11\quad12\quad-\qquad11\mid12\quad5\quad6\quad-\\ 12&\mid6\quad12\quad13\quad-\qquad13\mid13\quad15\quad16\quad+ \tag*{(2)} \end{aligned}

The repeated outer labels express closure, since τ\tau fixes the first and fourth entries. Each row is obtained by TT or T−1T^{-1} in the order of the letters in UU.

Put A=M2A=M_2, B=M8B=M_8, C=M13C=M_{13}, D=M0D=M_0. Replacing M1M_1 by A=D−1M1DA=D^{-1}M_1D changes the root by a multiple of the root of DD and the covector by a multiple of its covector, preserving both independent families. Let HH and FF denote the root and covector spans of A,B,CA,B,C, respectively. Both have dimension three, and in the pair (v,ν)(v,\nu) of DD one has v∉Hv \notin H and ν∉F\nu\notin F. Rows 1 through 7 and row 13 propagate pairs in H,FH,F.

Rows 0 and 8 give DAD−1=X−1DXDAD^{-1}=X^{-1}DX for X=M10X=M_{10}. If A,XA,X have pairs (a,f)(a,f) and (x,ξ)(x,\xi) in H,FH,F, comparing the pairs on both sides gives

a−ν(a)v=λ(v+μ−1ξ(v)x),f+μ−1f(v)ν=λ−1(ν−ν(x)ξ)\begin{aligned} a-\nu(a)v&=\lambda\left(v+\mu^{-1}\xi(v)x\right),\\ f+\mu^{-1}f(v)\nu&=\lambda^{-1}\left(\nu-\nu(x)\xi\right) \end{aligned}

for some λ≠0\lambda\ne0. The coefficients on v,νv,\nu give λ=−ν(a)\lambda=-\nu(a) and f(v)=μλ−1f(v)=\mu\lambda^{-1}. The other components give a=λμ−1ξ(v)xa=\lambda\mu^{-1}\xi(v)x and f=−λ−1ν(x)ξf=-\lambda^{-1}\nu(x)\xi. Applying ν\nu to the expression for aa gives ν(x)ξ(v)=−μ\nu(x)\xi(v)=-\mu. Thus af=xξaf=x\xi and X=AX=A. The relation is now DAD=ADADAD=ADA. Row 9, together with M1=DAD−1M_1=DAD^{-1}, gives M11=DM_{11}=D.

Next, rows 10–12 send (D,P)(D,P) to (P,N)(P,N), then (N,Q)(N,Q), then (Q,C)(Q,C), where P=M5P=M_5, N=M12N=M_{12} and Q=M6Q=M_6. Write the pair of PP as (p,π)(p,\pi) in H,FH,F, and put x1=π(v)x_1=\pi(v), y1=ν(p)y_1=\nu(p), h1=1+x1y1/μh_1=1+x_1y_1/\mu. Conjugating at each step gives

rootcovector
NNv+(x1/μ)pv+(x_1/\mu)pν−y1π\nu-y_1\pi
QQy1v+h1py_1v+h_1p−(x1/μ)ν+h1π-(x_1/\mu)\nu+h_1\pi
CCh1v+(x1/μ)(1+h1)ph_1v+(x_1/\mu)(1+h_1)ph1ν−y1(1+h1)πh_1\nu-y_1(1+h_1)\pi

Table 3.

For example N=P−1DPN=P^{-1}DP; the next row uses Q=N−1PNQ=N^{-1}PN. The last pair lies in H,FH,F, so h1=0h_1=0 and x1y1=−μx_1y_1=-\mu. Its remaining coefficients multiply to one, which gives P=CP=C.

Of the eight rows supported in H,FH,F, rows 1–7 suffice for the contradiction. They now satisfy the hypotheses of Lemma 3 and contain the three independent pairs of A,B,CA,B,C. This proves the span bound.

Lemma 3. Suppose the rank-one meridian matrices of common nonzero determinant μ\mu satisfy the seven signed relations in rows 1–7 of (2), with M10=M2M_{10}=M_2 and M5=M13M_5=M_{13}. Their root and covector spans cannot both have dimension three.

Proof. Reorder the crossings so that the propagation comes first:

(9,14,15,+),(15,9,2,+),(8,2,3,−),(14,3,4,+),(3,14,13,−),(4,9,8,+),(2,13,4,+).(9,14,15,+),\quad(15,9,2,+),\quad(8,2,3,-),\quad(14,3,4,+),\quad(3,14,13,-),\quad(4,9,8,+),\quad(2,13,4,+).

Here the rows with over-arcs 3, 4, 2 and output arcs 13, 8, 4, respectively, solve the corresponding prefix relations for the other under-arc. The first five crossings propagate all the matrices from M8,M14,M9M_8,M_{14},M_9. If both spans have dimension three, the corresponding pairs (u,f),(v,g0),(w,j)(u,f),(v,g_0),(w,j) are separately independent. Set

x=f(v),X=g0(u),y=f(w),Y=j(u),z=g0(w),Z=j(v),η=1−μ,x=f(v),\quad X=g_0(u),\quad y=f(w),\quad Y=j(u),\quad z=g_0(w),\quad Z=j(v),\quad\eta=1-\mu,
h=1+zZμ,t=−zxμ+hy,ℓ=ZX+hY,h=1+\frac{zZ}{\mu},\quad t=-\frac{zx}{\mu}+hy,\quad\ell=ZX+hY,
κ=tXμ+z(h−ημ),Λ=−ℓx+(η+h)Z.\kappa=\frac{tX}{\mu}+z\left(h-\frac{\eta}{\mu}\right),\quad\Lambda=-\ell x+(\eta+h)Z.

In the bases (u,v,w)(u,v,w) and (f,g0,j)(f,g_0,j), propagation gives

iiuiu_ifif_i
2(0,−z/μ,h)(0,-z/\mu,h)(0,Z,h)(0,Z,h)
3(t/μ,−z/μ,h)(t/\mu,-z/\mu,h)(−ℓ,Z,h)(-\ell,Z,h)
4(t/μ,−z/μ−κ,h)(t/\mu,-z/\mu-\kappa,h)(−ℓ,Z+Λ/μ,h)(-\ell,Z+\Lambda/\mu,h)
13(Λt/μ2,1−Λz/μ2,Λh/μ)(\Lambda t/\mu^2,1-\Lambda z/\mu^2,\Lambda h/\mu)(κℓ,1−κZ,−κh)(\kappa\ell,1-\kappa Z,-\kappa h)

Table 4.

Lemma 3. Suppose the rank-one meridian matrices of common nonzero determinant μ\mu satisfy the seven signed relations in rows 1–7 of (2), with M10=M2M_{10}=M_2 and M5=M13M_5=M_{13}. Their root and covector spans cannot both have dimension three.

Proof. Reorder the crossings so that the propagation comes first:

(9,14,15,+),(15,9,2,+),(8,2,3,−),(14,3,4,+),(3,14,13,−),(4,9,8,+),(2,13,4,+).(9,14,15,+),\quad(15,9,2,+),\quad(8,2,3,-),\quad(14,3,4,+),\quad(3,14,13,-),\quad(4,9,8,+),\quad(2,13,4,+).

Here the rows with over-arcs 3, 4, 2 and output arcs 13, 8, 4, respectively, solve the corresponding prefix relations for the other under-arc. The first five crossings propagate all the matrices from M8,M14,M9M_8,M_{14},M_9. If both spans have dimension three, the corresponding pairs (u,f),(v,g0),(w,j)(u,f),(v,g_0),(w,j) are separately independent. Set

x=f(v),X=g0(u),y=f(w),Y=j(u),z=g0(w),Z=j(v),η=1−μ,x=f(v),\quad X=g_0(u),\quad y=f(w),\quad Y=j(u),\quad z=g_0(w),\quad Z=j(v),\quad\eta=1-\mu,
h=1+zZμ,t=−zxμ+hy,ℓ=ZX+hY,h=1+\frac{zZ}{\mu},\quad t=-\frac{zx}{\mu}+hy,\quad\ell=ZX+hY,
κ=tXμ+z(h−ημ),Λ=−ℓx+(η+h)Z.\kappa=\frac{tX}{\mu}+z\left(h-\frac{\eta}{\mu}\right),\quad\Lambda=-\ell x+(\eta+h)Z.

In the bases (u,v,w)(u,v,w) and (f,g0,j)(f,g_0,j), propagation gives

iiuiu_ifif_i
2(0,−z/μ,h)(0,-z/\mu,h)(0,Z,h)(0,Z,h)
3(t/μ,−z/μ,h)(t/\mu,-z/\mu,h)(−ℓ,Z,h)(-\ell,Z,h)
4(t/μ,−z/μ−κ,h)(t/\mu,-z/\mu-\kappa,h)(−ℓ,Z+Λ/μ,h)(-\ell,Z+\Lambda/\mu,h)
13(Λt/μ2,1−Λz/μ2,Λh/μ)(\Lambda t/\mu^2,1-\Lambda z/\mu^2,\Lambda h/\mu)(κℓ,1−κZ,−κh)(\kappa\ell,1-\kappa Z,-\kappa h)

Table 5 (PDF p. 5).

:::*

For the first row, M15=M9M14M9−1M_{15}=M_{9}M_{14}M_{9}^{-1} has pair (v−Zw,g0+(z/μ)j)(v-Zw,g_{0}+(z/\mu)j), and M2=M15M9M15−1M_{2}=M_{15}M_{9}M_{15}^{-1}. The next two rows conjugate by M8−1M_{8}^{-1} and M14M_{14}, respectively, with t=f(u2)t=f(u_{2}), ℓ=f2(u)\ell=f_{2}(u) and κ=g0(u3)\kappa=g_{0}(u_{3}), Λ=f3(v)\Lambda=f_{3}(v). The last row uses M13=M3−1M14M3M_{13}=M_{3}^{-1}M_{14}M_{3}.

At the crossing (4,9,8,+)(4,9,8,+), put P=f4(w)P=f_{4}(w) and Q=j(u4)Q=j(u_{4}). The first and third coefficients of (M4w,jM4−1)=(γu,γ−1f)(M_{4}w,jM_{4}^{-1})=(\gamma u,\gamma^{-1}f) give

−Pt/μ=γ,Ph=1,−Qℓ/μ=γ−1,Qh/μ=−1.-Pt/\mu=\gamma,\qquad Ph=1,\qquad-Q\ell/\mu=\gamma^{-1},\qquad Qh/\mu=-1.

Thus P,Q,t,ℓ,hP,Q,t,\ell,h are nonzero. The middle coefficients give κ=−z/μ\kappa=-z/\mu and Λ=−μZ\Lambda=-\mu Z. At (2,13,4,+)(2,13,4,+) the M2M_{2} pair has zero first coefficients. Comparing the first coefficients of the pairs of M13M_{13} and M2−1M4M2M_{2}^{-1}M_{4}M_{2} therefore gives

Λt/μ2=βt/μ,κℓ=−β−1ℓ\Lambda t/\mu^{2}=\beta t/\mu,\qquad\kappa\ell=-\beta^{-1}\ell

with β≠0\beta\ne0. Cancelling t,ℓt,\ell yields zZ=κΛ=−μzZ=\kappa\Lambda=-\mu. This makes h=0h=0, contrary to Ph=1Ph=1.

For an irreducible representation in Cornwell’s correspondence, the root span is nonzero and invariant, hence equals VV. The common kernel of the covectors is the fixed subspace and is zero, so the covectors span V∗V^{*}. Lemma 2 bounds the dimension by b−1b-1 and proves the augmentation inequality in Theorem 1.

Hyperbolicity from two successive fillings

A circle around the moving strands

Set ρb=σb−1⋯σ4\rho_b=\sigma_{b-1}\cdots\sigma_{4} and θd=σ2⋯σb−2\theta_d=\sigma_{2}\cdots\sigma_{b-2}. The braid relation gives ρbδbρb−1=θd\rho_b\delta_b\rho_b^{-1}=\theta_d. For instance, conjugation of σ3\sigma_3 by σ4−1\sigma_4^{-1} gives σ3σ4σ3−1\sigma_3\sigma_4\sigma_3^{-1} when b=5b=5. In the step from bb to b+1b+1, the new letter σb−1\sigma_{b-1} of θd+1\theta_{d+1} is conjugated by ρb−1σb−1\rho_b^{-1}\sigma_b^{-1}, giving σb\sigma_b because σb−1σb−1σb=σb−1σbσb−1−1\sigma_b^{-1}\sigma_{b-1}\sigma_b=\sigma_{b-1}\sigma_b\sigma_{b-1}^{-1}. The earlier letters are unchanged by σb\sigma_b before conjugating by ρb−1\rho_b^{-1}. It follows that the two braid words

Qb=ρbUρb−1θdb+1,Qb′=ρbUρb−1θdQ_b=\rho_bU\rho_b^{-1}\theta_d^{b+1},\qquad Q'_b=\rho_bU\rho_b^{-1}\theta_d

are convenient starting points for a twist on the dd consecutive strands in positions 2,…,b−12,\ldots,b-1.

Add strand b+1b+1 and append

Pb=σbσb−1⋯σ3σ22σ3⋯σb−1σb−1.P_b=\sigma_b\sigma_{b-1}\cdots\sigma_3\sigma_2^2\sigma_3\cdots\sigma_{b-1}\sigma_b^{-1}.

The last strand closes to an unknot CC, bounding a disk pierced once by each strand in positions 2,…,b−12,\ldots,b-1 and missing the other strands. One way to see the disk is to factor PbP_b as A2,b+1⋯Ab−1,b+1A_{2,b+1}\cdots A_{b-1,b+1}, where

Ai,b+1=σb⋯σi+1σi2σi+1−1⋯σb−1.A_{i,b+1}=\sigma_b\cdots\sigma_{i+1}\sigma_i^2\sigma_{i+1}^{-1}\cdots\sigma_b^{-1}.

Each factor pushes the last puncture once around puncture ii. The stems in this ordered product run along the same side of the adjacent punctures, so their concatenation bounds an oval around precisely those punctures. Equivalently, in the closure of the last strand, its two opposite crossings across strand bb make a cancelling detour. The remaining oval passes over the selected strands on the outward trip and under them on the return. This gives the claimed disk in the slab of PbP_b, including the two outside positions. The knot component of QbPbQ_bP_b has the permutation already computed in Section 2; the same is true for Qb′Q'_b.

For a disk-bounding circle with this marking, filling along (1,−q)(1,-q) means killing μC−qλC\mu_C-q\lambda_C, where μC\mu_C is a positive meridian and λC\lambda_C the preferred disk longitude. A disk twist on the solid torus obtained by removing CC takes this slope to μC\mu_C. Localizing the twist to the slab inserts qq full twists on the disk-piercing strands. To check the sign, put w=a1⋯adw=a_1\cdots a_d for the selected meridians and cc for the circle meridian. Tracing the outward and return crossings of the oval gives the selected outputs c−1aicc^{-1}a_i c and circle output (wc)−1c(wc)(wc)^{-1}c(wc). The return has crossed the whole ordered tuple, which contributes ww. The two outside crossings conjugate the outside meridian by inverse powers of the initial and final circle labels and cancel after closure. The closure relation is [c,w]=1[c,w]=1, and λC\lambda_C is represented by ww, the boundary of the punctured disk. Filling gives c=wqc=w^q. By the Hurwitz formula, θdq\theta_d^q conjugates the whole selected tuple by w−1w^{-1}, so the geometric disk twist inserts θddq\theta_d^{dq} in our convention.

Let Mb=Ext⁡(QbPb^)M_b=\operatorname{Ext}(\widehat{Q_bP_b}) and Mb′=Ext⁡(Qb′Pb^)M'_b=\operatorname{Ext}(\widehat{Q'_bP_b}), where Ext⁡(L)\operatorname{Ext}(L) denotes the link exterior. The preceding disk twist identifies MbM_b with Mb′M'_b as exteriors without a fixed peripheral basis, since their knot braids differ by one full twist on the disk. In the original marking of MbM_b we have

Mb(C:(1,−d(d+1)k))≅Ext⁡(Kb,k).(3)M_b\left(C:(1,-d(d+1)k)\right)\cong\operatorname{Ext}(K_{b,k}). \tag*{(3)}

Indeed, the inserted power of θd\theta_d is d2(d+1)kd^2(d+1)k. Conjugating the resulting braid by ρb−1\rho_b^{-1} gives the word defining Kb,kK_{b,k}.

A single exterior for the first filling

Consider the six-strand braid

R=σ4σ3σ22σ3σ4σ5−1σ4Uσ4−1σ2σ3σ5R=\sigma_4\sigma_3\sigma_2^2\sigma_3\sigma_4\sigma_5^{-1}\sigma_4U\sigma_4^{-1}\sigma_2\sigma_3\sigma_5

and the seven-strand suffix D=σ6σ5σ42σ5σ6−1D=\sigma_6\sigma_5\sigma_4^2\sigma_5\sigma_6^{-1}. Set N=Ext⁡(RD^)N=\operatorname{Ext}(\widehat{RD}). The closure of RR has two components, a knot component containing UU and a circle. The fourth and fifth closure arcs lie on these different components. These assignments also follow by tracing the strand permutation of RR, which fixes position five and cycles the other five positions. The new last component D0D_0 bounds a disk around positions four and five, by the same oval construction as for PbP_b. Thus NN has three boundary tori, and filling the new circle along the disk-marked slope gives

N(D0:(1,−q))≅Ext⁡(Rσ42q^)(q∈Z).(4)N\left(D_0:(1,-q)\right)\cong\operatorname{Ext}\left(\widehat{R\sigma_4^{2q}}\right)\qquad(q\in\mathbb{Z}). \tag*{(4)}

Lemma 4. For every b≥5b\geq5, the oriented link Qb′Pb^\widehat{Q'_bP_b} is isotopic to Rσ42(b−5)^\widehat{R\sigma_4^{2(b-5)}}, with the knot and circle components identified.

Here is how the isotopy works. After braid conjugation and commutation,

σ3−1(Uδb)σ3=(σ3−1Uσ2σ3)σ4σ5⋯σb−1.\sigma_3^{-1}(U\delta_b)\sigma_3=(\sigma_3^{-1}U\sigma_2\sigma_3)\sigma_4\sigma_5\cdots\sigma_{b-1}.

On the knot component alone this is an iterated positive stabilization. In the link, the disk of CC meets the additional strands, so the corresponding curls cannot simply be removed. First cancel the detour of the circle and the two sides of the conjugating braid. The outer crossings then form a ladder along the circle. Slide each successive triangle through the already formed clasps by two Reidemeister III moves per clasp. At its end a Reidemeister III move exposes a curl, and a Reidemeister I move leaves one more two-crossing positive clasp. Repeating this leaves the b=5b=5 diagram with b−5b-5 clasps in the band of the fourth and fifth closure arcs of RR. Appendix A proves the isotopy by specifying the moves, the induction on the ladder, and the identification of that band.

By Lemma 4 and (4),

Mb≅N(D0:(1,−(b−5))) as exteriors.M_b \cong N(D_0:(1,-(b-5))) \text{ as exteriors.}

This homeomorphism is used to transfer hyperbolicity. The second filling (3) uses the original disk marking of MbM_b. Twisting around either circle can change the expression of the other circle’s longitude, so no common longitude basis is required for the two fillings.

Three finite hyperbolicity certificates

The computation certifies the complete hyperbolic structures of NN, M5M_5, M6M_6, where M5M_5, M6M_6 use QbQ_b, with its full disk twist, in the literal braid QbPb‾\overline{Q_bP_b}. Table 1 (PDF p. 8) records the sizes of the input diagrams and certified triangulations. The two direct tests for M5M_5, M6M_6 give explicit bridge numbers covered by the theorem regardless of the threshold obtained from NN.

ExteriorDiagram crossingsCuspsTetrahedra
NN32335
M5M_532231
M6M_643234

Table 1 (PDF p. 8). Literal braid diagrams and complete ideal triangulations for the three hyperbolicity certificates. Crossings are counted in the given projection.

Each exact input binds a planar-diagram code and its components to the braid, checking every crossing port and every closure identification. The exterior of that diagram is constructed in Spherogram 2.4.1 and SnapPy 3.3.2. Its decorated triangulation signature is checked against the retained one with the component marking, and the face pairings and gluing equations of the reloaded triangulation are checked. SnapPy under SageMath 10.9 then applies a Krawczyk interval test at 100 bits to both the fresh exterior and the retained triangulation. For the analytic criterion, a Krawczyk inclusion certifies a solution to a square subsystem of the shape equations in the interval box. The logarithmic edge and cusp equations are checked in the correct branches, and every shape has positive imaginary part. Together with the subsystem reduction, the positivity, gluing and completeness checks give a complete hyperbolic structure on the triangulated exterior [4 Sections 2–4]. Exact inputs, software pins, rational interval bounds and the replay procedure are supplied in the computational supplement. The proof uses these three finite certificates and the written diagram induction.

Proof of the prime-family conclusion

Since NN is complete and finite-volume hyperbolic, Thurston’s hyperbolic Dehn filling theorem [5 Theorem 5.8.2] applies to the D0D_0 cusp with the other two cusps unfilled. The slopes (1,−(b−5))(1,-(b-5)) escape every finite set as bb grows. Thus MbM_b is hyperbolic for every sufficiently large bb, as well as for b=5,6b=5,6 by the direct certificates. For any such bb, apply the theorem to MbM_b on the CC cusp. The slopes in (3) escape every finite set as kk grows, so all sufficiently large Kb,kK_{b,k} are hyperbolic. A hyperbolic knot is prime. Indeed, a composite knot group is the amalgam of the nontrivial summand groups over their meridian, and the two summand longitudes lie outside that amalgamating subgroup by peripheral injectivity. They commute with the common meridian and fail to commute with one another by amalgam normal form. The centralizer of a nonidentity element of a torsion-free discrete subgroup of PSL2(C)\mathrm{PSL}_2(\mathbb{C}) is abelian, as is seen by putting the element in parabolic or loxodromic normal form.

For a fixed such bb, the lengths ℓk\ell_k of the second filling slopes on an embedded horotorus tend to infinity, since they are the norms of μC−d(d+1)kλC\mu_C-d(d+1)k\lambda_C in a flat lattice with λC≠0\lambda_C \ne0. For sufficiently large kk the fillings are hyperbolic and ℓk>2π\ell_k>2\pi. The volume inequality of Futer, Kalfagianni and Purcell [2 Theorem 1.1] and strict volume decrease under proper hyperbolic filling [5 Theorem 6.5.6] give

(1−(2πℓk)2)3/2vol⁡(Mb)≤vol⁡(Ext⁡(Kb,k))<vol⁡(Mb).\left(1-\left(\frac{2\pi}{\ell_k}\right)^2\right)^{3/2}\operatorname{vol}(M_b)\le\operatorname{vol}(\operatorname{Ext}(K_{b,k}))<\operatorname{vol}(M_b).

The volumes converge to vol⁡(Mb)\operatorname{vol}(M_b), and by Mostow–Prasad rigidity each hyperbolic exterior type has one volume. A finite set of exterior types would have a maximum volume strictly below vol⁡(Mb)\operatorname{vol}(M_b). Thus there are infinitely many knot types for that bb. Together with the algebraic bounds, this proves Theorem 1.

Computational supplement. The accompanying supplement supplies the exact planar diagrams, decorated triangulations, face pairings, gluing equations, rational interval enclosures, and replay scripts for the hyperbolicity certificates in § 4.3. It also supplies the finite diagram moves and checks of the port conventions used in Appendix § 5. The algebraic and diagram inductions in the article establish the unrestricted parameter statements.

AI assistance and review. ChatGPT (OpenAI) assisted with mathematical arguments, literature checks, exposition, proof review and verification code.

The oriented diagram isotopy

We prove Lemma 4 in the spherical braid projection. The proof fixes the crossings of UU and keeps track of the two arcs where the new clasps are inserted.

Port convention and initial cancellations

A crossing has ports 0,1,2,30,1,2,3 in counterclockwise order. The even pair is the understrand and the odd pair the overstrand. A positive letter uses inputs (0,3)(0,3) and outputs (1,2)(1,2) in left-to-right order. A negative letter uses inputs (1,0)(1,0) and outputs (2,3)(2,3). On each strand, connect its last output to its first input to close the braid. Write X.jX.j for port jj of crossing XX and take port indices modulo four.

Put r=b−4r=b-4 and number the crossings of Qb′PbQ'_bP_b from zero. Cancel 3b+33b+3 with 5b5b, followed by ii with 2r+13−i2r+13-i for 0≤i<r0\le i<r, in increasing order. The first pair consists of the two crossings in the circle detour. In each pair (X,Z)(X,Z) the bigon has edges X.2X.2–Z.0Z.0 and X.3X.3–Z.3Z.3. The signs are opposite, with one branch over at both crossings. These conditions specify Reidemeister II cancellations.

The indexing of the uncancelled crossings and the neighbours in the successive bigons can be obtained as follows. Name the 1414 crossings of UU by Fj=r+jF_j=r+j. Use Yi=2b+6+iY_i=2b+6+i for the d−1d-1 crossings of θd\theta_d, and set uj=3b+4+ju_j=3b+4+j, vj=5b−1−jv_j=5b-1-j for 0≤j<d0\le j<d, the crossings on the descending and returning parts of PbP_b. The detour cancellation connects 0.30.3 to (2b+5).3(2b+5).3 and u0.3u_0.3 to v0.2v_0.2. In the resulting first bigon and at each later step ii, the four outside neighbours of X=iX=i, Z=2b+5−iZ=2b+5-i are

X.0vi.1X.1(i+1).3if i<r−1,F2.0if i=r−1Z.1(Z−1).3Z.2Yr−i.3\begin{array}{ll} X.0 & v_i.1\\ X.1 & (i+1).3\quad\text{if }i<r-1,\quad F_2.0\quad\text{if }i=r-1\\ Z.1 & (Z-1).3\\ Z.2 & Y_{r-i}.3 \end{array}

The cancellation connects vi.1v_i.1 to Yr−i.3Y_{r-i}.3 and wires the next bigon, with the last step joining F2.0F_2.0 to F13.3F_{13}.3. This describes the cancellations by induction. The listed neighbours are obtained from the port rule by following the consecutive crossings of ρb−1θd\rho_b^{-1}\theta_d and the return of PbP_b. In particular the pairs use no crossing from UU.

Let A=F12.1A=F_{12}.1, B=F13.2B=F_{13}.2, C=F0.3C=F_0.3, E=F1.3E=F_1.3. The edges of the remaining diagram outside UU are specified by their port neighbours in Table 2 (PDF p. 10). The YiY_i’s follow the consecutive crossings of θd\theta_d, with Yi.2Y_i.2 proceeding to Yi+1.0Y_{i+1}.0, or to u0.0u_0.0 at the end. The two circuits past the circle follow the uju_j’s in order and the vjv_j’s in reverse order. At the doubled σ2\sigma_2 the two crossings ud−1u_{d-1} and vd−1v_{d-1} meet directly. The rr joins from the cancelled bigons give the attachments from viv_i to Yr−iY_{r-i}. With the four unchanged attachments to UU these traces give the table. All crossings in it are positive.

CrossingPort 0Port 1Port 2Port 3
Y0Y_0AAud−1.0u_{d-1}.0Y1.0Y_1.0BB
YiY_i, 1≤i≤d−21\le i\le d-2Yi−1.2Y_{i-1}.2ud−1−i.0u_{d-1-i}.0Yi+1.0Y_{i+1}.0 or u0.0u_0.0vd−2−i.1v_{d-2-i}.1
u0u_0Yd−2.2Y_{d-2}.2u1.3u_1.3v0.3v_0.3v0.2v_0.2
uju_j, 1≤j≤d−21\le j\le d-2Yd−1−j.1Y_{d-1-j}.1uj+1.3u_{j+1}.3vj.3v_j.3uj−1.1u_{j-1}.1
ud−1u_{d-1}Y0.1Y_0.1vd−1.0v_{d-1}.0vd−1.3v_{d-1}.3ud−2.1u_{d-2}.1
v0v_0v1.2v_1.2Yd−2.3Y_{d-2}.3u0.3u_0.3u0.2u_0.2
vjv_j, 1≤j≤d−31\le j\le d-3vj+1.2v_{j+1}.2Yd−2−j.3Y_{d-2-j}.3vj−1.0v_{j-1}.0uj.2u_j.2
vd−2v_{d-2}vd−1.2v_{d-1}.2EEvd−3.0v_{d-3}.0ud−2.2u_{d-2}.2
vd−1v_{d-1}ud−1.1u_{d-1}.1CCvd−2.0v_{d-2}.0ud−1.2u_{d-1}.2

Table 2 (PDF p. 10). Port neighbours after the initial cancellations. The YiY_i port 2 neighbour is u0.0u_0.0 at i=d−2i=d-2. Every edge is reciprocal, including the ones meeting UU.

Two local moves and the induction

Write (X,a),(Y,c),(Z,e)(X,a),(Y,c),(Z,e) for the triangle with edges

X.(a+1)–Y.c,Y.(c+1)–Z.e,Z.(e+1)–X.a.X.(a+1)\text{--}Y.c,\qquad Y.(c+1)\text{--}Z.e,\qquad Z.(e+1)\text{--}X.a.

Consecutive ports make this a face in the oriented spherical rotation system. The projection is connected and these faces are empty disks. For the Reidemeister III moves below the edges have respectively two underports, two overports, and one of each. They are the bottom, top and middle branches required for the move.

First consider the triangle (u,3),(t,2),(v,1)(u,3),(t,2),(v,1) with an existing clasp attached, having edges u.1u.1--w.0w.0 and u.2u.2--w.3w.3. Use the six external endpoints in the first row of the table below, in the cyclic order (e0,e1,e4,e5,e3,e2)(e_0,e_1,e_4,e_5,e_3,e_2); the inputs are e0,e2,e3e_0,e_2,e_3. Apply Reidemeister III, first at this triangle and then at (w,3),(v,2),(t,1)(w,3),(v,2),(t,1). The clasp edges persist, and the other internal edges become w.1w.1–t.0t.0, w.2w.2–v.0v.0, t.3t.3–v.1v.1. Tracing the three strands between the six endpoints gives the second row:

e0e_0e1e_1e2e_2e3e_3e4e_4e5e_5
beforet.0t.0t.1t.1v.0v.0v.3v.3w.1w.1w.2w.2
afteru.0u.0t.1t.1w.3w.3v.3v.3t.2t.2u.2u.2

Table 6.

Thus the triangle can pass one clasp relative to all six external endpoints.

For the same triangle at the cap (Figure 1), use the extra edge u.2u.2–v.3v.3 and the first row below. The boundary order is (e0,e1,e2,e3)(e_0,e_1,e_2,e_3), with inputs e0,e3e_0,e_3. The first Reidemeister III move puts tt on the edge from u.2u.2 to v.3v.3, with u.2u.2–t.0t.0, t.1t.1–v.3v.3 and a monogon t.2t.2–t.3t.3. Remove the monogon by Reidemeister I. The two crossings left form a positive clasp with edges u.1u.1–v.0v.0, u.2u.2–v.3v.3 and the external attachments in the second row:

The signed cap move

Figure 1. The signed cap move. The black strand runs from e0e_0 to e1e_1, and the blue strand from e3e_3 to e2e_2. Gaps mark the underpasses. All crossings are positive. The type III move on u,t,vu,t,v exposes the curl at tt, and the type I move removes it while fixing the four boundary endpoints.

e0e_0e1e_1e2e_2e3e_3
beforet.0t.0t.1t.1u.1u.1v.0v.0
afteru.0u.0v.1v.1v.2v.2u.3u.3

Table 7.

In particular this is an ordinary positive full twist between the two incoming strands. Both local rewrites keep the cyclic boundary orders and orientations.

Now put q=d−3q=d-3. At stage ss, for 0≤s<q0\le s<q, set t=Yd−2−st=Y_{d-2-s}. There are already ss clasp pairs (uj,vj)(u_j,v_j) for j<sj<s. Each has its two clasp edges, and

vj.1–uj+1.0,vj.2–uj+1.3.v_{j}.1\text{--}u_{j+1}.0,\qquad v_{j}.2\text{--}u_{j+1}.3.

The moving triangle begins at (u0,3),(t,2),(vs,1)(u_0,3),(t,2),(v_s,1). At s=0s=0 the triangle and cap are in Table 2 (PDF p. 10). At each uju_j for j<sj<s, use the first local rewrite with w=vjw=v_j, v=vsv=v_s. The two former attachments of ww to uj+1u_{j+1} now attach t.2t.2 and vs.2v_s.2 to uj+1u_{j+1}, giving the triangle at uj+1u_{j+1}. This leaves us.2u_s.2–vs.3v_s.3 in place. At usu_s, the cap rewrite removes tt and gives the clasp (us,vs)(u_s,v_s).

To see the next stage, track the four ends of the unchanged part of the ladder. At the start of stage ss, t.0t.0 is attached to Yd−3−s.2Y_{d-3-s}.2 and vs.0v_s.0 to vs+1.2v_{s+1}.2. The first rewrite sends those attachments to u0.0u_0.0 and u0.3u_0.3, whether it is at a clasp or at the cap. Later moves in the stage keep them there. The cap rewires t.1t.1–us+1.0u_{s+1}.0 and us.1u_s.1–us+1.3u_{s+1}.3 to the two new edges from vs.1,vs.2v_s.1,v_s.2. The next triangle and cap therefore satisfy the same hypotheses. This proves the induction for every dd.

At its end Y2,…,Yd−2Y_2,\ldots,Y_{d-2} have been deleted. The diagram consists of the d=3d=3 ladder with indices Y0,Y1Y_0,Y_1 and uq,uq+1,uq+2,vq,vq+1,vq+2u_q,u_{q+1},u_{q+2},v_q,v_{q+1},v_{q+2}, and qq clasp pairs inserted between the two arcs Y1.2Y_1.2–uq.0u_q.0 and vq.2v_q.2–uq.3u_q.3. The first endpoint of each arc now leads into the first clasp (or directly to uqu_q if q=0q=0). The two edges from vjv_j to uj+1u_{j+1} then lead to the next clasp or to the base ladder. All other edges of the base ladder remain as specified in the table, and the crossings of UU are fixed.

Identifying the insertion band in RR

Number the crossings of the literal word RR from zero. Its fourth and fifth closure arcs run from 24.2 to 0.0 and from 25.1 to 0.3. Cut those two arcs just before crossing zero, leaving a named incoming and outgoing end for each arc. The Reidemeister II pairs (6, 25) and (7, 22) cancel with the four ends open. For the first pair the bigon edges are 6.0–25.2, 6.3–25.3. For the second they are 7.2–22.0, 7.3–22.3 after the first cancellation. The two incoming ends and the fourth outgoing end stay attached to their ports. The fifth outgoing end moves from 25.1 to 5.2. Neither cancellation meets the slab at the cut. The resulting 22-crossing projection, with the arcs reclosed, is the d=3d=3 ladder. The port bijection has no rotations and is given by

FjF_jY0Y_0Y1Y_1u0u_0u1u_1u2u_2v0v_0v1v_1v2v_2
crossing of RR8+j8+j2324012543

Table 8.

This is verified by the braid port rule, including the edges of UU and the four attachments in Table 2 (PDF p. 10). The cut arcs correspond precisely to Y1.2Y_1.2–u0.0u_0.0 and v0.2v_0.2–u0.3u_0.3. The marked ends identify the actual fourth/fifth strand band before the first crossing of RR, including both boundary orientations. In the closed braid a positive full twist in that band can be written at the end of RR. Each clasp from the induction has the port pairing of σ42\sigma_4^2 in this band, so the resulting projection is the twice-reduced diagram of Rσ42q^\widehat{R\sigma_4^{2q}}. The oriented moves preserve the component containing UU and the other component. Since q=b−5q=b-5, this proves Lemma 4.

References

  1. [1]C. R. Cornwell, KCH representations, augmentations, and A-polynomials, J. Symplectic Geom. 15 (2017), 983–1017. doi:10.4310/JSG.2017.v15.n4.a2.DOI
  2. [2]D. Futer, E. Kalfagianni, and J. S. Purcell, Dehn filling, volume, and the Jones polynomial, J. Differential Geom. 78 (2008), 429–464. doi:10.4310/jdg/1207834551.DOI
  3. [3]H. Gao, S. Gu, Z. Li, and J. Wang, Meridional ranks of iterated Whitehead doubles, preprint, 2026. arXiv:2611.15673v1.arxiv.org/abs/2611.15673
  4. [4]N. Hoffman, K. Ichihara, M. Kashiwagi, H. Masai, S. Oishi, and A. Takayasu, Verified computations for hyperbolic 3-manifolds, Exp. Math. 25 (2016), 66–78. doi:10.1080/10586458.2015.1029599.DOI
  5. [5]W. P. Thurston, The Geometry and Topology of Three-Manifolds, Princeton lecture notes, electronic edition 1.1, 2002. Electronic edition.

Paper details

vlnc:W_3b6xpjte
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
CC BY 4.0
Usage

views · 10

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Mathematics

OpenAI ChatGPT, OpenAI Codex

View statement
Looking for related papers…
Contents