Alphabeta Math
ExampleConstruction: AI-generatedVerification: AI-adaptedPipeline-generatedjudge pass (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 Hecke trace skein calculation for a three-crossing braid

Example

Assume AC for the link-invariance and closure-isotopy assertions below. Work in the coefficient ring R of The HOMFLYPT coefficient ring with the Ocneanu trace tr⁡ of The Ocneanu Markov trace exists and is unique and the invariant P of The HOMFLYPT polynomial from the Hecke Markov trace. For the three-crossing braid β=σ1σ2σ1∈B3 one has tr⁡3(π3(β))=z(z(v−1)+v)=z2(v−1)+zv,P(β^)=u3α2(z2(v−1)+zv). With the trace values A=tr⁡3(T1T2T1),B=tr⁡3(T1T2−1T1),C=tr⁡3(T12) one has A=z2(v−1)+zv, B=(1−v−1)z2+(3−v−v−1)z+(1−v), C=(v−1)z+v, and the skein relation l−1P(L+)−lP(L−)=mP(L0) of The HOMFLYPT skein relation holds on the triple (L+,L−,L0)=(σ1σ2σ1^,σ1σ2−1σ1^,σ1σ1^) at the middle crossing (x=y=σ1 in B3); the relation is equivalent to the polynomial identity A−vB=(v−1)C, both sides being (v−1)2z+v(v−1).

The closure β^ is not a knot: the conjugation σ1−1(σ12σ2)σ1=σ1σ2σ1 exhibits σ1σ2σ1 as conjugate to σ12σ2, the positive stabilization of σ12∈B2, so β^ is isotopic to σ12^, the (2,2)-torus link, i.e. the Hopf link with two components (Markov conjugation and stabilization moves, Markov moves preserve the oriented closure up to isotopy). Consistently, at the Jones specialization z0=−1/(v+1), u=s, t=s2 of The Temperley-Lieb quotient and the Jones specialization the invariant takes the value V(β^)=−s5−s=−t1/2(t2+1) on β^, and the same value on the 2-braid representative σ12^; this is the value of the Hopf link in the normalization of this page, with the convention fixed by The Temperley-Lieb quotient and the Jones specialization.

Verification

Given: AC (The Axiom of Choice), the braid β=σ1σ2σ1∈B3, the generators T1,T2∈H(3), the Ocneanu trace and the invariant P. AC is used only through the cited link-invariance and closure-isotopy results; the trace calculations are algebraic.

[A1] tr⁡n+1(xTny)=ztr⁡n(xy) and tr⁡n+1(xTn−1)=z−tr⁡n(x) for x,y∈H(n), tr⁡n(1)=1, tr⁡n(Ti)=z and tr⁡n+1∘ιn=tr⁡n (The Ocneanu Markov trace exists and is unique, The Markov trace of an inverse Hecke generator).

[A2] Ti2=(v−1)Ti+v and T1T2T1=T2T1T2 in H(n) (The generic type-A Hecke algebra, The Markov trace on the type-A Hecke tower).

[A3] P(β^)=ue(β)αn−1tr⁡n(πn(β)) for β∈Bn, the invariant is unchanged by Markov moves, α=(uz)−1, l=us, m=s−s−1 in R, and l−1P+−lP−=mP0 (The HOMFLYPT polynomial from the Hecke Markov trace, The Hecke trace construction is an oriented link invariant, The HOMFLYPT skein relation).

[A4] πn is multiplicative with πn(σi)=Ti and e(σi1ε1⋯σikεk)=∑rεr (The Hecke generators satisfy the Artin relations and are units, The exponent sum of a braid).

[A5] Conjugation of braids and positive stabilization preserve the isotopy class of the closure, and the closure of σ12∈B2 is the Hopf link (Markov conjugation and stabilization moves, Markov moves preserve the oriented closure up to isotopy, The closure of a geometric braid); the Jones specialization is V=se(−s2+1s)n−1tr⁡n(πn(β))∣z=z0 with z0=−1/(v+1) and s2=v (The Temperley-Lieb quotient and the Jones specialization).

Proof technique: direct computation from the trace recursion.

1.1A1A2A3A4algebra

The trace of the three-crossing braid. By [A4], π3(σ1σ2σ1)=T1T2T1; by the recursion of [A1] with n=2 and x=y=T1, tr⁡3(T1T2T1)=ztr⁡2(T12). By [A2], T12=(v−1)T1+v, so by linearity and [A1], tr⁡2(T12)=(v−1)z+v. Hence A=tr⁡3(T1T2T1)=z2(v−1)+zv, and P(β^)=ue(β)α2A=u3α2(z2(v−1)+zv) since e(β)=3 by [A4].

1.2A4A5givenalgebra

The closure is the Hopf link. The braid identity σ1−1(σ12σ2)σ1=σ1σ2σ1 holds in B3 by cancellation; since σ12∈B2 embeds as σ12∈B3, the element σ12σ2 is a positive stabilization of σ12, and [A5] shows that the closures of σ1σ2σ1 and σ12 are ambient-isotopic. The endpoint permutation of σ12 is (1 2)2=1, so [A5] gives two components. Closing its two positive crossings yields the usual two-crossing positive Hopf diagram, namely the (2,2)-torus link. Hence β^ is that Hopf link. In particular β^ is not a knot, and the knot normalization is not used.

2.1A1A2step 1.1algebra

The other two trace values. The same recursion gives tr⁡3(T12)=tr⁡2(T12)=C=(v−1)z+v, and with T2−1=v−1T2+(v−1−1) from [A1], B=tr⁡3(T1T2−1T1)=v−1A+(v−1−1)C=(1−v−1)z2+(3−v−v−1)z+(1−v).

2.2A5step 1.1algebra

The Jones specialization. By [A5], with z0=−1/(v+1) and u=s, tr⁡3(π3(β))∣z0=−(v2+1)/(v+1)2 and V(β^)=s3(−s2+1s)2(−v2+1(v+1)2)=−s(s4+1)=−s5−s=−t1/2(t2+1) with t=s2.

3.1A2A3A4step 1.1step 2.1algebra

The skein identity. Applying P to the three words xσ2y=σ1σ2σ1, xσ2−1y=σ1σ2−1σ1 and xy=σ12 with x=y=σ1 and using [A3] and [A4], P(L+)=u3α2A, P(L−)=uα2B and P(L0)=u2α2C. The skein relation l−1P+−lP−=mP0 of [A3] reduces, after cancelling the common factor u2α2 and multiplying by s with s2=v, to A−vB=(v−1)C. Expanding, A−vB=(v−1)z2+vz−v[(1−v−1)z2+(3−v−v−1)z+(1−v)]=(v−1)2z+v(v−1)=(v−1)C, so the relation holds identically in Λ.

4.1A1A3A5step 1.2step 2.2algebra∎

Agreement with the two-strand representative. For σ12∈B2 one computes tr⁡2(T12)=C=(v−1)z+v, so by [A5] V(σ12^)=s2(−s2+1s)v2+1v+1=−s(s4+1), the same value as step 2.2, as the invariance of [A3] requires for two representatives of the same link. This completes the computation and the cross-check.

Remarks

  • The value −t1/2(t2+1) is the Jones value of the Hopf link in this page's convention; the half-integral power of t reflects the two components of the link in the normalization used here.
  • The trace identity A=vB+(v−1)C of step 3.1 is the one used in The HOMFLYPT skein relation; the example exhibits it on a word in which the middle letter is isolated, so no other relation enters.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

55 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