🔢 mathematics

The minimal periodicity for integral bases of pure number fields

This paper establishes a sharp local-to-global principle demonstrating that the integral basis shape of a pure number field $K_a=\mathbb{Q}(\sqrt[n]{a})$ is determined by the residue of $a$ modulo $p^{e+1}$ for each prime power $p^e$ dividing $n$ , resulting in a global periodicity with the minimal modulus $M(n) = n \cdot \mathrm{rad}(n)$ .

Original authors: Khai-Hoan Nguyen-Dang

Published 2026-08-26

📖 5 min read🧠 Deep dive

CC BY 4.0

Original authors: Khai-Hoan Nguyen-Dang

Original paper licensed under CC BY 4.0 (http://creativecommons.org/licenses/by/4.0/). ✨ This is an AI-generated explanation of the paper below. It is not written or endorsed by the authors. For technical accuracy, refer to the original paper. Read full disclaimer

In the vast landscape of mathematics, there is a branch dedicated to understanding the hidden structures of numbers, specifically how they combine to form new systems called number fields. Imagine taking a simple number, like two, and asking what happens if you look for a number that, when multiplied by itself a certain number of times, equals that original value. This process creates a new world of numbers with its own rules. Within these worlds, mathematicians are constantly searching for the most efficient way to list all the fundamental building blocks, known as an integral basis. Think of this basis as a master set of Lego bricks that can be combined in specific ways to build every single number in that system without leaving any gaps or creating duplicates. For centuries, scholars have known that the shape of this master set changes depending on the starting number used to create the field, but the pattern behind these changes has remained elusive, especially as the complexity of the system grows.

A recent study by Khai-Hoan Nguyen-Dang has finally cracked the code on exactly how much information is needed to predict this shape. The researcher focused on a specific type of number field created by taking the root of an integer, a setup that has been a classic problem in algebra for over a century. The central question was simple yet profound: if you change the starting number just a little bit, does the structure of the building blocks change completely, or does it stay the same? Previous work had shown that for small, simple systems, the pattern repeats itself in a predictable cycle, but it was unclear if this held true for all systems or exactly how long those cycles were. The new paper proves that there is a precise, minimal amount of information required to determine the entire structure. It turns out that to know the shape of the building blocks for a system of a certain size, you only need to know the starting number up to a specific level of detail, much like knowing the first few digits of a long code is enough to identify the whole sequence.

The breakthrough lies in a concept the author calls the "shape" of the basis. This shape is not a visual picture but a detailed description of the fractions and adjustments needed to construct the fundamental bricks. The study demonstrates that this shape is governed by a strict rule of periodicity. If you take two starting numbers that are very close to each other in a specific mathematical sense—meaning they leave the same remainder when divided by a particular calculated number—their resulting systems will have identical shapes for their building blocks. The author calculated exactly what this dividing number is for any given system size. It is a value derived from the size of the system and its prime factors, and the paper proves that this value is the smallest possible one that works. No smaller amount of information is sufficient; if you try to use less, you will miss critical details that change the structure.

This finding resolves a long-standing uncertainty about the efficiency of these calculations. For decades, mathematicians had observed patterns in small examples and guessed at the rules for larger ones. This paper confirms that the rules are not just guesses but are mathematically proven to be the absolute minimum required. The researcher showed that the local behavior of the system at each prime factor determines the global behavior, and that this local behavior stabilizes after a very specific point. Once you pass that point, adding more digits to your starting number does not change the shape of the basis. This means that instead of having to calculate the complex structure for every single new number, one can simply look up the number's remainder against this specific modulus to instantly know the structure of its entire system.

The implications of this discovery are practical and immediate. Because the shape is now known to be periodic with a minimal, predictable modulus, mathematicians can create finite lookup tables. These tables would list every possible shape for a given system size, indexed by the remainder of the starting number. This transforms a potentially infinite and chaotic search into a manageable, organized task. The paper also provides a way to count how often each shape appears among all possible starting numbers, revealing that they are distributed in a regular, predictable way. This allows for a deeper understanding of the frequency of different structural types within these number fields.

The study does not claim to solve every mystery in number theory, nor does it suggest that all number fields behave this way. It is strictly limited to a specific, well-defined family of fields known as pure fields, where the starting number is not a perfect power of any other integer. Within this family, however, the results are definitive. The author proves that the periodicity is not just a feature of small examples but a fundamental law that holds for all sizes of these systems. By establishing the exact boundary of information needed, the work removes the guesswork from determining the integral basis of these fields, turning a complex algebraic problem into a matter of checking a specific remainder. This clarity offers a powerful new tool for researchers who study the architecture of numbers, providing a clear map where there was once only a fog of possibilities.

Technical Summary: The Minimal Periodicity for Integral Bases of Pure Number Fields

Problem Statement
The paper addresses the classical problem of determining the ring of integers $\mathcal{O}_{K_a}$ for pure number fields $K_a = \mathbb{Q}(\theta)$ where $\theta^n = a$ . Specifically, it investigates the periodicity of the "shape" of an integral basis as the parameter $a$ varies. While previous works (e.g., Gaál–Remete for small degrees, Jakhar–Khanduja–Sangwan for general $n$ ) established that the structure of integral bases is periodic with respect to $a$ , the precise minimal modulus governing this periodicity had not been rigorously determined for all $n \ge 3$ . The central question is: what is the smallest modulus $M(n)$ such that if $a \equiv a' \pmod{M(n)}$ , the integral basis structure of $\mathbb{Q}(\sqrt[n]{a})$ is identical to that of $\mathbb{Q}(\sqrt[n]{a'})$ ?

