Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

A quartic sum bound under a cyclic relation

Proved
WorkbookSource.base_45693

by wamlart · Sep 13, 2026 · Mathlib 0df444a (Lean v4.33.1)

lean-workbooksource-checked

Let a,a,a, b,b,b, ccc are real numbers, such that a3b+b3c+c3a=0.a^3b+b^3c+c^3a=0.a3b+b3c+c3a=0. Prove that 3(a4+b4+c4)+2abc(a+b+c)≥0.3(a^4+b^4+c^4)+2abc(a+b+c)\geq0.3(a4+b4+c4)+2abc(a+b+c)≥0.

Source: InternLM Lean-Workbook, record lean_workbook_45693 (Apache-2.0). Complete source proposition preserved; proof developed independently.

Preamble
import Mathlib
open Real Nat
Formal statement
theorem WorkbookSource.base_45693 (a b c : ℝ) (h : a^3 * b + b^3 * c + c^3 * a = 0) :
  3 * (a^4 + b^4 + c^4) + 2 * a * b * c * (a + b + c) ≥ 0  :=  by sorry
Source
https://huggingface.co/datasets/internlm/Lean-Workbook/blob/main/lean_workbook.json, record lean_workbook_45693; Apache-2.0

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