OpenFrontiers
← Back to the index
OP-12050OpenNumber theory

Lehmer’s Mahler measure constant (C40aC_{40a})

Lehmer’s Mahler measure constant: determine C40aC_{40a} or improve its bounds; the repository records 1 (lower) and 1.176280... (upper).

Editorial MSC2020 classification. Original article codes and source evidence are recorded in the literature directory.

Licensed source statementAs of Repository table at commit 2c1968c (2026-09-26); open while the recorded lower and upper bounds differSource & evidence ↓

Problem statement

Let

f(x)=∑i=0naixi  =  an∏i=1n(x−αi)f(x)=\sum_{i=0}^n a_i x^i \;=\; a_n\prod_{i=1}^n (x-\alpha_i)

be a polynomial with complex coefficients. The Mahler measure of ff is

M(f)  :=  ∣an∣∏i=1nmax⁡{1,∣αi∣}.M(f)\;:=\;|a_n|\prod_{i=1}^n \max\{1,|\alpha_i|\}.

[BDM2007-def-M]

For an integer polynomial f(x)∈Z[x]f(x)\in\mathbb{Z}[x], Kronecker’s theorem characterizes the case M(f)=1M(f)=1:

M(f)=1⟺f(x) is a product of cyclotomic polynomials and x.M(f)=1 \quad\Longleftrightarrow\quad f(x)\text{ is a product of cyclotomic polynomials and }x.

[BDM2007-kronecker]

Motivated by Lehmer’s question, define Lehmer’s Mahler measure constant C40aC_{40a} to be the infimum of Mahler measures strictly larger than 11 among integer polynomials, and denote it by LL:

L  :=  inf⁡{M(f)  :  f∈Z[x], 1<M(f)}.L \;:=\; \inf\bigl\{ M(f)\;:\; f\in\mathbb{Z}[x],\ 1<M(f)\bigr\}.

[BDM2007-lehmer-question]

Lehmer’s original question (1933) asks whether, for every ϵ>0\epsilon>0, there exists an integer polynomial ff with

1<M(f)<1+ϵ,1<M(f)<1+\epsilon,

which is equivalent to asking whether L=1L=1. [BDM2007-lehmer-question]

Lean 4

Not yet attached

No Lean statement or proof is attached yet. Have a formalization? Share its source to add it to this problem.

Background

  • Nonreciprocal case (Smyth). Smyth answered Lehmer’s question for nonreciprocal polynomials: if f∈Z[x]f\in\mathbb{Z}[x] is nonreciprocal and f(0)≠0f(0)\neq 0, then
M(f) ≥ M(x3−x−1)=1.324717…,M(f)\ \ge\ M(x^3-x-1)=1.324717\ldots,

[BDM2007-smyth-thm1] [Smy1971]

