Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 4.1, p. 9 — f_a(x) = x(1 − ax) is concave, unimodal with maximum 1/(4a), has no nonzero fixed point and f_a(x) < x

Proved
RecMarkovGraph.IndepLB.lemma_4_1

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

concave-functionp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-strengthenedp2o-v1recursion

Let a∈(0,1]a\in(0,1]a∈(0,1] and fa(x)=x(1−ax)f_a(x)=x(1-ax)fa​(x)=x(1−ax). Then faf_afa​ is concave on R\mathbb RR and:

  1. faf_afa​ is strictly increasing on (−∞,12a](-\infty,\tfrac1{2a}](−∞,2a1​] and strictly decreasing on (12a,∞)(\tfrac1{2a},\infty)(2a1​,∞);
  2. fa(x)≤14af_a(x)\le \tfrac1{4a}fa​(x)≤4a1​ for all xxx, with equality at x=12ax=\tfrac1{2a}x=2a1​;
  3. fa(x)=xf_a(x)=xfa​(x)=x only for x=0x=0x=0;
  4. fa(x)∈(0,1)f_a(x)\in(0,1)fa​(x)∈(0,1) for x∈(0,1)x\in(0,1)x∈(0,1);
  5. fa(x)<xf_a(x)<xfa​(x)<x for x≠0x\ne0x=0;
  6. a fa(x)=f1(ax)a\,f_a(x)=f_1(ax)afa​(x)=f1​(ax) for all xxx;
  7. fa(x)<fb(x)f_a(x)<f_b(x)fa​(x)<fb​(x) for every x>0x>0x>0 and every real b<ab<ab<a.

These elementary facts drive the analysis of the recursion xn+1=fa(xn)x_{n+1}=f_a(x_n)xn+1​=fa​(xn​), which governs the edge probabilities of Gn,prG^r_{n,p}Gn,pr​ (with a=γa=\gammaa=γ).

Differences from the source:

  • reading: "is increasing on (−∞, 1/(2a)] and decreasing on (1/(2a), ∞)" → StrictMonoOn on Iic (1/(2a)) and StrictAntiOn on Ioi (1/(2a)); reason: the stronger of the two readings, true for a > 0
  • encoding: "has a maximum value of 1/(4a)" → f_a(x) ≤ 1/(4a) for all x and f_a(1/(2a)) = 1/(4a); reason: the definition of a maximum value
  • generalization: item 7 for a > b, with b a parameter of (3), i.e. b ∈ (0, 1] → every real b < a; reason: the inequality −a x² < −b x² holds for every real b < a; it specializes to b ∈ (0, 1]
Preamble
import Mathlib
import Definitions.Def_RecMarkovGraph_IndepLB_Model
Formal statement
namespace RecMarkovGraph.IndepLB

open Set

theorem lemma_4_1 (a : ℝ) (ha : 0 < a) (ha1 : a ≤ 1) :
    ConcaveOn ℝ univ (fa a) ∧
    (StrictMonoOn (fa a) (Iic (1 / (2 * a))) ∧ StrictAntiOn (fa a) (Ioi (1 / (2 * a)))) ∧
    ((∀ x, fa a x ≤ 1 / (4 * a)) ∧ fa a (1 / (2 * a)) = 1 / (4 * a)) ∧
    (∀ x, fa a x = x → x = 0) ∧
    (∀ x ∈ Ioo (0 : ℝ) 1, fa a x ∈ Ioo (0 : ℝ) 1) ∧
    (∀ x, x ≠ 0 → fa a x < x) ∧
    (∀ x, a * fa a x = fa 1 (a * x)) ∧
    (∀ b x : ℝ, b < a → 0 < x → fa a x < fa b x) := by sorry

end RecMarkovGraph.IndepLB
Source
Gupte, Zhu, Large independent sets in recursive Markov random graphs, arXiv:2207.04514v4, p. 9, Lemma 4.1 (proof in §9, p. 22); context (3), p. 9
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