Freiman lower construction: priority finite selection
ProvedFreiman.lower_priority_finite_selectionfreimanlower-construction
Elementary finite-priority selection: replace a blocked candidate by an eligible preferred candidate. The two source branches are disjoint and preferred candidates cannot themselves be blocked on the same branch.
Preamble
import Definitions.Def_Freiman_lowerCertificates import Mathlib.Tactic.Linarith import Mathlib.Tactic.Push open Freiman
Formal statement
theorem Freiman.lower_priority_finite_selection (t : ℝ) (p : LowerPair) (hp : lowerPreferredGood p)
(h : ∃ l : LowerLabel, lowerOffered p l ∧ lowerGood (lowerChild p l) ∧ t ∈ lowerCover (lowerChild p l)) :
∃ l : LowerLabel, lowerOffered p l ∧ lowerPriority t p l ∧ lowerGood (lowerChild p l) ∧ t ∈ lowerCover (lowerChild p l) := by
sorrySource
Freiman's Hall ray: Proof report and corrected English text (8 September 2026), parts/global_selection.tex, compatible priority selection