Littlewood conjecture
Builds on Irrational numberContinued fraction
Statement
For a real number , let denote the distance from to the nearest integer. For every pair of real numbers and , where runs over the positive integers.
Remarks
The problem is open; Littlewood posed it around 1930. It holds if is not badly approximable, that is, if . Indeed gives . Rational numbers are not badly approximable, and the same holds with the roles of and exchanged. By the theory of continued fractions, a number is badly approximable exactly when its partial quotients are bounded, so the open case is a pair of such irrational numbers. Cassels and Swinnerton-Dyer proved it in 1955 when span a totally real cubic number field. Einsiedler, Katok and Lindenstrauss proved in 2006 that the set of pairs for which it fails has Hausdorff dimension . Their proof uses the action of the diagonal group on and the rigidity of measures invariant under it.
Reading path
To understand this page from the ground up, read these 3 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Continued fraction concept
- Irrational number concept
- Littlewood conjecture conjecture
Further reading
About this page
| Tag | P8D6T5A1QD |
|---|---|
| URI | m2://P8D6T5A1QD |
| Kind | conjecture |
| Writing | W0 stub |
| MSC | 11J13, 37A17, 22E40 |
| Status | This copy of the site has no build data. Run m2 status P8D6T5A1QD. |
| About | Irrational number |
| Uses | Irrational number, Continued fraction |
| Same as |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
- a source with a locator (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
No page links to this page yet.