lean_workbook_plus_50529

⚠️ Retired — specification defect

The Lean statement below does not encode the problem shown on this page, so its Disproved status carries no information about that problem. Do not import this node or use it as a dependency.

Prove or disprove that $\forall a,b,c,d \in \mathbb{R}^+$ we have the following inequality: \n $3 \leq \frac{4a+b}{a+4b} + \frac{4b+c}{b+4c} + \frac{4c+a}{c+4a} < \frac{33}{4}$

Why this node was retired

The posted statement is

theorem lean_workbook_plus_50529 : ∀ a b c d : ℝ, 3 ≤ (4 * a + b) / (a + 4 * b) + (4 * b + c) / (b + 4 * c) + (4 * c + a) / (c + 4 * a) ∧ (4 * a + b) / (a + 4 * b) + (4 * b + c) / (b + 4 * c) + (4 * c + a) / (c + 4 * a) < 33 / 4   :=  by sorry

The source positive-variable hypotheses were omitted, so the zero tuple is not a valid counterexample to the intended question.

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 (d is unused) and then prove or disprove the stated two-sided rational 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.