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.

Colored Jones and the volume conjecture

1 · Prerequisites

2 · Logical flowchart

3 · Definitions, theorems and proofs

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

Normalized colored Jones sequence

Definition

Let A be an indeterminate, put q=A4, qK=A2, and qL=A−2=qK−1, and work over F=Q(A). An oriented knot in S3 means a smooth embedded circle with an orientation, considered up to orientation-preserving ambient isotopy. For an integer r, put [r]=qKr−qK−rqK−qK−1,[m]!=∏r=1m[r](m≥1),[0]!=1. For each N≥1, put qN=exp⁡(2πi/N). For each integer N≥1, let VN have basis v0,…,vN−1 and define the UqL(sl2) action in the library coproduct convention by KLvj=qLN−1−2jvj,Evj=[N−j]vj−1,Fvj=[j+1]vj+1, where v−1=vN=0. In the universal R-matrix formula use qK and Hvj=(N−1−2j)vj; on VN⊗VN its action is the finite sum RN=qKH⊗H/2∑r=0N−1qKr(r−1)/2(qK−qK−1)r[r]! Er⊗Fr, and the positive crossing is cN=PRN, where P(x⊗y)=y⊗x. This is an irreducible module of dimension N. Equip these matrices with the Kauffman-bracket half-ribbon data: the twist matrix is the scalar θN=λNI with λN=(−1)N−1AN2−1, and the matrix GN=(−1)N−1diag⁡(A2(N−1−2j))j=0N−1 is the pivotal comparison used in the closure trace. The resulting generic quantum dimension is dN=Tr⁡(GN)=(−1)N−1A2N−A−2NA2−A−2. Use the contragredient left-dual action (x⋅f)(v)=f(S(x)v) on VN∗, with evaluation ev⁡(f⊗v)=f(v) and coevaluation 1↦∑j=0N−1vj⊗vj∗. The ambient category is the F-linear category generated by the modules VN for all N≥1 under finite tensor products, contragredient duals, finite direct sums and images of module-idempotents, whose morphisms are module homomorphisms, and whose tensor-product action is induced by the stated Hopf coproduct; its tensor unit is F with the trivial action, so its tensor-unit endomorphism ring is F. These matrix data satisfy the ribbon-category axioms: braiding and inverse braiding, both duality snakes, monoidal pivotal comparison, balancing and dual compatibility of twist. Assume the Axiom of Choice and Countable Choice for the framed-tangle and Markov constructions. An oriented knot K⊂S3 presented as the closure of an n-strand braid β has generic normalized value JNgen(K;q)=λN−w(β)Tr⁡(GN⊗nρN(β))dN∈F, where, for a word β=σi1ε1⋯σimεm with εj∈{1,−1}, w(β):=∑j=1mεj, and ρN(β) is obtained by replacing each positive braid generator by cN on the corresponding adjacent tensor factors and each inverse generator by cN−1, then composing in word order. This quotient is an integral Laurent polynomial in A4. Define the normalized colored Jones sequence by the unique JN(K;q)∈Z[q,q−1] satisfying JN(K;A4)=JNgen(K;A4). Its root value JN(K;qN) is obtained by substituting into this Laurent polynomial. The variable transport to the ordinary Jones convention is t=q−1=A−4.

Facts & Assumptions

Given: An integer N≥1, the Axiom of Choice and Countable Choice, the generic module and matrices from the Definition, an oriented knot K, and a braid word β whose closure represents K.

[F1]

The library presentation has KLEKL−1=qL2E, KLFKL−1=qL−2F, and EF−FE=(KL−KL−1)/(qL−qL−1) (The Drinfeld-Jimbo quantized enveloping algebra by generators and relations).

[F2]

The library coproduct is Δ(E)=E⊗KL−1+1⊗E and Δ(F)=F⊗1+KL⊗F (The Drinfeld–Jimbo formulas define a Hopf algebra).

[F3]

A ribbon category has a braiding, chosen duals, and a twist satisfying the balancing and dual-compatibility identities (Braiding, Left dual and right dual object, Twist and ribbon structure).

[F4]

For an absolutely simple color with scalar twist λI, the generic framed trace corrected by λ−w(β) is invariant under oriented unframed Markov equivalence, under the stated Axiom of Choice (Scalar twist correction removes the framing).

