Essential minimum of the Zhang-Zagier height

Description of constant

Let $\overline{\mathbb{Q}}$ be the set of all algebraic numbers. The naïve height $h : \overline{\mathbb{Q}} \rightarrow \mathbb{R}$ is defined as follows. Let $\alpha \in \overline{\mathbb{Q}}$ and let $P(x)$ be an irreducible primitive polynomial with integers coefficients such that $P(\alpha)=0$. Let $n$ be the degree and $a$ be the leading coefficient of $P(x)$. Then,

\[h(\alpha):=\frac{1}{n}\left( \log|a|+\sum_{P(\beta)=0} \log \max (1,|\beta|)\right).\]

The Zhang-Zagier height is the function

\[h_Z : \overline{\mathbb{Q}} \rightarrow \mathbb{R}, \quad h_Z(\alpha)=h(\alpha)+h(1-\alpha).\]

The essential minimum of the Zhang-Zagier height is the supremum $C_{82}$ over all real numbers $H$ such that the set ${\alpha \in \overline{\mathbb{Q}} | h_Z(\alpha)\le H}$ is finite.

Known upper bounds

Bound Reference Comments
0.39679 [D03], Section 7  
0.25594 [Doc01a] $h_Z=\log \mathfrak{h}$ in his notation
0.25444 [Doc01b] Previous best known upper bound
0.2536331090204145 [Gri26] Computation based on Doche’s polynomials
0.2535744749068227* [Epi26] Doche’s limit-point construction with unequal denominator multiplicities and two additional factors (Ed5, En6); reported in the Épi results repository (September 2026). An independent Arb re-evaluation of the same construction in [Pin26] encloses it at $0.25356893\ldots$. Asterisked: a self-archived computer-assisted result.
0.2534449* [Pin26] Doche’s limit-point construction [Doc01b] on the factor library of [Gri26] and [Epi26], adding $P_7$ to the denominator and 25 new numerator factors found by LP-dual-weighted lattice reduction (LLL), with all multiplicities and exponents re-optimised by a linear program ($\deg Q = 999999992$). Certified upper bound $0.2534446873\ldots$ by two independently written Arb checkers; the repository includes a self-contained proof that the construction yields infinitely many distinct algebraic numbers with $h_Z \le B$. Certificate SHA-256 b33626f367b6f52922746c0fee7bb008449cd0bb18efcb983ab20ff073350fce, repository commit 69d8964. Asterisked: a self-archived computer-assisted certificate, not yet independently replayed.

Known lower bounds

Bound Reference Comments
0 trivial  
0 [Zha95] Strict inequality
$\frac{1}{2}\log \big(\frac{1+\sqrt{5}}{2}\big)=0.2406059…$ [Zag93]  
0.24824 [Doc01a] $h_Z=\log \mathfrak{h}$ in his notation
0.24874 [F18] $h_Z=\log \zeta$ in her notation, best known lower bound

Additional comments

References

Contribution notes

Prepared with assistance from GPT-5.5 Pro.

The [Pin26] upper-bound row (October 2026): the factor search, the certificate, the checkers and the row text were prepared with AI assistance (OpenAI Codex/GPT-6 Astra and Claude) under the direction of the submitter, R. Pinho, who reviewed the argument and the references.