The uniform Littlewood conjecture fails on a set of positive Hausdorff dimension

In the vast landscape of mathematics, there is a quiet corner dedicated to understanding how well we can approximate one number using another. Imagine trying to find a fraction that sits incredibly close to a strange, endless decimal. Some numbers are easy to pin down; others resist, no matter how hard you try. Mathematicians have long been fascinated by the "badly approximable" numbers, those stubborn values that refuse to be closely matched by simple fractions. This resistance is not random; it follows a hidden structure that reveals itself when we look at how these numbers behave in pairs. For decades, a famous idea known as the Littlewood conjecture has asked whether, for any two such numbers, we can always find a way to make them both look very much like whole numbers at the same time, simply by multiplying them by a large enough integer. The answer to this classic question is believed to be yes for almost every pair, though the set of potential exceptions is so small it is almost invisible to standard measurement.

Recently, mathematicians turned their attention to a stricter version of this problem, called the uniform Littlewood conjecture. This version demands that the approximation works not just eventually, but consistently and efficiently across a specific range of multipliers. It is a more rigid test, asking if the best possible match is always found within a certain window of effort. For a long time, it was hoped that this stricter rule would hold true for all pairs of numbers. However, recent work has shown that this is not the case. There are pairs of numbers that break this rule, failing the test in a way that leaves a measurable gap. The question that remained was how many such pairs exist and how "large" this group of failures is.

A new study by Nikita Shulga has now answered this question with surprising depth. The researcher proved that the collection of pairs that break the uniform rule is not just a tiny, scattered handful of exceptions. Instead, these counterexamples form a substantial family, occupying a space that is large enough to be measured with a specific scale of complexity. The study focuses on a special group of numbers that are notoriously difficult to approximate, known as badly approximable numbers. Shulga demonstrated that if you take one of these stubborn numbers as your starting point, there is a vast array of partners you can pair it with to create a failure of the uniform rule. In fact, the set of such starting numbers is so large that it fills the entire space of possibilities in terms of its geometric complexity.

The paper establishes that the set of these failing pairs has a specific dimension, a mathematical measure of size that goes beyond simple counting. While the classic version of the problem suggests that any exceptions would be so rare they have zero size, this new work shows that the uniform version allows for a much richer set of failures. The author proves that the dimension of this set of counterexamples is at least one and a half. This is a significant finding because it means the set is not just a line or a point, but something with a thickness that defies simple description. Furthermore, the study shows that the set of badly approximable numbers that can serve as the first part of such a failing pair is so extensive that it has a dimension of one, meaning it is as large as the entire set of real numbers in that category.

To reach this conclusion, the researcher constructed a specific, intricate family of number pairs. This construction involved carefully selecting numbers based on how their digits behave when written as continued fractions, a method of representing numbers that reveals their hidden patterns. By choosing numbers with bounded digits, the researcher ensured they belonged to the stubborn, badly approximable group. Then, by pairing them with carefully chosen partners, the study showed that these pairs consistently fail the uniform test. The proof relies on counting how many such pairs can be found within specific ranges and showing that this count grows fast enough to guarantee a large, positive dimension. The work does not just say these pairs exist; it builds them and measures their size, proving that the failure of the uniform Littlewood conjecture is a robust and widespread phenomenon, not a rare anomaly.

This discovery changes our understanding of the landscape of number theory. It reveals that while the classic Littlewood conjecture might hold true for almost all pairs, the stricter, uniform version is far more fragile. The existence of a large, positive-dimensional set of counterexamples means that the rule-breaking behavior is deeply embedded in the structure of these numbers. The study confirms that even when we restrict ourselves to the most difficult-to-approximate numbers, we can still find a vast, complex world of pairs that defy the uniform expectation. This result settles a long-standing question about the size of these exceptions, showing that they are far more numerous and structurally significant than previously thought, providing a clearer, more detailed map of where the rules of approximation break down.