Lean module · Frontier
BanditRLProof.Algorithms.StochasticGradientBanditTheoremTwoLatentReward
Appendix C of Baudry--Johnson--Vary--Pike-Burke--Rebeschini treats the rewards collected from the optimal arm in pull order. This module exposes the safe part of that reindexing through the existing latent arm-stream coupling.
Module map
Imports
BanditRLProof.Algorithms.StochasticGradientBanditTheoremTwoNthPull, BanditRLProof.Algorithms.ThompsonStationaryReward, BanditRLProof.Algorithms.UCBArmStreamConditionalReward
Imported by
BanditRLProof, BanditRLProof.Algorithms.StochasticGradientBanditTheoremTwoNativeTrajectory
Declarations
Open an item to read its exact compact statement and source link. Detailed teaching notes are linked when registered.
theorem
BanditRLProof.UCB.armStreamMeasure_map_fixedArmFinitePrefix_eq_pi
Compiled
A fixed arm's first `m` latent rewards have the finite IID product law.
Used in these reading views: Bandit Book
10. Automation, resources, and open routes
Canonical node identity
declaration:BanditRLProof.UCB.armStreamMeasure_map_fixedArmFinitePrefix_eq_piReading membership is not a proof dependency. Exact assumptions remain in the Lean statement.
theorem armStreamMeasure_map_fixedArmFinitePrefix_eq_pi {K m : Nat} (nu : Kernel (Fin K) Real) [IsMarkovKernel nu] (arm : Fin K) : Measure.map (fun stream : ArmRewardStream K => fun i : Fin m => stream (i : Nat) arm) (armStreamMeasure nu) = Measure.pi (fun _ : Fin m => nu arm)
theorem
BanditRLProof.Thompson.latentArmStreamTrajectoryMeasure_map_fixedArmFinitePrefix_eq_pi
Compiled
The fixed-arm product law lifted through the exact stream marginal of the latent trajectory coupling.
Used in these reading views: Bandit Book
10. Automation, resources, and open routes
Canonical node identity
declaration:BanditRLProof.Thompson.latentArmStreamTrajectoryMeasure_map_fixedArmFinitePrefix_eq_piReading membership is not a proof dependency. Exact assumptions remain in the Lean statement.
theorem latentArmStreamTrajectoryMeasure_map_fixedArmFinitePrefix_eq_pi {Env : Type u} {K m : Nat} [MeasurableSpace Env] [NeZero K] (algorithm : HistoryAlgorithm (Fin K) Real) (env : Env) (nu : Kernel (Fin K) Real) [IsMarkovKernel nu] (arm : Fin K) : Measure.map (fun sample : UCB.ArmRewardStream K × ((n : Nat) -> Fin K × Real) => fun i : Fin m => sample.1 (i : Nat) arm) (latentArmStreamTrajectoryMeasure algorithm env nu) = Measure.pi (fun _ : Fin m => nu arm)
def
BanditRLProof.StochasticGradientBandit.twoArmFixedIIDLatentTrajectoryMeasure
Compiled
The latent-stream coupling specialized to the zero-initialized two-arm SGB policy and the fixed arm laws used by the source instance.
Used in these reading views: Bandit Book
10. Automation, resources, and open routes
Canonical node identity
declaration:BanditRLProof.StochasticGradientBandit.twoArmFixedIIDLatentTrajectoryMeasureReading membership is not a proof dependency. Exact assumptions remain in the Lean statement.
noncomputable def twoArmFixedIIDLatentTrajectoryMeasure (armLaw : Fin 2 -> Measure Real) (hprob : forall arm, IsProbabilityMeasure (armLaw arm)) (eta : Real) : Measure (UCB.ArmRewardStream 2 × ((n : Nat) -> Fin 2 × Real))
theorem
BanditRLProof.StochasticGradientBandit.twoArmTrajectoryMeasure_dirac_eq_map_trajectoryKernel
Compiled
The native `Unit`-environment law is its trajectory kernel with the trivial environment coordinate reattached. This is normalization for the still-open latent-to-native trajectory adapter.
Used in these reading views: Bandit Book
10. Automation, resources, and open routes
Canonical node identity
declaration:BanditRLProof.StochasticGradientBandit.twoArmTrajectoryMeasure_dirac_eq_map_trajectoryKernelReading membership is not a proof dependency. Exact assumptions remain in the Lean statement.
theorem twoArmTrajectoryMeasure_dirac_eq_map_trajectoryKernel (armLaw : Fin 2 -> Measure Real) (hprob : forall arm, IsProbabilityMeasure (armLaw arm)) (eta : Real) : twoArmTrajectoryMeasure (Measure.dirac ()) eta (twoArmFixedIIDEnvironment armLaw hprob) = Measure.map (Prod.mk ()) (trajectoryKernel (fun _ : Fin 2 => 0) eta (twoArmFixedIIDEnvironment armLaw hprob) ())
theorem
BanditRLProof.StochasticGradientBandit.stationaryRewardKernelAt_twoArmFixedIIDRewardKernel_eq
Compiled
Freezing the direct fixed-IID reward kernel at `Unit` gives the same finite-arm kernel used by the latent-stream construction.
Used in these reading views: Bandit Book
10. Automation, resources, and open routes
Canonical node identity
declaration:BanditRLProof.StochasticGradientBandit.stationaryRewardKernelAt_twoArmFixedIIDRewardKernel_eqReading membership is not a proof dependency. Exact assumptions remain in the Lean statement.
theorem stationaryRewardKernelAt_twoArmFixedIIDRewardKernel_eq (armLaw : Fin 2 -> Measure Real) (hprob : forall arm, IsProbabilityMeasure (armLaw arm)) : letI : IsMarkovKernel (twoArmFixedIIDRewardKernel armLaw)
theorem
BanditRLProof.StochasticGradientBandit.twoArmFixedIIDLatentTrajectoryMeasure_map_optimalPrefix_eq_pi
Compiled
On the specialized coupling, the first `m` latent optimal-arm rewards have exactly the product of the source arm law.
Used in these reading views: Bandit Book
10. Automation, resources, and open routes
Canonical node identity
declaration:BanditRLProof.StochasticGradientBandit.twoArmFixedIIDLatentTrajectoryMeasure_map_optimalPrefix_eq_piReading membership is not a proof dependency. Exact assumptions remain in the Lean statement.
theorem twoArmFixedIIDLatentTrajectoryMeasure_map_optimalPrefix_eq_pi (armLaw : Fin 2 -> Measure Real) (hprob : forall arm, IsProbabilityMeasure (armLaw arm)) (eta : Real) (m : Nat) : Measure.map (fun sample : UCB.ArmRewardStream 2 × ((n : Nat) -> Fin 2 × Real) => fun i : Fin m => sample.1 (i : Nat) 0) (twoArmFixedIIDLatentTrajectoryMeasure armLaw hprob eta) = Measure.pi (fun _ : Fin m => armLaw 0)
theorem
BanditRLProof.StochasticGradientBandit.twoArmNthOptimalPullReward_eq_latentCoordinate_ae
Compiled
At every finite nth optimal-arm pull, the observed stopped reward is the corresponding latent arm-`0` coordinate almost surely. This is pathwise support, not an IID statement about totalized or occurrence-conditioned stopped rewards.
Used in these reading views: Bandit Book
10. Automation, resources, and open routes
Canonical node identity
declaration:BanditRLProof.StochasticGradientBandit.twoArmNthOptimalPullReward_eq_latentCoordinate_aeReading membership is not a proof dependency. Exact assumptions remain in the Lean statement.
theorem twoArmNthOptimalPullReward_eq_latentCoordinate_ae (armLaw : Fin 2 -> Measure Real) (hprob : forall arm, IsProbabilityMeasure (armLaw arm)) (eta : Real) (pullIndex : Nat) : ∀ᵐ sample ∂twoArmFixedIIDLatentTrajectoryMeasure armLaw hprob eta, ∀ t : Nat, twoArmNthOptimalPullTime (Env := Unit) pullIndex ((), sample.2) = (t : WithTop Nat) -> twoArmNthOptimalPullReward (Env := Unit) pullIndex ((), sample.2) = sample.1 pullIndex 0