AFTD Auto-Formalizing Theoretical Domains

archimedean_ratio_gt_one

theoremverified

For any real constant c > 1/2, there exists a natural number M > 1 such that 1 < c * (2 - 1 / M).

Statement

theorem archimedean_ratio_gt_one (c : ℝ) (hc : 1 / 2 < c) :
    ∃ M : ℕ, 1 < M ∧ 1 < c * (2 - (1 : ℝ) / M)
Source
step towards op182_deferred_to_deadline_beyond_half_against_stopping
Verified
19 Oct 2026
Axioms
Classical.choiceQuot.soundpropext
Used by 1

The proof, explained

The desired inequality 1 < c * (2 - 1 / M) is equivalent to 1 / M < 2 - 1 / c. Since c > 1/2, the difference 2 - 1 / c is strictly positive. Applying the Archimedean property yields a natural number M strictly greater than max(1, 1 / (2 - 1 / c)), which ensures both M > 1 and, by taking reciprocals, 1 / M < 2 - 1 / c.

  1. 0 < c

    Since c > 1/2, linear arithmetic immediately establishes that c is strictly positive.

    line 4

      have hcpos : 0 < c := by linarith
  2. 0 < 2 - 1 / c

    Since c > 0, the inequality 1 / c < 2 is equivalent by div_lt_iff₀ to 1 < 2 * c, which holds because c > 1/2. Subtracting 1 / c from 2 shows that 2 - 1 / c > 0.

    lines 5–9

    uses div_lt_iff₀

      have hdiff : 0 < 2 - 1 / c := by
        have : 1 / c < 2 := by
          rw [div_lt_iff₀ hcpos]
          linarith
        linarith
  3. There exists a natural number M strictly greater than max 1 (1 / (2 - 1 / c)).

    By the Archimedean property of the real numbers (exists_nat_gt), there is a natural number M strictly exceeding max 1 (1 / (2 - 1 / c)).

    line 10

    uses exists_nat_gt

      obtain ⟨M, hM⟩ := exists_nat_gt (max 1 (1 / (2 - 1 / c)))
  4. 1 < M

    Since 1 ≤ max 1 (1 / (2 - 1 / c)) < M by le_max_left and lt_of_le_of_lt, the inequality 1 < M holds for real numbers, and casting down to ℕ establishes 1 < M.

    lines 11–13

    uses lt_of_le_of_lt, le_max_left

      have h1 : 1 < M := by
        have : (1 : ℝ) < M := lt_of_le_of_lt (le_max_left _ _) hM
        exact_mod_cast this
  5. 1 / M < 2 - 1 / c

    Similarly, 1 / (2 - 1 / c) ≤ max 1 (1 / (2 - 1 / c)) < M by le_max_right and lt_of_le_of_lt. Since both M and 2 - 1 / c are strictly positive, taking reciprocals using one_div_lt reverses the strict inequality, giving 1 / M < 2 - 1 / c.

    lines 14–17

    uses lt_of_le_of_lt, le_max_right, one_div_lt

      have h2 : 1 / (2 - 1 / c) < (M : ℝ) := lt_of_le_of_lt (le_max_right _ _) hM
      have hMpos : 0 < (M : ℝ) := by positivity
      have hinv : 1 / (M : ℝ) < 2 - 1 / c := by
        rwa [one_div_lt hMpos hdiff]
  6. 1 < c * (2 - 1 / M), completing the existential claim.

    Using M as the witness along with 1 < M, rearranging 1 / M < 2 - 1 / c yields 1 / c < 2 - 1 / M. Multiplying both sides by c > 0 via div_lt_iff₀ gives 1 < (2 - 1 / M) * c, which by linear arithmetic yields 1 < c * (2 - 1 / M).

    lines 18–22

    uses div_lt_iff₀

      refine ⟨M, h1, ?_⟩
      have : 1 / c < 2 - 1 / (M : ℝ) := by linarith
      have : 1 < (2 - 1 / (M : ℝ)) * c := by
        rwa [div_lt_iff₀ hcpos] at this
      linarith
div_lt_iff₀
For positive c, b / c < a is equivalent to b < a * c.
exists_nat_gt
For any real number x, there exists a natural number n strictly greater than x.
lt_of_le_of_lt
If a ≤ b and b < c, then a < c.
le_max_left
For any elements a and b, a ≤ max a b.
le_max_right
For any elements a and b, b ≤ max a b.
one_div_lt
For positive numbers a and b, 1 / a < b is equivalent to 1 / b < a.

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

/-- For any constant c > 1/2, there exists an integer M > 1 such that c * (2 - 1/M) > 1. -/theorem archimedean_ratio_gt_one (c : ℝ) (hc : 1 / 2 < c) :    ∃ M : ℕ, 1 < M ∧ 1 < c * (2 - (1 : ℝ) / M) := by  have hcpos : 0 < c := by linarith  have hdiff : 0 < 2 - 1 / c := by    have : 1 / c < 2 := by      rw [div_lt_iff₀ hcpos]      linarith    linarith  obtain ⟨M, hM⟩ := exists_nat_gt (max 1 (1 / (2 - 1 / c)))  have h1 : 1 < M := by    have : (1 : ℝ) < M := lt_of_le_of_lt (le_max_left _ _) hM    exact_mod_cast this  have h2 : 1 / (2 - 1 / c) < (M : ℝ) := lt_of_le_of_lt (le_max_right _ _) hM  have hMpos : 0 < (M : ℝ) := by positivity  have hinv : 1 / (M : ℝ) < 2 - 1 / c := by    rwa [one_div_lt hMpos hdiff]  refine ⟨M, h1, ?_⟩  have : 1 / c < 2 - 1 / (M : ℝ) := by linarith  have : 1 < (2 - 1 / (M : ℝ)) * c := by    rwa [div_lt_iff₀ hcpos] at this  linarith
See it in the graphDiscuss this resultChallenge it