On the Chevalley-Bass number of a field

This paper establishes upper and lower bounds for the Chevalley-Bass number of fields of characteristic zero, provides an algorithm to compute this value given the maximal abelian subextension, and applies these results to improve a constant in exponential Diophantine equations.

The Gist

Imagine you are a detective trying to solve a mystery about numbers. Specifically, you are looking at a special collection of numbers called a Field (let's call it $K$). This field is a bit like a magical kingdom where you can add, subtract, multiply, and divide numbers, but with some very specific rules.

The paper by Gillibert, Gillibert, and Ranieri is about finding a "Master Key" for this kingdom. This key is called the Chevalley-Bass Number (let's call it $\Lambda$).

The Mystery: The "Power" Problem

In this kingdom, there are special numbers called roots of unity. Think of these as the "clock hands" of the number world. If you turn a clock hand 12 times, you get back to where you started. In math, these are numbers that, when multiplied by themselves a certain number of times, equal 1.

The mystery is this:
Sometimes, a number $x$ in your kingdom $K$ looks like it has been "powered up" (raised to a high power) inside a slightly larger, more magical version of the kingdom (called $K(\zeta)$).

• The Question: If $x$ looks like a perfect $n$-th power in the big kingdom, does that mean it was already a perfect $n$-th power in your original, smaller kingdom?
• The Catch: Not always. Sometimes, you need to multiply $x$ by a special "magic number" (a root of unity) to make it work.

The Chevalley-Bass Number ($\Lambda$) is the smallest "magic multiplier" you need to guarantee that if a number looks like a power in the big kingdom, it is definitely a power in the small one (once you account for the magic).

The New Discovery: A Better Map

Before this paper, mathematicians knew such a number existed, but they didn't have a precise way to calculate it for every specific kingdom. They had a rough guess, but it was often too big or too vague.

The authors' breakthrough is like finding a GPS for this number. They figured out exactly how to calculate $\Lambda$ based on two simple things about the kingdom:

1. $\lambda$ (Lambda): How many "clock hands" (roots of unity) are already inside the kingdom?
2. $f$ (The Conductor): How "complex" is the kingdom's connection to the rest of the number world?

The Formula:
They discovered that $\Lambda$ is tightly squeezed between two values. It must be a multiple of the number of clock hands ($\lambda$) and a divisor of a specific number derived from the kingdom's complexity ($f'$).

• Simple Analogy: Imagine you are trying to guess the weight of a secret package. You know it weighs at least as much as a brick ($\lambda$) and at most as much as a boulder ($f'$). The authors didn't just give you the range; they gave you a scale that tells you the exact weight based on the shape of the box.

The Algorithm: A Recipe for the Answer

The paper doesn't just give a formula; it gives a recipe (algorithm).
If you know the "blueprint" of the kingdom (specifically, its maximal abelian subextension, which is like the "skeleton" of the kingdom's structure), you can run a step-by-step computer program to find the exact Chevalley-Bass number.

How the recipe works:

1. Look at the prime numbers that divide the "clock hands" count ($\lambda$).
2. For each prime, check how the kingdom behaves when you add more "clock hands."
3. The program checks if the "magic" works at different levels of complexity.
4. It stops exactly when it finds the smallest number that makes the math work perfectly.

Why Should You Care? (The Real-World Impact)

You might ask, "Who cares about these abstract number kingdoms?"

The paper mentions a connection to Exponential Diophantine Equations. These are equations where the unknowns are in the exponent (like $2^x + 3^y = 5^z$). These are notoriously hard to solve.

• The Old Way: Mathematicians used a very large, safe number to estimate how many solutions these equations could have. It was like using a giant net to catch a tiny fish; it worked, but it was inefficient and gave loose estimates.
• The New Way: By using the precise Chevalley-Bass number ($\Lambda$) instead of the old, rough estimate, the authors can tighten the net. They can prove that there are fewer solutions than previously thought, or find them much faster.

The "Bilu" Connection:
The paper answers questions posed by a mathematician named Bilu.

• Question: Is the Chevalley-Bass number always a multiple of 4?
• Answer: Yes! (Unless the kingdom is very simple, but even then, it's usually 4).
• Question: Can we calculate it?
• Answer: Yes, here is the algorithm.

The "Cohomology" Part (The Secret Sauce)

The paper uses a branch of math called Galois Cohomology.

• Analogy: Imagine the kingdom has a security system. The "roots of unity" are the guards. The "cohomology" is a way of measuring how well the guards are organized.
• The authors proved that the "security system" (the cohomology group) is always controlled by the number of guards ($\lambda$). If you have 10 guards, the system can't be more chaotic than a factor of 10. This insight is the key that unlocked the ability to calculate the Master Key ($\Lambda$).

Summary in a Nutshell

1. The Problem: We needed a precise "magic number" to solve certain tricky math puzzles about powers in number fields.
2. The Solution: The authors found a way to calculate this number exactly using the field's "roots of unity" and its "conductor."
3. The Tool: They provided a step-by-step algorithm (a recipe) to compute it.
4. The Result: This allows mathematicians to solve complex exponential equations more efficiently and with tighter, more accurate bounds than ever before.

It's like upgrading from a rough sketch of a treasure map to a high-definition satellite image. You still know where the treasure is, but now you know exactly where to dig.

Technical Summary

1. Problem Statement

The paper addresses the Chevalley-Bass number ($\Lambda$) of a field $K$ of characteristic zero. This concept arises from the study of exponential Diophantine equations. Specifically, for a field $K$ where the maximal abelian subextension $K_{ab}/\mathbb{Q}$ has finite degree, there exists a smallest positive integer $\Lambda$ such that for any integer $n$:
$$(K(\zeta_{\Lambda n})^\times)^{\Lambda n} \cap K^\times \subseteq (K^\times)^n$$
where $\zeta_k$ denotes a primitive $k$-th root of unity.

The authors aim to:

1. Establish precise upper and lower bounds for $\Lambda$ in terms of the arithmetic invariants of $K$.
2. Provide an algorithm to compute $\Lambda$ given the structure of $K_{ab}$.
3. Resolve open questions regarding the properties of $\Lambda$ and improve constants in related Diophantine results.

2. Methodology

The authors employ Galois cohomology as their primary tool, a strategy previously used by Laurent but refined here with new insights. The methodology proceeds through the following steps:

• Cohomological Characterization: They establish that the Chevalley-Bass number is determined by the surjectivity of specific inflation maps in Galois cohomology. Specifically, $\Lambda$ is the smallest integer such that for all $n$, the map $H^1(G_{\Lambda n}, \mu_{\Lambda}) \to H^1(G_{\Lambda n}, \mu_{\Lambda n})$ is surjective, where $G_n = \text{Gal}(K(\zeta_n)/K)$.
• Reduction to Abelian Extensions: They prove that $K$ and its maximal abelian subextension $K_{ab}$ share the same Chevalley-Bass number. This allows the problem to be reduced to the case where $K$ is a finite abelian extension of $\mathbb{Q}$.
• Local Analysis (Prime by Prime): Using the Chinese Remainder Theorem and properties of cyclic groups, they analyze the $p$-adic valuation of $\Lambda$ ($\text{ord}_p(\Lambda)$) independently for each prime $p$.
• Group Structure Analysis: They utilize the structure of the Galois groups of cyclotomic extensions, specifically the subgroups $\Omega_{k,\nu}^p$ (kernels of reduction maps in $(\mathbb{Z}/p^\nu\mathbb{Z})^\times$), to compute cohomology groups $H^1$ and $H^2$.
• Algorithmic Construction: By determining the conditions under which cohomology maps become surjective, they derive a finite-step algorithm to compute $\Lambda$.

3. Key Contributions and Results

A. The Main Theorem (Theorem 1.1)

The paper provides tight bounds for the Chevalley-Bass number $\Lambda$. Let:

• $\lambda$: The number of roots of unity in $K$ (i.e., the largest integer such that $\mathbb{Q}(\zeta_\lambda) \subseteq K$).
• $f$: The conductor of $K_{ab}/\mathbb{Q}$.
• $f'$: A modified conductor defined as:
  $$f' = \begin{cases} \prod_{p|\lambda} p^{\text{ord}_p(f)} & \text{if } 4 \mid f \\ 4 \prod_{p|\lambda} p^{\text{ord}_p(f)} & \text{if } f \text{ is odd} \end{cases}$$

The Chevalley-Bass number $\Lambda$ satisfies:
$$\text{lcm}\left(4, \lambda, \frac{f'}{\lambda}\right) \mid \Lambda \mid f'$$

Corollaries:

• $\Lambda$ has exactly the same prime factors as $\lambda$.
• If $K_{ab}/\mathbb{Q}$ is totally real, $\Lambda$ is a power of 2.
• $\Lambda$ is always a multiple of 4.

B. Cohomological Bounds (Proposition 1.2 & Lemma 2.10)

The authors prove that the Galois cohomology group $H^1(\text{Gal}(K(\zeta_n)/K), \mu_n)$ is killed by $\lambda$ (the number of roots of unity in $K$).

• Correction of Literature: They demonstrate that the order of this group is unbounded as $n$ varies, correcting a statement in Laurent's [Lau84] regarding the boundedness of the group order. However, they confirm the boundedness of the exponent (which is $\lambda$), which is the crucial property for Diophantine applications.

C. Improved Diophantine Constants (Corollary 1.4)

Using the cohomological results, the authors improve upon previous explicit bounds for exponential Diophantine equations (specifically Proposition 4.4 of [BLN+25] and [Lau84]).

• They show that the Chevalley-Bass number $\Lambda$ in these bounds can be replaced by the simpler invariant $\lambda$ (the number of roots of unity).
• This leads to a significant improvement in the constant $\rho$ in Proposition 4.7 of [BLN+25], changing the bound from $\rho \exp(\exp(m/\log m))$ to $2\rho \exp(m)$.

D. Algorithm for Computation (Section 2.5)

The paper presents an algorithm to compute $\Lambda$ for any field $K$ where $K_{ab}$ is known:

1. Compute the conductor $f$ and the Galois group $G_f = \text{Gal}(\mathbb{Q}(\zeta_f)/K)$.
2. For each prime $p \mid \lambda$, determine the smallest integer $j$ such that specific cohomology maps are surjective for a finite set of test integers $n$.
3. The value $\Lambda$ is constructed from these $p$-adic valuations.

E. Existence of Extremal Cases (Section 2.6)

The authors construct explicit examples of fields with conductor $f = p^{4m}$ and $\lambda = 2p^2$ (for odd primes $p$) where $\Lambda$ takes all possible values allowed by their bounds: $4p^2$, $4p^3$, and $4p^4$. This proves that the bounds in Theorem 1.1 are sharp.

4. Significance

• Theoretical Precision: The paper resolves the exact arithmetic nature of the Chevalley-Bass number, showing it is entirely determined by the roots of unity and the conductor of the maximal abelian subextension.
• Algorithmic Feasibility: It transforms the Chevalley-Bass number from an existential constant into a computable invariant for number fields.
• Diophantine Applications: By replacing the complex Chevalley-Bass number with the simpler count of roots of unity ($\lambda$) in Diophantine bounds, the paper significantly tightens estimates for exponential equations, potentially leading to better effective bounds in number theory problems.
• Correction of Prior Work: It clarifies the behavior of Galois cohomology groups in this context, correcting a minor error in Laurent's 1984 paper regarding group orders while reinforcing the validity of his exponent-based results.

In summary, this work provides a complete structural characterization of the Chevalley-Bass number, offering both theoretical bounds and practical computational tools that directly enhance the study of exponential Diophantine equations.