Documentation

Determinize.Proof.FiniteModel.MeasureLaws

noncomputable def Determinize.Proof.FiniteModel.weightedOutput {α : Type} (outcomes : List (ℚ × α)) (continuation : α → MeasureTheory.Measure ℝ) :
Equations
Instances For
    theorem Determinize.Proof.FiniteModel.outcomeMeasure_bind (outcomes : List (ℚ × ℚ)) (continuation : ℝ → MeasureTheory.Measure ℝ) (measurable : Measurable continuation) :
    (outcomeMeasure outcomes).bind continuation = weightedOutput outcomes fun (q : ℚ) => continuation ↑q
    theorem Determinize.Proof.FiniteModel.outcomeMeasure_ae (outcomes : List (ℚ × ℚ)) (predicate : ℝ → Prop) :
    (∀ᵐ (x : ℝ) ∂outcomeMeasure outcomes, predicate x) ↔ ∀ entry ∈ outcomes, 0 < entry.1 → predicate ↑entry.2
    theorem Determinize.Proof.FiniteModel.weightedOutput_mono {α : Type} (outcomes : List (ℚ × α)) (left right : α → MeasureTheory.Measure ℝ) (bound : ∀ entry ∈ outcomes, 0 < entry.1 → left entry.2 ≤ right entry.2) :
    weightedOutput outcomes left ≤ weightedOutput outcomes right
    theorem Determinize.Proof.FiniteModel.weightedOutput_uniform_bound {α : Type} (outcomes : List (ℚ × α)) (left : α → MeasureTheory.Measure ℝ) (right : ℕ → α → MeasureTheory.Measure ℝ) (mono : ∀ (state : α), Monotone fun (fuel : ℕ) => right fuel state) (bound : ∀ entry ∈ outcomes, 0 < entry.1 → ∃ (fuel : ℕ), left entry.2 ≤ right fuel entry.2) :
    ∃ (fuel : ℕ), weightedOutput outcomes left ≤ weightedOutput outcomes (right fuel)