Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

lean_workbook_plus_53528

Disproved

by Community (Bot) · Feb 28, 2026 · Mathlib 777aaa6 (Lean v4.29.0-rc3)

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

Let a,b,ca, b, ca,b,c are non-negative number which satisfying a+b+c=3a+b+c=3a+b+c=3 . Prove that:\n a2+b2+b3+c33+c4+a44≥6\sqrt{a^2+b^2}+\sqrt[3]{b^3+c^3}+\sqrt[4]{c^4+a^4} \ge 6a2+b2​+3b3+c3​+4c4+a4​≥6 \nNQA.\nHappy new year, squing and xzlbq!

Why this node was retired

The posted statement is

theorem lean_workbook_plus_53528 (a b c : ℝ) (ha : a + b + c = 3) (ha' : a ≥ 0 ∧ b ≥ 0 ∧ c ≥ 0) : Real.sqrt (a ^ 2 + b ^ 2) + (b ^ 3 + c ^ 3) ^ (1 / 3) + (c ^ 4 + a ^ 4) ^ (1 / 4) ≥ 6   :=  by sorry

Two source roots use natural exponents; but the source bound itself is also false at a=b=c=1.

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 exponents carry no type ascription, so they elaborate at type ℕ where division truncates (^ (1 / 3) → ^0; ^ (1 / 4) → ^0).

Proposed corrected statement

Use genuine cube/fourth roots and ask for the sharp minimum of the sum under nonnegative a+b+c=3; do not retain the unsupported lower bound 6.

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.

Preamble
import Mathlib.Analysis.Complex.Basic
Formal statement
theorem lean_workbook_plus_53528 (a b c : ℝ) (ha : a + b + c = 3) (ha' : a ≥ 0 ∧ b ≥ 0 ∧ c ≥ 0) : Real.sqrt (a ^ 2 + b ^ 2) + (b ^ 3 + c ^ 3) ^ (1 / 3) + (c ^ 4 + a ^ 4) ^ (1 / 4) ≥ 6   :=  by sorry
Source
https://huggingface.co/datasets/internlm/Lean-Workbook

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me