BanditRLlib
Lean gate passed before this site build; local proof declarations are shown as compiled.

Lean module · ETC

BanditRLProof.Algorithms.ETCPairwiseTailContract

# ETC pairwise empirical-mean tail contract surface This module introduces the narrow contract surface needed between concrete ETC empirical means and the already compiled concrete argmax wrong-commit probability wrapper. It deliberately packages the abstract pairwise-tail hypothesis without proving any concentration theorem, adding filtration, or proving final ETC regret.

Module map

Teaching chapter
3. Explore-Then-Commit
Declarations
3
Placeholders
0

Imports

BanditRLProof.Algorithms.ETCArgmaxOracle, BanditRLProof.Algorithms.ETCEmpiricalMean

Imported by

BanditRLProof, BanditRLProof.Algorithms.ETCPairwiseSubGaussianTail

Declarations

Open an item to read its exact compact statement and source link. Detailed teaching notes are linked when registered.

structure BanditRLProof.ETC.PairwiseEmpMeanTailContract Compiled

Abstract non-best pairwise tail contract for fixed-commit ETC empirical means. This is the `ETC-PAIRWISE-TAIL-CONTRACT-SURFACE` leaf. It records exactly the `hpair_tail` shape needed by the concrete argmax filtered-sum probability wrapper after instantiating `empMean` with `ETC.empMeanAtExploration`.

structure PairwiseEmpMeanTailContract {Omega : Type u} {K : Nat} [MeasurableSpace Omega] (mu : MeasureTheory.Measure Omega) (spec : ETC.Spec K) (model : FiniteBanditModel K) (commitArm : Fin K) (reward : Omega -> RewardTrace Rat) (tail : Fin K -> ENNReal) : Prop where
theorem BanditRLProof.ETC.prob_argmaxCommitOracle_eq_arm_le_pairwise_tail_of_contract Compiled

The concrete argmax commit probability for one non-best arm is bounded by the matching arm entry of a pairwise empirical-mean tail contract. Unlike the filtered-sum consumer below, this theorem performs no finite union and keeps the candidate arm visible for a later gap-weighted expected-regret sum.

theorem prob_argmaxCommitOracle_eq_arm_le_pairwise_tail_of_contract {Omega : Type u} {K : Nat} [MeasurableSpace Omega] (hK : 0 < K) (mu : MeasureTheory.Measure Omega) (spec : ETC.Spec K) (model : FiniteBanditModel K) (commitArm : Fin K) (reward : Omega -> RewardTrace Rat) (tail : Fin K -> ENNReal) (hcontract : ETC.PairwiseEmpMeanTailContract mu spec model commitArm reward tail) (a : Fin K) (hne : a = model.bestArm -> False) : mu {omega : Omega | (ETC.argmaxCommitOracle hK).choose (fun b : Fin K => ETC.empMeanAtExploration spec commitArm (reward omega) b) = a} <= tail a
theorem BanditRLProof.ETC.prob_argmaxCommitOracle_ne_bestArm_le_filtered_sum_pairwise_tail_of_contract Compiled

The concrete argmax wrong-commit probability wrapper consumes the fixed-commit ETC empirical-mean pairwise-tail contract directly. This leaf only connects the contract surface to the compiled probability consumer. It does not prove the contract, import Hoeffding/sub-Gaussian tails, introduce filtration, or prove final ETC regret.

theorem prob_argmaxCommitOracle_ne_bestArm_le_filtered_sum_pairwise_tail_of_contract {Omega : Type u} {K : Nat} [MeasurableSpace Omega] (hK : 0 < K) (mu : MeasureTheory.Measure Omega) (spec : ETC.Spec K) (model : FiniteBanditModel K) (commitArm : Fin K) (reward : Omega -> RewardTrace Rat) (tail : Fin K -> ENNReal) (hcontract : ETC.PairwiseEmpMeanTailContract mu spec model commitArm reward tail) : mu {omega : Omega | (ETC.argmaxCommitOracle hK).choose (fun a : Fin K => ETC.empMeanAtExploration spec commitArm (reward omega) a) = model.bestArm -> False} <= ((Finset.univ : Finset (Fin K)).filter (fun a : Fin K => a = model.bestArm -> False)).sum tail