Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-generatedjudge 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 evaluation of an X-colored closed braid

Definition

Let C be a ribbon category with chosen left duals, twist θ (Twist and ribbon structure) and Drinfeld morphism uX ⁣:X→X∨∨ of A braided rigid category has a Drinfeld morphism. Put

jX:=uX θX  ⁣: X⟶X∨∨.

Then j is a natural isomorphism: it is the composite of the natural isomorphism u with the natural automorphism θ of the identity. It is monoidal up to the monoidal comparison dX,Y ⁣:X∨∨⊗Y∨∨→(X⊗Y)∨∨ of the double-dual functor,

jX⊗Y=dX,Y∘(jX⊗jY),

which is precisely the statement that uθ is the pivotal comparison induced by the ribbon structure; the identity follows from the tensor relation dX,Y∘(uX⊗uY)=uX⊗Y∘cY,X∘cX,Y for the Drinfeld morphism together with the twist axiom θX⊗Y=(θX⊗θY)∘cY,X∘cX,Y and the naturality of θ. Iterating the comparison identifies jX⊗n with the corresponding composite of the jX and the coherence isomorphisms of the tensor power.

Let n≥1 and β∈Bn (The braid group by Artin presentation), and let ρn ⁣:Bn→Aut⁡C(X⊗n) be the canonical braid action (An object of a braided category carries canonical braid actions). The ribbon evaluation of the X-colored closed braid is the value

tn(β):=Tr⁡L ⁣(jX⊗n∘ρn(β))∈End⁡C(1),

in the sense of The categorical trace of a morphism into the double dual: the composite jX⊗n∘ρn(β) is a morphism X⊗n→(X⊗n)∨∨, which is exactly the input type of the left categorical trace. When End⁡C(1)=k the value tn(β) is a scalar. For n=1 the group B1 is trivial and t1(e)=Tr⁡L(jX), the left dimension of X.

For n=0 put t0(e)=11, the evaluation of the empty closed tangle. This is a separate convention; no generator or dual pairing is needed for the empty diagram.

The identification of tn(β) with the evaluation FX(β^fr) of the blackboard-framed closure of β under the functor of A ribbon object defines a unique framed-tangle evaluation functor is the content of the closure-comparison lemma of this page; it must be proved before the trace is used as a link evaluation, and it is not assumed here. The functor FX is constructed under countable choice ACω (The Axiom of Countable Choice (ACω)), while the definition of tn above is choice-free and uses neither that functor nor that principle; only the comparison, not the trace, carries the choice cost.

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