Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Kauffman bracket and normalized Jones polynomial

Definition
JonesUnknot_jones

by LG · Nov 17, 2026 · Mathlib 0df444a (Lean v4.33.1)

jones-polynomialknot-theory

The Kauffman bracket and the normalized Jones polynomial of a PD code, valued in the Laurent polynomial ring Z[A,A−1]\mathbb Z[A,A^{-1}]Z[A,A−1] (represented as AddMonoidAlgebra ℤ ℤ).

A state sss assigns to each of the nnn crossings one of its two Kauffman smoothings; the AAA-smoothing pairs positions (0,1)(0,1)(0,1) and (2,3)(2,3)(2,3), the BBB-smoothing pairs (0,3)(0,3)(0,3) and (1,2)(1,2)(1,2). Writing a(s)a(s)a(s) and b(s)b(s)b(s) for the numbers of AAA- and BBB-smoothings and loops(s)\mathrm{loops}(s)loops(s) for the number of circles of the smoothed diagram, the Kauffman bracket is

⟨D⟩=∑sA a(s)−b(s) δ loops(s)−1,δ=−A2−A−2.\langle D\rangle=\sum_{s} A^{\,a(s)-b(s)}\,\delta^{\,\mathrm{loops}(s)-1},\qquad \delta=-A^2-A^{-2}.⟨D⟩=s∑​Aa(s)−b(s)δloops(s)−1,δ=−A2−A−2.

The circle count reuses the existing PD.stateGraph connected components.

With w(D)w(D)w(D) the writhe, the normalized bracket is

fD(A)=(−A3)−w(D) ⟨D⟩.f_D(A)=(-A^3)^{-w(D)}\,\langle D\rangle.fD​(A)=(−A3)−w(D)⟨D⟩.

For a knot KKK presented by DDD, fD(A)=VK(A−4)f_D(A)=V_K(A^{-4})fD​(A)=VK​(A−4), where VKV_KVK​ is the Jones polynomial; because the exponents of fDf_DfD​ are multiples of 444, fD=1f_D=1fD​=1 if and only if VK=1V_K=1VK​=1. The empty diagram has fD=1f_D=1fD​=1.

Formalization Note. The state sum ranges over Fin D.numCrossings → Bool (definitionally PD.State); numTrue and stateGraph are imported from the platform's Lee layer. The sign factor (−1)w(-1)^{w}(−1)w is written via Even (writhe D) to avoid integer zpow.

Definition code
import Mathlib
import Definitions.Def_ManolescuPiccirillo_PD
import Definitions.Def_ManolescuPiccirillo_Lee1
import Definitions.Def_JonesUnknot_planar

open Classical
noncomputable section

namespace JonesUnknot
open ManolescuPiccirillo

/-- The Laurent polynomial ring `ℤ[A, A⁻¹]`, represented as `ℤ[ℤ]`. -/
abbrev LP := AddMonoidAlgebra ℤ ℤ

/-- The Kauffman loop value `δ = -A² - A⁻²`. -/
def delta : LP := -AddMonoidAlgebra.single 2 1 - AddMonoidAlgebra.single (-2) 1

/-- The number of circles of the smoothed diagram in state `s`. -/
def stateLoops (D : PD) (s : Fin D.numCrossings → Bool) : ℕ :=
  if D.crossings = [] then 1 else Fintype.card (D.stateGraph s).ConnectedComponent

/-- The Kauffman bracket `⟨D⟩ = Σ_s A^{a(s)-b(s)} δ^{loops(s)-1}`. -/
def kauffmanBracket (D : PD) : LP :=
  ∑ s : Fin D.numCrossings → Bool,
    AddMonoidAlgebra.single ((2 * D.numTrue s : ℤ) - D.numCrossings) 1 *
      delta ^ (stateLoops D s - 1)

/-- The normalized bracket `(-A³)^{-w(D)} ⟨D⟩`, which equals `V_K(A⁻⁴)` for a knot `K`. -/
def jonesA (D : PD) : LP :=
  AddMonoidAlgebra.single (-3 * writhe D) (if Even (writhe D) then 1 else -1) *
    kauffmanBracket D

end JonesUnknot
Source
Epoch AI FrontierMath, The Jones Unknot Conjecture, https://epoch.ai/frontiermath/open-problems/jones-unknot ; L. H. Kauffman, State models and the Jones polynomial, Topology 26 (1987), 395-407.

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me