lean_workbook_plus_34801
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.
Suppose that are positive numbers with Prove that \n\n \n\n The sum is cyclic.
Why this node was retired
The posted statement is
theorem lean_workbook_plus_34801 (a b c : ℝ) (ha : 0 < a) (hb : 0 < b) (hc : 0 < c) (habc : a + b + c = 1) : a * (1 - b * c)^(1 / 3) + b * (1 - c * a)^(1 / 3) + c * (1 - a * b)^(1 / 3) ≥ 2 / 3 := by sorry
The stored statement omits that factor and replaces all roots by1, leaving only a+b+c≥2/3.
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 / 3) → ^0).
Proposed corrected statement
Restore the factor1/3 inside each cube-root radicand and use the real cube-root exponent.
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_34801 (a b c : ℝ) (ha : 0 < a) (hb : 0 < b) (hc : 0 < c) (habc : a + b + c = 1) : a * (1 - b * c)^(1 / 3) + b * (1 - c * a)^(1 / 3) + c * (1 - a * b)^(1 / 3) ≥ 2 / 3 := by sorry