References (from the repository page)

  • [BDM2007] Borwein, Peter; Dobrowolski, Edward; Mossinghoff, Michael J. Lehmer’s problem for polynomials with odd coefficients. Annals of Mathematics 166(2) (2007), 347–366. DOI: 10.4007/annals.2007.166.347. Google Scholar. Author PDF

  • [BDM2007-def-M] loc: Author PDF p.1, Equation (1.1). quote: “Mahler’s measure of a polynomial ff, denoted M(f)M(f), is defined as the product of the absolute values of those roots of ff that lie outside the unit disk, multiplied by the absolute value of the leading coefficient. Writing f(x)=a∏k=1d(x−αk)f(x)=a\prod_{k=1}^d (x-\alpha_k), we have M(f)=∣a∣∏k=1dmax⁡{1,∣αk∣}M(f)=|a|\prod_{k=1}^d \max\{1,|\alpha_k|\}.”

  • [BDM2007-kronecker] loc: Author PDF p.2, Introduction (paragraph after Equation (1.1)). quote: “For f∈Z[x]f \in \mathbb{Z}[x], clearly M(f)≥1M(f) \ge 1, and by a classical theorem of Kronecker, M(f)=1M(f) = 1 precisely when f(x)f(x) is a product of cyclotomic polynomials and the monomial xx.”

  • [BDM2007-lehmer-question] loc: Author PDF p.2, Introduction (Lehmer’s question). quote: “In 1933, D. H. Lehmer [12] asked if for every ϵ>0\epsilon > 0 there exists a polynomial f∈Z[x]f \in \mathbb{Z}[x] satisfying 1<M(f)<1+ϵ1 < M(f) < 1 + \epsilon.”

  • [BDM2007-lehmer-poly] loc: Author PDF p.2, Introduction (Lehmer’s example). quote: “Lehmer noted that the polynomial ℓ(x)=x10+x9−x7−x6−x5−x4−x3+x+1\ell(x)=x^{10}+x^9-x^7-x^6-x^5-x^4-x^3+x+1 has M(ℓ)=1.176280…M(\ell)=1.176280\ldots, and this value remains the smallest known measure larger than 11 of a polynomial with integer coefficients.”

  • [BDM2007-smallest-known] loc: Author PDF p.2, Introduction (after Lehmer’s example). quote: “and this value remains the smallest known measure larger than 11 of a polynomial with integer coefficients.”

  • [BDM2007-smyth-thm1] loc: Author PDF p.2, Introduction (Smyth’s result). quote: “Smyth [22] showed that if f∈Z[x]f \in \mathbb{Z}[x] is nonreciprocal and f(0)≠0f(0) \ne 0, then M(f)≥M(x3−x−1)=1.324717…M(f) \ge M(x^3-x-1) = 1.324717 \ldots.”

  • [Leh1933] Lehmer, D. H. Factorization of Certain Cyclotomic Functions. Annals of Mathematics 34(3) (1933), 461–479. DOI: 10.2307/1968172. Google Scholar.

  • [Smy1971] Smyth, C. J. On the product of the conjugates outside the unit circle of an algebraic integer. Bulletin of the London Mathematical Society 3(2) (1971), 169–175. DOI: 10.1112/blms/3.2.169. Google Scholar.

Progress & source assessment

Repository table (commit 2c1968c, 26 September 2026): best known lower bound 1; best known upper bound 1.176280.... Values marked with an asterisk have minimal verification.

Known upper bounds

Bound Reference Comments
1.176280…1.176280\ldots [BDM2007] [Leh1933] Lehmer’s example polynomial ℓ(x)=x10+x9−x7−x6−x5−x4−x3+x+1\ell(x)=x^{10}+x^9-x^7-x^6-x^5-x^4-x^3+x+1 has Mahler measure M(ℓ)=1.176280…M(\ell)=1.176280\ldots, giving L≤1.176280…L\le 1.176280\ldots. [BDM2007-lehmer-poly]
1.176280…1.176280\ldots [BDM2007] [Leh1933] The value 1.176280…1.176280\ldots (the Mahler measure of ℓ\ell) “remains the smallest known measure >1>1 for an integer polynomial,” i.e. it is the best currently known explicit upper bound for LL. [BDM2007-smallest-known]

Known lower bounds

Bound Reference Comments
11 Trivial (Kronecker) For f∈Z[x]f\in\mathbb{Z}[x], one has M(f)≥1M(f)\ge 1, with M(f)=1M(f)=1 precisely in the cyclotomic/monomial case; hence L≥1L\ge 1. [BDM2007-kronecker]
References
  1. [1]Davis, Damek; Ivanisvili, Paata; Tao, Terence (maintainers). Optimization Constants in Mathematics, github.com/teorth/optimizationproblems (commit 2c1968c, 26 September 2026). — Lehmer’s Mahler measure constant ($C_{40a}$) linkApache-2.0 (repository license); constant pages reproduced with attribution; repository references retained.

Recorded progress

Add yours →

Nothing recorded yet. A pointer to a paper the entry is missing counts.

Machine attempts

0 recorded

Attempts run against the statement below and are recorded in full, including the failures. The point is to stop the next model — and the next person — from re-walking a road that is already known to end. Each attempt costs 25 credits.

No machine attempts recorded.

Sign in to run an attempt. New accounts start with enough credits for ten.

Discussion

0 notes

Notes are for clarifying the statement, flagging a missing reference, or recording why an approach fails. Claimed solutions belong in a submission, where they can be reviewed.

No notes yet.

Sign in to add a note.