Coherent systems of probability measures on graphs for representations of free Frobenius towers

Henry KvingearXiv 2018 · DOI · arXiv

TL;DR

This paper generalizes the theory of "coherent systems"—sequences of probability measures on graded graphs—from symmetric groups to a much broader class of algebraic structures known as free Frobenius towers. Crucially, it extends this framework to non-semisimple algebras, revealing a duality between simple modules and indecomposable projective modules that results in two distinct, mathematically rich coherent systems.

What Problem Does This Paper Address?

In asymptotic representation theory, researchers study how the properties of algebraic structures (like the symmetric group $S_n$) behave as they grow infinitely large ($n \to \infty$). A key tool in this field is the "coherent system," a sequence of probability measures (like the Plancherel measure) defined on a graded graph (like the Young diagram lattice). These measures must be "coherent," meaning they play nicely with transition functions that describe how representations of $A_n$ relate to those of $A_{n+1}$.

Until now, most of this work assumed semisimplicity—a condition where every representation can be perfectly decomposed into a unique sum of "simple" building blocks. However, many modern and "exotic" algebras (such as Hecke algebras or certain superalgebras) are non-semisimple. In these cases, the relationship between simple modules and "projective" modules (the building blocks that map onto simples) becomes complicated. The author tackles the challenge of defining coherent systems for these more complex, non-semisimple "Frobenius towers."

Methods

The author utilizes the framework of Frobenius extensions. A tower of algebras is a Frobenius tower if the operations of "induction" (moving a representation up the tower) and "restriction" (moving it down) are biadjoint—essentially, they are two sides of the same coin.

The key methodological innovation is the distinction between two types of modules:

  1. Simple modules ($L^\lambda$): The irreducible "atoms" of the representation.
  2. Indecomposable projective modules ($P^\lambda$): Larger structures that "cover" the simples.

In a semisimple algebra, these are identical. In a non-semisimple algebra, they diverge. The author uses this divergence to define two different sets of transition probabilities (down/up functions) on the "Bratteli diagram" (the graded graph representing the tower). The paper also employs Jucys-Murphy elements, which are special elements in the center of these algebras that help encode combinatorial data into algebraic form.

Datasets

Not discussed in the paper. As a theoretical mathematical work, it does not use empirical datasets. Instead, it provides rigorous proofs and applies its framework to several well-known algebraic "test cases," including:

  • The tower of symmetric group algebras ($\mathbb{C}[S_n]$).
  • Sergeev superalgebras.
  • Wreath product algebras.
  • Degenerate cyclotomic Hecke algebras.

Key Insights and Ideas

  • The Duality of Non-Semisimplicity: The most significant "aha!" moment is that when semisimplicity fails, a single coherent system splits into two. In one system, "down" transitions are controlled by the dimensions of simple modules, while "up" transitions are controlled by projective modules. In the second system, the roles are reversed.
  • Generalizing the Plancherel Measure: The author defines a generalized Plancherel measure for non-semisimple algebras that weights a representation by the product of the dimension of its simple module and the dimension of its projective cover.
  • Algebraic Encoding of Probability: The paper proves that the "moments" (statistical properties like mean and variance) of these new probability measures are exactly captured by specific central elements within the algebras. This means hard probabilistic questions can be translated into easier algebraic ones.
  • Categorical Connections: The author notes that these transition functions appear naturally in "Heisenberg categories," suggesting that these probabilistic systems are deeply embedded in the structure of higher-dimensional category theory.

Key Results

  • Construction of Two Systems: The paper successfully constructs two coherent systems ($G_\Gamma$ and $G^*_\Gamma$) for any free Frobenius tower.
  • Theorem 4.4: This is the central result. It provides a formula showing that the moments of the transition measures are equal to the values of specific central elements (related to the Frobenius trace).
  • Unified Framework: The paper provides a single, unified language that covers symmetric groups, superalgebras, and Hecke algebras, which were previously often treated as separate cases.

Limitations and Future Work

  • Limit Shapes: While the paper provides the framework for these measures, it does not calculate the specific "limit shapes" (the asymptotic distribution of the measures) for the newer examples like cyclotomic Hecke algebras. The author identifies this as a primary goal for future research.
  • Symmetric Functions: The author suggests there is a deeper, yet-to-be-explored connection between these new coherent systems and the theory of symmetric functions (like Schur or Jack polynomials).
  • Combinatorial Properties: The commutative algebras generated by these new moment functions likely have fascinating combinatorial properties that remain unexamined.

Summary updated

Abstract

First formally defined by Borodin and Olshanski, a coherent system on a graded graph is a sequence of probability measures which respect the action of certain down/up transition functions between graded components. In one common example of such a construction, each measure is the Plancherel measure for the symmetric group $S_{n}$ and the down transition function is induced from the inclusions $S_{n} \hookrightarrow S_{n+1}$. In this paper we generalize the above framework to the case where $\{A_n\}_{n \geq 0}$ is any free Frobenius tower and $A_n$ is no longer assumed to be semisimple. In particular, we describe two coherent systems on graded graphs defined by the representation theory of $\{A_n\}_{n \geq 0}$ and connect one of these systems to a family of central elements of $\{A_n\}_{n \geq 0}$. When the algebras $\{A_n\}_{n \geq 0}$ are not semisimple, the resulting coherent systems reflect the duality between simple $A_n$-modules and indecomposable projective $A_n$-modules.
BibTeX
@misc{kvinge2018coherent,
  author = {Henry Kvinge},
  title = {{Coherent systems of probability measures on graphs for representations of free Frobenius towers}},
  year = {2018},
  eprint = {1810.11555},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/1810.11555},
}

Loading related content...

Figure