AFTD Auto-Formalizing Theoretical Domains

nat_succ_le_two_pow

lemmaverified

For every natural number j, (j + 1 : ℝ) ≤ 2^j.

Statement

lemma nat_succ_le_two_pow (j : ℕ) : (j + 1 : ℝ) ≤ (2 : ℝ) ^ j
Source
arXiv:2611.17090, Lemma 7 proof
Verified
15 Nov 2026
Axioms
Classical.choiceQuot.soundpropext
Used by 1
  • accumulating_prefix_scalesAccumulating prefix edge lengths across dyadic scales (Lemma 7). Let E be a finite set of edges with weights w_e > 0, and for a fixed…

Read back from the Lean

For every natural number $j$, the real number $j + 1$ is less than or equal to $2^j$.

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

/-- Linear bound by dyadic powers: j + 1 ≤ 2^j for all natural numbers j. -/
lemma nat_succ_le_two_pow (j : ℕ) : (j + 1 : ℝ) ≤ (2 : ℝ) ^ j := by
  exact_mod_cast (Nat.succ_le_of_lt (Nat.lt_two_pow_self (n := j)))
See it in the graphDiscuss this resultChallenge it