Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adapted
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 canonical algebra of a characteristic-zero fusion category is separable

Statement

Let C be a fusion category over an algebraically closed field of characteristic zero. For the canonical Frobenius algebra (K,μ,η,Δ,λ) constructed in The canonical algebra of a fusion category is Frobenius, set t=λμΔη. Then t≠0 and s=t−1Δ is a K-bimodule section of multiplication. In particular K is separable, and e=sη satisfies μe=η,(μ⊗id)(id⊗e)=(id⊗μ)(e⊗id).

Facts & Assumptions

[F1]

The canonical Frobenius algebra and its displayed bimodule identities are supplied by The canonical algebra of a fusion category is Frobenius.

[F2]

The squared-norm computation in Nonzero global dimension and the canonical Frobenius scalar identifies λμΔη with the nonzero global dimension of C; no pivotal structure is assumed.

Proof

Given: The Frobenius algebra and field hypotheses in the statement.

1.1F1givenalgebra

The bimodule equations imply that u=μΔ is a K-bimodule endomorphism and u=μ(id⊗uη). Because Hom⁡D(1,K)=kη, write uη=tη. Thus u=tidK; applying λ gives t=λμΔη since λη=1.

2.1F1F2step 1.1algebra∎

Fact [F2] gives t≠0. Therefore s=t−1Δ is a bimodule map and μs=idK. Its value e=sη obeys μe=η. Applying the left and right bimodule equations for s to the unit identifies (μ⊗id)(id⊗e) and (id⊗μ)(e⊗id) with s, proving centrality.

Depends on

Used by

Dependency tree · two levels

4 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