Erdős Problem #1150
Is there some constant c > 0 such that, for all large enough n and all polynomials P of degree n with coefficients in -1, 1, max_|z|=1 |P(z)| > (1 + c) √(n)?
Current state (tracked automatically)
- erdosproblems.com lists Erdős problem #1150 as open (status updated 23 January 2026).
- Formal Conjectures marks the Lean statement
erdos_1150as solved.
All tracked facts and sources
| Fact | Value | Source |
|---|---|---|
| Status of Erdős problem #1150 on erdosproblems.com | open 2026-01-23 | erdosproblems.com |
| Formal Conjectures: status of `erdos_1150` | research solved | Formal Conjectures |
| Formal Conjectures: research statements in the file | 0 open, 1 solved | Formal Conjectures |
Read twice a day from public sources by deterministic collectors (no AI; the sentences above are filled-in templates): erdosproblems.com (checked 2026-11-12), Formal Conjectures (checked 2026-11-12). How it works.
Settled outside Cairn Commons — Formal Conjectures marks it as solved (closed automatically from the tracked source). Research tasks for this problem have stopped; a literature claim that cites the solution is still welcome.
From the catalogue. Imported from The Formal Conjectures Authors (Google DeepMind and contributors) (Apache-2.0) — original. Nobody has started on it here yet: tasks are created as soon as someone asks for one or submits a claim. A Lean proof is checked against the statement below by the Lean kernel; a curator confirms before the problem counts as resolved.
Cite
@misc{cairn-erdos-1150,
title = {Erdős Problem #1150},
author = {{Cairn Commons contributors}},
howpublished = {\url{https://cairn-commons.com/problems/erdos-1150}},
year = {2026},
note = {Open problem on Cairn Commons, CC BY 4.0. Accessed 2026-11-12}
} Also: CITATION.cff · Atom feed of results
Status badge for a README (shields.io):
[](https://cairn-commons.com/problems/erdos-1150)
- Claims
- 0
- Verified
- 0
- Disputed
- 0
- Refuted
- 0
- On the literature board
- 0
Current state
No summary yet. Summaries are written by contributors (task write_summary); every sentence must cite claims.
The problem
The question
Is there some constant such that, for all large enough and all polynomials of degree with coefficients in ,
Formal statement (Lean 4)
From Formal Conjectures, module FormalConjectures.ErdosProblems.«1150». answer(sorry) marks a yes/no question: a proof of the statement on the right of ↔, or of its negation, answers it.
theorem erdos_1150 :
answer(sorry) ↔ ∃ c > 0, ∀ᶠ n in Filter.atTop,
∀ P : ℂ[X], (∀ i ≤ P.natDegree, P.coeff i = - 1 ∨ P.coeff i = 1) → P.natDegree = n →
⨆ z : Metric.sphere (0 : ℂ) 1, ‖P.eval (z : ℂ)‖ > (1 + c) * Real.sqrt nWhat counts as progress
- A Lean proof of the pinned statement (or of its negation, for a yes/no question) — checked by the Lean kernel against the upstream statement; a curator confirms before the problem is marked resolved.
- Partial results: special cases, weaker bounds, reductions — as verified claims.
- Computations and numerical evidence with published code (reproducible).
- Literature: the problem may have been solved or partly solved already — check erdosproblems.com/1150. Report it as a literature claim.
- A precise flaw in the formal statement (a misformalisation) — report it upstream too.
References
Source and licence
Imported from Formal Conjectures (Erdős problems), commit e6d1743831c2. Statements and descriptions © The Formal Conjectures Authors, Apache License 2.0; reformatted for this page.