[F5]

The framed colored-link value is the ribbon-tangle evaluation in End⁡C(1) (Colored framed-link evaluation from a ribbon category). For an X-colored closed braid, its categorical value is tn(β)=Tr⁡L(jX⊗nρn(β)) (The ribbon evaluation of an X-colored closed braid) and equals the tangle evaluation of its blackboard-framed closure (The ribbon trace equals the framed-closure evaluation).

[F6]

Absolute simplicity means End⁡(VN)=FI (Absolutely simple objects).

[F7]

The finite matrices satisfy all ribbon identities for every N≥1 and their pivotal trace of the identity is dN (All generic colored Jones matrices satisfy the ribbon identities ↗).

[F8]

The normalized generic quotient for every knot and color belongs to Z[A4,A−4] (The normalized generic colored Jones quotient is an integral Laurent polynomial ↗).

[A2]

The Axiom of Choice supplies a choice function for every family of nonempty sets (The Axiom of Choice).

[A3]

Countable choice supplies a choice function for every sequence of nonempty sets (The Axiom of Countable Choice (ACω)).

Proof

technique · direct

Given: The hypotheses in the Definition.

1.1F1givenalgebra

The diagonal weights give KLEKL−1vj=qL2Evj and KLFKL−1vj=qL−2Fvj. For the commutator, EFvj−FEvj=([j+1][N−j−1]−[N−j][j])vj=[N−1−2j]vj; the last equality follows by expanding the two quantum-number products over qK−qK−1. Since [r]qK=[r]qL, this is (KL−KL−1)(qL−qL−1)−1vj. The generators therefore satisfy the defining sl2 relations.

1.2F6givenalgebra

The eigenvalues qLN−1−2j of KL are pairwise distinct in F. Any module endomorphism is therefore diagonal in the given basis; commuting with E, whose successive coefficients [N−j] are nonzero in F, forces all diagonal entries to be equal. Thus End⁡UqL(sl2)(VN)=FI and the color is absolutely simple by [F6].

1.3givenalgebra

If N=1, VN is one-dimensional and irreducible. For N>1, let W be a nonzero submodule and choose x=∑jcjvj∈W nonzero. The eigenvalues of KL are distinct, so the polynomial spectral projection for any j with cj≠0 maps x to cjvj; hence vj∈W. Repeated application of E gives v0∈W, since every coefficient [N−k] encountered is nonzero. Repeated application of F to v0 gives each vk because the coefficients [k] are nonzero. Thus W=VN, proving irreducibility.

1.4F2F3F5F7givenalgebra

The displayed sum for dN is a geometric sum, so dN=(−1)N−1[N]. Its numerator A2N−A−2N is a nonzero Laurent polynomial and its denominator A2−A−2 is nonzero in F; hence the generic normalization is defined. The Hopf coproduct [F2] supplies the tensor-power action used in ρN(β). By the braiding, dual, and ribbon axioms [F3] and the all-color ribbon identities [F7], the comparison on VN⊗n is GN⊗n. The basis coevaluation and evaluation in the left categorical trace [F5] then give the ordinary matrix trace Tr⁡(GN⊗nρN(β)), which is the scalar of the framed closure.

2.1A2A3F4F6F7step 1.2step 1.4given

By [F4], [F7], and [A2], λN−w(β)tN(β) is unchanged by every conjugation and Markov stabilization, since VN is absolutely simple and its specified twist scalar is nonzero. Countable choice [A3] supplies the evaluator's hypothesis. Dividing by the fixed nonzero dN preserves that equality, so the displayed generic value is independent of the braid representative.

2.2F5step 1.4givenalgebra

The unknot is represented by the one-strand identity braid, whose exponent sum is zero and whose pivotal trace is Tr⁡(GN)=dN. Hence JNgen(◯;q)=1. For N≥2, at qN=e2πi/N choose AN=eπi/(2N); then AN4=qN and AN2−AN−2≠0, while AN2N−AN−2N=eπi−e−πi=0. Thus dN(qN)=0: the generic quotient cannot be evaluated there by dividing by dN.

3.1A2A3F8step 2.1step 2.2givenalgebra∎

