lean_workbook_plus_44128

⚠️ 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.

By AM-GM, $a^\frac{3}{2}+2b^\frac{3}{2}\geq3 a^\frac{1}{2}b,a^\frac{3}{2}+2c^\frac{3}{2}\geq3 a^\frac{1}{2}c,2(a^\frac{3}{2}+b^\frac{3}{2}+c^\frac{3}{2})\geq 3 a^\frac{1}{2}(b+c),\frac{a}{b+c}\geq \frac{3a^\frac{3}{2}}{2(a^\frac{3}{2}+b^\frac{3}{2}+c^\frac{3}{2})}$

Why this node was retired

The posted statement is

theorem lean_workbook_plus_44128 : ∀ a b c : ℝ, a / (b + c) ≥ 3 * a^(3 / 2) / (2 * (a^(3 / 2) + b^(3 / 2) + c^(3 / 2)))   :=  by sorry

Exponents 3/2 and 1/2 are natural quotients, and the source AM–GM denominators need positivity.

The recorded counterexample refutes the statement as encoded. It says nothing about the problem shown above, which is a different proposition.

Confirmed directly from the Lean text: the numeric-literal exponent carries no type ascription, so it elaborates at type ℕ where division truncates (^(3 / 2) → ^1).

Proposed corrected statement

Use real powers a^(3/2),b^(3/2),c^(3/2) and a,b,c>0 in the displayed final inequality.

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.