AFTD Auto-Formalizing Theoretical Domains

cactus_cycle_envelope_lt_three_halves

theoremverified

For every natural number m satisfying 1 ≤ m, the cactus cycle envelope cactus_cycle_envelope m is strictly less than 3 / 2.

Statement

theorem cactus_cycle_envelope_lt_three_halves (m : ℕ) (hm : 1 ≤ m) : cactus_cycle_envelope m < 3 / 2
Source
arXiv:2610.23032
Verified
30 Oct 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 1
  • cactus_cycle_envelopeFor a natural number m, the cactus cycle envelope cactus_cycle_envelope m is defined as the real number (3 * (2 : ℝ) ^ (m - 1) - 2) / ((2…

Read back from the Lean

For every natural number $m$ satisfying $1 ≤ m$, $\text{cactus\_cycle\_envelope}(m) < 3 / 2$ (in the real numbers).

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

The proof, explained

Using the assumption m ≥ 1, the proof writes m = n + 1, simplifying cactus_cycle_envelope m to (3 * 2^n - 2) / (2^(n+1) - 1). It establishes that the denominator is strictly positive because 2^n ≥ 1. Multiplying through by the positive denominator reduces the claim to 3 * 2^n - 2 < 3 * 2^n - 3 / 2, which holds since -2 < -3 / 2.

  1. The goal reduces to showing that (3 * 2 ^ n - 2) / (2 ^ (n + 1) - 1) < 3 / 2 for some natural number n.

    Using the hypothesis m ≥ 1, we write m = n + 1 with n = m - 1. Substituting this into the definition of cactus_cycle_envelope, the exponent (n + 1) - 1 in the numerator simplifies to n by Nat.add_sub_cancel.

    lines 3–4

    uses Nat.add_sub_cancel

      obtain ⟨n, rfl⟩ : ∃ n, m = n + 1 := ⟨m - 1, by omega⟩
      simp only [cactus_cycle_envelope, Nat.add_sub_cancel]
  2. (2 : ℝ) ^ (n + 1) = 2 * 2 ^ n.

    This is the standard power identity 2^(n+1) = 2 * 2^n in the real numbers, verified by ring arithmetic.

    line 5

      have h2 : (2:ℝ)^(n+1) = 2 * 2^n := by ring
  3. The denominator 2 ^ (n + 1) - 1 is strictly positive.

    Since 1 ≤ 2, one_le_pow₀ implies 1 ≤ 2 ^ n. Using the identity 2 ^ (n + 1) = 2 * 2 ^ n, we have 2 ^ (n + 1) - 1 = 2 * 2 ^ n - 1 ≥ 2 * 1 - 1 = 1 > 0, which linear arithmetic confirms.

    lines 6–8

    uses one_le_pow₀

      have hpos : (0:ℝ) < 2 ^ (n + 1) - 1 := by
        have h3 : (1:ℝ) ≤ 2 ^ n := one_le_pow₀ (by norm_num : (1:ℝ) ≤ 2)
        rw [h2]; linarith
  4. cactus_cycle_envelope (n + 1) < 3 / 2 holds.

    Since the denominator is strictly positive, div_lt_iff₀ transforms the division inequality into 3 * 2 ^ n - 2 < 3 / 2 * (2 ^ (n + 1) - 1). Replacing 2 ^ (n + 1) with 2 * 2 ^ n, the right-hand side expands to 3 * 2 ^ n - 3 / 2, reducing the inequality to -2 < -3 / 2, which is closed by linear arithmetic.

    lines 9–10

    uses div_lt_iff₀

      rw [div_lt_iff₀ hpos, h2]
      linarith
Nat.add_sub_cancel
For any natural numbers n and m, (n + m) - m = n.
one_le_pow₀
In an ordered monoid with zero, if 1 ≤ a, then 1 ≤ a ^ n for all natural numbers n.
div_lt_iff₀
In an ordered group with zero, if c > 0, then b / c < a if and only if b < a * c.

Written by a model (gemini-3.8-flash) from the Lean proof and the goal states Lean reported at each step. Lean verified the proof; this explanation is a reading aid and is not itself machine-checked.

Lean source view module on GitHub

/-- The cactus cycle envelope is strictly bounded above by 3 / 2 for all m ≥ 1. -/theorem cactus_cycle_envelope_lt_three_halves (m : ℕ) (hm : 1 ≤ m) : cactus_cycle_envelope m < 3 / 2 := by  obtain ⟨n, rfl⟩ : ∃ n, m = n + 1 := ⟨m - 1, by omega⟩  simp only [cactus_cycle_envelope, Nat.add_sub_cancel]  have h2 : (2:ℝ)^(n+1) = 2 * 2^n := by ring  have hpos : (0:ℝ) < 2 ^ (n + 1) - 1 := by    have h3 : (1:ℝ) ≤ 2 ^ n := one_le_pow₀ (by norm_num : (1:ℝ) ≤ 2)    rw [h2]; linarith  rw [div_lt_iff₀ hpos, h2]  linarith
See it in the graphDiscuss this resultChallenge it