Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-generated
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.

Unitary fusion category

Definition

Let C be a fusion category over C in the sense of Fusion and multifusion categories. A dagger structure assigns to every morphism f:X→Y a morphism f†:Y→X, conjugate-linearly, with (g∘f)†=f†∘g† and (f†)†=f. A unitary fusion category is such a fusion category equipped with this dagger so that every morphism space is a finite-dimensional normed space, composition is submultiplicative, ∥f†∥=∥f∥, and ∥f†f∥=∥f∥2. Thus each End⁡C(X) is a finite-dimensional C∗-algebra. Positive endomorphisms are the elements of its usual C∗-positive cone (equivalently u†u for an endomorphism u); in particular, if c is simple and End⁡(c)=Cid⁡c, then λid⁡c is positive exactly when λ≥0. For any morphism f:X→Y, f†f is positive in End⁡(X); also require f†f=0 to imply f=0. Semisimple direct-sum decompositions can be chosen orthogonally: their inclusions ij satisfy ij†ik=0 for j≠k, ij†ij=id⁡, and ∑jijij†=id⁡. Tensor product preserves daggers: (f⊗g)†=f†⊗g†. Its associator and unit constraints are unitary, meaning α†=α−1, λ†=λ−1, and ρ†=ρ−1.

The underlying fusion category is rigid, so its evaluation and coevaluation morphisms satisfy the duality zig-zag identities. Those morphisms are not required to be unitary isomorphisms. A braiding is additional structure; when it is specified as a unitary braiding, each component satisfies cX,Y†=cX,Y−1. Positivity and unitarity are extra structure, not consequences of the fusion rules or of the braid relations alone.

Depends on

Used by

Dependency tree · two levels

8 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