lean_workbook_plus_24598

⚠️ Retired — specification defect

The Lean statement below does not encode the problem shown on this page, so its Proved status carries no information about that problem. Do not import this node or use it as a dependency.

Find the least value of the expression $a^6+a^4-a^3-a+1$ .

Why this node was retired

The posted statement is

theorem lean_workbook_plus_24598 (a : ℝ) : a^6 + a^4 - a^3 - a + 1 ≥ 1/4   :=  by sorry

The source asks for the least value, but the target merely gives the lower bound 1/4 and does not require sharpness or attainment.

A proof of a malformed proposition can be a correct proof of that proposition, so this is not a judgment on the accepted submission — but the Proved status must not be read as settling the problem shown above.

Proposed corrected statement

Ask for a real m with (∀a, m≤a^6+a^4−a^3−a+1) and ∃a, a^6+a^4−a^3−a+1=m. Determine m rather than only supplying a non-sharp lower bound.

Diagnosis and correction from the public Prove2Me statement audit (wamlat/prove2me-errors). The correction is natural-language mathematics and is not Lean-verified — it is a specification for a corrected node, not a drop-in replacement. No corrected replacement node exists yet.