Measurability of the finite arrival-time selection cylinder
ProvedAvramDividend.Classical.chat06_positive_count_finite_prefix_measurableavram-dividendchat06lean4renewal
The condition that a clock time lies between two successive cumulative waiting-time sums is a measurable event of the finite vector of waits.
Preamble
import Mathlib.MeasureTheory.Constructions.Pi
import Mathlib.MeasureTheory.MeasurableSpace.Constructions
import Mathlib.Data.Fin.Basic
open MeasureTheory Set
namespace AvramChat06
def padWaitPrefix (n : ℕ) (g : Fin (n + 2) → ℝ) (i : ℕ) : ℝ :=
if h : i < n + 2 then g ⟨i, h⟩ else 0
def positiveCountPrefixEvent (n : ℕ) (t : ℝ) :
Set (Fin (n + 2) → ℝ) :=
{g | (∑ j ∈ Finset.range (n + 1), padWaitPrefix n g j) ≤ t ∧
t < ∑ j ∈ Finset.range (n + 2), padWaitPrefix n g j}
end AvramChat06
open AvramChat06Formal statement
theorem AvramDividend.Classical.chat06_positive_count_finite_prefix_measurable (n : ℕ) (t : ℝ) :
MeasurableSet (positiveCountPrefixEvent n t) := by sorrySource
Verified source complete private candidate at pinned Mathlib revision; source and remote job recorded in Chat 06 SUBMISSIONS.json. Preamble defines the local arrival/prefix functions used by exact statement.