Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 4.2, p. 10 (corrected: ℓ_n(a x_1) for ℓ_n(x_1), and x_n ≤ 1/(4a) non-strict) — the recursion decreases and (1/a)ℓ_n(ax_1) ≤ x_n < 1/(a(n − 1 + 1/x_1))

Proved
RecMarkovGraph.IndepLB.lemma_4_2

by mikedeng1 · Oct 24, 2026 · Mathlib 0df444a (Lean v4.33.1)

asymptoticsp2o-batch-pfp2ap2o-correctedp2o-gran-per-chapterp2o-plan-paperp2o-v1recursion

Let a∈(0,1]a\in(0,1]a∈(0,1], x1∈(0,1)x_1\in(0,1)x1​∈(0,1) and xn+1=fa(xn)=xn(1−axn)x_{n+1}=f_a(x_n)=x_n(1-ax_n)xn+1​=fa​(xn​)=xn​(1−axn​). Then the sequence is strictly decreasing, xn+1<xnx_{n+1}<x_nxn+1​<xn​ for all n≥1n\ge1n≥1, and for every n≥2n\ge2n≥2

1a ℓn(ax1) ≤ xn,xn≤14a,xn<1a⋅1n−1+1/x1,\frac1a\,\ell_n(a x_1)\ \le\ x_n,\qquad x_n\le\frac1{4a},\qquad x_n<\frac1a\cdot\frac{1}{n-1+1/x_1},a1​ℓn​(ax1​) ≤ xn​,xn​≤4a1​,xn​<a1​⋅n−1+1/x1​1​,

where ℓn\ell_nℓn​ is the function of display (4).

The terms of the recursion are thus of order 1/n1/n1/n; through Lemma 3.1 these bounds become the bounds of Lemma 6.1 on the edge probabilities of Gn,prG^r_{n,p}Gn,pr​.

Differences from the source:

  • correction: lower bound (1/a) ℓ_n(x_1) ⩽ x_n → ell n (a * x₁) / a ≤ x_n, i.e. (1/a) ℓ_n(a x_1); reason: the printed bound is false for a < 1: a = 0.2, x_1 = 0.01, n = 2 gives x_2 = 0.00998 < (1/a) ℓ_2(x_1) = 0.02475; the proof reduces to a = 1 through y_n = a x_n, which yields ℓ_n(a x_1), the form Lemma 6.1 uses (ℓ_j(γp)/γ)
  • correction: x_n < (1/a) min{1/4, ·}, strict in the 1/4 term → x_n ≤ 1/(4a) (non-strict) together with the strict x_n < (1/a)/(n − 1 + 1/x_1); reason: a = 1, x_1 = 1/2, n = 2 gives x_2 = 1/4 = 1/(4a)
  • reading: "generates a decreasing sequence" → recSeq a x₁ (k+1) < recSeq a x₁ k for all k; reason: strictly decreasing, the stronger reading; true since x_n > 0
  • encoding: x_n, n ≥ 1; x < min{A, B} → recSeq a x₁ (n − 1); the minimum split into the two bounds; reason: 0-based sequence index; x < min{A, B} is x < A ∧ x < B
Preamble
import Mathlib
import Definitions.Def_RecMarkovGraph_IndepLB_Model
Formal statement
namespace RecMarkovGraph.IndepLB

theorem lemma_4_2 (a x₁ : ℝ) (ha : 0 < a) (ha1 : a ≤ 1) (hx₁ : 0 < x₁) (hx₁1 : x₁ < 1) :
    (∀ k : ℕ, recSeq a x₁ (k + 1) < recSeq a x₁ k) ∧
    ∀ n : ℕ, 2 ≤ n →
      ell n (a * x₁) / a ≤ recSeq a x₁ (n - 1) ∧
      recSeq a x₁ (n - 1) ≤ 1 / (4 * a) ∧
      recSeq a x₁ (n - 1) < 1 / a * (1 / ((n : ℝ) - 1 + 1 / x₁)) := by sorry

end RecMarkovGraph.IndepLB
Source
Gupte, Zhu, Large independent sets in recursive Markov random graphs, arXiv:2207.04514v4, p. 10, Lemma 4.2 and (4) (proof in §9, pp. 22–23)
Human review
  • Endorsed by Shuze Chen · Oct 24, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 24, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me