Kauffman bracket breadth bound (${\mathrm{br}}_A⟨D⟩\le 2c(D)+2s_A+2s_B-4$)

A state with $k$ B smoothings has at most $s_A+k$ circles, so its largest A exponent is at most $c(D)+2s_A-2$. The dual argument bounds the smallest exponent below by $-c(D)-2s_B+2$. For a connected link diagram, the Turaev surface inequality bounds the resulting breadth by $4c(D)$. For a connected reduced alternating diagram, adequacy prevents cancellation at both extremes and planar Euler characteristic gives equality. A disconnected projection needs the additional term in the Jones polynomial breadth bound for a disconnected diagram.

Here $n$ is the crossing count and $k$ is the number of connected components of the planar link diagram, not necessarily the number of link components. The all-$A$ and all-$B$ state counts satisfy $s_A+s_B\le n+2k$, by summing the Turaev surface Euler characteristic bound over projection components. The Kauffman bracket breadth bound and $t=A^{-4}$ give the displayed bound. It is sharp for an unlink diagram with $n=0$, whose Jones polynomial has breadth of a Laurent polynomial $k-1$.