🔢 mathematics

When is $A + x A =\mathbb{R}$

This paper investigates the conditions under which the sum set $A + xA$ equals $\mathbb{R}$ , demonstrating that while certain additive $F_\sigma$ subgroups with specific Hausdorff dimensions satisfy this property, any subring $A$ with this property must be $\mathbb{R}$ itself, and under the Continuum Hypothesis, subgroups of dimension zero can satisfy the condition for all irrational $x$ , utilizing techniques from recursion theory and algorithmic randomness.

Original authors: Jinhe Ye, Liang Yu, Xuanheng zhao

Published 2026-05-12

📖 5 min read🧠 Deep dive

CC0 1.0

Original authors: Jinhe Ye, Liang Yu, Xuanheng zhao

Original paper dedicated to the public domain under CC0 1.0 (http://creativecommons.org/publicdomain/zero/1.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 the real number line as an infinite, continuous highway stretching from negative infinity to positive infinity. In this paper, the authors are playing a game of "filling the highway" using two specific types of vehicles: a Subgroup (let's call it a "Base Fleet") and a Multiplier (a specific number $x$ ).

The game works like this: You take every car in your Base Fleet, and you also take every car in your Base Fleet, multiply their speed by $x$ , and then combine them. Mathematically, this is written as $A + xA$. The big question the authors ask is: Can we build a Base Fleet that is "small" (in terms of size or complexity) but still, when we mix it with a specific multiplier $x$ , covers the entire infinite highway?

Here is a breakdown of their findings using simple analogies:

1. The "Small but Mighty" Fleet (The Main Discovery)

Usually, if you have a small group of numbers (a "small" set), adding them together or scaling them up doesn't fill the whole highway. It leaves huge gaps.

However, the authors found a special, somewhat "weird" type of Base Fleet (called an Fσ subgroup) that is surprisingly efficient.

The Analogy: Imagine a net made of very fine mesh. It looks like it has almost no surface area (it's "small" in terms of Hausdorff dimension, specifically $\le 1/2$ ). But, if you pick the right "magic number" ( $x$ ) to stretch this net, the holes disappear, and it suddenly covers the entire highway.
The Result: They proved such a fleet exists. It is small, but with the right multiplier, it becomes the whole world of real numbers.

2. The "Rigid" Rule for Rings (The "No-Go" Zone)

The paper also looked at a stricter type of fleet called a Subring. A subring is like a Base Fleet that has extra rules: you can add, subtract, and multiply numbers within the fleet, and the result must stay in the fleet.

The Analogy: Think of a subring as a very rigid, locked-down club. If you try to use this rigid club to fill the highway by mixing it with a multiplier, the rules are so strict that the club must already be the entire highway to begin with.
The Result: If your fleet is a subring and you can fill the highway with it, your fleet wasn't "small" at all—it was the whole highway from the start. You can't have a "small" subring that does this trick.

3. The "Perfectly Empty" Fleet (Under a Special Assumption)

The authors also explored what happens if we assume a specific mathematical rule called the Continuum Hypothesis (CH). This is a controversial but useful assumption in math that helps organize infinite sets.

The Analogy: Imagine building a fleet so sparse that it has zero size (dimension 0). It's like a single point that has been stretched out infinitely but still has no "bulk."
The Result: Assuming CH, they showed you can build this "zero-size" fleet. If you pick a multiplier that is not a simple fraction (an irrational number), this tiny fleet can still fill the entire highway, except for the rational numbers (fractions). It's a "ghost fleet" that covers almost everything, leaving only the simple fractions behind.

4. The "Magic" of Randomness

To build these special fleets, the authors used concepts from recursion theory (the study of algorithms and randomness).

The Analogy: They didn't build the fleet by picking numbers one by one. Instead, they used "generic" numbers—numbers that are maximally random and unpredictable, like the result of an infinite series of perfect coin flips.
The Insight: These "random" numbers are so chaotic that when you mix them with the right multipliers, they naturally fill in all the gaps. It's like shaking a box of sand so vigorously that the grains settle into every single crack, no matter how small.

Summary of the "Rules of the Road"

Subgroups (Flexible): You can have a "small" subgroup that, with the right multiplier, fills the whole highway. (The "Magic Net").
Subrings (Rigid): If a subring fills the highway with a multiplier, it must have been the whole highway to begin with. (The "Locked Club").
Analytic Sets (Regular): If your fleet is a "regular" shape (like a smooth curve or a standard geometric set) and it's big enough (dimension > 1/2), it will almost certainly fill the highway with almost any multiplier you choose.
The "Zero" Fleet: With the right assumptions (CH) and enough randomness, you can make a fleet with zero size that fills the highway (minus the fractions).

Why does this matter?

The paper doesn't claim this will help build bridges or cure diseases. Instead, it solves a deep puzzle about the structure of reality. It tells us exactly how "small" a collection of numbers can be before it loses the power to generate the entire number line. It draws a sharp line between what is possible with flexible groups and what is impossible with rigid rings, using the tools of randomness and infinite logic.

Technical Summary: "When is $A + xA = R$"

Problem Statement
The paper investigates the structural and dimensional properties of subgroups and subrings of the real numbers $(\mathbb{R}, +)$ in relation to the set $X_A = \{x \in \mathbb{R} : A + xA = \mathbb{R}\}$ , where $A + xA = \{a + xb : a, b \in A\}$ . The central question is: Given a subobject $A$ (subgroup, subring, or subfield), does there exist an $x$ such that $A + xA = \mathbb{R}$ ? If such an $x$ exists, what constraints does this impose on the "size" (specifically Hausdorff dimension and measure) of $A$ ?

Methodology
The authors employ a diverse toolkit spanning real analysis, descriptive set theory, and recursion theory:

Descriptive Set Theory and Measure Theory: The paper utilizes properties of analytic sets, the Marstrand projection theorem, and the Steinhaus theorem (regarding difference sets of positive measure) to analyze the behavior of analytic subgroups.
Concrete Constructions: For specific counterexamples, the authors construct $F_\sigma$ subgroups using binary expansions with specific zero-pattern constraints (blocks of zeros of increasing length).
Recursion Theory and Algorithmic Dimension: Under the assumption of the Continuum Hypothesis (CH), the authors utilize concepts of genericity (specifically $y$ -generic reals), Turing reducibility, and Kolmogorov complexity. They apply the "point-to-set principle" (Lutz and Lutz) to relate the Hausdorff dimension of a set to the algorithmic dimension of its elements relative to oracles.
Algebraic Number Theory: The paper applies results on real closed fields, integral extensions, and the structure of maximal subfields to address questions regarding subrings and subfields.

Key Contributions and Results

Subrings and Subfields:
- Rigidity of Subrings: The paper proves that if $A$ is a subring of $\mathbb{R}$ and $X_A \neq \emptyset$ , then $A = \mathbb{R}$ . This result extends to $p$ -adic fields ( $\mathbb{Q}_p$ ). The proof relies on the fact that if $A + xA = \mathbb{R}$ , then $\mathbb{R}$ is a finite extension of $A$ , forcing $A$ to be a field, which in turn forces $A = \mathbb{R}$ due to the properties of real closed fields.
- Maximal Subfields: The authors show that the existence of a maximal subfield of $\mathbb{R}$ excluding a specific point requires the Axiom of Choice (AC). In models where every subset of $\mathbb{R}$ is measurable (e.g., Solovay's model with ZF + DC), no such maximal subfield exists. Conversely, assuming CH, they construct a maximal subfield of Hausdorff dimension 0 that excludes a given transcendental number from its algebraic closure.
Subgroups (Main Theorems):
- Existence of Small Subgroups with Non-Empty $X_A$ : Theorem 1.4 establishes the existence of an $F_\sigma$ subgroup $A$ with Hausdorff dimension $\dim_H(A) \leq 1/2$ such that $X_A \neq \emptyset$ . This refines previous results (Proposition 3.4) which suggested that for "regular" analytic sets with $\dim_H(A) > 1/2$ , $X_A$ is co-null. The construction involves defining a subgroup based on binary expansions with controlled gaps of zeros.
- Zero-Dimensional Subgroups under CH: Theorem 1.5, assuming the Continuum Hypothesis, constructs a subgroup $A$ with $\dim_H(A) = 0$ such that $X_A = \mathbb{R} \setminus \mathbb{Q}$ . This construction uses generic reals and algorithmic dimension to ensure the group is small in dimension yet large enough to generate $\mathbb{R}$ via the operation $A + xA$ for irrational $x$ .
- Limitations on Complexity: Proposition 4.6 demonstrates that if $A$ is an $F_\sigma$ null set, then for a comeager set of $x$ , $A + xA$ is null. Consequently, the subgroup $A$ constructed in Theorem 1.5 cannot be $F_\sigma$ .
Analytic Subgroups:
- The paper confirms that if $A$ is an analytic subgroup with $\dim_H(A) > 1/2$ , then $X_A$ is co-null (Proposition 3.4).
- Theorem 3.8 shows that if $A$ is an analytic subgroup and $x \in X_A$ , there exists an $F_\sigma$ subgroup $B \subseteq A$ such that $x \in X_B$ . This reduces the problem of finding "small" subgroups with non-empty $X_A$ to the analytic case.

Significance and Claims
The paper claims to resolve the relationship between the algebraic generation of $\mathbb{R}$ via $A + xA$ and the geometric size of $A$ .

It distinguishes sharply between subrings (where the condition $X_A \neq \emptyset$ forces $A=\mathbb{R}$ ) and subgroups (where $A$ can be small, even of dimension 0 under CH).
It demonstrates that the "size" of $A$ required to satisfy $A + xA = \mathbb{R}$ depends heavily on the descriptive complexity of $A$ . While analytic sets with dimension $> 1/2$ almost always satisfy the condition, the authors show that $F_\sigma$ sets can satisfy it with dimension as low as $1/2$ , and generic sets (under CH) can satisfy it with dimension 0.
The work highlights the necessity of set-theoretic assumptions (like CH) for constructing subgroups with specific dimensional properties (dimension 0) that satisfy the condition for all irrational $x$ .
The authors note that their methods, particularly the use of genericity and algorithmic dimension, may be applicable to constructing other "exotic" subsets of reals.

The paper concludes by posing open questions regarding whether the Continuum Hypothesis is necessary for Theorem 1.5 and whether the constructed subgroup $A$ can be Borel.