State Sum Formula in Kauffman Bracket for Link Diagrams | Math Tutorial

Added:

States Intro
Smoothing Rules
Smoothing Example
State Sum Formula
Formula Example
Smoothing All States
Simplification

States Intro

0:03
Playing Section
  • 1

    Defines a state as a sign assignment at each crossing.

  • 2

    Uses a figure-8 diagram to illustrate 16 possible states.

Basic concepts of knot theory, including knots, links, link diagrams, and the geometric representation of crossings.
Understanding of Reidemeister moves and how they define ambient isotopy for link diagrams.
Familiarity with polynomial algebra, specifically manipulating Laurent polynomials, as the bracket calculation yields polynomial expressions.
Elementary combinatorics, particularly summing over a set of binary choices (the A-smoothings and B-smoothings of crossings).
Normalizing the Kauffman bracket using writhe to construct the Jones Polynomial, a famous topological link invariant.
Proving the invariance of the Kauffman bracket under Reidemeister moves II and III mathematically.
Exploring Khovanov Homology, which categorifies the Jones polynomial into a sequence of homology groups.
Applying the Jones polynomial to solve classical problems in knot theory, such as Tait's conjectures on alternating knots.
Investigating connections between state sum models in topology and partition functions in statistical mechanics (e.g., the Potts and Ising models).
1.5K views15likes14:19@richardhepworth1441Original Release: 2015-03-24

The state sum formula provides a method to compute the Kauffman bracket of a link diagram by summing over all possible states, where each state assigns a +1 or -1 sign to every crossing, and the contribution of each state is calculated as (-a² - a⁻²) raised to the power of (number of components in the smoothed diagram minus one) multiplied by a raised to the sum of the signs in that state.