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.

Nonzero global dimension and the canonical Frobenius scalar

Statement

Let C be a fusion category over an algebraically closed field k of characteristic zero. Use left duals i∗ with ev⁡i:i⊗i∗→1 and coev⁡i:1→i∗⊗i. For each simple i, choose an isomorphism ai:i→i∗∗ and put di=ev⁡i∗(idi∗⊗ai)coev⁡i,ei=ev⁡i(ai−1⊗idi∗)coev⁡i∗,∣i∣2=diei. The scalar ∣i∣2 is independent of ai. The global dimension Dim⁡(C)=∑i∣i∣2 is nonzero. Over C, every ∣i∣2 is a strictly positive real number. For the canonical Frobenius algebra (K,μ,η,Δ,λ) of The canonical algebra of a fusion category is Frobenius, λμΔη=Dim⁡(C)≠0. No pivotal or unitary structure on C is assumed.

Facts & Assumptions

[F1]

The canonical Frobenius algebra and its explicit multiplication, perfect pairing β=λμ, inverse pairing c=Δη, and normalization λη=1 are supplied by The canonical algebra of a fusion category is Frobenius.

[F2]

The equivalence from the regular category to canonical-algebra modules and its coherent tensor-sliding maps, without assuming separability, are supplied by Canonical algebra modules and coherent tensor sliding.

Proof

Given: k,C as stated. Associators, tensor constraints of duality, and unitors in the following composites are the specified coherent ones. The symbol ∗ retains the statement's left-dual convention. For the cyclic-transpose construction only, write ∨ for right duality, with evaluation X∨⊗X→1 and coevaluation 1→X⊗X∨.

1.1givenalgebra

Left and right duals of a simple i are isomorphic. Indeed, rigidity identifies the unique simple j with Hom⁡(1,i⊗j)≠0 as one dual, and the unique simple j with Hom⁡(i⊗j,1)≠0 as the other; semisimplicity makes both dimensions the multiplicity of the unit in i⊗j, so these simple labels coincide. Thus i≅i∗∗. Each of the two loops defining di,ei is nonzero: it is a nonzero inclusion of the multiplicity-one unit summand in a product of dual simples followed by a nonzero projection to that summand. Multiplicity one follows from End⁡(i)=k and rigidity. Any two ai differ by a scalar t≠0; this multiplies di by t and ei by t−1. Hence ∣i∣2 is well-defined and nonzero.

1.2F1F2construct

Put D=C⊠Crev. The object 1∈C is a generator for its regular left D-module action, since (V⊠1)⋅1=V. By F2, H(V)=Hom⁡‾(1,V) is an equivalence from C to right K-modules. Rigidity and representability identify both LV=(V⊠1)K and RV=(1⊠V)K with H(V): applying Hom⁡D(X⊠Y,−) in each case gives Hom⁡C(X⊗Y,V), by moving V across the Hom using the appropriate dual. These identifications preserve the right action because both actions are composition of the representing evaluations. Thus J:V↦LV is fully faithful, and the identity on the represented Hom functor defines a right K-linear natural isomorphism ρV:LV→RV.

1.3F1constructalgebra

We prove the algebraic mate calculation needed to dualize sliding. In any rigid category, let A be a Frobenius algebra with b=ϵm, and let ℓ:A→A∨ be its perfect right-curried pairing, so b=ev⁡A(ℓ⊗id). Put F=(−)∨∨, q=(ℓ−1)∨ℓ:A→F(A) and bR=ev⁡A∨(idF(A)⊗ℓ). Then ℓ∨q=ℓ, hence bR(q⊗id)=b. For t:U⊗V→1 define its cyclic transpose, of source F(V)⊗U, by RU,V(t)=ev⁡V∨(idF(V)⊗[(t⊗idV∨)(idU⊗coev⁡V)]). The two snake identities make this operation invertible. Direct substitution proves naturality in U and the rule RU,W(t(idU⊗h))=RU,V(t)(F(h)⊗idU) for h:W→V. It also proves that two successive last-factor rotations equal rotation of their last-two-factor block: substitute the nested coevaluation formula for V⊗W and the reverse-order evaluation formula, obtaining the same nested composite.

