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 over an algebraically closed field of characteristic zero, there is a finite integer such that every indecomposable finite semisimple right -module category has at most isomorphism classes of simple objects. More explicitly, write for its simple labels, for the unit, and for its fusion coefficients. There are positive real numbers , determined by these coefficients, with and . Put . One may take . For every finite semisimple right module category, indecomposable or otherwise, the multiplicity satisfies . 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.
Fusion categories are finite semisimple and rigid with simple unit (Fusion and multifusion categories).
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
On the real vector space with orthonormal basis , rigidity gives Frobenius reciprocity , and . Indeed the adjunctions and give the first equalities by dimensions; simplicity of the unit gives the second. Left and right multiplication matrices therefore have transposes , respectively, and by associativity. The matrix is real symmetric and strictly positive entrywise: for any , the nonzero object has a simple summand , and reciprocity then gives . 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.
Here is the required positive-matrix argument without an unproved Perron theorem. A real symmetric strictly positive matrix has a largest eigenvalue by the finite-dimensional spectral theorem, equivalently the maximum of on the real unit sphere. Replacing a maximizing vector by its coordinatewise absolute value cannot decrease this expression; take a nonnegative maximizer . The equation implies and every coordinate of 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 and would necessarily have both signs. Apply this to and normalize its positive top eigenvector by .
Since commutes with , for a scalar ; it is positive because is nonzero and nonnegative and is strictly positive. Transposition and the scalar product give . The coefficient of in is , so . Right multiplication by a product now gives , and gives . These numbers are fixed by the fusion data, since and the normalization of its unique positive top eigenvector are fixed. Writing , we have and therefore for .
For a module category let have entry equal to . Adjunction for the action, obtained by applying its associator to the evaluation and coevaluation of , gives , hence . The matrices represent the fusion ring in the opposite order, which does not affect the equation for the square of a single element. Thus is symmetric, has nonnegative entries, satisfies , and has diagonal entries at least one since . If the category is indecomposable, is strictly positive: the undirected graph joining simples whenever some has a positive connecting entry is connected, since its connected components are exactly action-stable summands. A path from to gives a positive entry in the product of its action matrices. Associativity expands that product as a nonnegative integer sum of the , so some already connects to .
Every eigenvalue of symmetric is either or , by . In the indecomposable case strict positivity and step 2.1 make its top eigenspace one-dimensional; since , its nonzero eigenvalue is and it has rank one. Thus , as each of its 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 is , so by applying the norm inequality to the unit coordinate vectors. Each entry is therefore a nonnegative integer bounded by . At rank there are only entries and finitely many such arrays. For indecomposable arrays , 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
- Etingof, Gelaki, Nikshych, and Ostrik, Tensor Categories, Corollary 9.1.6 (standard reference, not scraped)
- Etingof, Nikshych, and Ostrik, On fusion categories, Section 8.1 (standard reference, not scraped)