Semisimple Picky Elements in Lie Type Groups

• Semisimple picky elements are defined as semisimple elements that lie in a unique Sylow ℓ-subgroup with centralisers determined by a unique Sylow d-torus.
• They underpin the Picky Conjecture by establishing bijections between irreducible characters of the group and its local subnormaliser, preserving key invariants.
• Their classification employs Deligne–Lusztig induction and Lusztig’s Jordan decomposition, offering actionable insights for modular representation theory.

A semisimple picky element is a semisimple element which lies in a unique Sylow ℓ-subgroup (for a prime ℓ ≠ the defining characteristic) of a finite group of Lie type or an associated algebraic group, a structure deeply intertwined with subnormalisers and the existence of tight character correspondences that generalize aspects of the McKay Conjecture. The concept and its representation-theoretic consequences have been formalized and classified in recent work, culminating in the verification of the Picky Conjecture for quasi-simple finite groups of Lie type outside the defining prime (Malle, 13 Mar 2025, Malle et al., 21 Oct 2025).

1. Definition and Characterisation of Semisimple Picky Elements

A semisimple element $x$ of a finite group $G$ (typically of Lie type, $G = \mathbb{G}^F$) is called picky with respect to a prime $\ell$ (distinct from the defining prime $p$) if $x$ lies in a unique Sylow $\ell$-subgroup of $G$ (Malle, 13 Mar 2025, Malle et al., 21 Oct 2025). Equivalently, the subnormaliser of $x$ in $G$ is the normaliser of the unique Sylow $G$0-subgroup containing $G$1: $G$2 For semisimple $G$3-elements (with $G$4 an odd prime different from $G$5), this pickiness is further sharpened by the existence of a unique Sylow $G$6-torus $G$7 (with $G$8, defined by the multiplicative order of $G$9 modulo $G = \mathbb{G}^F$0) such that $G = \mathbb{G}^F$1 (Malle, 13 Mar 2025): $G = \mathbb{G}^F$2 In the important case $G = \mathbb{G}^F$3 (e.g., when $G = \mathbb{G}^F$4 divides $G = \mathbb{G}^F$5), $G = \mathbb{G}^F$6 is picky if and only if it is regular semisimple: its centraliser is a maximal torus.

2. Subnormalisers and the Local Structure

The subnormaliser $G = \mathbb{G}^F$7 of an element $G = \mathbb{G}^F$8 is the subgroup generated by the normalisers of all Sylow subgroups containing $G = \mathbb{G}^F$9: $\ell$0 For semisimple picky elements $\ell$1, the structure simplifies significantly: there exists a unique Sylow $\ell$2-torus $\ell$3 with $\ell$4 and

$\ell$5

This reduction is critical both for the tractability of the subnormaliser in group-theoretic terms and as a foundation for explicit character correspondences, as the normaliser of a torus is often much more accessible than general local subgroups.

3. The Picky Conjecture and Character Correspondences

The Picky Conjecture, as formulated by Moretó and Rizo and proven for groups of Lie type (outside the defining characteristic), posits a bijection between the irreducible complex characters of $\ell$6 not vanishing on a picky element $\ell$7 and the irreducible characters of $\ell$8 that do not vanish on $\ell$9 (Malle et al., 21 Oct 2025, Malle, 13 Mar 2025). In favorable cases, this correspondence preserves more refined invariants—most notably degrees, character values (up to sign), and fields of values.

A particularly strong form, the Strong Picky Conjecture, asserts that for many classes of characters (notably those afforded by Deligne–Lusztig induction from suitable Levi subgroups), the nonzero values of the character on $p$0 in $p$1 and on $p$2 in $p$3 coincide up to sign [(Malle et al., 21 Oct 2025), Prop. 3.9]: $p$4 where $p$5 is an irreducible character of $p$6 from a minimal $p$7-split Levi $p$8 and $p$9 a character of $x$0.

4. Classification for Small Primes and Structural Criteria

The complete classification for $x$1 and $x$2 in quasi-simple groups of Lie type is accomplished in [(Malle et al., 21 Oct 2025), §4]. For every simple, simply connected group $x$3 over a field of odd characteristic $x$4, a picky $x$5-element is characterised as follows:

• It lies in a unique $x$6-stable maximal torus $x$7 with $x$8,
• Its order must be a $x$9-power determined by the cyclotomic factors dividing $\ell$0 [(Malle et al., 21 Oct 2025), Prop. 4.3]. The classification is case-by-case for small rank and exceptional types; see tables providing the centraliser structures and consequences for character degrees.

In many small rank groups (e.g., certain $\ell$1 and $\ell$2), picky elements of order $\ell$3 or $\ell$4 exist only for special $\ell$5 (Fermat or Mersenne primes, $\ell$6, etc.), and, except for these cases, pickiness is more common for primes $\ell$7 with abelian but not cyclic Sylow subgroups.

5. Theoretical Framework: Lusztig Induction and Jordan Decomposition

The verification of the Picky Conjecture for semisimple picky elements utilises Deligne–Lusztig theory—specifically, that values of irreducible characters on $\ell$8 are determined via Lusztig induction from tori or minimal $\ell$9-split Levi subgroups: $G$0 For picky $G$1, almost all terms appearing in this expansion are conjugate to a single character, which enables the transfer of information to the local subgroup $G$2, since $G$3 is locally as “generic” as possible.

This compatibility is strengthened by properties of Lusztig's Jordan decomposition, especially when it preserves sign and degree structures; under mild additional hypotheses, the Strong Picky Conjecture holds in all cases.

6. Broader Impact and Connections

The study of semisimple picky elements not only supplies explicit local–global bridges (generalizing the Isaacs–Malle–Navarro reduction in the McKay conjecture) but also clarifies the role of regular semisimple elements and their centralisers in character theory and the representation theory of finite groups of Lie type.

The parametrization of semisimple classes and semisimple characters (in terms of tori, their component groups, and multi-faceted data from the Brauer complex and affine Weyl groups) is essential for this ongoing local–global analysis (Brunat, 2010). The combinatorial-geometric structure of these elements (e.g., having centraliser a maximal torus) is critical both structurally and algorithmically, since most character-theoretic invariants then reflect properties of very tractable local subgroups.

Table: Criteria and Consequences for Semisimple Picky Elements

Feature	Condition/Structure	Consequence
Definition	Unique Sylow ℓ-subgroup containing $G$4	$G$5
Centraliser	$G$6 (unique Sylow $G$7-torus $G$8)	$G$9 'regular' ⇒ $x$0 toral
Character Correspondence	Bijection $x$1	Preserves ℓ-parts, values (sign)
Small primes ($x$2)	Explicit case-by-case classification	Table of groups/types

7. Applications and Future Directions

The existence and classification of semisimple picky elements not only facilitates the verification of the Picky Conjecture (and its refinements)—thereby providing the sharpest bridges yet between global and local representation theory—but also heralds new computational techniques for explicit character evaluation, decomposition numbers, and automorphism group actions for finite groups of Lie type. These insights are anticipated to yield further progress in modular representation theory, block theory, and the algorithmic study of finite simple and quasi-simple groups.

The extension of these correspondences beyond quasi-simple groups, analysis for more general primes or more intricate local subgroups, and the systematic study of their exceptional behavior in covering and non-split cases present promising avenues for future research (Malle, 13 Mar 2025, Malle et al., 21 Oct 2025).