Lean module · Frontier
BanditRLProof.DelayedFeedback.StochasticGoodEvent
Generated source map for this Lean module.
Module map
Imports
BanditRLProof.DelayedFeedback.Elimination, BanditRLProof.ProbabilityUnionBound
Imported by
BanditRLProof, BanditRLProof.DelayedFeedback.StochasticGoodEventAssembly
Declarations
Open an item to read its exact compact statement and source link. Detailed teaching notes are linked when registered.
structure
BanditRLProof.DelayedFeedback.DelayedSAPOSourceConfidenceSnapshot
Compiled
The two armwise upper-confidence surfaces entering the source definition of `ucbStar`. The recursive construction of those surfaces from a processed history remains outside this snapshot.
structure DelayedSAPOSourceConfidenceSnapshot (K : Nat) extends DelayedSAPOEliminationSnapshot K where
def
BanditRLProof.DelayedFeedback.DelayedSAPOSourceConfidenceSnapshot.sourceUcbStar
Compiled
Source-shaped projection of `ucbStar(S) = min_i {ucb_i(S), overline-ucb_i(S)}`.
noncomputable def sourceUcbStar {K : Nat} [Nonempty (Fin K)] (snapshot : DelayedSAPOSourceConfidenceSnapshot K) : ℝ
structure
BanditRLProof.DelayedFeedback.DelayedSAPOSourceConfidenceSnapshot.EliminationGoodEvent
Compiled
The elimination-relevant projection of the stochastic good event in Definition D.1. It records both empirical-mean confidence and the two upper confidence surfaces used by `ucbStar`. Count/phase/error/delay clauses from the full source event are deliberately not included here.
structure EliminationGoodEvent {K : Nat} [Nonempty (Fin K)] (snapshot : DelayedSAPOSourceConfidenceSnapshot K) (mean : Fin K → ℝ) : Prop where
theorem
BanditRLProof.DelayedFeedback.DelayedSAPOSourceConfidenceSnapshot.optimalMean_le_ucbStar_of_eliminationGoodEvent
Compiled
On the source-shaped elimination good event, the best loss mean is below the exact minimum of both armwise upper-confidence surfaces.
theorem optimalMean_le_ucbStar_of_eliminationGoodEvent {K : Nat} [Nonempty (Fin K)] (snapshot : DelayedSAPOSourceConfidenceSnapshot K) (mean : Fin K → ℝ) (optimal : Fin K) (hoptimal : ∀ i, mean optimal ≤ mean i) (hgood : EliminationGoodEvent snapshot mean) : mean optimal ≤ snapshot.ucbStar
theorem
BanditRLProof.DelayedFeedback.DelayedSAPOSourceConfidenceSnapshot.optimalArmSurvivalCertificate_of_eliminationGoodEvent
Compiled
The source-shaped elimination projection constructs the exact certificate consumed by the deterministic core of Lemma D.9; no independent `mean optimal <= ucbStar` premise remains.
theorem optimalArmSurvivalCertificate_of_eliminationGoodEvent {K : Nat} [Nonempty (Fin K)] (snapshot : DelayedSAPOSourceConfidenceSnapshot K) (mean : Fin K → ℝ) (optimal : Fin K) (hoptimal : ∀ i, mean optimal ≤ mean i) (hactive : optimal ∈ snapshot.active) (hgood : EliminationGoodEvent snapshot mean) : DelayedSAPOEliminationSnapshot.OptimalArmSurvivalCertificate snapshot.toDelayedSAPOEliminationSnapshot mean optimal where
theorem
BanditRLProof.DelayedFeedback.DelayedSAPOSourceConfidenceSnapshot.optimal_mem_remainingActive_of_eliminationGoodEvent
Compiled
Source Lemma D.9 at one elimination snapshot, conditional only on the elimination projection of Definition D.1 and current activity of the optimal arm. Establishing the full good-event probability and persistence over the recursive state machine remain separate obligations.
theorem optimal_mem_remainingActive_of_eliminationGoodEvent {K : Nat} [Nonempty (Fin K)] (snapshot : DelayedSAPOSourceConfidenceSnapshot K) (mean : Fin K → ℝ) (optimal : Fin K) (hoptimal : ∀ i, mean optimal ≤ mean i) (hactive : optimal ∈ snapshot.active) (hgood : EliminationGoodEvent snapshot mean) : optimal ∈ snapshot.remainingActive
def
BanditRLProof.DelayedFeedback.DelayedSAPOSourceConfidenceSnapshot.eliminationGoodEventSet
Compiled
Random-state event on which the elimination projection of Definition D.1 holds.
def eliminationGoodEventSet {Ω : Type*} {K : Nat} [Nonempty (Fin K)] (snapshot : Ω → DelayedSAPOSourceConfidenceSnapshot K) (mean : Fin K → ℝ) : Set Ω
def
BanditRLProof.DelayedFeedback.DelayedSAPOSourceConfidenceSnapshot.optimalSurvivalEventSet
Compiled
Event that the optimal arm survives the current elimination update.
def optimalSurvivalEventSet {Ω : Type*} {K : Nat} (snapshot : Ω → DelayedSAPOSourceConfidenceSnapshot K) (optimal : Fin K) : Set Ω
theorem
BanditRLProof.DelayedFeedback.DelayedSAPOSourceConfidenceSnapshot.eliminationGoodEventSet_subset_optimalSurvivalEventSet
Compiled
The elimination good event is contained in the optimal-arm survival event when the optimal arm is active in every input snapshot.
theorem eliminationGoodEventSet_subset_optimalSurvivalEventSet {Ω : Type*} {K : Nat} [Nonempty (Fin K)] (snapshot : Ω → DelayedSAPOSourceConfidenceSnapshot K) (mean : Fin K → ℝ) (optimal : Fin K) (hoptimal : ∀ i, mean optimal ≤ mean i) (hactive : ∀ ω, optimal ∈ (snapshot ω).active) : eliminationGoodEventSet snapshot mean ⊆ optimalSurvivalEventSet snapshot optimal
theorem
BanditRLProof.DelayedFeedback.DelayedSAPOSourceConfidenceSnapshot.measure_optimalSurvivalEventSet_compl_le
Compiled
Any tail bound for the complement of the source-shaped good event immediately controls the probability that the optimal arm is eliminated.
theorem measure_optimalSurvivalEventSet_compl_le {Ω : Type*} [MeasurableSpace Ω] {K : Nat} [Nonempty (Fin K)] (mu : Measure Ω) (snapshot : Ω → DelayedSAPOSourceConfidenceSnapshot K) (mean : Fin K → ℝ) (optimal : Fin K) (hoptimal : ∀ i, mean optimal ≤ mean i) (hactive : ∀ ω, optimal ∈ (snapshot ω).active) : mu (optimalSurvivalEventSet snapshot optimal)ᶜ ≤ mu (eliminationGoodEventSet snapshot mean)ᶜ
theorem
BanditRLProof.DelayedFeedback.DelayedSAPOSourceConfidenceSnapshot.measure_optimalSurvivalEventSet_compl_le_of_goodEvent
Compiled
Failure-budget consumer for the D.9 projection. The hypothesis must be discharged by the D.2--D.7 concentration/counting development and the Corollary-D.8 union assembly; this theorem does not manufacture that probability estimate.
theorem measure_optimalSurvivalEventSet_compl_le_of_goodEvent {Ω : Type*} [MeasurableSpace Ω] {K : Nat} [Nonempty (Fin K)] (mu : Measure Ω) (snapshot : Ω → DelayedSAPOSourceConfidenceSnapshot K) (mean : Fin K → ℝ) (optimal : Fin K) (delta : ℝ) (hoptimal : ∀ i, mean optimal ≤ mean i) (hactive : ∀ ω, optimal ∈ (snapshot ω).active) (hgoodProbability : mu (eliminationGoodEventSet snapshot mean)ᶜ ≤ ENNReal.ofReal delta) : mu (optimalSurvivalEventSet snapshot optimal)ᶜ ≤ ENNReal.ofReal delta