(16), Sect. 5.1.1, p. 14 — ℙᴺ{A} = ∫_(ε(k),1] (1−v)^(N−k) dF_k(v)
ProvedWaitJudge.Convex.prob_A_eq_integralLet be a probability measure, let Assumptions 1 and 2 and the measurability conditions hold, and fix and a threshold . For the event $$A={V(x^_N)>\epsilon(k)\ \wedge\ s^_N=k\ \wedge\ \text{the first constraints are of support}}
\mathbb P^N{A}=\int_{(\epsilon(k),1]}(1-v)^{N-k},\mathrm dF_k(v),$$ where is the generalized distribution function (12).
Given , the probability that the other independent constraints are all satisfied by is ; combined with almost surely, this gives the formula.
Formalization Note is the (non-normalised) finite measure on whose distribution function is , and the integral is the Lebesgue integral over against it. The probability is an extended nonnegative real, compared with the real integral through .
import Mathlib import Definitions.Def_ScenarioApproach_Generalization_violation import Definitions.Def_WaitJudge_Convex_Setting open MeasureTheory ScenarioApproach.Generalization
namespace WaitJudge.Convex
theorem prob_A_eq_integral {d p : ℕ} {Δ : Type*} [MeasurableSpace Δ] (P : Measure Δ) [IsProbabilityMeasure P]
(c : E d) (X : Set (E d)) (Xδ : Δ → Set (E d)) (tb : Fin p → E d → ℝ)
(hA1 : Assumption1 c X Xδ tb) (hA2 : Assumption2 c X Xδ tb P)
(hmeas : MeasurabilityPins c X Xδ tb)
(ε : ℕ → ℝ) (N k : ℕ) (hk : k ≤ N) :
(Measure.pi fun _ : Fin N => P) {ω | ε k < violation P Xδ (xstar c X Xδ tb ω) ∧ sstar c X Xδ tb ω = k ∧
∀ i : Fin N, i.val < k → i ∈ supportSet c X Xδ tb ω} =
ENNReal.ofReal (∫ v in Set.Ioc (ε k) 1, (1 - v) ^ (N - k) ∂(Fk P c X Xδ tb k)) := by sorry
end WaitJudge.Convex
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.