lean_workbook_plus_30302
Disproved⚠️ Retired — specification defect
The Lean statement below does not encode the problem shown on this page, so its
Disprovedstatus carries no information about that problem. Do not import this node or use it as a dependency.
Let be nonnegative real numbers such that . Prove that: \n
Why this node was retired
The posted statement is
theorem lean_workbook_plus_30302 :
∀ x y z : ℝ, 0 ≤ x ∧ 0 ≤ y ∧ 0 ≤ z ∧ x + y + z = 3 → 3 ≤ Real.sqrt (x * y + x) + Real.sqrt (y * z + y) + Real.sqrt (z * x + z) := by sorry
The source upper bounds x,y,z≤2 were omitted.
The recorded counterexample refutes the statement as encoded. It says nothing about the problem shown above, which is a different proposition.
Proposed corrected statement
Restore0≤x,y,z≤2 together with sum3 and prove the stated radical 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.
import Mathlib.Analysis.Complex.Basic
theorem lean_workbook_plus_30302 : ∀ x y z : ℝ, 0 ≤ x ∧ 0 ≤ y ∧ 0 ≤ z ∧ x + y + z = 3 → 3 ≤ Real.sqrt (x * y + x) + Real.sqrt (y * z + y) + Real.sqrt (z * x + z) := by sorry