Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (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 ribbon trace equals the framed-closure evaluation

Statement

Assume ACω (The Axiom of Countable Choice (ACω)). Let C be a ribbon category with chosen left duals and twist θ (Twist and ribbon structure), let X∈C, let n≥1 and β∈Bn, and let β^fr be the blackboard-framed closure of β: the closed framed tangle diagram obtained from the (n,n)-tangle diagram of β by joining its top boundary points to its bottom boundary points by the identity pairing in the blackboard framing, with every band colored by X. Denote by FX(β^fr) the value of the tangle evaluation functor on a word in the elementary generators representing this closed diagram. Then

tn(β)=FX(β^fr)∈End⁡C(1),

where tn is the ribbon trace of The ribbon evaluation of an X-colored closed braid and FX is the tangle evaluation functor of A ribbon object defines a unique framed-tangle evaluation functor. Consequently tn(β) depends only on the framed isotopy class of β^fr, and the blackboard-framed closure of the positive stabilization ιn(β)σn is the framed closure of β with one positive curl added on a band, while the closure of the negative stabilization adds one negative curl; with Turaev's convention the positive curl is the generator φX with FX(φX)=θX.

Facts & Assumptions

Given: ACω; a ribbon category C with chosen left duals and twist θ; an object X; n≥1 and β∈Bn; the (n,n)-tangle diagram of β and its blackboard-framed closure obtained by joining free ends by the identity pairing.

[L1]

The ribbon trace is tn(β)=Tr⁡L(jX⊗nρn(β)) with j=uθ, the Drinfeld morphism u of A braided rigid category has a Drinfeld morphism, and the canonical braid action ρn (The ribbon evaluation of an X-colored closed braid, The categorical trace of a morphism into the double dual).

[L2]

Under ACω (The Axiom of Countable Choice (ACω)) the tangle evaluation functor FX sends the positive crossing to cX,X, the cup and cap of the positive strand to coev⁡X and ev⁡X, the positive twist to θX, and is a monoidal functor; isotopic framed tangles have equal values (A ribbon object defines a unique framed-tangle evaluation functor). The elementary tangles of the framed oriented tangle category and the reading of a closed diagram as a word in the generators are as in The framed oriented tangle category.

[L3]

For a chosen left dual Y∨ of Y the maps ev⁡Y ⁣:Y∨⊗Y→1 and coev⁡Y ⁣:1→Y⊗Y∨ satisfy the zig-zag identities (Left dual and right dual object).

[F1]

Turaev's trace formula (1.5.a) is tr⁡(f)=dV∘cV,V∨∘((θVf)⊗1V∨)∘bV for f∈End⁡(V), and Corollary 2.7.2 states that closing the free ends of an (n,n)-graph Φ gives F(Φ‾)=tr⁡(F(Φ)) (Turaev, printed pp. 21--22 and 43--44).

[F2]

In the library's LEFT-dual convention, the pivotal trace is Tr⁡(f)=ev⁡X∨∘(ψXf⊗1X∨)∘coev⁡X with ψ=uθ, so Tr⁡(f)=Tr⁡L(ψXf). The evaluator is ev⁡X∨ because the preceding target is X∨∨⊗X∨. This translates EGNO formula (8.40) and its following trace-identification sentence; the commuting proof diagram following (8.41) explicitly uses ev⁡X∗ (author final text, printed p. 220).

[L4]

The left categorical trace is Tr⁡L(a)=ev⁡Y∨∘(a⊗1Y∨)∘coev⁡Y for a ⁣:Y→Y∨∨ (The categorical trace of a morphism into the double dual).

Proof

technique · direct
1.1L2F1construct

The word of the closed diagram. Read the closed framed diagram β^fr as a word in the elementary generators of the framed oriented tangle category: the diagram of β contributes its crossings, and the closing bands contribute, at the free ends, one coevaluation and one evaluation pair together with the crossings and twists produced by the blackboard framing of the closing bands. Since FX is monoidal [L2], its value on the closed diagram is the composite of the corresponding generator values: evaluations ev⁡, coevaluations coev⁡, braidings c and twists θ. By the closure corollary of [F1] this composite is exactly Turaev's trace: FX(β^fr)=tr⁡(ρn(β))=ev⁡X⊗n∘cX⊗n,(X⊗n)∨∘((θX⊗nρn(β))⊗1(X⊗n)∨)∘coev⁡X⊗n, where ρn(β)=FX applied to the (n,n)-tangle of β by the generator values of [L2].

2.1L1L3L4F2step 1.1algebra

The trace formula equals the library trace. By [F2] the composite of [F1] equals Tr⁡L(ψX⊗nρn(β)) with ψ=uθ: expanding ψX=uXθX by the defining composite of the Drinfeld morphism and substituting into [L4], the evaluation–coevaluation pair introduced by u is cancelled against the outer evaluation by the zig-zag identities of [L3], leaving precisely Turaev's composite. Hence FX(β^fr)=Tr⁡L(jX⊗nρn(β))=tn(β) by [L1].

3.1L2step 1.1step 2.1construct

Invariance and the curl. Since FX is a functor and isotopic framed tangles are equal morphisms of the framed oriented tangle category [L2], the value FX(β^fr) depends only on the framed isotopy class of the closure; by step 2.1 the same holds for tn(β). The closure of ιn(β)σn±1 is obtained from the closure of β by adding one crossing and one band to the last strand, which in the blackboard framing is the insertion of one full twist φX±1 on a band; by the generator values of [L2] its image is θX±1, and with the declared convention the positive stabilization corresponds to the positive curl φX+ with FX(φX+)=θX.

4.1L1L2step 1.1step 2.1step 3.1∎

Conclusion. Steps 1.1 and 2.1 identify the ribbon trace with the functor's value on the blackboard-framed closure, step 3.1 records the framed-isotopy invariance and the local curl picture used by the stabilization lemma. Multiplicativity and cyclicity of the trace, where used, are the published properties of Basic properties of the categorical trace. The only choice principle used is ACω, consumed through the existence of the functor FX of [L2], which rests on the classification input of the tangle lemma; with FX available the trace computations of steps 1.1--3.1 are finite and use no further choice.

Depends on

Used by

Dependency tree · two levels

28 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