p. 17, Section 4.6, proof of the Proposition — one removal step spares an elite individual outside X
ProvedVidalHGS.Elitism.removalStep_keeps_eliteLet be a subpopulation, , and let arise from by one removal step of the survivor-selection procedure (remove an individual of maximum Biased Fitness in if , otherwise in ). If , , and is among the best individuals of in terms of fitness, then
This is the last sentence of the proof of the elitism Proposition. When , the removed individual has Biased Fitness at least that of the worst individual, hence at least , while . When , the removed individual lies in and does not — this case is why the Proposition assumes .
Formalization Note. The paper's sentence covers the case ; the case is part of the same step of the procedure and is included here. The condition is the population-size condition implicit in the paper (Table 1 and Section 4.6).
import Mathlib import Definitions.Def_VidalHGS_Elitism_SurvivorSelection
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
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.