Apply [F8] to the given knot-closing braid and color under [A2] and [A3]. The generic quotient therefore has a unique integral Laurent representative in q=A4. Substitution into that finite Laurent sum is defined for every nonzero complex q, including qN; it does not divide by the specialized quantum dimension. Together with steps 2.1 and 2.2, this proves the stated representative independence, unknot normalization and root-evaluation convention.

Remarks

The all-color ribbon identities are proved by the finite-series interpolation argument in the first well-definedness supplier. The second proves integral Laurentness by cutting the knot into an integral scalar endomorphism and then proving invariance under A↦iA. Thus root evaluation uses the resulting Laurent polynomial, even though the generic quantum dimension vanishes at the specified root for every N≥2.

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

Colored Jones evaluation from ribbon data

Definition

For the identification of the output with the normalized colored Jones knot invariant and its integral Laurent representative, assume the Axiom of Choice and Countable Choice. The finite fixed-braid rational operations below use only the supplied matrix data.

Input an integer N≥1, an integer n≥1, a finite word β=σi1ϵ1⋯σimϵm with ϵj∈{1,−1} and 1≤ij<n, whose closure joins each bottom endpoint to the top endpoint in the same position outside the braid cylinder and has one component, and the generic matrix ribbon data for the color VN defined above in this pair. The coefficient field is F=Q(A), whose elements are encoded as exact rational functions and whose field operations, equality test, and inversion of a nonzero element terminate. The output is the generic rational value JNgen(β^;A4)∈F. The procedure is:

  1. Form the positive crossing matrix cN=PRN from the finite universal-R sum in the color definition. The sum terminates at r=N−1 because EN=FN=0; its inverse is available because cN is the braiding in the proved ribbon data.

  2. Form the Nn×Nn pivotal matrix JW=GN⊗n on W=VN⊗n by finite tensor products; the prescribed pivotal comparison is monoidal. Invoke the finite colored-braid matrix evaluator with strand count n, the word β in composition order, the constant color tuple (VN,…,VN), the positive matrix cN, its inverse, and JW, using the prescribed duality and twist data. Record its exact output t=Tr⁡(JWρN(β)).

  3. Compute the exponent sum w(β)=∑ε and the generic quantum dimension dN.

  4. Return λN−w(β)t/dN in F. Reject a malformed braid word, matrix data differing from the prescribed color data, or an input with dN=0 in the coefficient field. This algorithm does not substitute a root of unity into the generic quotient; root evaluation is a separate operation on a proved Laurent-polynomial representative.

The normalized-sequence Laurentness result identifies this rational output with a unique JN(β^;q)∈Z[q,q−1] under q=A4. Root evaluation is a separate finite operation: given q0≠0 and the representative JN(β^;q)=∑kckqk, return ∑kckq0k.

The positive generator convention is the braid-height convention used by the matrix cN: strand i+1 passes over strand i.

ii+1i+1i

The continuous strand is the overpassing strand. The diagram records the chosen positive generator only; the algorithm and any proof use the explicit matrix and ribbon identities, not the drawing.

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

All generic colored Jones matrices satisfy the ribbon identities

Statement

Let A be indeterminate, F=Q(A), qK=A2, and qL=A−2. For every integer N≥1, the concrete module, finite R series, duality, pivotal comparison GN, and twist λN in the normalized colored Jones definition are admissible ribbon data. More precisely, take the F-linear category generated by all those modules under finite tensor products, chosen contragredient duals, finite direct sums, and images of module-idempotents, with all module maps as morphisms. Its braiding on weight vectors is the finite series RX,Y=DX,Y∑r≥0qKr(r−1)/2(qK−qK−1)r[r]!EXr⊗FYr,DX,Y(xh⊗yk)=Ahkxh⊗yk. The sum is finite on each pair. Its pivotal comparison on weight h is (−1)hqKh, and its twist on VN is (−1)N−1AN2−1I. These give natural invertible braidings with both hexagons, both duality snakes, the balancing identity and dual compatibility of twist. In particular all colors N, rather than a fixed bounded range of colors, are covered.

Facts & Assumptions

Given: The generic matrices and the category described in the Statement.

[F1]

The normalized color definition gives KL=qLH, Evj=[N−j]vj−1, Fvj=[j+1]vj+1, and the library coproduct Δ(E)=E⊗KL−1+1⊗E, Δ(F)=F⊗1+KL⊗F (Normalized colored Jones sequence).

