🔢 mathematics

The rationality problem for multinorm one tori

This paper investigates the rationality problem for multinorm one tori by proving the equivalence of stable and retract rationality for those splitting over finite Galois extensions with nilpotent Galois groups, establishing systematic reduction methods, and providing a new example where the multinorm principle holds.

Original authors: Sumito Hasegawa, Kazuki Kanai, Yasuhiro Oki

Published 2026-01-23

📖 5 min read🧠 Deep dive

CC BY 4.0

Original authors: Sumito Hasegawa, Kazuki Kanai, Yasuhiro Oki

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

Imagine you are an architect trying to figure out if a specific building design can be easily transformed into a simple, open field (a "rational" space). In the world of algebraic geometry, these "buildings" are called tori, and the "simple field" is just a standard projective space.

The paper by Hasegawa, Kanai, and Oki tackles a complex version of this problem involving "Multinorm One Tori." Here is a breakdown of what they did, using everyday analogies.

The Core Problem: The "Shape-Shifting" Building

Think of a Norm One Torus as a building constructed from a single type of brick (a single field extension). Mathematicians have known for a long time how to tell if this single-brick building can be flattened into a simple field.

However, the authors are studying Multinorm One Tori. Imagine these are buildings constructed by gluing together multiple different types of bricks (multiple field extensions) in a specific way. The question is: Can this complex, multi-brick building also be flattened into a simple field?

There are different levels of "flattening":

Rational: You can turn it into a simple field perfectly.
Stably Rational: You can turn it into a simple field if you first attach a few extra, useless rooms (dimensions) to it.
Retract Rational: You can flatten it, but you might lose a tiny bit of detail in the process (like a rough sketch).

The authors prove that for a specific, large family of these multi-brick buildings, Stably Rational and Retract Rational are actually the same thing. If you can do one, you can do the other.

The "Blueprint" Method: Translating Buildings to Puzzles

To solve this, the authors don't look at the buildings directly. Instead, they translate the building's design into a mathematical puzzle involving a "character group" (a lattice).

The Analogy: Imagine the building's structure is a complex 3D puzzle. The authors realized that if you can solve a specific 2D version of this puzzle (determining if the puzzle pieces can be rearranged into a perfect square), you know the building is "stably rational."
They created a new, generalized version of this puzzle piece (which they call $J^{(\phi)}_{G/H}$ ) to handle the complexity of the multi-brick buildings.

The Main Discovery: The "Group" Rules

The behavior of these buildings depends on the "symmetry group" of the bricks. Think of the symmetry group as the set of rules for how the bricks can be rotated or flipped without breaking the building.

The authors focused on cases where these rules form a Nilpotent Group (a specific type of orderly, hierarchical rule set, like a well-organized military chain of command).

They found that for these orderly groups, the building can be flattened if and only if the arrangement of bricks follows one of two very specific patterns:

The Single Brick Pattern: The building is essentially made of just one type of brick (or a variation that acts like one), and the rules for that brick are simple and circular (cyclic).
The "Dihedral" Pair Pattern: The building is made of exactly two types of bricks that interact in a specific "mirror" way (related to a Dihedral group, which is the symmetry of a regular polygon). If you have more than two bricks, or if they interact in a messy way, the building cannot be flattened.

The "Reduction" Trick

One of the paper's biggest contributions is a systematic reduction method.

The Analogy: Imagine you have a massive, tangled ball of yarn (a complex multi-brick building). The authors developed a set of scissors and a map that allows you to cut away the messy, redundant parts of the yarn without changing the core knot.
They proved that you can strip away any brick that is "hidden" inside another brick or any duplicate bricks, leaving you with a smaller, simpler core. If this smaller core can be flattened, the whole building can be. This allows mathematicians to solve huge problems by breaking them down into tiny, manageable pieces.

The Bonus: The "Multinorm Principle"

The paper also touches on a related concept called the Multinorm Principle.

The Analogy: Imagine you have a set of locks (the bricks). The "Multinorm Principle" asks: If a key opens all the locks individually, does it also open the master lock that combines them all?
The authors used their new findings to prove that for a specific new type of lock-and-key setup (involving the "Dihedral" pattern mentioned above), the answer is Yes. This provides a new example where this principle holds true, which is a useful tool for number theorists.

Summary

In short, the authors took a difficult problem about complex geometric shapes, translated it into a puzzle about symmetry groups, and proved that for a large class of these shapes, the answer to "Can it be simplified?" depends entirely on whether the pieces are arranged in a single circle or a specific two-piece mirror pattern. They also gave mathematicians a new toolkit to break down any complex version of this problem into its simplest form.

Technical Summary: The Rationality Problem for Multinorm One Tori

