Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

p. 17, Section 4.6, proof of the Proposition — one removal step spares an elite individual outside X

Proved
VidalHGS.Elitism.removalStep_keeps_elite

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, nbElit+1≤∣P∣\mathit{nbElit} + 1 \le |P|nbElit+1≤∣P∣, and let QQQ arise from PPP by one removal step of the survivor-selection procedure (remove an individual of maximum Biased Fitness in X(P)X(P)X(P) if X(P)≠∅X(P) \neq \emptysetX(P)=∅, otherwise in PPP). If J∈PJ \in PJ∈P, J∉X(P)J \notin X(P)J∈/X(P), and JJJ is among the nbElit\mathit{nbElit}nbElit best individuals of PPP in terms of fitness, then

J∈Q.J \in Q.J∈Q.

This is the last sentence of the proof of the elitism Proposition. When X(P)=∅X(P) = \emptysetX(P)=∅, the removed individual has Biased Fitness at least that of the worst individual, hence at least 111, while BFP(J)<1BF_P(J) < 1BFP​(J)<1. When X(P)≠∅X(P) \ne \emptysetX(P)=∅, the removed individual lies in X(P)X(P)X(P) and JJJ does not — this case is why the Proposition assumes J∉XJ \notin XJ∈/X.

Formalization Note. The paper's sentence covers the case X=∅X = \emptysetX=∅; the case X≠∅X \neq \emptysetX=∅ is part of the same step of the procedure and is included here. The condition nbElit≤∣P∣−1\mathit{nbElit} \le |P| - 1nbElit≤∣P∣−1 is the population-size condition implicit in the paper (Table 1 and Section 4.6).

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

/-- Section 4.6, p. 17, proof of the Proposition: one removal step of the survivor-selection
procedure does not remove an individual `J ∉ X` that is among the `nbElit` best in terms of
fitness, provided `nbElit ≤ nbIndiv − 1`. -/
theorem removalStep_keeps_elite {α : Type*} [DecidableEq α]
    (c : α → ℝ) (δ : α → α → ℝ) (Δ : Finset α → α → ℝ) (nbElit : ℕ) (best : α)
    (P Q : Finset α) (J : α)
    (hstep : RemovalStep c δ Δ nbElit best P Q) (hsize : nbElit + 1 ≤ P.card)
    (hJ : J ∈ P) (hJX : J ∉ cloneSet c δ best P) (helite : IsElite c nbElit P J) :
    J ∈ Q := 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 (third 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