[F2]

For every integer ℓ≥3, the full-weight divided-power category at q=eπi/ℓ, s=eπi/(2ℓ), has the finite R series, positive-K pivotal comparison and full ribbon identities proved in The corrected finite rank-one R series gives the full tilting ribbon structure. Its proof establishes the finite tensor hexagons, naturality on full module maps and summands, and the ribbon condition. Its final paragraph gives twist sa(a+2) on the simple Δ(a) for a<ℓ.

[F3]

For 0≤a<ℓ, the string module Δ(a) is simple and tilting, and its dual and finite tensor products are tilting (Outside-alcove rank-one tiltings have zero pivotal dimension, in its below-alcove simplicity argument, and the tilting category in The specified rank-one divided-power tilting category).

[F4]

The chosen duality, braiding and ribbon axioms are those of Left dual and right dual object, Braiding and Twist and ribbon structure. The Drinfeld morphism is a natural isomorphism with its proved tensor defect (A braided rigid category has a Drinfeld morphism).

Proof

technique · direct

Given: The data in the Statement.

1.1F1givenalgebra

Put K=KL−1. Then the generator relations and coproduct in [F1] become exactly KEK−1=qK2E, KFK−1=qK−2F, [E,F]=(K−K−1)/(qK−qK−1), Δ(E)=E⊗K+1⊗E, Δ(F)=F⊗1+K−1⊗F. The antipodes also agree: S(E)=−EK−1, S(F)=−KF. Thus this is a change of parameter and Cartan generator, not an assumption equating the two parameters. Every weight is an integer, and E,F are nilpotent on every fixed generated object by its finite weight range. The finite R series and all dual matrices are therefore rational matrices in A.

2.1F1F2F3step 1.1algebra

Fix finitely many objects, module maps, and a single proposed ribbon identity involving them. Realize every image of an idempotent inside its ambient finite tensor sum. There are finitely many rational entries, denominators, weights and matrix sizes in this identity. Specialize A=sℓ=eπi/(2ℓ) for integers ℓ greater than every color, every weight-range width and every divided-power index which can act nontrivially. Exclude the finitely many zeros of the finitely many nonzero denominator polynomials. Every color specializes to Δ(N−1) in [F3]; ordinary powers divided by [r]! specialize to its divided powers for all possibly nonzero indices, since those indices are below ℓ. Larger divided powers are zero by weight range. A generic module map preserves weights, because the generic K eigenvalues distinguish them, and commutes with these divided powers and the scalar toral characters. It is consequently a full divided-power module map after specialization, not merely a small-quantum-group map. An idempotent specializes to an idempotent module map, whose image is a tilting summand.

2.2F1F4step 1.1algebra

The contragredient action and ordinary evaluation and coevaluation in the color definition are module maps by the antipode identities: the action on their composites uses m(S⊗1)Δ=m(1⊗S)Δ=ηε. Their vector-space contractions send each basis vector or dual basis vector to itself, proving both snakes. Tensor, sum and idempotent duals use the corresponding transpose maps. Therefore the whole generated category is rigid. The unsigned pivotal comparison is jX+(x)(f)=f(Kx): S2=Ad⁡K, and K is group-like, so it is a natural monoidal module isomorphism to the double dual.

3.1F2F3step 2.1algebra

At each such specialization the finite generic series becomes exactly the one in [F2]: replacing ordinary powers by divided powers changes its coefficient to qKr(r−1)/2(qK−qK−1)r[r]!=qKr(r+1)/2(1−qK−2)r[r]!. The weight factor is Ahk=sℓhk. Thus the specialized series is a full natural braiding on all the chosen objects and maps, with both hexagons. Each entry of its generic intertwining, naturality, or hexagon equation is a rational function vanishing at infinitely many distinct sℓ. Its numerator polynomial has infinitely many roots and hence is zero. These identities therefore hold generically. Invertibility follows as well: the nilpotent series has constant term 1, hence a finite geometric-series inverse on each pair, and D is an invertible diagonal matrix. Idempotent restrictions and their inverses are compatible by naturality. This proves braiding on the full generated category.

4.1F2F4step 3.1step 2.2algebra

