← Latest papers
🔢 mathematics

Linear theories of global fields with absolute values

This paper investigates the model theory of global fields viewed as vector spaces equipped with predicates for absolute values, establishing that the theory is decidable for ultrametric and real archimedean valuations but undecidable for complex ones, while also providing axiomatizations for the existential theories involving all non-complex absolute values.

Original authors: Arno Fehm, Pierre Touchard

Published 2026-03-27
📖 4 min read🧠 Deep dive

Original authors: Arno Fehm, Pierre Touchard

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 trying to understand the rules of a very complex game played with numbers. Usually, mathematicians study these games by looking at how numbers multiply and add together. But in this paper, the authors, Arno Fehm and Pierre Touchard, decide to play a different game.

They strip away the ability to multiply numbers directly. Instead, they only allow adding numbers and scaling them (like stretching or shrinking a rubber band). This is what they call a "linear theory."

However, to make the game interesting, they add a special "ruler" or "sensor" to the board. This sensor measures the size (or "absolute value") of the numbers. Depending on where you are in the mathematical universe, this ruler behaves differently. The authors ask: Can we write a computer program that can answer every possible question about this game?

Here is the breakdown of their findings using some creative analogies:

1. The Three Types of Rulers

The "ruler" in this game comes in three flavors, depending on the type of number field (the set of numbers you are playing with):

  • The Ultrametric Ruler (Finite Places): Imagine a ruler where the rules of geometry are weird. If you have three points, the two longest sides are always equal. This is like a tree structure where everything branches out.
    • The Result: The game is solvable. If you give a computer the rules for this ruler, it can answer any question you ask. It's like a puzzle with a clear, logical solution.
  • The Real Ruler (Real Infinite Places): This is the ruler we are used to on Earth. It measures distance on a straight line (like the number line from negative to positive infinity).
    • The Result: If you only have the ruler and addition, the game is solvable. The computer can figure everything out.
    • The Twist: But if you secretly sneak in the ability to multiply numbers (or define it using the ruler), the game suddenly becomes impossible for a computer to solve. It's like realizing that once you know how to multiply, the puzzle becomes infinitely complex.
  • The Complex Ruler (Complex Infinite Places): This ruler lives in a 2D plane (like a map with North/South and East/West). It measures distance from the center of a circle.
    • The Result: The game is impossible for a computer to solve right from the start. Even without full multiplication, the geometry of this 2D plane is too tangled for a computer to predict every outcome.

2. The "Weak Approximation" Magic Trick

The authors use a famous mathematical trick called Weak Approximation.

The Analogy: Imagine you are a chef trying to bake a cake that tastes exactly like a specific recipe from three different countries (France, Japan, and Brazil) all at the same time.

  • The "Weak Approximation" theorem says: "Yes, you can! You can find a single batch of dough that is almost French, almost Japanese, and almost Brazilian simultaneously."
  • In the paper, this means the authors can prove that if a computer can solve the game for one specific ruler, and another for a different ruler, it can also solve the game when you combine them all together (as long as you don't mix in the "complex" or "real multiplication" troublemakers).

3. The Big Conclusion

The paper draws a clear line in the sand:

  • Decidable (Solvable): If your game involves only "tree-like" rulers (finite places) or "straight-line" rulers (real places) without full multiplication, a computer can eventually figure out the answer to any question.
  • Undecidable (Unsolvable): If your game involves the "2D plane" ruler (complex places) or if you try to force multiplication into the "straight-line" ruler, the game becomes chaotic. No computer program, no matter how powerful, can guarantee an answer for every question.

Why Does This Matter?

In the world of math, knowing whether a problem is "decidable" is like knowing if a map exists.

  • If the map exists (Decidable), we can navigate the territory with confidence.
  • If the map doesn't exist (Undecidable), we are wandering in a fog where some paths lead to dead ends that no algorithm can predict.

Fehm and Touchard have drawn a new, detailed map for these specific "linear" number games. They showed us exactly where the fog begins and where the clear path ends, helping us understand the fundamental limits of what computers can calculate in the world of numbers.

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 →