← Latest papers
🔢 mathematics

Tame fundamental groups of rigid spaces

This paper introduces the tame étale fundamental group for rigid spaces over non-archimedean fields and establishes its topological finite generation and presentation under specific geometric and arithmetic conditions by leveraging techniques from logarithmic geometry and vertical compactification.

Original authors: Piotr Achinger, Katharina Hübner, Marcin Lara, Jakob Stix

Published 2026-08-14
📖 4 min read🧠 Deep dive

Original authors: Piotr Achinger, Katharina Hübner, Marcin Lara, Jakob Stix

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 exploring a vast, invisible city built not of bricks and mortar, but of pure mathematical shapes called "rigid spaces." These cities exist over strange number systems known as non-archimedean fields, where the usual rules of distance and size behave in counterintuitive ways. In this world, mathematicians study "fundamental groups," which are like the ultimate map of all the possible loops you can draw in the city without tearing them. If you can untie a loop, it's trivial; if you can't, it reveals a hidden hole or a secret tunnel in the city's structure.

For a long time, mathematicians knew that if they tried to map these loops in certain parts of the city, the map would become infinitely complicated and unmanageable. It was as if the city had an infinite number of tiny, wild tunnels that couldn't be counted or organized. This chaos was caused by something called "wild ramification"—a phenomenon where paths twist and turn so violently near the edges of the city that they break the rules of standard counting. However, there is a gentler version of these paths called "tame" paths. These paths twist, but they do so in a polite, orderly fashion that allows mathematicians to count them. The big question was: even if we ignore the wild chaos and only look at the polite, tame paths, can we still get a manageable map for these rigid cities? Or does the complexity of the city's shape still make the map infinite?

This paper, written by Piotr Achinger, Katharina Hübner, Marcin Lara, and Jakob Stix, answers that question with a resounding "yes, but with conditions." The authors introduce a new, carefully defined way to measure these "tame fundamental groups" for rigid spaces. They prove that if the city is built in a specific, well-behaved way (mathematically described as "quasi-compact and quasi-separated") and the underlying number system is either algebraically closed (like a field containing all possible roots) or a local field (like the p-adic numbers), then the map of tame paths is indeed finite and manageable. In fact, they show that this map can be described using a finite list of generators, meaning the entire structure of these tame loops can be built from a small, finite set of basic building blocks.

The authors also go a step further. They show that if the rigid space comes from a "strictly semistable formal scheme" (a very specific type of geometric construction that looks like a smooth surface with some controlled singularities) and its special part has a nice "projective snc compactification" (a way of closing up the space with a clean boundary), then the map isn't just finitely generated; it is "finitely presented." This is a stronger condition, meaning the rules governing how these loops interact are also finite and can be written down completely.

To reach these conclusions, the team had to invent new tools. They couldn't just use the old maps because the "wild" paths were too messy. Instead, they developed a technique involving "logarithmic geometry," which is like adding a special set of coordinates to the city that tracks not just where you are, but how you got there relative to the boundaries. They also used a method called "vertical compactification," which is akin to building a giant, invisible dome over the city to capture all the paths that might otherwise escape to infinity. By comparing the tame paths in the rigid city to the tame paths in a simpler, related structure (the "special fibre" of a formal model), they were able to translate the complex problem into one that was already known to be solvable.

Crucially, the paper rules out the idea that the tame fundamental group is always finite. They explicitly show that if you don't use their specific "relative" definition of tameness (which checks paths against the whole city, including its invisible boundaries), the group can indeed be infinite, just like the wild case. They demonstrate this with the example of the affinoid unit disc, where a standard approach fails. Their work confirms that while the wild chaos is real, the tame order is recoverable, provided you look at the city through the right lens and ensure the city itself isn't too fragmented. The results are not just suggestions or simulations; they are rigorous mathematical proofs that establish the finite generation and finite presentation of these groups under the stated conditions.

Drowning in papers in your field?

Get daily digests of the most novel papers matching your research keywords — with technical summaries, in your language.

Try Digest →