Freiman lower construction: dependent path
ProvedFreiman.lower_dependent_pathfreimanlower-construction
Dependent choice over finite histories: terminate at an explicit limiting model or choose forever, preserving the source, physical words, same target, goodness, parameter domain, and the two priorities.
Preamble
import Definitions.Def_Freiman_lowerCertificates import Mathlib.Tactic.Linarith import Mathlib.Tactic.Push open Freiman
Formal statement
theorem Freiman.lower_dependent_path (step : ∀ (t : ℝ) (h : ℕ → LowerPair) (n : ℕ), lowerHistory t h n →
lowerHasValue t ∨ ∃ l : LowerLabel, lowerOffered (h n) l ∧ lowerPriority t (h n) l ∧ lowerState t (lowerChild (h n) l))
(t : ℝ) (p : LowerPair) (hr : lowerInitialRoot t p) (hs : lowerState t p) :
lowerHasValue t ∨ ∃ h : ℕ → LowerPair, lowerPath t h := by
sorrySource
Freiman's Hall ray: Proof report and corrected English text (8 September 2026), parts/global_selection.tex, inductive target selection