lean_workbook_plus_72595
ProvedLet . We want to show that for Rearranging terms we get . Clearly when or . Because is symmetric in , all we have to examine now is the case .
Preamble
import Mathlib.Analysis.Complex.Basic
Formal statement
theorem lean_workbook_plus_72595 (a b c : ℝ) (h₀ : 0 < a ∧ 0 < b ∧ 0 < c) (h₁ : b ≤ a ∧ a ≤ c) : 8 * a^3 + 3 * b^3 + 3 * c^3 + b^2 * c + b * c^2 - 4 * (a^2 * b + a * b^2 + a^2 * c + a * c^2) ≥ 0 := by sorry
Source