AFTD Auto-Formalizing Theoretical Domains

rare_tail_target_limit_lt_one

theoremverified

For every real p strictly between 0 and 1, the rare-tail limit ratio 4 * (1 - p) / (1 + (1 - p))^2 is strictly less than 1.

Statement

theorem rare_tail_target_limit_lt_one (p : ℝ) (hp0 : 0 < p) (hp1 : p < 1) :
    4 * (1 - p) / (1 + (1 - p)) ^ 2 < 1
Source
arXiv:2106.02330, OP-1721
Verified
15 Nov 2026
Axioms
Classical.choiceQuot.soundpropext

Read back from the Lean

For every real number $p$, if $0 < p$ and $p < 1$, then $4(1 - p) / (1 + (1 - p))^2 < 1$.

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

The proof clears the fraction by first verifying that the denominator (1 + (1 - p))^2 is strictly positive. It then reduces the goal to showing 4(1 - p) < (2 - p)^2. Since (2 - p)^2 - 4(1 - p) = p^2 and p > 0, the inequality holds strictly, which is verified by nonlinear arithmetic.

  1. The denominator (1 + (1 - p))^2 is strictly positive.

    Since p < 1, the quantity 1 - p is positive, so 1 + (1 - p) > 1 > 0. The square of a strictly positive real number is strictly positive, a fact established automatically by the `positivity` tactic.

    line 4

      have h_pos : 0 < (1 + (1 - p)) ^ 2 := by positivity
  2. It suffices to prove 4 * (1 - p) < 1 * (1 + (1 - p))^2.

    Because the denominator (1 + (1 - p))^2 was shown to be strictly positive, clearing the fraction via `div_lt_iff₀` preserves the strict inequality.

    line 5

    uses div_lt_iff₀

      rw [div_lt_iff₀ h_pos]
  3. The cleared inequality 4 * (1 - p) < 1 * (1 + (1 - p))^2 holds, completing the proof. automation

    Expanding the right-hand side yields (2 - p)^2 = 4 - 4p + p^2, while the left-hand side is 4 - 4p. Their difference is p^2, which is strictly positive since p > 0. The nonlinear arithmetic decision procedure `nlinarith`, assisted by `sq_nonneg p`, carries out the algebraic expansion and concludes the proof.

    line 6

    uses sq_nonneg

      nlinarith [sq_nonneg p]
div_lt_iff₀
A quotient b / c is strictly less than a if and only if b < a * c, provided c > 0.
sq_nonneg
The square of any real number (or element of an ordered semiring) is non-negative: a^2 ≥ 0.

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 asymptotic matching-ratio limit 4q/(1+q)^2 is strictly less than 1 for all p in (0, 1) -/theorem rare_tail_target_limit_lt_one (p : ℝ) (hp0 : 0 < p) (hp1 : p < 1) :    4 * (1 - p) / (1 + (1 - p)) ^ 2 < 1 := by  have h_pos : 0 < (1 + (1 - p)) ^ 2 := by positivity  rw [div_lt_iff₀ h_pos]  nlinarith [sq_nonneg p]
See it in the graphDiscuss this resultChallenge it