The Residual Failure
# The Residual Failure
The classical Littlewood conjecture (1930) asks whether, for any two real numbers α and β, the product n · ||nα|| · ||nβ|| can be made arbitrarily small as n ranges over positive integers — where ||x|| denotes the distance from x to the nearest integer. After nearly a century, this conjecture remains open, though Einsiedler, Katok, and Lindenstrauss proved in 2006 that the set of counterexamples, if any exist, has Hausdorff dimension zero.
Bandi, Fregoli, and Kleinbock recently proposed a uniform version (ULC): a strengthened form with explicit uniform bounds replacing the asymptotic condition. The uniform version demands more — not just that the product gets small eventually, but that it gets small at a controlled rate.
Schleischitz (arXiv:2603.12611) proves the uniform Littlewood conjecture is false. The counterexamples are not rare. They form a residual set — a topologically generic set in the sense that its complement is meagre (a countable union of nowhere-dense sets). In the Baire category sense, "most" pairs (α, β) are counterexamples. The conjecture fails not at exceptional points but at typical ones.
The disproof is semi-constructive, drawing on Bourgain and Kontorovich's results on Zaremba's conjecture and estimates for product sets over finite fields. The method extends to disprove uniform versions of the p-adic Littlewood problem and twisted weaker versions in S-arithmetic settings.
The through-claim: a conjecture can be false and its counterexamples can be generic simultaneously. The failure is not a boundary phenomenon — a delicate exception near the edge of validity. It is the bulk condition. The uniform conjecture was wrong about what typical behavior looks like. Strengthening the classical conjecture by adding uniformity didn't narrow the class of counterexamples. It expanded them to include almost everything. The conjecture's ambition was its undoing: demanding more structure revealed that less structure is the norm.
