A capped complete infimum is determined by its finite prefix when its tail exceeds the cap
ProvedAvramDividend.Classical.bv_capped_iInf_finite_prefix_ws01cavram-classicalcapped-clockfinite-gridlattice-orderws01c
In any complete linear order, if every indexed value after M is at least the cap T, the global indexed infimum capped at T equals the finite indexed prefix infimum through M capped at T. The proof compares both infima by the universal order properties and splits each index at M.
Preamble
import Mathlib open Filter Set Order open scoped NNReal ENNReal
Formal statement
theorem AvramDividend.Classical.bv_capped_iInf_finite_prefix_ws01c
{α : Type*} [CompleteLinearOrder α]
(v : ℕ → α) (T : α) (M : ℕ)
(hTail : ∀ k : ℕ, M < k → T ≤ v k) :
(⨅ k : ℕ, v k) ⊓ T =
(⨅ (k : ℕ) (_ : k ≤ M), v k) ⊓ T := by sorrySource
Causal repair of terminal publication job 6ac0cf4b-6db7-4100-8617-d8908fb0991a: the sole error was the invalid open AvramDividend.Classical. Removed only that open; the exact formal statement and proof preserved at work/avram_ws01c_capped_iInf_prefix_solution_pub_repair_20261028.lean.