p. 17, Section 4.6, proof of the Proposition — the worst individual has fit = 1 and BF ≥ 1
ProvedVidalHGS.Elitism.worst_biasedFitness_ge_oneLet be a subpopulation with , let satisfy , and suppose the set of non-best individuals having a clone is empty. Let be an individual with the worst fitness, i.e. for all . Then
This is the first sentence of the proof of the elitism Proposition: the worst individual lies in the "removal zone" .
Formalization Note. The paper speaks of "the individual with the worst fitness". The hypothesis is the branch of the survivor-selection procedure in which this step is used; it forces the costs in 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 . The size conditions and are left implicit in the paper; they make the denominator positive and the coefficient of nonnegative. The proof calls this individual ; it is here.
import Mathlib import Definitions.Def_VidalHGS_Elitism_SurvivorSelection
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
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.