Let u be [F4]'s Drinfeld isomorphism, formed with the just-proved generic braiding and duality, and put θ+=u−1j+. Its tensor defect gives the balancing identity. Every matrix entry of its dual-compatibility equation is rational in A. Upon each sufficiently large specialization in step 2.1 it is precisely [F2]'s ribbon twist, so the equation holds by the same infinite-root argument as step 3.1. On VN, its specialized matrix is sℓ(N−1)(N+1)I by [F2]; infinite-root interpolation therefore gives θVN+=AN2−1I generically. This establishes the unsigned ribbon structure without importing an unproved generic universal-R assertion.

5.1F1F4step 3.1step 2.2step 4.1algebra∎

On a weight-h vector define pX=(−1)h. This is a module map because E,F change weight by 2; it is natural because module maps preserve weights, monoidal because weights add, and involutive. On dual weights −h it satisfies pX∗=(pX)∗, and p commutes with the braiding. Set j=pj+ and θ=pθ+. Substitution into the unsigned balancing and dual-compatibility equations proves the corresponding equations for θ; monoidality of p proves that j is a pivotal comparison. Since all weights of VN have parity N−1, its pivotal matrix is GN=(−1)N−1diag⁡(A2(N−1−2j)) and its twist is exactly λN=(−1)N−1AN2−1. The trace of the identity is (−1)N−1∑j=0N−1A2(N−1−2j)=dN. Every generic ribbon assertion required in the Statement has now been proved, and N was arbitrary.

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

The normalized generic colored Jones quotient is an integral Laurent polynomial

Statement

Assume the Axiom of Choice and Countable Choice. For every integer N≥1 and every finite braid word β on b≥1 strands whose closure is a knot, the normalized generic quotient λN−w(β)Tr⁡(GN⊗bρN(β))dN belongs to Z[A4,A−4]. Consequently there is a unique JN(K;q)∈Z[q,q−1] whose substitution q=A4 equals that quotient. It is independent of the braid representative, has JN(◯;q)=1, and agrees with the normalized colored Jones convention of Murakami’s explicit matrix definition in the variable q. Its value at every nonzero complex q, in particular qN=e2πi/N, means evaluation of this Laurent polynomial; it never means division by the specialized quantum dimension.

Facts & Assumptions

Given: Integers N≥1, b≥1, the knot-closing braid word β, and the two choice assumptions.

[F1]

The generic matrices, nonzero dN, scalar λN, absolute simplicity of VN, representative independence under the choice hypotheses and unknot normalization are established in Normalized colored Jones sequence. Their admissibility is proved, for every N, in All generic colored Jones matrices satisfy the ribbon identities.

[F2]

Symmetric Gaussian quotients [mr]qK are integral Laurent polynomials in qK, and their Gauss product and alternating-sum identities hold (The quantum Pascal recurrences, the Gauss product formula and Gaussian integrality).

[F3]

Under Countable Choice a colored framed tangle is evaluated by its ribbon matrices; compositions, tensor products and closures agree with their corresponding contractions (Colored framed-link evaluation from a ribbon category, A ribbon object defines a unique framed-tangle evaluation functor, The ribbon trace equals the framed-closure evaluation). Absolute simplicity says that every color endomorphism is a scalar (Absolutely simple objects).

[A1]

The Axiom of Choice and Countable Choice (The Axiom of Choice, The Axiom of Countable Choice (ACω)).

Proof

technique · direct

Given: The hypotheses in the Statement. Put a=N−1, z=qK−qK−1 and R0=Z[A,A−1].

1.1F1F2givenalgebra

On the displayed color basis, Er/[r]! sends vi to [a−i+rr]qKvi−r, with zero outside the index range, while Frvj=∏s=1r[j+s]vj+r. By [F2] each coefficient in the finite R series therefore belongs to R0, including the weight factor Ahk. Its inverse is (∑r≥0(−1)rqK−r(r−1)/2zrEr⊗Fr/[r]!)D−1, again a finite integral matrix by the same argument. To check the inverse formula, the coefficient of (E⊗F)m in the product of the two nilpotent series is, after multiplication by [m]!/zm, ∑r=0m(−1)m−rqKr(r−1)/2−(m−r)(m−r−1)/2[mr]qK. Its exponent equals (m−1)r−m(m−1)/2, so for m>0 it vanishes by [F2]'s alternating Gauss sum; at m=0 it is 1. Thus both c and c−1 are integral matrices.

