lean_workbook_plus_51881
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 , and are non-negatives such that . Prove that: .
Why this node was retired
The posted statement is
theorem lean_workbook_plus_51881 (a b c : ℝ) (ha : a ≥ 0) (hb : b ≥ 0) (hc : c ≥ 0) (hab : a + b + c = 3) : a * (a + b) ^ (1 / 4) + b * (b + c) ^ (1 / 4) + c * (c + a) ^ (1 / 4) ≥ 3 * (2) ^ (1 / 4) := by sorry
The target simplifies to the existing sum hypothesis.
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 / 4) → ^0).
Proposed corrected statement
Use genuine fourth roots, retaining a,b,c≥0 and a+b+c=3.
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_51881 (a b c : ℝ) (ha : a ≥ 0) (hb : b ≥ 0) (hc : c ≥ 0) (hab : a + b + c = 3) : a * (a + b) ^ (1 / 4) + b * (b + c) ^ (1 / 4) + c * (c + a) ^ (1 / 4) ≥ 3 * (2) ^ (1 / 4) := by sorry