Vela

Determine the infimum and supremum ofas ranges over all non-constant monic polynomials, all of whose roots are real and in the interval .

Worked, still open.

analysis · open · formalized (Lean) · 0 attempts

use this record

vela registry pull vfr_37aec80d874a0239
vela reproduce examples/erdos-problems

evidence

unverified AI candidates (2)

gpt-erdos · GPT-5.2 Pro + Deep Research · unverified

Let [ S_f:={x\in\mathbb R:\ |f(x)|<1},\qquad m(f):=|S_f| ] (Lebesgue measure). Note that replacing “(<1)” by “(\le 1)” does **not** change the measure, because (|f(x)|=1) has only finitely many real solutions.

candidate solution ↗

llm-hunter · gpt pro 5.2 · unverified

1 LLM attack(s) recorded (gpt pro 5.2); unverified.

candidate solution ↗

formal

AMS 28 · open (literature)

theorem erdos_1038.parts.i (n : ℕ) : answer(sorry) =
    ⨅ f : {f : Polynomial ℝ // f.Monic ∧ f ≠ 1 ∧
    (f.roots.filter fun x => x ∈ Set.Icc (-1 : ℝ) 1).card = f.natDegree},
    volume {x | |f.1.eval x| < 1}
formal-conjectures/1038.lean ↗

status

open

notary

vela reproduce examples/erdos-problems
  • packet.json · sha256 f58dc1051ed9aef0430ee9debd91fab38e9bb2b980b2a5afc72c14509b922849

finding.noted · reviewer:will-blair · 1 day

renders the record as of vev_d199cb2e · 1,338 events · hub

Search Vela

Jump to a section, signal, campaign, document, primitive, work path, frontier, record index, atlas, constellation, agent, capability, or full-state search.