analysis / Analysis, Polynomials

Erdős Problem #1151

An elementary solution via a primitive-row decomposition of the Chebyshev-node measures; the main theorem is formalized in Lean, but erdosproblems.com still lists the problem open

10Significance / 100
1Frontier events
0Verification tasks
0Recorded attempts

Temporal state

Current frontier

No reconciled state yet.

Append-only history

Frontier timeline

analysisApr 30, 2026Significance 10/100Registry: lean verified

Erdős Problem #1151

Prior state unknown→proved

An elementary solution via a primitive-row decomposition of the Chebyshev-node measures; the main theorem is formalized in Lean, but erdosproblems.com still lists the problem open

SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review

Research memory

Claims and attempts

Scoped claims

Source authenticated

An elementary solution via a primitive-row decomposition of the Chebyshev-node measures; the main theorem is formalized in Lean, but erdosproblems.com still lists the problem open

An elementary solution via a primitive-row decomposition of the Chebyshev-node measures; the main theorem is formalized in Lean, but erdosproblems.com still lists the problem open

Recorded attempts

Evidence graph

Connected research record