lean_workbook_plus_2398
Proved⚠️ Retired — mistyped fractional exponent
The exponent
^(1 / 3)in the Lean statement below is natural-number division, not a real exponent, so it collapses 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.
Let such that . Prove that
Why this node was retired
The posted statement is
theorem lean_workbook_plus_2398 (a b c : ℝ) (ha : 0 < a) (hb : 0 < b) (hc : 0 < c) (habc : a * b * c = 1) : 1 / (26 * a + 1)^(1 / 3) + 1 / (26 * b + 1)^(1 / 3) + 1 / (26 * c + 1)^(1 / 3) ≥ 1 := 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 / 3)→^0, so the radical is1for every base
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 the actual roots and fractional powers in the following source statement: nonnegative real roots for nonnegative radicands, the unique signed real cube root for a possibly negative radicand, and an explicit real type on each other fractional exponent. Preserve the displayed hypotheses, parentheses and inequality direction. Proposed corrected problem: Let such that . Prove that
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_2398 (a b c : ℝ) (ha : 0 < a) (hb : 0 < b) (hc : 0 < c) (habc : a * b * c = 1) : 1 / (26 * a + 1)^(1 / 3) + 1 / (26 * b + 1)^(1 / 3) + 1 / (26 * c + 1)^(1 / 3) ≥ 1 := by sorry