Papers
Topics
Authors
Recent
Search
2000 character limit reached

A geometric proof of Peck's theorem

Published 24 Sep 2026 in math.NT | (2609.29469v1)

Abstract: Suppose that d≥2d\ge 2 and that 1,α<em>1,…,αd1,α<em>1,\ldots ,α_d is a basis for a real algebraic number field. A theorem of Peck from 1961 establishes that [ \liminf{n\rightarrow\infty}n\log n\,|nα_1|\cdots|nα_d|\ < \infty.] The goal of this paper is to recast Peck's proof in an intuitive geometric framework, where the result follows from a single application of the Minkowski convex body theorem. We will also explain how a simple modification of this approach leads immediately to new proofs of results of de Mathan, Teulié, and Bugeaud regarding the pp-adic Littlewood conjecture for dd-tuples of algebraic numbers. Finally, changing the shape of the convex body allows us to make progress on a conjecture raised by Peck in the same paper, about distributing the logarithmic savings unequally among the coordinates. We prove the conjecture for every real biquadratic field with its natural basis, and for an arbitrary number field when the factors involved are of comparable size.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Tweets

Sign up for free to view the 1 tweet with 0 likes about this paper.