2.1step 1.2F1construct

The sliding equation for ρ says that on (V⊠1)(W⊠1)K, sliding W and then V, commuting the distinct exterior factors between these operations, equals sliding V⊗W. To verify it without a diagram, apply Hom⁡D(X⊠Y,−) and the identifications of step 1.2. In either order the two adjunctions represent the same map X⊗Y→V⊗W. If intermediate simple decompositions are inserted, their inclusion/projection sum is ∑qapa=id, so erasing these sums gives the original map in both orders. The reverse-order tensor-dual evaluation is exactly the composite of the two evaluations, and the module associator equation identifies their parentheses. The unit case is evaluation against 1. Yoneda proves the sliding and unit equations.

2.2step 1.3algebra

Define τn(t)=RA⊗(n−1),A(t)(q⊗id) on Hom⁡(A⊗n,1), and set t3=b(m⊗id)=b(id⊗m). Using the first expression and naturality in the first argument gives τ3(t3)=bR(q⊗m)=b(id⊗m)=t3. Thus τ32(t3)=t3. On the other hand, the two-factor rotation rule gives τ32(t3)=RA,A⊗A(t3)(q⊗q⊗id). Using t3=b(id⊗m) and naturality in the last argument makes this bR(F(m)(q⊗q)⊗id). The nondegenerate pairing makes h↦bR(h⊗id) injective on Hom⁡(A⊗A,F(A)), and t3=bR(qm⊗id). Therefore qm=F(m)(q⊗q). Similarly rotating b(id⊗η)=ϵ=b(η⊗id) gives bR(F(η)⊗id)=bR(qη⊗id), so qη=F(η). Thus q is an algebra isomorphism. Every expression above is typed: both inputs to F(m) lie in F(A), and no product of an A input and an F(A) input is used.

2.3F1step 1.1construct

We compute the canonical Frobenius scalar directly, rather than using a trace characterization of δ. Fix a simple i and write j=i∗, transporting across a chosen representative isomorphism if necessary. With d=di,e=ei,a=ai, choose the following projections and sections of the unit summands: pij=ev⁡i,qij=(a−1⊗idi∗)coev⁡i∗/e,pji=ev⁡i∗(idi∗⊗a),qji=coev⁡i/d. Then pijqij=pjiqji=1. The explicit multiplication in F1 gives βij=pij⊠qij∗. Write the corresponding inverse-pairing component as cij=Aiqij⊠pij∗; this is its general form because the relevant two Hom spaces from the unit are one-dimensional. On Ki=i⊠i∗, the first exterior factor in (id⊗β)(c⊗id) is Ai(idi⊗pji)(qij⊗idi); the second is (qji∗⊗idi∗)(idi∗⊗pij∗), which is the left dual of (pij⊗idi)(idi⊗qji). No other summand contributes.

3.1step 1.2step 2.1step 2.2construct

Apply this construction to K∈D and its Frobenius pairing. The twice-right-dual of ρV is a map (F(V)⊠1)K∨∨→(1⊠F−1(V))K∨∨, because right duality in the reversed second factor is left duality in C. It is right K∨∨-linear by twice dualizing the action square. Transport through the algebra isomorphism q:K→K∨∨ gives a right K-linear map ρ~V:(F(V)⊠1)K→(1⊠F−1(V))K. Compose with ρF−1(V)−1. Full faithfulness of J gives a unique isomorphism δV:F(V)→F−1(V) whose image is this composite. The twice-dual sliding equation, transported through q, is the sliding equation for ρ~: internal q−1,q pairs cancel, and the multiplication and unit vertices agree by step 2.2. Combining it with the inverse sliding equation for ρ proves the tensor equation for δ; full faithfulness reflects it in C. Thus gV=δF(V)−1:V→F2(V) is a monoidal natural isomorphism.

4.1step 3.1constructalgebra

