Finite-list binary minimum fold equals the indexed infimum with fallback
ProvedAvramDividend.Classical.bv_foldr_min_eq_finite_iInf_ws01cavram-classicalcapped-clockfinite-gridlattice-orderws01c
For a complete linear order, a fold taking the binary minimum of values at finitely many natural indices and a fallback H equals the indexed infimum restricted to those list indices, infimum H. The proof is a list induction respecting repeated indices; this is the bridge between executable finite grid observation folds and declarative indexed infima.
Preamble
import Mathlib open Set open scoped ENNReal
Formal statement
theorem AvramDividend.Classical.bv_foldr_min_eq_finite_iInf_ws01c
{α : Type*} [CompleteLinearOrder α]
(v : ℕ → α) (L : List ℕ) (H : α) :
L.foldr (fun k u => v k ⊓ u) H =
(⨅ (j : ℕ) (_ : j ∈ L), v j) ⊓ H := by sorrySource
Causal repair of terminal publication job 58644f06-30c8-4a46-9104-8fbd0118bbe6: the sole error was the invalid open AvramDividend.Classical. Removed only that open; the exact formal statement and proof preserved at work/avram_ws01c_foldr_min_iInf_solution_pub_repair_20261028.lean.