lean_workbook_plus_32180
ProvedExpress the recurrence relation as and show that for all .
Preamble
import Mathlib.Analysis.Complex.Basic
Formal statement
theorem lean_workbook_plus_32180 (x : ℕ → ℝ) (hx : x 0 = 1 / 2) (hn : ∀ n, x (n + 1) = x n * (1 - x n) * (1 + (x n)^2)) : ∀ n, 0 < x n ∧ x n < 1 := by sorry
Source