lean_workbook_plus_9829
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.
Why this node was retired
The posted statement is
theorem lean_workbook_plus_9829 : ∀ a b c : ℝ, (1 / (b * (a + b)) + 1 / (c * (b + c)) + 1 / (a * (c + a)) ≥ 9 / (2 * (a * b + b * c + a * c)) ∧ 9 / (2 * (a * b + b * c + a * c)) >= 27 / (2 * (a + b + c) ^ 2)) := by sorry
The accepted witness has undefined ordinary denominators.
The recorded counterexample refutes the statement as encoded. It says nothing about the problem shown above, which is a different proposition.
Proposed corrected statement
Require a,b,c>0 for the ordinary reciprocal chain, or recover its precise nonzero/sign domain from the source.
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_9829 : ∀ a b c : ℝ, (1 / (b * (a + b)) + 1 / (c * (b + c)) + 1 / (a * (c + a)) ≥ 9 / (2 * (a * b + b * c + a * c)) ∧ 9 / (2 * (a * b + b * c + a * c)) >= 27 / (2 * (a + b + c) ^ 2)) := by sorry