2.1F1F3step 1.1algebra

Ordinary dual evaluation and coevaluation have entries 0,1. The pivotal matrices GN and GN−1 are diagonal Laurent monomials with signs. Accordingly both orientations of cup and cap are integral: one uses ordinary evaluation/coevaluation, the other their composites with the pivotal comparison or its inverse. Crossings involving a dual strand are obtained by bending one or both strands of c or c−1 with those maps, as follows from braiding naturality at evaluation and the snakes; concretely this is a partial transpose followed by the just-listed integral contractions. It introduces no matrix inverse other than c−1 and GN−1. Every elementary matrix of a tangle colored by VN and its dual is thus over R0.

2.2F1step 1.1algebra

It remains to prove the stronger exponent assertion. Work temporarily over Q(i)(A), and let a prime denote substitution A↦iA. On the basis v0,…,va put Qvj=(−1)j(j−1)/2vj and Dvj=(−1)jvj. The rth term of R sends input (u,v) to (u−r,v+r), before the flip. Every nonzero Laurent monomial in its coefficient has degree, modulo 4, (a−2u)(a−2v)+2r(a−u+v+r)≡a2−2a(u+v)+2r(a−u+v+r)(mod4). Indeed [m] has all degrees congruent to 2(m−1), z has degree 2, qKr(r−1)/2 has degree r(r−1), and the weight factor is evaluated at the output weights. The quotient of the output and input Q⊗Q signs is (−1)r(v−u+r). Comparing these two explicit expressions yields c′=(Q⊗Q)c(Q⊗Q)−1(a even), c′=i(Q⊗Q)(D⊗1)c(D⊗1)(Q⊗Q)−1(a odd). For the second formula, the remaining sign is (−1)u+v+r, exactly the product of the left input and left output D signs after the flip. No asymptotic or numerical specialization is used in these matrix equalities.

3.1A1F1F3step 2.1algebraconstruct

Cut a small oriented arc of the framed knot closure of β. The remaining framed (1,1)-tangle is a morphism f:VN→VN (choose its endpoint orientation accordingly). A generic planar projection decomposes it into finitely many elementary crossings, cups and caps, so step 2.1 makes every entry of f an element of R0. By [F1] and [F3], f=sI for a scalar s∈F; its v0 diagonal entry gives s∈R0. Closing that cut arc is the pivotal trace of f, namely dNs, and is the same framed knot value as Tr⁡(GN⊗bρN(β)) by [F3]. Since dN≠0 generically, the quotient in the Statement is λN−w(β)s∈R0. This proves integral Laurentness in A without dividing in an integral ring or after specialization.

3.2F1step 2.2algebra

If a is even, let T=Q⊗b. Step 2.2 gives ρ′=TρT−1 for every braid word, including inverses. Direct substitution gives GN′=GN, dN′=dN and λN′=λN, because a and a(a+2) are even and divisible by 4, respectively. Since T commutes with GN⊗b, cyclicity of the ordinary trace shows that the normalized quotient is unchanged by A↦iA.

3.3F1step 2.2algebra

If a is odd, put H=D0⊗D1⊗⋯⊗Db−1 and T=Q⊗bH. The operator c preserves the sum of basis indices, so it commutes with D⊗D. Consequently conjugating an adjacent c by H has the effect (D⊗1)c(D⊗1), regardless of which adjacent position has odd exponent. Step 2.2 thus gives ρ′=iw(β)TρT−1. Here GN′=−GN, dN′=−dN, and λN′=−iλN, since a(a+2)≡3(mod4). Taking the trace and normalizing therefore multiplies the quotient by (−1)b−1+w(β). The strand permutation of a knot-closing braid is a single b-cycle, so its sign is (−1)b−1. Each positive or negative generator is a transposition, so that same sign is (−1)w(β). The multiplier is 1. This proves invariance under A↦iA also for odd a.

4.1F1step 3.1step 3.2step 3.3algebra

