Lean module · Finite-horizon RL
BanditRLProof.RL.FiniteHorizonAdaptiveStochasticRewardSampledEmpiricalOptimisticSource
This module constructs a genuinely sampled-reward adaptive optimistic source. The successor table is computed from the latest complete stochastic batch, including its observed rewards, rather than from the known-mean projection.
Module map
Imports
BanditRLProof.RL.FiniteHorizonAdaptiveStochasticRewardEmpiricalOptimisticProjection, BanditRLProof.RL.FiniteHorizonStochasticRewardIIDAllCoordinateEmpiricalModelConfidence
Imported by
BanditRLProof, BanditRLProof.RL.FiniteHorizonAdaptiveStochasticRewardSampledEmpiricalOptimisticConfidence
Declarations
Open an item to read its exact compact statement and source link. Detailed teaching notes are linked when registered.
theorem
BanditRLProof.FiniteHorizonRL.EpisodeBatch.measurable_rewardSum
Compiled
A fixed sampled-reward sum is measurable on raw episode batches.
Used in these reading views: Bandit Book · Reinforcement Learning Book
9. Finite-horizon reinforcement learning
Canonical node identity
declaration:BanditRLProof.FiniteHorizonRL.EpisodeBatch.measurable_rewardSumReading membership is not a proof dependency. Exact assumptions remain in the Lean statement.
theorem measurable_rewardSum {mdp : MDP State Action} {episodes : Nat} (stage : Fin mdp.horizon) (state : State) (action : Action) : Measurable fun batch : EpisodeBatch mdp episodes => batch.rewardSum stage state action
theorem
BanditRLProof.FiniteHorizonRL.EpisodeBatch.measurable_empiricalReward
Compiled
A fixed empirical sampled-reward mean is measurable on raw batches.
Used in these reading views: Bandit Book · Reinforcement Learning Book
9. Finite-horizon reinforcement learning
Canonical node identity
declaration:BanditRLProof.FiniteHorizonRL.EpisodeBatch.measurable_empiricalRewardReading membership is not a proof dependency. Exact assumptions remain in the Lean statement.
theorem measurable_empiricalReward {mdp : MDP State Action} {episodes : Nat} (stage : Fin mdp.horizon) (state : State) (action : Action) : Measurable fun batch : EpisodeBatch mdp episodes => batch.empiricalReward stage state action
def
BanditRLProof.FiniteHorizonRL.TransitionCountSummary.stateKernel
Compiled
A fixed empirical next-state law as a kernel in the count summary.
Used in these reading views: Bandit Book · Reinforcement Learning Book
9. Finite-horizon reinforcement learning
Canonical node identity
declaration:BanditRLProof.FiniteHorizonRL.TransitionCountSummary.stateKernelReading membership is not a proof dependency. Exact assumptions remain in the Lean statement.
noncomputable def stateKernel {mdp : MDP State Action} (defaultState : State) (stage : Fin mdp.horizon) (state : State) (action : Action) : ProbabilityTheory.Kernel (TransitionCountSummary mdp) State
def
BanditRLProof.FiniteHorizonRL.EpisodeBatch.empiricalTransitionStateKernel
Compiled
The raw-batch empirical next-state law as a Markov kernel in the batch.
Used in these reading views: Bandit Book · Reinforcement Learning Book
9. Finite-horizon reinforcement learning
Canonical node identity
declaration:BanditRLProof.FiniteHorizonRL.EpisodeBatch.empiricalTransitionStateKernelReading membership is not a proof dependency. Exact assumptions remain in the Lean statement.
noncomputable def empiricalTransitionStateKernel {mdp : MDP State Action} {episodes : Nat} (defaultState : State) (stage : Fin mdp.horizon) (state : State) (action : Action) : ProbabilityTheory.Kernel (EpisodeBatch mdp episodes) State
theorem
BanditRLProof.FiniteHorizonRL.EpisodeBatch.empiricalTransitionStateKernel_apply
Compiled
No declaration docstring is present; use the chapter context and exact statement below.
Used in these reading views: Bandit Book · Reinforcement Learning Book
9. Finite-horizon reinforcement learning
Canonical node identity
declaration:BanditRLProof.FiniteHorizonRL.EpisodeBatch.empiricalTransitionStateKernel_applyReading membership is not a proof dependency. Exact assumptions remain in the Lean statement.
theorem empiricalTransitionStateKernel_apply {mdp : MDP State Action} {episodes : Nat} (batch : EpisodeBatch mdp episodes) (defaultState : State) (stage : Fin mdp.horizon) (state : State) (action : Action) : empiricalTransitionStateKernel (episodes := episodes) defaultState stage state action batch = batch.empiricalTransitionKernel defaultState stage (state, action)
theorem
BanditRLProof.FiniteHorizonRL.EpisodeBatch.measurable_uncurry_of_forall_measurable
Compiled
Finite-state coordinatewise measurability yields joint measurability.
Used in these reading views: Bandit Book · Reinforcement Learning Book
9. Finite-horizon reinforcement learning
Canonical node identity
declaration:BanditRLProof.FiniteHorizonRL.EpisodeBatch.measurable_uncurry_of_forall_measurableReading membership is not a proof dependency. Exact assumptions remain in the Lean statement.
theorem measurable_uncurry_of_forall_measurable {Omega : Type*} [MeasurableSpace Omega] (value : Omega -> State -> Real) (hvalue : forall nextState : State, Measurable fun omega => value omega nextState) : Measurable (Function.uncurry value)
theorem
BanditRLProof.FiniteHorizonRL.EpisodeBatch.measurable_empiricalTransitionValue
Compiled
The empirical transition integral is measurable when every continuation-value coordinate is measurable in the same raw batch.
Used in these reading views: Bandit Book · Reinforcement Learning Book
9. Finite-horizon reinforcement learning
Canonical node identity
declaration:BanditRLProof.FiniteHorizonRL.EpisodeBatch.measurable_empiricalTransitionValueReading membership is not a proof dependency. Exact assumptions remain in the Lean statement.
theorem measurable_empiricalTransitionValue {mdp : MDP State Action} {episodes : Nat} (defaultState : State) (stage : Fin mdp.horizon) (state : State) (action : Action) (value : EpisodeBatch mdp episodes -> State -> Real) (hvalue : forall nextState : State, Measurable fun batch => value batch nextState) : Measurable fun batch : EpisodeBatch mdp episodes => ∫ nextState, value batch nextState ∂batch.empiricalTransitionKernel defaultState stage (state, action)
theorem
BanditRLProof.FiniteHorizonRL.MDP.measurable_stochasticAllCoordinateEmpiricalOptimisticQ
Compiled
Every sampled empirical optimistic action-value coordinate is measurable.
Used in these reading views: Bandit Book · Reinforcement Learning Book
9. Finite-horizon reinforcement learning
Canonical node identity
declaration:BanditRLProof.FiniteHorizonRL.MDP.measurable_stochasticAllCoordinateEmpiricalOptimisticQReading membership is not a proof dependency. Exact assumptions remain in the Lean statement.
theorem measurable_stochasticAllCoordinateEmpiricalOptimisticQ (mdp : MDP State Action) (episodes : Nat) (defaultState : State) (rewardBudget transitionBudget : Real) (stage : Fin mdp.horizon) (state : State) (action : Action) (value : EpisodeBatch mdp episodes -> State -> Real) (hvalue : forall nextState : State, Measurable fun batch => value batch nextState) : Measurable fun batch : EpisodeBatch mdp episodes => let model := mdp.stochasticAllCoordinateEmpiricalFiniteBatchModel episodes batch defaultState rewardBudget transitionBudget model.plan.optimisticQ stage (value batch) state action
theorem
BanditRLProof.FiniteHorizonRL.MDP.measurable_stochasticAllCoordinateEmpiricalUpperValueRemaining
Compiled
The sampled empirical optimistic value recursion is batch-measurable.
Used in these reading views: Bandit Book · Reinforcement Learning Book
9. Finite-horizon reinforcement learning
Canonical node identity
declaration:BanditRLProof.FiniteHorizonRL.MDP.measurable_stochasticAllCoordinateEmpiricalUpperValueRemainingReading membership is not a proof dependency. Exact assumptions remain in the Lean statement.
theorem measurable_stochasticAllCoordinateEmpiricalUpperValueRemaining (mdp : MDP State Action) (episodes : Nat) (defaultState : State) (rewardBudget transitionBudget : Real) : forall (remaining : Nat) (hremaining : remaining <= mdp.horizon) (state : State), Measurable fun batch : EpisodeBatch mdp episodes => let model := mdp.stochasticAllCoordinateEmpiricalFiniteBatchModel episodes batch defaultState rewardBudget transitionBudget model.plan.upperValueRemaining remaining hremaining state | 0, _hremaining, state => by simp [EstimatedModelPlan.upperValueRemaining] | remaining + 1, hremaining, state => by let stage := mdp.decisionStageRemaining remaining hremaining let value := fun batch : EpisodeBatch mdp episodes => let model := mdp.stochasticAllCoordinateEmpiricalFiniteBatchModel episodes batch defaultState rewardBudget transitionBudget model.plan.upperValueRemaining remaining (by omega) have hvalue : forall nextState : State, Measurable fun batch => value batch nextState
theorem
BanditRLProof.FiniteHorizonRL.MDP.measurable_stochasticAllCoordinateEmpiricalOptimisticActionAt
Compiled
Every chronological sampled empirical optimistic action is measurable.
Used in these reading views: Bandit Book · Reinforcement Learning Book
9. Finite-horizon reinforcement learning
Canonical node identity
declaration:BanditRLProof.FiniteHorizonRL.MDP.measurable_stochasticAllCoordinateEmpiricalOptimisticActionAtReading membership is not a proof dependency. Exact assumptions remain in the Lean statement.
theorem measurable_stochasticAllCoordinateEmpiricalOptimisticActionAt (mdp : MDP State Action) (episodes : Nat) (defaultState : State) (rewardBudget transitionBudget : Real) (stage : Fin mdp.horizon) (state : State) : Measurable fun batch : EpisodeBatch mdp episodes => let model := mdp.stochasticAllCoordinateEmpiricalFiniteBatchModel episodes batch defaultState rewardBudget transitionBudget model.plan.optimisticActionAt stage state
theorem
BanditRLProof.FiniteHorizonRL.MDP.measurable_stochasticAllCoordinateEmpiricalOptimisticPolicyTable
Compiled
The complete sampled empirical optimistic policy table is measurable.
Used in these reading views: Bandit Book · Reinforcement Learning Book
9. Finite-horizon reinforcement learning
Canonical node identity
declaration:BanditRLProof.FiniteHorizonRL.MDP.measurable_stochasticAllCoordinateEmpiricalOptimisticPolicyTableReading membership is not a proof dependency. Exact assumptions remain in the Lean statement.
theorem measurable_stochasticAllCoordinateEmpiricalOptimisticPolicyTable (mdp : MDP State Action) (episodes : Nat) (defaultState : State) (rewardBudget transitionBudget : Real) : Measurable fun batch : EpisodeBatch mdp episodes => fun stage state => (mdp.stochasticAllCoordinateEmpiricalFiniteBatchModel episodes batch defaultState rewardBudget transitionBudget).plan |>.optimisticActionAt stage state
def
BanditRLProof.FiniteHorizonRL.StochasticEpisodeBatch.sampledEmpiricalOptimisticPolicyTable
Compiled
Optimistic table computed from the actual sampled rewards in one batch.
Used in these reading views: Bandit Book · Reinforcement Learning Book
9. Finite-horizon reinforcement learning
Canonical node identity
declaration:BanditRLProof.FiniteHorizonRL.StochasticEpisodeBatch.sampledEmpiricalOptimisticPolicyTableReading membership is not a proof dependency. Exact assumptions remain in the Lean statement.
noncomputable def sampledEmpiricalOptimisticPolicyTable {mdp : MDP State Action} {episodes : Nat} (batch : StochasticEpisodeBatch mdp episodes) (defaultState : State) (rewardBudget transitionBudget : Real) : DeterministicMarkovPolicyTable mdp
theorem
BanditRLProof.FiniteHorizonRL.StochasticEpisodeBatch.measurable_sampledEmpiricalOptimisticPolicyTable
Compiled
The sampled-reward optimistic table is measurable in the stochastic batch.
Used in these reading views: Bandit Book · Reinforcement Learning Book
9. Finite-horizon reinforcement learning
Canonical node identity
declaration:BanditRLProof.FiniteHorizonRL.StochasticEpisodeBatch.measurable_sampledEmpiricalOptimisticPolicyTableReading membership is not a proof dependency. Exact assumptions remain in the Lean statement.
theorem measurable_sampledEmpiricalOptimisticPolicyTable {mdp : MDP State Action} {episodes : Nat} (defaultState : State) (rewardBudget transitionBudget : Real) : Measurable fun batch : StochasticEpisodeBatch mdp episodes => batch.sampledEmpiricalOptimisticPolicyTable defaultState rewardBudget transitionBudget
def
BanditRLProof.FiniteHorizonRL.AdaptiveStochasticSampledEmpiricalOptimisticSource.latestBatch
Compiled
The latest complete stochastic batch in a finite nonempty prefix.
Used in these reading views: Bandit Book · Reinforcement Learning Book
9. Finite-horizon reinforcement learning
Canonical node identity
declaration:BanditRLProof.FiniteHorizonRL.AdaptiveStochasticSampledEmpiricalOptimisticSource.latestBatchReading membership is not a proof dependency. Exact assumptions remain in the Lean statement.
def latestBatch {mdp : MDP State Action} {episodes n : Nat} (history : StochasticEpisodeBatchPrefix mdp episodes n) : StochasticEpisodeBatch mdp episodes
theorem
BanditRLProof.FiniteHorizonRL.AdaptiveStochasticSampledEmpiricalOptimisticSource.measurable_latestBatch
Compiled
No declaration docstring is present; use the chapter context and exact statement below.
Used in these reading views: Bandit Book · Reinforcement Learning Book
9. Finite-horizon reinforcement learning
Canonical node identity
declaration:BanditRLProof.FiniteHorizonRL.AdaptiveStochasticSampledEmpiricalOptimisticSource.measurable_latestBatchReading membership is not a proof dependency. Exact assumptions remain in the Lean statement.
theorem measurable_latestBatch {mdp : MDP State Action} {episodes n : Nat} : Measurable (latestBatch : StochasticEpisodeBatchPrefix mdp episodes n -> StochasticEpisodeBatch mdp episodes)
def
BanditRLProof.FiniteHorizonRL.AdaptiveStochasticSampledEmpiricalOptimisticSource.successorTable
Compiled
Sampled-reward optimistic table selected from the latest stochastic batch.
Used in these reading views: Bandit Book · Reinforcement Learning Book
9. Finite-horizon reinforcement learning
Canonical node identity
declaration:BanditRLProof.FiniteHorizonRL.AdaptiveStochasticSampledEmpiricalOptimisticSource.successorTableReading membership is not a proof dependency. Exact assumptions remain in the Lean statement.
noncomputable def successorTable {mdp : MDP State Action} {episodes : Nat} (defaultState : State) (rewardBudget transitionBudget : Real) (n : Nat) (history : StochasticEpisodeBatchPrefix mdp episodes n) : DeterministicMarkovPolicyTable mdp
theorem
BanditRLProof.FiniteHorizonRL.AdaptiveStochasticSampledEmpiricalOptimisticSource.measurable_successorTable
Compiled
No declaration docstring is present; use the chapter context and exact statement below.
Used in these reading views: Bandit Book · Reinforcement Learning Book
9. Finite-horizon reinforcement learning
Canonical node identity
declaration:BanditRLProof.FiniteHorizonRL.AdaptiveStochasticSampledEmpiricalOptimisticSource.measurable_successorTableReading membership is not a proof dependency. Exact assumptions remain in the Lean statement.
theorem measurable_successorTable {mdp : MDP State Action} {episodes : Nat} (defaultState : State) (rewardBudget transitionBudget : Real) (n : Nat) : Measurable (successorTable (mdp := mdp) (episodes := episodes) defaultState rewardBudget transitionBudget n)
def
BanditRLProof.FiniteHorizonRL.AdaptiveStochasticSampledEmpiricalOptimisticSource.exploratorySource
Compiled
Adaptive exploratory source whose successor policy uses actual sampled rewards.
Used in these reading views: Bandit Book · Reinforcement Learning Book
9. Finite-horizon reinforcement learning
Canonical node identity
declaration:BanditRLProof.FiniteHorizonRL.AdaptiveStochasticSampledEmpiricalOptimisticSource.exploratorySourceReading membership is not a proof dependency. Exact assumptions remain in the Lean statement.
noncomputable def exploratorySource (mdp : MDP State Action) (initialState : Measure State) [IsProbabilityMeasure initialState] (episodes : Nat) (rewardSource : mdp.MeanCompatibleRewardKernel) (initialTable : DeterministicMarkovPolicyTable mdp) (defaultState : State) (rewardBudget transitionBudget : Real) (explorationRate : NNReal) (hexplorationRate : explorationRate <= 1) : AdaptiveStochasticEpisodeBatchSource mdp initialState episodes where
theorem
BanditRLProof.FiniteHorizonRL.AdaptiveStochasticSampledEmpiricalOptimisticSource.exploratorySource_batchKernel_eq_selectedPolicy_iidLaw
Compiled
Every history fiber has the exact iid stochastic law of its selected policy.
Used in these reading views: Bandit Book · Reinforcement Learning Book
9. Finite-horizon reinforcement learning
Canonical node identity
declaration:BanditRLProof.FiniteHorizonRL.AdaptiveStochasticSampledEmpiricalOptimisticSource.exploratorySource_batchKernel_eq_selectedPolicy_iidLawReading membership is not a proof dependency. Exact assumptions remain in the Lean statement.
theorem exploratorySource_batchKernel_eq_selectedPolicy_iidLaw {mdp : MDP State Action} {initialState : Measure State} [IsProbabilityMeasure initialState] {episodes : Nat} (rewardSource : mdp.MeanCompatibleRewardKernel) (initialTable : DeterministicMarkovPolicyTable mdp) (defaultState : State) (rewardBudget transitionBudget : Real) (explorationRate : NNReal) (hexplorationRate : explorationRate <= 1) (n : Nat) (history : StochasticEpisodeBatchPrefix mdp episodes n) : let source := exploratorySource mdp initialState episodes rewardSource initialTable defaultState rewardBudget transitionBudget explorationRate hexplorationRate source.batchKernel n history = rewardSource.iidStochasticTrajectoryFamilyMeasure ((successorTable defaultState rewardBudget transitionBudget n history) |>.exploratoryPolicy explorationRate hexplorationRate) initialState episodes