Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

p. 17, Section 4.6, proof of the Proposition — the worst individual has fit = 1 and BF ≥ 1

Proved
VidalHGS.Elitism.worst_biasedFitness_ge_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 with ∣P∣≥2|P| \ge 2∣P∣≥2, let nbElit\mathit{nbElit}nbElit satisfy nbElit+1≤∣P∣\mathit{nbElit} + 1 \le |P|nbElit+1≤∣P∣, and suppose the set X(P)X(P)X(P) of non-best individuals having a clone is empty. Let W∈PW \in PW∈P be an individual with the worst fitness, i.e. c(K)≤c(W)c(K) \le c(W)c(K)≤c(W) for all K∈PK \in PK∈P. Then

fitP(W)=1andBFP(W)=fitP(W)+(1−nbElit∣P∣−1)×dcP(W)≥1.\mathit{fit}_P(W) = 1 \qquad\text{and}\qquad BF_P(W) = \mathit{fit}_P(W) + \Bigl(1 - \frac{\mathit{nbElit}}{|P| - 1}\Bigr) \times \mathit{dc}_P(W) \ge 1.fitP​(W)=1andBFP​(W)=fitP​(W)+(1−∣P∣−1nbElit​)×dcP​(W)≥1.

This is the first sentence of the proof of the elitism Proposition: the worst individual lies in the "removal zone" BF≥1BF \ge 1BF≥1.

Formalization Note. The paper speaks of "the individual with the worst fitness". The hypothesis X(P)=∅X(P) = \emptysetX(P)=∅ is the branch of the survivor-selection procedure in which this step is used; it forces the costs in PPP to be pairwise distinct (two individuals of equal cost are clones, and at most one of them is the best solution), so the worst individual is unique and its rank is exactly 111. The size conditions ∣P∣≥2|P| \ge 2∣P∣≥2 and nbElit≤∣P∣−1\mathit{nbElit} \le |P| - 1nbElit≤∣P∣−1 are left implicit in the paper; they make the denominator positive and the coefficient of dc\mathit{dc}dc nonnegative. The proof calls this individual III; it is WWW here.

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

/-- Section 4.6, p. 17, proof of the Proposition: when `X = ∅` (so that costs in `P` are
pairwise distinct), the individual `W` with the worst fitness has `fit(W) = 1` and
`BF(W) ≥ 1`, provided `nbElit ≤ nbIndiv − 1` and `nbIndiv ≥ 2`. -/
theorem worst_biasedFitness_ge_one {α : Type*} [DecidableEq α]
    (c : α → ℝ) (δ : α → α → ℝ) (Δ : Finset α → α → ℝ) (nbElit : ℕ) (best : α)
    (P : Finset α) (W : α)
    (hX : cloneSet c δ best P = ∅) (hcard : 2 ≤ P.card) (hsize : nbElit + 1 ≤ P.card)
    (hW : W ∈ P) (hworst : ∀ K ∈ P, c K ≤ c W) :
    fitRank c P W = 1 ∧ 1 ≤ biasedFitness c Δ nbElit P W := 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 (first 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