lean_workbook_plus_13017
ProvedIf we're in the bad case, we can pick new variables (in 'good' cyclic order) and substitute into the original proposition to find:
Preamble
import Mathlib.Analysis.Complex.Basic
Formal statement
theorem lean_workbook_plus_13017 (x y z : ℝ) (hx : x ∈ Set.Ioi 0) (hy : y ∈ Set.Ioi 0) (hz : z ∈ Set.Ioi 0) (h : x * y * z = 1) : x ^ 2 / (x ^ 2 + y ^ 2) + y ^ 2 / (y ^ 2 + z ^ 2) + z ^ 2 / (z ^ 2 + x ^ 2) ≤ 3 := by sorry
Source