Monoidal natural isomorphisms of rigid tensor functors preserve duality. Here this follows directly by applying naturality and the monoidal equation for g to evaluation and coevaluation: the resulting two equations say that gX∨ is the inverse dual of gX, under the canonical dual constraints. Uniqueness of a dual mate follows from the snake identities, so gX∨=(gX∨)−1. Applying this twice gives gF(X)=F(gX). Define C~ to have objects (V,f) with f:V→F(V) invertible and F(f)f=gV, and arrows h with F(h)f=f′h. Tensor using f⊗f′ and the tensor constraint of F; monoidality of g proves closure. The inverse-dual identity just proved gives dual objects and their evaluation and coevaluation. The tautological map f:(V,f)→(F(V),F(f)) is an arrow, with its target an object by F(gV)=gF(V), and it is natural and monoidal. Hence it is a pivotal structure.

5.1step 1.1step 4.1constructalgebra

This cover is finite semisimple. Every simple i is F-stable by step 1.1. Choose bi:i→F(i); there is ci≠0 with F(bi)bi=cigi. Choose ti with ti2ci=1. There are exactly two simple lifts (i,±tibi). On any multiplicity space of i, an arbitrary lift has the form tibi⊗T, and its equation is T2=id. Characteristic zero gives the two projections (id±T)/2, so every lift is a direct sum of these two simple lifts. Their endomorphisms are k, and Hom between opposite lifts vanishes. There are exactly twice as many simple labels, the tensor unit has endomorphism ring k, and rigidity was proved in step 4.1. Thus C~ is a pivotal fusion category, and its forgetful tensor functor to C preserves every evaluation/coevaluation composite, hence squared norms.

6.1step 1.1step 5.1algebra

Over C, squared norms in any pivotal fusion category are strictly positive. Indeed let Di be the pivotal trace of a simple i; substituting tensor-product evaluations and coevaluations and the monoidal pivotal equation proves DiDj=∑rNijrDr, and duality gives ∣i∣2=DiDi∗. Let (Mi)j,r=Nijr and D=(Dj)j≠0, since D1=1. Then MiD=DiD. Rigidity gives Nijr=Ni∗rj, so Mi∗=Mit and MiMitD=∣i∣2D. Since Mi is real, ∣i∣2=D∗MiMitDD∗D=∥MitD∥2∥D∥2≥0. Step 1.1 excludes zero. A pivotal structure for right double duality also supplies one for left double duality by inversion and reindexing, so this calculation applies to the cover in step 5.1 with the statement's trace convention. Each simple of C lifts to a simple of the cover, and forgetting preserves its two trace loops. Thus ∣i∣2>0 in C and ∑i∣i∣2>0. No positivity or reality of Di was used.

7.1step 6.1constructalgebra

For arbitrary k, choose a finite skeletal presentation: simple labels, bases for their finite multiplicity spaces, matrices of associators, unitors, evaluations and coevaluations, their needed inverses, and the finitely many ai±1. Their entries generate a finitely generated characteristic-zero subfield k0⊂k. It embeds into C by choosing an algebraically independent complex image of a finite transcendence basis and extending the remaining finite algebraic extension. The split semisimple skeletal category over k0 with these matrices has the same simple labels and remains split semisimple after this embedding. Its pentagon, triangle and snake equations are finite matrix identities over k0, hence still hold. The two trace loops and their sum are elements of k0 given by these same matrix expressions. A zero sum in k would therefore give a zero sum in the complex fusion category, contradicting step 6.1. Hence Dim⁡(C)≠0.

8.1step 2.3step 7.1algebra∎

Substitution gives (idi⊗pji)(qij⊗idi)=e−1idi: its numerator is a−1(idi∗∗⊗ev⁡i∗)(coev⁡i∗⊗idi∗∗)a=idi by the snake identity. The other first-factor composite is (pij⊗idi)(idi⊗qji)=d−1idi, by (ev⁡i⊗idi)(idi⊗coev⁡i)=idi. The inverse-pairing equation is therefore Ai/(de)=1, so Ai=de=∣i∣2. Finally βijcij=Ai(pijqij)⊠(qij∗pij∗)=∣i∣2. Summing all simple blocks and using c=Δη gives λμΔη=βc=∑i∣i∣2, which is nonzero by step 7.1.

Depends on

Used by

Dependency tree · two levels

3 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