Write the integral Laurent polynomial from step 3.1 as ∑knkAk, where nk∈Z and only finitely many are nonzero. Steps 3.2 and 3.3 imply ∑knk(ik−1)Ak=0. Linear independence of Laurent monomials over Q(i) gives nk=0 unless 4∣k. Replacing A4m by qm gives the required unique integral Laurent polynomial. Its representative independence and unknot value follow from [F1]. Evaluation of a finite Laurent sum at a nonzero complex number is defined without any denominator other than a power of that number, even when the generic quantum dimension specializes to zero. This proves every assertion, including the root-evaluation interpretation.

5.1F1step 1.1step 3.3step 4.1algebra∎

To check the conventional variable explicitly, write a=N−1 and {m}=qm/2−q−m/2, {m}!=∏s=1m{s}. Murakami's defining positive matrix on basis e0,…,ea has coefficient, for input (k,l) and output (I,J)=(l−r,k+r), {l}!{a−k}!{l−r}!{r}!{a−k−r}!q(I−a/2)(J−a/2)−r(I−J)/2−r(r+1)/4, with 0≤r≤min⁡(l,a−k), and pivotal diagonal μej=q(2j−a)/2ej; these are the explicit defining formulas in §2.4, not an invoked invariance theorem. At q=A4, change basis by vj=Aj2([j]![a−j]!)−1ea−j. For input (u,v), reversal makes the output (v+r,u−r). The factorial coefficient changes to zr[a−u+r]![v+r]!/([a−u]![v]![r]!), exactly the one in step 1.1. Before scaling, the exponent of A differs from the declared R coefficient by 2r(v−u+r); the change-of-basis factor Au2+v2−(u−r)2−(v+r)2 is its inverse. Thus the two positive crossing matrices are conjugate, as are their inverses, and μ becomes K=qKH. Murakami's twist-normalizing scalar is Aa(a+2). Replacing this unsigned pivotal and twist by the signed ones of our definition multiplies the normalized closed-braid quotient by (−1)a(b−1−w(β))=1, by the knot-permutation parity proved in step 3.3. Consequently the Laurent polynomial just established is exactly that source's normalized colored Jones polynomial with q=A4.

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

Finite colored Jones evaluation is exact and representative-independent

Statement

Assume the Axiom of Choice and the prescribed generic matrix ribbon data for the N-dimensional color, where N≥1. For every finite braid word β on n≥1 strands whose closure is a knot, the algorithm performs finitely many exact operations, including exactly one crossing-matrix update per letter and one finite pivotal-trace contraction, and returns the generic normalized value JNgen(β^;q). If two such braid words close to the same oriented unframed knot, their returned generic values agree. The unique Laurent representative belongs to Z[q,q−1], and its evaluation at any nonzero complex q is defined, including at qN=e2πi/N.

Facts & Assumptions

Given: The Axiom of Choice, an integer N≥1, the prescribed generic matrix ribbon data, a finite braid word β of length m on n≥1 strands, and a knot closure.

[F1]

The procedure forms the positive and inverse crossing matrices and JW=GN⊗n on W=VN⊗n, calls the finite matrix ribbon evaluator with this pivotal matrix, computes the exponent sum, and returns λN−w(β)tN(β)/dN over the exact field Q(A) (Colored Jones evaluation from ribbon data).

[F2]

For valid finite-dimensional matrix data over an effective field and a color-preserving braid word of length m, the ribbon evaluator makes exactly m crossing-matrix updates and one finite pivotal-trace contraction and returns the framed colored-braid value (Correctness and termination of the colored-braid evaluation procedure).

[F3]

The generic data lie in an F-linear ribbon category with End⁡(1)=F, where F=Q(A); VN is absolutely simple with twist λNI, dN≠0, λN≠0, and JNgen=λN−w(β)tN(β)/dN (Normalized colored Jones sequence).

[F4]

Under the Axiom of Choice, in a k-linear ribbon category with k-bilinear tensor product and End⁡(1)=k, an absolutely simple color with scalar twist λI gives a corrected framed trace λ−w(β)tn(β) depending only on the oriented unframed link type when all components have that color (Scalar twist correction removes the framing).

[F5]

The framed ribbon-tangle evaluator is defined under Countable Choice (Colored framed-link evaluation from a ribbon category).

[F6]

The Axiom of Choice implies Countable Choice (AC implies DC implies countable choice).

[F7]

