Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedverified 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 bracket state sum matches the library Jones specialization

Statement

Assume the Axiom of Choice. Let A and t be formal variables and K a nonempty oriented link, and let D be any regular oriented diagram representing K. At each crossing of D use the source chart with over-strand southwest-to-northeast: A joins left and right endpoints with coefficient A, and B joins top and bottom endpoints with coefficient A−1. A state S:C(D)→{A,B} assigns one smoothing at every crossing; let a(S) and b(S) count these choices and ∣S∣ count the resulting circles. Fix a unit viewing normal n and orient the projection plane P so (u,v) is positive exactly when (n,u,v) is positive in the ambient oriented 3-sphere. Define sgn⁡(c)=sgn⁡det⁡P(vover,vunder),wr⁡(D)=∑csgn⁡(c), fK(A)=(−A3)−wr⁡(D)∑S:C(D)→{A,B}Aa(S)−b(S)(−A2−A−2)∣S∣−1. This value is independent of the chosen regular oriented diagram of K. For an n-strand braid β whose oriented closure is K, let e:Bn→Z be the homomorphism e(σi)=1, where σi is the positive geometric Artin half twist. Let H(n) be the type-A Hecke algebra with generators Ti, quadratic relation Ti2=(v−1)Ti+v, braid relations, and distant commutation, and let πn(σi)=Ti. Its normalized Markov trace tr⁡n satisfies tr⁡n(1)=1, cyclicity, tower restriction, and tr⁡n+1(xTn)=ztr⁡n(x). Define the library Jones value by VK(t)=se(β)(−s2+1s)n−1tr⁡n(πn(β))∣v=s2, z=−1/(s2+1), t=s2, where s=t1/2. With A=t−1/4, these values satisfy VK(t)=fK(t−1/4).

Facts & Assumptions

Given: Full AC, a nonempty oriented link K, a braid closure of K, and the two polynomial constructions in the statement.

[A1]

Full AC means that every family of nonempty sets has a choice function (The Axiom of Choice).

[F1]

Full AC implies countable choice (AC implies DC implies countable choice).

[F2]

The positive Artin half twist has determinant crossing sign +1; the opposite reflected half twist exchanges over and under and has sign −1 (Oriented crossing signs, diagram writhe, and blackboard framing, The elementary geometric half twist, its support disc, and its opposite).

[F3]

The braid exponent sum is additive, with e(σi)=1 and e(σi−1)=−1 (The exponent sum of a braid).

[F4]

For every braid closure, the normalized bracket satisfies fβ^(A)=(−A3)−wr⁡(β^)⟨β^⟩, and its value is independent of the regular diagram under ACω (The normalized bracket is an oriented link invariant).

[F5]

For every n-braid, the raw bracket has the trace expression ⟨β^⟩=δn−1(−A)e(β)tr⁡n(πn(β))∣v=A−4, z=−1/(A−4+1),δ=−A2−A−2 (Hecke–bracket trace dictionary and local descent).

[F6]

The library Jones value is invariant under braid equivalence and Markov moves under full AC, and is given by the trace formula in the Statement (The Hecke trace construction is an oriented link invariant, The Temperley-Lieb quotient and the Jones specialization).

[F7]

Every nonempty oriented link has a braid closure under full AC (Alexander's theorem: every link is a closed braid, The closure of a geometric braid).

[F8]

Every element of Bn is represented by a finite word in the Artin generators and their inverses; each letter is one geometric half twist or its opposite, and the closure joins the braid endpoints (The braid group by Artin presentation, The elementary geometric half twist, its support disc, and its opposite, The closure of a geometric braid).

Proof

1.1F2F3F8algebra

A closed braid diagram has one crossing for each letter in a finite Artin word and no crossings at its closure arcs. Each positive generator contributes +1 to writhe by [F2]. In the reflected inverse half twist, the over- and under-strands exchange while their oriented projected tangent vectors retain their respective directions; exchanging the two vectors negates their determinant, so each inverse generator contributes −1. Summing over the word and using the homomorphism in [F3] and the finite word representation in [F8] gives wr⁡(β^)=e(β).

2.1F4F5F6step 1.1algebra

Put q=A−2 and t=q2. Then δ=−A2−A−2=−(q+q−1)=−(t+1)/q. By [F5] and step 1.1, fβ^(A)=(−A3)−e(β)δn−1(−A)e(β)tr⁡n(πn(β))=qe(β)δn−1tr⁡n(πn(β))=qe(β)(−q2+1q)n−1tr⁡n(πn(β)). This is exactly the library trace normalization with s=q and t=s2 from [F6]. Thus the two constructions agree on every braid closure.

3.1F5F6step 2.1algebra

Put RA=Z[A±1,(A−4+1)−1], as in [F5]. The target coefficient ring in [F6] is T=Z[s±1,(s2+1)−1]. The substitution s↦A−2, t=s2↦A−4 defines a ring map T→RA. It is injective because distinct Laurent powers sk map to distinct Laurent monomials A−2k, and the localization denominator maps to the unit A−4+1. Hence the equality from step 2.1 is an equality in T, with t=s2, rather than only after embedding the two values in a larger ring.

4.1A1F1F4F6F7step 2.1step 3.1given∎

By [A1] and [F1], full AC supplies the countable-choice hypothesis of [F4]. By [F7], choose a braid closure for the given nonempty link K. The calculation in step 2.1 and its ring identification in step 3.1 prove equality on that closure; the invariance in [F4] and [F6] makes both values independent of the chosen regular diagram and braid representative. Therefore VK(t)=fK(t−1/4) for every nonempty oriented link.

Depends on

Used by

Dependency tree · two levels

73 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