AFTD Auto-Formalizing Theoretical Domains

recursive_one_player_extension_reciprocal

lemmaverified

Let r be a natural number, and let α : ℕ → ℝ be a sequence satisfying α (k + 1) = 1 / (2 - α k) for all k ≥ r. If α r < 1, then for all m ≥ r, 1 / (1 - α m) = 1 / (1 - α r) + ((m : ℝ) - (r : ℝ)).

Statement

lemma recursive_one_player_extension_reciprocal
    (r : ℕ) (α : ℕ → ℝ) (hαr : α r < 1)
    (hrec : ∀ k, r ≤ k → α (k + 1) = 1 / (2 - α k))
    (m : ℕ) (hm : r ≤ m) :
    1 / (1 - α m) = 1 / (1 - α r) + ((m : ℝ) - (r : ℝ))
Source
arXiv:2611.06076 Proposition 2.3 proof
Verified
08 Nov 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 2
Used by 1
  • recursive_one_player_extension_barrierLet r be a natural number and let α : ℕ → ℝ be a sequence satisfying 0 ≤ α r and α r < 1. Under the one-player extension recurrence α (k +…

Read back from the Lean

Let $r, m \in \mathbb{N}$ with $r \le m$, and let $\alpha : \mathbb{N} \to \mathbb{R}$ be a sequence of real numbers. Assume that $\alpha(r) < 1$, and that for all $k \in \mathbb{N}$ such that $r \le k$, $\alpha(k + 1) = \frac{1}{2 - \alpha(k)}$. Then $\frac{1}{1 - \alpha(m)} = \frac{1}{1 - \alpha(r)} + (m - r)$ (where $m$ and $r$ are cast to $\mathbb{R}$).

Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.

Lean source view module on GitHub

/-- Telescoping sum of reciprocals for the one-player extension recurrence. -/
lemma recursive_one_player_extension_reciprocal
    (r : ℕ) (α : ℕ → ℝ) (hαr : α r < 1)
    (hrec : ∀ k, r ≤ k → α (k + 1) = 1 / (2 - α k))
    (m : ℕ) (hm : r ≤ m) :
    1 / (1 - α m) = 1 / (1 - α r) + ((m : ℝ) - (r : ℝ)) := by
  induction m, hm using Nat.le_induction with
  | base => simp
  | succ m hm ih =>
      rw [hrec m hm]
      rw [one_player_extension_reciprocal_step (α m)
        (recursive_one_player_extension_lt_one r α hαr hrec m hm)]
      rw [ih]
      push_cast
      ring
See it in the graphDiscuss this resultChallenge it