The Baernstein quasi-norm monotonicity conjecture compares normalized circle means of a polynomial with those of equally spaced roots
on the unit circle (Agler and McCarthy 2021). For
a nonzero polynomial of polynomial degree
with all its roots on the unit
circle, set
and define
for . These means are polynomial
norms for
and quasi-norms for
.
The endpoint
is the Mahler measure,
while
. The conjecture states that
for .
Zhang (2026) proved the conjecture and states that the original proof was completed without AI assistance. ChatGPT was subsequently used for presentation and proofreading, and Codex generated an accompanying Lean formalization that the author reports was checked by the Lean kernel (Zhang 2026).