The quotient has a unique integral Laurent representative in q=A4, proved by The normalized generic colored Jones quotient is an integral Laurent polynomial.

[A1]

The Axiom of Choice (The Axiom of Choice).

[A2]

Countable Choice has its usual sequence-of-nonempty-sets meaning (The Axiom of Countable Choice (ACω)).

Proof

technique · direct

Given: The hypotheses in the Statement and [A1].

1.1F1F2F3givenconstruct

The universal-R sum used for cN has only the terms 0≤r<N, since EN=FN=0 on the displayed N-dimensional module. The invertible crossing matrix has finite size, so its inverse is computable by finite Gaussian elimination over Q(A); forming JW=GN⊗n also takes finitely many field operations. The braid word has finitely many letters, and [F2] performs exactly one matrix update per letter followed by one finite trace contraction. The remaining normalization uses finite arithmetic and integer powers of the nonzero generic scalars dN and λN in the effective field Q(A), so every operation terminates.

2.1F1F2F3step 1.1given

By [F2], the evaluator returns tN(β), the pivotal trace of the framed colored closure. The last step in [F1] multiplies this value by λN−w(β) and divides by dN, exactly the formula in [F3]. Hence the returned value is JNgen(β^;q).

3.1A1A2F3F4F5F6F7step 2.1given∎

Countable Choice, with the meaning in [A2], follows from [A1] by [F6], so the framed evaluator's hypothesis [F5] is satisfied. By [F3], the prescribed category and color satisfy every hypothesis of [F4], including absolute simplicity and the scalar twist. Hence if β and β′ close to the same oriented unframed knot, [F4] directly gives equality of their corrected framed traces λN−wtN. Dividing by the same nonzero dN and applying step 2.1 proves equality of the algorithm outputs. Finally [F7] gives their unique common representative in Z[q,q−1]. Substituting any nonzero complex q into its finite Laurent sum is defined, including at qN, without division by a specialized quantum dimension.

Open problemQuestion: Literature-sourcedProof: Not applicable‡ sources checked 2026-10-22‡ not proved hereOpen item page →
‡ Recorded, not proved here. This statement is included so the library can refer to it honestly, with a citation to the literature. It is not proved anywhere in this library: the track that would prove it has not been developed here yet.

Kashaev–Murakami–Murakami volume conjecture for hyperbolic knots

Open problem

Assume the Axiom of Choice and Countable Choice for the normalized colored Jones sequence used below.

Let K be an oriented smooth knot in S3, let EK be its compact exterior, and equip int⁡(EK) with a complete finite-volume hyperbolic metric g having exactly one peripheral torus cusp. Write Vol⁡g(K) for its Riemannian volume. Let JN(K;q)∈Z[q,q−1] be the normalized N-dimensional colored Jones Laurent polynomial with JN(◯;q)=1, in the variable q=A4 declared in the generic color definition. Put qN=exp⁡(2πi/N). The conjecture is that JN(K;qN)≠0 for all sufficiently large N and that lim⁡N→∞2πNlog⁡∣JN(K;qN)∣=Vol⁡g(K). This is the real absolute-value formulation; the complex-volume refinement is a separate conjecture.

Status

As of 2026-10-19, the classical diagonal-sequence conjecture for arbitrary hyperbolic knots remains open in the inspected status source. Aistleitner and Borda (2025), §1, state that the classical volume conjecture is proved for some low-crossing knots, including the figure-eight knot, but remains open for general knots. Kakuta's version-3 preprint (2026), §1, proves a different varying-color, deformed-parameter statement for a range of cone angles on the figure-eight knot; its stated parameter and color regime do not settle the classical sequence with color dimension N and parameter qN=exp⁡(2πi/N) for every hyperbolic knot. The complex-volume/Chern–Simons refinement is distinct from the real limit stated above.

The local Laurent-polynomial supplier proves that the displayed generic normalization is an element of Z[q,q−1] for every knot and color and matches Murakami’s explicit normalization with q=A4. Thus JN(K;qN) is evaluation of that Laurent polynomial. For N≥2 the quantum dimension in the generic quotient vanishes at qN; direct specialized division is not its definition. This algebraic well-definedness does not prove the conjectured asymptotic limit.

4 · Examples, counterexamples and false statements

None yet.

Sources