lean_workbook_plus_5671
Proved⚠️ Retired — mistyped fractional exponent
The exponents
^(1 / 4),^(7 / 4)in the Lean statement below are natural-number division, not a real exponent, so they collapse to an integer power and the displayed radical is not what is being asserted. Do not import this node or use it as a dependency.
a,b,c \in \mathbb R_+, abc=1 .Show that: $a^3b+b^3c+c^3a\geqslant a^{\frac{7}{4}}+b^{\frac{7}{4}}+c^{\frac{7}{4}}+16\left(a^{\frac{1}{4}}+b^{\frac{1}{4}}+c^{\frac{1}{4}}\right)\left(a^{\frac{1}{4}}-b^{\frac{1}{4}}\right)^2\left(a^{\frac{1}{4}}-c^{\frac{1}{4}}\right)^2\left(b^{\frac{1}{4}}-c^{\frac{1}{4}}\right)^2$
Why this node was retired
The posted statement is
theorem lean_workbook_plus_5671 (a b c : ℝ) (ha : 0 < a) (hb : 0 < b) (hc : 0 < c) (habc : a * b * c = 1) : a^3 * b + b^3 * c + c^3 * a >= a^(7 / 4) + b^(7 / 4) + c^(7 / 4) + 16 * (a^(1 / 4) + b^(1 / 4) + c^(1 / 4)) * (a^(1 / 4) - b^(1 / 4))^2 * (a^(1 / 4) - c^(1 / 4))^2 * (b^(1 / 4) - c^(1 / 4))^2 := by sorry
A numeric-literal exponent carrying no type ascription is elaborated at type ℕ (via HPow ℝ ℕ ℝ, Monoid.npow), and natural-number division truncates. Each occurrence therefore collapses:
^(1 / 4)→^0, so the radical is1for every base^(7 / 4)→^1, i.e. the 7/4 power is replaced by the 1th power
What the accepted submission established is therefore a proof of the collapsed statement, not of the exercise displayed on this page. The submission is not thereby invalid — a proof of a malformed proposition can be a correct proof of that proposition — but its Proved status must not be read as settling the source problem.
What a faithful statement would require
Every fractional exponent must be given a real type, e.g. x ^ ((1 : ℝ) / 3) using Real.rpow, or be written with the intended root operation (Real.sqrt, or the signed real cube root where the radicand may be negative). Real powers also need their own domain hypotheses: rpow is only the intended root for a nonnegative base.
Proposed corrected statement
Use real powers7/4 and1/4 throughout, retaining positivity and abc=1.
From the public Prove2Me statement audit (wamlat/prove2me-errors). That proposal is natural-language mathematics and is not Lean-verified; it is a specification for a corrected node, not a drop-in replacement.
import Mathlib.Analysis.Complex.Basic
theorem lean_workbook_plus_5671 (a b c : ℝ) (ha : 0 < a) (hb : 0 < b) (hc : 0 < c) (habc : a * b * c = 1) : a^3 * b + b^3 * c + c^3 * a >= a^(7 / 4) + b^(7 / 4) + c^(7 / 4) + 16 * (a^(1 / 4) + b^(1 / 4) + c^(1 / 4)) * (a^(1 / 4) - b^(1 / 4))^2 * (a^(1 / 4) - c^(1 / 4))^2 * (b^(1 / 4) - c^(1 / 4))^2 := by sorry