Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-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.

A uniform rank and action-multiplicity bound for module categories

Statement

For a fixed fusion category C over an algebraically closed field of characteristic zero, there is a finite integer R(C) such that every indecomposable finite semisimple right C-module category has at most R(C) isomorphism classes of simple objects. More explicitly, write I for its simple labels, 0 for the unit, and Nijk for its fusion coefficients. There are positive real numbers di=di∗, determined by these coefficients, with d0=1 and didj=∑kNijkdk. Put D=∑idi2. One may take R(C)=⌊D⌋. For every finite semisimple right module category, indecomposable or otherwise, the multiplicity naib=[ma⊙Xi:mb] satisfies naib≤D/di. Consequently there are finitely many possible action multiplicity arrays at any specified rank, and finitely many indecomposable arrays at all ranks.

The real numbers used here concern the fusion ring, and are not categorical traces. No pivotal structure or positivity of categorical dimensions is assumed.

Facts & Assumptions

Given: The category and module categories in the statement.

[F1]

Fusion categories are finite semisimple and rigid with simple unit (Fusion and multifusion categories).

[F2]

Right module categories have associative unital actions (Finite semisimple module category over a fusion category). Indecomposable means not a direct sum of two nonzero action-stable full semisimple subcategories.

Proof

1.1F1algebra

On the real vector space with orthonormal basis bi=[Xi], rigidity gives Frobenius reciprocity Nijk=Ni∗kj=Nkj∗i, and Nij0=δj,i∗. Indeed the adjunctions Hom⁡(Xi⊗Xj,Xk)≅Hom⁡(Xj,Xi∗⊗Xk) and Hom⁡(Xi⊗Xj,Xk)≅Hom⁡(Xi,Xk⊗Xj∗) give the first equalities by dimensions; simplicity of the unit gives the second. Left and right multiplication matrices Li,Ri therefore have transposes Li∗,Ri∗, respectively, and LiRj=RjLi by associativity. The matrix S=∑iLi is real symmetric and strictly positive entrywise: for any a,b, the nonzero object Xb⊗Xa∗ has a simple summand Xi, and reciprocity then gives Niab>0. The object is nonzero because tensoring by a nonzero rigid object is faithful: the unit is a summand of its dual times itself, so a zero tensor product would force the other factor to be zero.

2.1step 1.1algebra

Here is the required positive-matrix argument without an unproved Perron theorem. A real symmetric strictly positive matrix T has a largest eigenvalue λ by the finite-dimensional spectral theorem, equivalently the maximum of vtTv on the real unit sphere. Replacing a maximizing vector by its coordinatewise absolute value cannot decrease this expression; take a nonnegative maximizer v. The equation Tv=λv implies λ>0 and every coordinate of v is positive. Every maximizing vector has coordinates of one sign: if both signs occur, taking absolute values strictly increases its quadratic form because every cross entry is positive. Hence the top eigenspace is one-dimensional, for an independent top eigenvector could be chosen orthogonal to v and would necessarily have both signs. Apply this to S and normalize its positive top eigenvector v by v0=1.

3.1step 1.1step 2.1algebra

Since Ri commutes with S, Riv=div for a scalar di; it is positive because Ri is nonzero and nonnegative and v is strictly positive. Transposition and the scalar product give di⟨v,v⟩=⟨v,Riv⟩=⟨Ri∗v,v⟩=di∗⟨v,v⟩. The coefficient of b0 in vbi is vi∗, so di=vi∗=vi. Right multiplication by a product now gives didj=∑kNijkdk, and R0=1 gives d0=1. These numbers are fixed by the fusion data, since S and the normalization of its unique positive top eigenvector are fixed. Writing Ω=∑idibi=v, we have Ωbi=diΩ and therefore Ω2=DΩ for D=∑idi2.

4.1F1F2step 3.1algebra

For a module category let Ai have entry (b,a) equal to naib. Adjunction for the action, obtained by applying its associator to the evaluation and coevaluation of Xi, gives Hom⁡(ma⊙Xi,mb)≅Hom⁡(ma,mb⊙Xi∗), hence Ait=Ai∗. The matrices represent the fusion ring in the opposite order, which does not affect the equation for the square of a single element. Thus B=∑idiAi is symmetric, has nonnegative entries, satisfies B2=DB, and has diagonal entries at least one since A0=1. If the category is indecomposable, B is strictly positive: the undirected graph joining simples whenever some Ai has a positive connecting entry is connected, since its connected components are exactly action-stable summands. A path from a to b gives a positive entry in the product of its action matrices. Associativity expands that product as a nonnegative integer sum of the Ai, so some Ai already connects a to b.

5.1step 2.1step 3.1step 4.1algebra∎

Every eigenvalue of symmetric B is either 0 or D, by B2=DB. In the indecomposable case strict positivity and step 2.1 make its top eigenspace one-dimensional; since B≠0, its nonzero eigenvalue is D and it has rank one. Thus r≤tr⁡B=D, as each of its r diagonal entries is at least one. For the multiplicity bound in any module category, no indecomposability is needed: the same polynomial identity and symmetry show that the operator norm of B is D, so 0≤di(Ai)ba≤Bba≤D by applying the norm inequality to the unit coordinate vectors. Each entry is therefore a nonnegative integer bounded by D/di. At rank r there are only ∣I∣r2 entries and finitely many such arrays. For indecomposable arrays 1≤r≤⌊D⌋, so their union is finite. The empty category, if allowed, adds the single rank-zero array and is not indecomposable.

Depends on

Used by

Dependency tree · two levels

5 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