Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

p. 17, Section 4.6, proof of the Proposition — an elite individual has BF < 1

Proved
VidalHGS.Elitism.elite_biasedFitness_lt_one

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

elitismgenetic-algorithmp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1

Let PPP be a subpopulation and nbElit∈N\mathit{nbElit} \in \mathbb{N}nbElit∈N with nbElit+1≤∣P∣\mathit{nbElit} + 1 \le |P|nbElit+1≤∣P∣. Let J∈PJ \in PJ∈P be among the nbElit\mathit{nbElit}nbElit best individuals of PPP in terms of fitness, i.e. fewer than nbElit\mathit{nbElit}nbElit members of PPP have strictly smaller cost than JJJ. Then

BFP(J)≤nbElit−1∣P∣−1+1−nbElit∣P∣−1<1.BF_P(J) \le \frac{\mathit{nbElit} - 1}{|P| - 1} + 1 - \frac{\mathit{nbElit}}{|P| - 1} < 1.BFP​(J)≤∣P∣−1nbElit−1​+1−∣P∣−1nbElit​<1.

This is the second sentence of the proof of the elitism Proposition: elite individuals lie strictly outside the removal zone BF≥1BF \ge 1BF≥1.

Formalization Note. All arithmetic is in R\mathbb{R}R. The hypotheses force nbElit≥1\mathit{nbElit} \ge 1nbElit≥1 and ∣P∣≥2|P| \ge 2∣P∣≥2, so the denominator ∣P∣−1|P| - 1∣P∣−1 is positive. The condition nbElit≤∣P∣−1\mathit{nbElit} \le |P| - 1nbElit≤∣P∣−1 is implicit in the paper (Table 1 gives nbElit=el×μ≤μ\mathit{nbElit} = el \times \mu \le \munbElit=el×μ≤μ, and the procedure acts on populations of more than μ\muμ individuals). The intermediate bound is kept in the paper's unsimplified form.

Preamble
import Mathlib
import Definitions.Def_VidalHGS_Elitism_SurvivorSelection
Formal statement
namespace VidalHGS.Elitism

/-- Section 4.6, p. 17, proof of the Proposition: an individual `J` among the `nbElit` best
in terms of fitness has
`BF(J) ≤ (nbElit − 1)/(nbIndiv − 1) + 1 − nbElit/(nbIndiv − 1) < 1`,
provided `nbElit ≤ nbIndiv − 1`. -/
theorem elite_biasedFitness_lt_one {α : Type*} [DecidableEq α]
    (c : α → ℝ) (Δ : Finset α → α → ℝ) (nbElit : ℕ) (P : Finset α) (J : α)
    (hsize : nbElit + 1 ≤ P.card) (hJ : J ∈ P) (helite : IsElite c nbElit P J) :
    biasedFitness c Δ nbElit P J ≤
        ((nbElit : ℝ) - 1) / ((P.card : ℝ) - 1) + 1 - (nbElit : ℝ) / ((P.card : ℝ) - 1) ∧
      biasedFitness c Δ nbElit P J < 1 := by sorry

end VidalHGS.Elitism
Source
Vidal, Crainic, Gendreau, Lahrichi and Rei, A Hybrid Genetic Algorithm for Multi-Depot and Periodic Vehicle Routing Problems, CIRRELT-2010-34 (July 2010), p. 17, Section 4.6, proof of the Proposition (second sentence)
Human review
  • Endorsed by Shuze Chen · Oct 7, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 7, 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