lean_workbook_plus_13019
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.
Prove that\n\n
\n\nor, by letting and raising both sides to the th power\n\n
\n\nBy the Power-Mean inequality\n\n
\n\nSo it remains to prove that\n\n
\n\nIf we can prove that\n\n
\n\nthen we can arrive at the desired conclusion by summing similar inequalities. Indeed, is equivalent to\n\n
\n\nbut the last one is true by \n\n
\n\nso we are done.
Why this node was retired
The posted statement is
theorem lean_workbook_plus_13019 :
∀ x y z : ℝ, (x + y + z) ^ 4 ≠ 0 → 1 / (x + y + z) ^ 4 * 81 ≤ 1 / x ^ 4 + 1 / y ^ 4 + 1 / z ^ 4 := by sorry
Nonzero total x+y+z does not ensure nonzero positive individual reciprocals; the source AM–GM argument requires them.
The recorded counterexample refutes the statement as encoded. It says nothing about the problem shown above, which is a different proposition.
Proposed corrected statement
For x,y,z>0 prove the stronger243/(x+y+z)^4≤1/x^4+1/y^4+1/z^4; recover the four-variable cyclic conclusion by summing.
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_13019 : ∀ x y z : ℝ, (x + y + z) ^ 4 ≠ 0 → 1 / (x + y + z) ^ 4 * 81 ≤ 1 / x ^ 4 + 1 / y ^ 4 + 1 / z ^ 4 := by sorry