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.
Hecke–bracket trace dictionary and local descent
Statement
Let be an indeterminate, , , , , and . For a nonempty regular diagram , define by summing its crossing smoothings with weights and and the factor for a state with circles. Let be the -strand Artin braid group with positive geometric generators (label passes below the midpoint and label passes above), drawn with braid parameter increasing from bottom to top; let be the homomorphism . Let be the type-A Hecke algebra with generators , quadratic relation , braid relations, and distant commutation; let send to . Its normalized Markov trace satisfies , cyclicity, tower restriction, and . Let be the noncrossing pairing algebra with loop value , and let be the unnormalized trace, where is the number of circles after joining corresponding top and bottom endpoints outside the rectangle; set . For , , orient its closure in the braid direction. Under the specialization , of the Hecke tower, one has The identity gives bracket value on the one-strand identity closure. Its positive and negative Markov stabilizations multiply the raw bracket by and , respectively.
Statement references
Facts & Assumptions
Given: , an -strand braid , the Laurent coefficient ring , and the definitions and relations named below.
A crossing in the source chart is the A-smoothing with coefficient plus the B-smoothing with coefficient , and the loop value is (Kauffman bracket smoothing and loop value).
The positive geometric half twist has the explicit diamond path with label passing below the midpoint and label above it; the reflected path is its inverse (The elementary geometric half twist, its support disc, and its opposite).
is generated by with the Artin braid and distant-commutation relations, and the closure joins corresponding top and bottom endpoints with the strand orientations respected (The braid group by Artin presentation, The closure of a geometric braid).
The vertical identity diagram has through strands; has a top cap and bottom cup at positions ; stacking removes each closed loop with coefficient (Temperley–Lieb planar diagram data and endomorphism modules).
The generators satisfy , , , and distant commutation (The elementary diagram generators satisfy the local Temperley–Lieb relations).
The local crossing operators satisfy R2 cancellation and the R3 braid identity in the declared source chart (Kauffman bracket R2 and R3 identities).
The unnormalized diagram closure trace is cyclic, , and ; when is a unit, (Unnormalized diagram closure and partial trace, Diagram closure trace is cyclic and satisfies the tower rules).
The Hecke tower has quadratic relation , and its Ocneanu trace satisfies the tower restriction, cyclicity, and (The Markov trace on the type-A Hecke tower, The Ocneanu Markov trace exists and is unique).
The assignment is a group homomorphism to Hecke units, and (The Hecke generators satisfy the Artin relations and are units).
The Hecke tower has the decomposition as an -bimodule (The Hecke tower is free over the previous level).
The exponent sum is a homomorphism with (The exponent sum of a braid).
Proof
Use source coordinates with their standard positive orientation and positive projection coordinates on the braid box. For , the map has determinant . It sends the source over direction to and the source under direction to , whose determinant is . The source left/right pairs have constant , hence constant braid position and give the through pairing ; the source top/bottom pairs have constant , hence constant braid time and give the cup-cap . The displayed page coordinates reverse the positive projection orientation; their visual quarter-turn is not the orientation comparison. Thus its two smoothings are with weight and with weight . For the opposite crossing the pairings exchange. Hence the local operators are The relations [F5] and [F6] show these operators satisfy the Artin relations and are mutual inverses; distant generators commute by [F5].
Define and . With and , direct multiplication gives The braid and distant-commutation relations for follow from [F5] and step 1.1. Under the coefficient map given by and , the assignment therefore defines a compatible homomorphism from the specialized Hecke tower to the Temperley--Lieb diagram algebras. For a braid word, this map sends to the product of the corresponding .
The element is a unit in and is therefore a unit. Set . By [F7], , , and is cyclic. Since , the last closure rule of [F7] gives Thus satisfies all specialized Markov-trace rules, where .
The decomposition in [F10] is a direct sum of modules spanned by disjoint subsets of the Hecke standard basis. Under , that basis remains a basis, so for the specialized tower still has . Any specialized Markov trace is therefore determined by its restriction to : restriction determines the first summand, while cyclicity and the Markov rule force on every product in the second summand. Starting at , induction proves uniqueness, without dividing by any specialized parameter. The scalar extension of the Ocneanu trace exists by [F8], so the trace in step 3.1 equals that specialized trace.
Expand each crossing of by or and close the resulting Temperley–Lieb diagrams. The unnormalized trace counts each closed state circle with a factor , whereas the bracket state sum counts it with ; hence Since and , multiplying along an Artin word gives . Step 4.1 now gives the displayed trace identity.
The closure of the identity in has one circle; the state sum gives , and its trace expression gives . For positive stabilization, the Markov trace factor is , so the bracket formula changes by For negative stabilization, [F9] and [F8] give trace factor the bracket formula changes by This proves the unknot value and both stabilization normalizations.
Depends on
- Kauffman bracket smoothing and loop value
- The elementary geometric half twist, its support disc, and its opposite
- The braid group by Artin presentation
- Temperley–Lieb planar diagram data and endomorphism modules
- The elementary diagram generators satisfy the local Temperley–Lieb relations
- Kauffman bracket R2 and R3 identities
- Unnormalized diagram closure and partial trace
- Diagram closure trace is cyclic and satisfies the tower rules
- The Markov trace on the type-A Hecke tower
- The Ocneanu Markov trace exists and is unique
- The Hecke generators satisfy the Artin relations and are units
- The Hecke tower is free over the previous level
- The exponent sum of a braid
- The closure of a geometric braid
Used by
Dependency tree · two levels
51 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
- Louis H. Kauffman, An Invariant of Regular Isotopy, Transactions of the AMS 318(2) (1990), §III, printed pp. 430–432 (standard reference, not scraped)
- Louis H. Kauffman, Combinatorial Knot Theory and the Jones Polynomial, arXiv:2204.12104v2, §2 (standard reference, not scraped)
- Justin Roberts, Knots Knotes, §§4.1–4.4, printed pp. 21–26 (standard reference, not scraped)
- François Funar, A Crash Course in Quantum Invariants of Knots and 3-Manifolds, Chapter 3, §§1.1–2.3 (standard reference, not scraped)