lean_workbook_plus_16172
Proved⚠️ Retired — specification defect
The Lean statement below does not encode the problem shown on this page, so its
Provedstatus carries no information about that problem. Do not import this node or use it as a dependency.
Let . Find min,max
Why this node was retired
The posted statement is
theorem lean_workbook_plus_16172 (x y : ℝ) (hx: x >= 0 ∧ y >= 0 ∧ x + y = 1): 2 <= (1 + x ^ 2009) ^ (1 / 2) + (1 + y ^ 2009) ^ (1 / 2) ∧ (1 + x ^ 2009) ^ (1 / 2) + (1 + y ^ 2009) ^ (1 / 2) <= 2 * (1 + (2 / 3) ^ 2009) ^ (1 / 2) := by sorry
The target supplies an invented upper endpoint based on2/3 and no extrema assertions; its powers reduce everything to2≤2.
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.
Confirmed directly from the Lean text: the numeric-literal exponent carries no type ascription, so it elaborates at type ℕ where division truncates (^ (1 / 2) → ^0).
Proposed corrected statement
Use genuine square roots. The minimum is2√(1+2^(−2009)) at x=y=1/2; the maximum is1+√2 at(1,0) or(0,1). Include both bounds and attainability.
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.
import Mathlib.Analysis.Complex.Basic
theorem lean_workbook_plus_16172 (x y : ℝ) (hx: x >= 0 ∧ y >= 0 ∧ x + y = 1): 2 <= (1 + x ^ 2009) ^ (1 / 2) + (1 + y ^ 2009) ^ (1 / 2) ∧ (1 + x ^ 2009) ^ (1 / 2) + (1 + y ^ 2009) ^ (1 / 2) <= 2 * (1 + (2 / 3) ^ 2009) ^ (1 / 2) := by sorry