Methodology
The author employs a "local-to-global" approach, relying on the explicit $p$ -adic invariants and integral bases constructed by Jakhar–Khanduja–Sangwan [JKS21] under Hypothesis (H) (which requires $a$ to be $n$ -th power-free and satisfies specific valuation conditions at primes dividing $n$ ).

Definition of Shape: The paper formalizes the concept of the "shape" of an integral basis. In the fixed coordinate system $\{1, \theta, \dots, \theta^{n-1}\}$ ${1, θ, \dots, θ^{n - 1}}$ , an integral basis is represented as a set of elements with rational coefficients. The shape $S(a)$ $S (a)$ is defined as the tuple of local shapes $S_p(a)$ $S_{p} (a)$ for each prime $p \mid n$ $p ∣ n$ . Each local shape $S_p(a)$ $S_{p} (a)$ consists of:
- The sequence of $p$ -adic denominator exponents $k_{p,m}$ for the basis elements.
- The corresponding linear correction terms $\beta_m$ reduced modulo $p^{k_{p,m}}$ .
Local Analysis: The author analyzes the dependence of these local invariants on the parameter $a$ . Using the explicit formulas from [JKS21], it is shown that the local $p$ -shape is determined by the invariant $d_p(a) = \min\{v_p(a^{p-1}-1)-1, e\}$ (where $p^e \parallel n$ ) and the residue of $a$ modulo $p^{k_{p,m}+1}$ .
Sharpness Argument: The paper constructs specific pairs of integers $a, a'$ that are congruent modulo $p^e$ but not modulo $p^{e+1}$ , demonstrating that the local shape changes. This proves that the precision $p^{e+1}$ is necessary and sufficient to fix the local shape at $p$ .
Global Synthesis: By the Chinese Remainder Theorem, the global shape is determined by the local shapes at all primes dividing $n$ . The minimal global modulus is thus the product of the minimal local moduli.

Key Results

The Minimal Modulus: The paper proves that the minimal period for the shape of the integral basis is:
$M(n) = \prod_{p^e \parallel n} p^{e+1} = n \cdot \text{rad}(n)$
where $\text{rad}(n)$ is the product of distinct prime factors of $n$ .
Local-to-Global Principle (Theorem 3.1):
- Local Determinacy: For each prime $p \mid n$ with $p^e \parallel n$ , the local shape $S_p(a)$ depends only on the residue class of $a$ modulo $p^{e+1}$ .
- Local Sharpness: The modulus $p^{e+1}$ is optimal; $p^e$ is insufficient to determine the shape.
- Global Minimality: The global shape $S(a)$ is periodic modulo $M(n)$ , and $M(n)$ is the least such modulus. If $a \equiv a' \pmod{M(n)}$ , then $S(a) = S(a')$ .
Comparison with Previous Work:
- For squarefree $n$ , $M(n) = n^2$ , recovering the $n^2$ -periodicity observed by Gaál–Remete [GR17] for small degrees.
- For non-squarefree $n$ , $M(n) < n^2$ , pinpointing exactly when the $n^2$ bound is not sharp.
Computational Consequences (Theorem 3.5): The existence of a finite lookup table $T(n)$ indexed by $a \pmod{M(n)}$ is established. This table allows the immediate determination of the integral basis shape for any valid $a$ without re-computing local invariants, as the table can be filled purely locally using the recipes from [JKS21].
Relative Periodicity (Proposition 3.6): The result extends to relative extensions $L(\sqrt[n]{a})/L$ where $L/\mathbb{Q}$ is a number field with $\gcd(n, \Delta_L) = 1$ , maintaining the same minimal period $M(n)$ .

Applications and Significance

The paper claims several immediate applications derived from this minimal periodicity:

Sharp Local Index Tests: The results provide precise criteria for the $p$ -part of the index $[\mathcal{O}_{K_a} : \mathbb{Z}[\theta]]$ . Specifically, for $p \parallel n$ , the index is divisible by $p$ if and only if $a^{p-1} \equiv 1 \pmod{p^2}$ (a Wieferich-type condition). The paper clarifies that the invariant determining this is $d_p(a)$ , which requires knowledge of $a$ modulo $p^2$ (or $p^{e+1}$ generally), not just modulo $p^e$ .
Explicit Discriminant Jumps: The paper analyzes how the $p$ -adic valuation of the discriminant $d_{K_a}$ changes as $a$ varies. It shows that the "final jump" in the valuation occurs when $a$ crosses the threshold from $p^e$ to $p^{e+1}$ , confirming the minimality of the modulus.
Counting and Density: Because the shape is a class function of $a \pmod{M(n)}$ , the paper establishes equidistribution results. It provides asymptotic formulas and natural densities for the occurrence of specific integral basis shapes among $n$ -th power-free integers. The global density factorizes into a product of local proportions attached to residue classes modulo $p^{e+1}$ .

Significance
The paper's primary contribution is the unification and formalization of the periodicity phenomenon in pure number fields. By introducing the "shape" concept and proving the minimality of the modulus $M(n) = n \cdot \text{rad}(n)$ , it resolves the question of how much $p$ -adic information is strictly necessary to determine the integral basis. The work demonstrates that the "one extra $p$ -adic digit" beyond the exponent of $p$ in $n$ is the precise threshold required, offering a sharp, local-to-global explanation for the regularity observed in families of pure fields. This provides a uniform alternative to ad-hoc case-by-case analysis used in small degrees.

Technical Summary: The Minimal Periodicity for Integral Bases of Pure Number Fields

More like this