Character values and conductors of low-rank groups of Lie type

This paper demonstrates that for certain rank 1 finite groups of Lie type, the conductor of any complex irreducible character is realized at a single group element, thereby providing a specific instance of a potential strengthening of W. Feit's conjecture through methods combining algebraic number theory and character tables.

The Gist

Imagine you are a detective trying to solve a mystery about a massive, complex machine called a Group. This machine is made of thousands of tiny gears (elements) that click and turn in specific patterns.

In the world of mathematics, specifically Group Theory, these machines have "personalities" called Characters. Think of a character as a unique fingerprint or a musical theme that describes how the machine behaves. When you press a specific gear (an element $x$), the character sings out a specific number (a value).

The Mystery: The "Conductor"

Every character sings a song made of many different notes. Some notes are simple (like whole numbers), but many are complex, irrational numbers that sound like they belong to a very specific, high-pitched musical scale.

Mathematicians call the smallest, most complete musical scale needed to hold all the notes of a character's song its Conductor.

• The Old Conjecture (Feit's Conjecture): A famous mathematician named W. Feit guessed that for any machine, there is at least one single gear you can press that will reveal the entire musical scale of the character. In other words, one single note contains the "DNA" of the whole song.
• The New Clue: The authors of this paper, Christopher Herbig and Nguyen Hung, wondered if this is true not just for the scale, but for the Conductor itself. They asked: Is there always one single gear that, when pressed, produces a note whose "complexity" (conductor) is exactly the same as the complexity of the entire song?

The Investigation: Low-Rank Machines

The authors decided to test this on a specific family of machines called Groups of Lie Type. These are like the "standard models" of mathematical machines. They focused on the simplest, most fundamental versions of these machines (Rank 1), which are like the compact cars of the group world:

1. GL2 and SL2: These are like 2D linear machines (think of stretching and rotating a flat sheet).
2. Suzuki Groups: These are a bit more exotic, like a specialized sports car with a unique engine.

The Method: Algebraic Number Theory as a Toolkit

To solve this, the authors didn't just look at the machines; they used a powerful toolkit from Algebraic Number Theory.

Imagine the "notes" (character values) as ingredients in a soup.

• Some ingredients are simple (like salt and pepper).
• Some are complex (like a rare spice that only grows in a specific climate).
• The Conductor is the size of the pot needed to cook the whole soup.

The authors' job was to prove that for these specific machines, you don't need to taste the whole soup to know the size of the pot. You just need to taste one single spoonful (one specific gear press) to know the exact size of the pot required for the entire dish.

The Journey Through the Paper

1. The General Linear Groups (GL2):
The authors looked at the "standard" 2D machines. They found that the characters (songs) come in families.

• The Easy Cases: Some songs are simple loops. The answer is obvious.
• The Tricky Cases: Some songs are sums of two or three complex notes. The authors had to use "number theory lemmas" (like special rules of logic) to prove that even when notes cancel each other out or combine in weird ways, there is always one "master note" that dictates the complexity of the whole group.
• Analogy: Imagine a choir singing a chord. Sometimes, if you listen to just the tenor, you can tell exactly what key the whole choir is singing in. The authors proved that for these machines, the "tenor" (one specific element) always exists.

2. The Special Linear Groups (SL2):
These are similar machines but with a slight restriction (like a car with a speed limiter). The authors showed that the songs here are just "restricted versions" of the GL2 songs. Since the rule worked for the bigger machine, it worked for the smaller one too, with a few minor exceptions that they handled with a simple trick (complex conjugation).

3. The Suzuki Groups (The Exotic Ones):
This was the hardest part. These machines have a very strange structure. The songs here involve sums of four notes.

• The authors had to check if these four notes could ever combine to create a "fake" complexity that didn't exist in the individual notes.
• They used a classification of "vanishing sums" (sums that equal zero). It's like checking if four ingredients can cancel each other out perfectly.
• They proved that even in these exotic cases, the "master note" exists. The complexity of the whole song is always captured by a single gear press.

The Verdict

The authors successfully proved Theorem A:
For these specific low-rank groups, yes, there is always a single element (a single gear) you can press that reveals the full conductor of the character.

Why Does This Matter?

This isn't just a math puzzle.

• Strengthening a Legend: This result is a stronger version of Feit's famous (but unsolved) conjecture. If you can find a single note that holds the conductor, you automatically find a gear whose order (how many times you have to press it to return to start) matches that conductor.
• The Big Picture: It suggests that even in the most chaotic, complex mathematical systems, there is a hidden simplicity. You don't need to analyze the whole system to understand its fundamental nature; sometimes, one single piece of data tells you everything you need to know.

In a Nutshell

The paper is a detective story where the authors prove that for a specific class of mathematical machines, the "fingerprint" of the whole system is always hidden inside a single, specific part. They used advanced number theory to show that you never need to look at the whole picture to understand the scale of the complexity; one single snapshot is enough.

Technical Summary

1. Problem Statement

The paper investigates the conductor of character values for finite groups of Lie type, specifically focusing on those of semisimple rank 1.

• Definitions:
  • Let $G$ be a finite group and $\chi \in \text{Irr}(G)$ be a complex irreducible character.
  • The conductor of a set of cyclotomic integers $S$, denoted $c(S)$, is the smallest positive integer $n$ such that $S \subseteq \mathbb{Q}(\zeta_n)$.
  • The conductor of the character, $c(\chi)$, is defined as the conductor of the set of all its values: $c(\chi) := c(\{\chi(x) \mid x \in G\})$.
• The Core Question: The authors aim to verify a conjecture (denoted as $(\dagger)$) proposed by the second author, which posits that for any irreducible character $\chi$, there exists a single group element $g \in G$ such that:
  $$c(\chi) = c(\chi(g))$$
  This implies that the conductor of the entire set of character values is realized by the conductor of a single value.
• Context: This conjecture, if true, would strengthen a famous 1980 conjecture by W. Feit. Feit's conjecture asserts that $G$ contains an element whose order is exactly $c(\chi)$. Since $c(\chi(g))$ divides the order of $g$, proving $(\dagger)$ would immediately imply Feit's conjecture. While $(\dagger)$ is easily verified for symmetric/alternating groups (where values are often rational), it is significantly harder for groups of Lie type, which possess highly irrational character values.

2. Methodology

The authors employ a combination of representation theory and algebraic number theory to analyze the specific structure of character tables for rank-1 groups.

• Target Groups: The paper focuses on three families of rank-1 groups:
  1. General Linear Groups: $GL_2(q)$
  2. Special Linear Groups: $SL_2(q)$
  3. Suzuki Groups: ${}^2B_2(q)$ (where $q = 2^{2n+1}$)
• Character Analysis: The authors utilize the known classification of irreducible characters for these groups (based on Deligne-Lusztig theory and classical results by Jordan, Schur, and Suzuki). They categorize characters into families (e.g., unipotent, semisimple, and specific families labeled $X_{(m,n)}$, $Y_{(n)}$, etc.) and analyze their reduced value sets.
• Number-Theoretic Tools:
  • Loxton's Theorem: They use a result by J.H. Loxton regarding the conductors of sums of roots of unity. Specifically, if a sum of $k$ roots of unity cannot be expressed as a sum of fewer than $k$ roots, the field generated by the sum contains the individual roots.
  • Minimal Vanishing Sums: For the Suzuki groups, the authors analyze minimal vanishing sums of roots of unity (sums that equal zero but have no proper sub-sum equal to zero). They rely on the classification of such sums with up to 7 terms to handle cases where character values collapse into simpler forms.
  • Galois Theory: The proofs involve analyzing the action of Galois automorphisms on cyclotomic fields to determine the fixed fields and the conductors of specific sums.
• Strategy: For each character family, they determine the field of values $\mathbb{Q}(\chi)$ and the conductor $c(\chi)$. They then demonstrate that there exists a specific element $g$ (often corresponding to a specific power of a generator in a maximal torus) such that $\mathbb{Q}(\chi(g))$ generates the same field or has the same conductor as the full set of values.

3. Key Contributions and Results

Main Theorem (Theorem A)

The paper proves that for the groups $GL_2(q)$, $SL_2(q)$, and ${}^2B_2(q)$, the conjecture $(\dagger)$ holds true.

Theorem A: Let $G$ be one of the groups $GL_2(q)$, $SL_2(q)$, or ${}^2B_2(q)$. For every $\chi \in \text{Irr}(G)$, there exists an element $g \in G$ such that $c(\chi) = c(\chi(g))$.

Specific Findings by Group Family:

1. $GL_2(q)$:
   • The authors analyze four families of characters: linear characters, Steinberg characters, and two families of non-unipotent characters ($X_{(m,n)}$ and $Y_{(n)}$).
   • For the complex families $X_{(m,n)}$ and $Y_{(n)}$, the values involve sums of roots of unity. The authors use Lemmas 2.1–2.4 to handle cases where these sums vanish or reduce to single roots of unity. They prove that even in these degenerate cases, the conductor is attained by a single value.
2. $SL_2(q)$:
   • Characters of $SL_2(q)$ are derived from restrictions of $GL_2(q)$ characters.
   • The authors show that the property holds for the restricted characters $X^1_{(k)}$ and $Y^1_{(n)}$. They utilize Lemma 3.2 to show that for sums of the form $\epsilon^{na} + \epsilon^{-na}$, the field of values is generated by a single term $\epsilon^n + \epsilon^{-n}$.
3. Suzuki Groups ${}^2B_2(q)$:
   • This is the most technically demanding section. The characters involve values on three types of maximal tori.
   • The authors analyze the values of semisimple characters, which are sums of 4 roots of unity (e.g., $\zeta^m + \zeta^{mq} + \zeta^{-m} + \zeta^{-mq}$).
   • Proposition 4.2 is the core result here. It uses the classification of minimal vanishing sums (Table 2) to exhaustively check cases where the sum of 4 roots might reduce to fewer terms. They prove that regardless of whether the sum vanishes, reduces to a root of unity, or remains a sum of 4 terms, the conductor is always realized by a single group element.

4. Significance and Implications

• Advancement of Feit's Conjecture: By confirming $(\dagger)$ for these specific groups, the paper provides strong evidence for Feit's conjecture. It demonstrates that for low-rank groups of Lie type, the "worst-case" irrationality of a character is captured by a single group element.
• Distinction between Field and Conductor: The paper clarifies the relationship between the field of values $\mathbb{Q}(\chi)$ and the conductor. While it is generally false that $\mathbb{Q}(\chi) = \mathbb{Q}(\chi(g))$ (the field of values might require multiple generators), the paper proves that the conductor (the smallest $n$ such that the field is contained in $\mathbb{Q}(\zeta_n)$) is always realized by a single value.
• Methodological Framework: The techniques developed, particularly the use of minimal vanishing sums and Loxton's theorem in the context of character tables, provide a blueprint for attacking similar problems in higher-rank groups (e.g., $GL_3(q)$, Ree groups), though the authors note this would be significantly more complex.
• Counter-examples to Stronger Conjectures: The authors note that while the conductor property holds, the stronger property that the field of values is generated by a single value fails for general groups (citing examples like SmallGroup(32,15) and $4.L_2(25).2^3$). This highlights the subtlety of the conductor problem.

Conclusion

Herbig and Hung successfully resolve the conductor realization problem for all rank-1 groups of Lie type. Their work bridges the gap between abstract representation theory and concrete number-theoretic properties of character values, offering a significant step toward understanding the structure of character conductors in finite simple groups.