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 intertwiner induced by a braided monoidal functor

Definition

Let F ⁣:C→D be a braided monoidal functor between braided monoidal categories (Braided monoidal functor), with binary tensor constraint JX,Y ⁣:F(X)⊗F(Y)→F(X⊗Y) and unit constraint J0 ⁣:1→F(1), which are isomorphisms because F is strong monoidal (Lax, strong, and strict monoidal functors). Let X∈C.

For n≥1 the n-fold constraint is the canonical isomorphism

Jn ⁣:F(X)⊗n⟶F(X⊗n),

defined in a strict model of both categories by the recursion J1=1F(X) and Jn+1=JX⊗n,X∘(Jn⊗1F(X)); in general the associativity and unit isomorphisms of the two monoidal structures are inserted in the same composite, and Jn is independent of those insertions by Mac Lane coherence for the monoidal structure.

We call Jn the intertwiner induced by F at X. It conjugates the canonical braid action on F(X)⊗n (An object of a braided category carries canonical braid actions) to F of the canonical braid action on X⊗n: the precise statement is that Jn∘ρnD(β)=F(ρnC(β))∘Jn for every β∈Bn, which is proved in the companion theorem. Each Jn is an isomorphism because it is a composite of the structure isomorphisms JX,Y and J0, which are invertible by strong monoidality; in particular Jn is a natural isomorphism between the two tensor-power functors.

Depends on

Used by

Dependency tree · two levels

13 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