Problem Statement
The paper addresses the rationality problem for multinorm one tori, algebraic varieties defined as the kernel of the multinorm map $N_{K/k}: \text{Res}_{K/k} \mathbb{G}_m \to \mathbb{G}_m$ , where $K$ is a finite étale algebra over a field $k$ . While the rationality of norm one tori (where $K$ is a field) has been extensively studied, the multinorm case (where $K$ is a product of fields) remains less understood. The authors focus on determining conditions under which these tori are stably rational (birationally equivalent to a projective space times a projective space) or retract rational (a weaker condition involving rational maps). The central motivation is that multinorm one tori arise naturally as base changes of norm one tori; thus, understanding their rationality properties provides a pathway to resolving open questions regarding norm one tori.

Methodology
The authors employ the established correspondence between the rationality of algebraic tori and the properties of their character groups as modules over the Galois group $G = \text{Gal}(L/k)$ , where $L$ is the Galois closure of the composite field of the factors of $K$ .

Character Group Analysis: The rationality of the torus $T_{K/k}$ is reduced to determining whether the associated $G$ -lattice $J_{G/\mathcal{H}}$ (the dual of the augmentation kernel of the permutation lattice associated with the subgroups $\mathcal{H} = \{\text{Gal}(L/K_i)\}$ ) is quasi-permutation (for stable rationality) or quasi-invertible (for retract rationality).
Generalization of Lattices: A key methodological innovation is the introduction of generalized character groups $I^{(\varphi)}_{G/\mathcal{H}}$ and $J^{(\varphi)}_{G/\mathcal{H}}$ , where $\varphi$ is a weight function on the multiset of subgroups $\mathcal{H}$ . This generalization allows for the handling of multiplicities and specific subgroup configurations that standard augmentation kernels cannot address directly.
Reduction Techniques: The paper develops systematic reduction methods (Propositions 3.16, 3.17, 3.20, 3.22) to decompose complex $G$ -lattices into smaller lattices over subgroups or quotient groups. These methods generalize previous work by Endo (2001, 2011) and allow the authors to inductively analyze the rationality conditions.
Flabby Resolutions: The authors utilize flabby resolutions and the theory of flabby classes (specifically the class $[M]_{fl}$ in the similarity monoid of $G$ -lattices) to determine if a lattice is quasi-permutation or quasi-invertible. They explicitly construct resolutions for specific cases, such as dihedral groups and products involving cyclic groups.

Key Contributions and Results

Equivalence of Rationality Conditions for Nilpotent Groups: The primary result (Theorem 1.5) establishes that for multinorm one tori splitting over finite Galois extensions with nilpotent Galois groups, stable rationality and retract rationality are equivalent. This generalizes a known result for norm one tori by Endo (2011) to the multinorm setting.
Criteria for $p$ -groups:
- Odd Primes ( $p > 2$ ): Theorem 1.2 proves that for a $p$ -group Galois extension, the torus is stably/retract rational if and only if the number of direct factors $r=1$ and the Galois group is cyclic.
- Prime $p=2$ : Theorem 1.3 provides a more complex criterion. Stably/retract rationality holds if either $r=1$ with a cyclic Galois group, or if $r \ge 2$ , the Galois group is a dihedral group $D_{2\nu}$ , and the subgroups satisfy specific conjugacy and index conditions involving the generators of the dihedral group.
New Stably Rational Families: The paper identifies new families of stably rational multinorm one tori even when the Galois group is not nilpotent. Specifically, Theorem 1.8 demonstrates that if $K = K_1 \times K_2$ and the Galois group of the composite is a dihedral group $D_{2m}$ (with specific non-conjugacy conditions on $K_1$ and $K_2$ ), the torus is stably rational.
Application to the Multinorm Principle: Leveraging the rationality results and a connection to the Tate–Shafarevich group (via Ono's theorem), the authors provide a new example (Theorem 1.9) where the multinorm principle holds. Specifically, for $K = K_1 \times K_2$ where the Galois group is $C_m \times D_{2\nu}$ (with $m$ odd), the group $X(K/k)$ is trivial, meaning the multinorm principle is valid.

Significance and Claims
The paper claims to significantly extend the understanding of the rationality problem from norm one tori to multinorm one tori. By introducing generalized character groups and systematic reduction methods, the authors successfully classify the stable and retract rationality for the broad class of nilpotent Galois groups. The equivalence of stable and retract rationality in the nilpotent case is a major theoretical advancement, simplifying the classification problem. Furthermore, the paper demonstrates the utility of these rationality results by solving a specific instance of the multinorm principle, a classic problem in algebraic number theory. The authors note that their approach generalizes Endo's 2011 results and provides a framework for investigating arbitrary multinorm one tori through the reduction of $G$ -lattices.