← All problems

Erdős Problem #495 — The Littlewood conjecture

65 years old · traced to

For a real number xx, let ∥x∥=min⁡m∈Z∣x−m∣\|x\|=\min_{m\in\mathbb Z}|x-m|, its distance to the nearest integer. The question is whether, for every pair (α,β)∈R2(\alpha,\beta)\in\mathbb R^2, the following holds, with nn ranging over the positive integers:

lim inf⁡n→∞n ∥nα∥ ∥nβ∥=0.\liminf_{n\to\infty} n\,\|n\alpha\|\,\|n\beta\|=0.

Erdős Problem #495

Background

This is Littlewood’s conjecture, a central problem in simultaneous Diophantine approximation, formulated around 1930. The issue is most significant when both numbers are badly approximable: that is, when each satisfies lim inf⁡n→∞n∥nα∥>0\liminf_{n\to\infty}n\|n\alpha\|>0. For almost every real number this individual lower limit is zero, which already implies the conjecture for almost every pair; the difficult cases therefore include pairs whose coordinates are both badly approximable. On a lower bound of the number of integers in Littlewood’s conjecture

A dynamical formulation connects the problem to diagonal actions on the space of unimodular lattices. For the lattice associated with (α,β)(\alpha,\beta), the conjecture is equivalent to unboundedness of a corresponding positive diagonal semigroup orbit. This translates the search for simultaneous small fractional parts into a question about how lattice vectors behave under diagonal rescaling. Einsiedler, Katok, and Lindenstrauss (2006)

References

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.