Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedPipeline-generatedjudge pass (gpt-6-luna)verified 2026-10-22 (gpt-6.1-sol)
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 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.

Depends on

Used by

Cited to discharge well-definedness by Normalized colored Jones sequence.

Dependency tree · two levels

39 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources