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.

Canonical algebra modules and coherent tensor sliding

Statement

Use the canonical algebra K in D=C⊠Crev from The canonical algebra of a fusion category is Frobenius. Without a separability or characteristic-zero assumption, the functor J:C→Mod⁡D(K) given by J(V)=(V⊠1)⊗K is an equivalence. There are natural right K-module isomorphisms ρV:(V⊠1)K⟶(1⊠V)K. They obey ρ1=id and the sliding equation: ρV⊗W is the composite of idV⊠1⊗ρW, the interchange of the two separate Deligne factors, and id1⊠W⊗ρV. In particular any right K-linear map J(V)→J(W) uniquely equals f⊗idK for f:V→W.

Proof

Given: The canonical algebra and its multiplication from the cited Frobenius construction. Only finite semisimplicity and rigidity of C are used.

1.1givenconstructalgebra

Put LV=(V⊠1)K and RV=(1⊠V)K. For every X⊠Y, evaluation identifies both Hom⁡D(X⊠Y,LV) and Hom⁡D(X⊠Y,RV) with Hom⁡C(X⊗Y,V). Explicitly the first is ⨁iHom⁡(X,V⊗i)⊗Hom⁡(Y,i∗), evaluated by idV⊗ev⁡i, and the second is ⨁iHom⁡(X,i)⊗Hom⁡(Y,i∗⊗V), evaluated by ev⁡i⊗idV. Their inverses are the duality adjunction followed by the simple-object decomposition; the identity ∑qp=id verifies both inverse equations. Thus they are isomorphisms natural in X,Y,V. These two representations respect the right K-actions: the internal-Hom right action is composition with K on the source 1, and the free right action inserts exactly that further evaluation, by the definition of multiplication. Yoneda therefore gives a natural right K-linear isomorphism ρV:LV→RV identifying these two representations.

2.1step 1.1algebra

To check sliding, apply the preceding adjunction to an arbitrary map X⊠Y→((V⊗W)⊠1)K. The proposed iterated slide inserts one simple decomposition in the W adjunction and one in the V adjunction. Applying their evaluations erases both insertions by ∑qp=id, leaving the original map X⊗Y→V⊗W. The direct map ρV⊗W has the same image by its definition. The adjunction is injective and natural, so Yoneda proves the sliding identity. The unit identity follows by the same calculation with the identity unit constraints. The interchange in this identity is between different Deligne factors and requires no braiding on C.

3.1step 1.1step 2.1algebra

Free-module adjunction gives Hom⁡K(J(X),J(Y))=Hom⁡D(X⊠1,(Y⊠1)K)=Hom⁡C(X,Y): in the sum K=⨁ii⊠i∗ only i=1 contributes to the second equality. The resulting map sends f exactly to f⊗idK, proving full faithfulness. By sliding, every free module (X⊠Y)K is isomorphic to J(X⊗Y); additivity gives the same conclusion for a free module on any object of D.

4.1step 3.1constructalgebra∎

The category of right K-modules is abelian with kernels and cokernels computed in D: tensoring with K is exact, so these inherit unique actions and satisfy the module universal properties. Every module U has a finite free presentation: its action U⊗K→U is epic, since it is split in D by idU⊗η, and the same construction supplies a free epimorphism onto its kernel. By the preceding step the presenting free modules are J(X),J(Y); full faithfulness lifts the presenting map to f:X→Y. The functor J, whose underlying functor is tensoring with the fixed object K, is exact. Hence the presentation identifies U with J(coker⁡f). This proves essential surjectivity and the claimed equivalence without any separability assumption.

Depends on

Used by

Dependency tree · two levels

2 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