Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Statement
Setting (pp. 6--7), in dimension . is irrational. For a bounded measurable , is the multiplicity of its projection to , and is a bounded remainder set (BRS) if some constant satisfies for and almost every (display (2.1), p. 6).
Theorem 2.6 (p. 9, attributed to Hecke and Ostrowski, quoted). "Any interval with length in is a BRS."
The interval is arbitrary in position, and its length may exceed , in which case counts multiplicity. Together with Proposition 2.4 this is the one-dimensional Hecke-Ostrowski-Kesten characterization that the paper recalls on pp. 1--2: an interval is a BRS if and only if its length belongs to .
Read depth. Claims checked: the statement and the definitions it uses were read clause by clause on the page images, and the short proof on p. 9 was read. Nothing here is independently reviewed.
Source. Sigrid Grepstad and Nir Lev, Sets of bounded discrepancy for multi-dimensional irrational rotation, Geom. Funct. Anal. 25 (2015), no. 1, 87--133, doi:10.1007/s00039-015-0313-z, read in arXiv:1404.0165v2 as identified on the source card; pages are those of the arXiv version.
Proof pointer
P. 9. The bounded remainder property does not depend on the interval's position, so one may take with , (an integer length is trivial). By Proposition 2.5 (p. 8: a BRS for a rotation vector , , is a BRS for ) it suffices to treat the rotation by , and there is a bounded transfer function: jumps by at and by at , is constant in between and has integral zero, so it equals .
Bears on
- Problem 998: the theorem is the converse of the problem's corrected statement (an interval of length has bounded discrepancy), which the problem page credits to Hecke and Ostrowski. Because the position is arbitrary, it also gives bounded discrepancy for translates whose endpoints are not fractional parts of multiples of . As printed, the theorem bounds the discrepancy for almost every starting point , while the problem counts the orbit from one fixed point.