BanditRLlib
Lean gate passed before this site build; local proof declarations are shown as compiled.Lean-verified build · exact declarations linked.

Lean module · Frontier

BanditRLProof.Algorithms.StochasticGradientBanditTwoArmMeasurableRecurrence

This module lifts the fixed-history recurrences to the jointly measurable environment kernel used by the canonical SGB trajectory. It also records one uniform, source-faithful environment contract: every initial and successor reward fiber is supported in [-1,1] almost everywhere and has the same fixed arm mean, uniformly over environment values, times, and finite histories.

Module map

Declarations
25
Placeholders
0

Imports

BanditRLProof.Algorithms.StochasticGradientBanditTwoArmRecurrence

Imported by

BanditRLProof, BanditRLProof.Algorithms.StochasticGradientBanditTwoArmPathIntegrability

Declarations

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

def BanditRLProof.StochasticGradientBandit.twoArmForwardSuccessorPotential Compiled

The forward successor exponential at a retained finite two-arm history.

Used in these reading views: Bandit Book

10. Automation, resources, and open routes

Canonical node identitydeclaration:BanditRLProof.StochasticGradientBandit.twoArmForwardSuccessorPotential

Reading membership is not a proof dependency. Exact assumptions remain in the Lean statement.

def twoArmForwardSuccessorPotential (eta : Real) {n : Nat} (history : History.FinitePairHistory (Fin 2) Real n) (pair : Fin 2 × Real) : Real
def BanditRLProof.StochasticGradientBandit.twoArmInverseSuccessorPotential Compiled

The inverse-odds successor exponential at the same time fence.

Used in these reading views: Bandit Book

10. Automation, resources, and open routes

Canonical node identitydeclaration:BanditRLProof.StochasticGradientBandit.twoArmInverseSuccessorPotential

Reading membership is not a proof dependency. Exact assumptions remain in the Lean statement.

def twoArmInverseSuccessorPotential (eta : Real) {n : Nat} (history : History.FinitePairHistory (Fin 2) Real n) (pair : Fin 2 × Real) : Real
def BanditRLProof.StochasticGradientBandit.twoArmForwardRecurrenceBound Compiled

The additive right side of the forward conditional recurrence.

Used in these reading views: Bandit Book

10. Automation, resources, and open routes

Canonical node identitydeclaration:BanditRLProof.StochasticGradientBandit.twoArmForwardRecurrenceBound

Reading membership is not a proof dependency. Exact assumptions remain in the Lean statement.

def twoArmForwardRecurrenceBound (eta Delta : Real) {n : Nat} (history : History.FinitePairHistory (Fin 2) Real n) : Real
def BanditRLProof.StochasticGradientBandit.twoArmInverseRecurrenceBound Compiled

The additive right side of the inverse conditional recurrence.

Used in these reading views: Bandit Book

10. Automation, resources, and open routes

Canonical node identitydeclaration:BanditRLProof.StochasticGradientBandit.twoArmInverseRecurrenceBound

Reading membership is not a proof dependency. Exact assumptions remain in the Lean statement.

def twoArmInverseRecurrenceBound (eta Delta : Real) {n : Nat} (history : History.FinitePairHistory (Fin 2) Real n) : Real
theorem BanditRLProof.StochasticGradientBandit.measurable_twoArmForwardSuccessorPotential Compiled

No declaration docstring is present; use the chapter context and exact statement below.

Used in these reading views: Bandit Book

10. Automation, resources, and open routes

Canonical node identitydeclaration:BanditRLProof.StochasticGradientBandit.measurable_twoArmForwardSuccessorPotential

Reading membership is not a proof dependency. Exact assumptions remain in the Lean statement.

theorem measurable_twoArmForwardSuccessorPotential (eta : Real) (n : Nat) : Measurable (fun input : History.FinitePairHistory (Fin 2) Real n × (Fin 2 × Real) => twoArmForwardSuccessorPotential eta input.1 input.2)
theorem BanditRLProof.StochasticGradientBandit.measurable_twoArmInverseSuccessorPotential Compiled

No declaration docstring is present; use the chapter context and exact statement below.

Used in these reading views: Bandit Book

10. Automation, resources, and open routes

Canonical node identitydeclaration:BanditRLProof.StochasticGradientBandit.measurable_twoArmInverseSuccessorPotential

Reading membership is not a proof dependency. Exact assumptions remain in the Lean statement.

theorem measurable_twoArmInverseSuccessorPotential (eta : Real) (n : Nat) : Measurable (fun input : History.FinitePairHistory (Fin 2) Real n × (Fin 2 × Real) => twoArmInverseSuccessorPotential eta input.1 input.2)
theorem BanditRLProof.StochasticGradientBandit.measurable_twoArmForwardRecurrenceBound Compiled

No declaration docstring is present; use the chapter context and exact statement below.

Used in these reading views: Bandit Book

10. Automation, resources, and open routes

Canonical node identitydeclaration:BanditRLProof.StochasticGradientBandit.measurable_twoArmForwardRecurrenceBound

Reading membership is not a proof dependency. Exact assumptions remain in the Lean statement.

theorem measurable_twoArmForwardRecurrenceBound (eta Delta : Real) (n : Nat) : Measurable (twoArmForwardRecurrenceBound eta Delta : History.FinitePairHistory (Fin 2) Real n -> Real)
theorem BanditRLProof.StochasticGradientBandit.measurable_twoArmInverseRecurrenceBound Compiled

No declaration docstring is present; use the chapter context and exact statement below.

Used in these reading views: Bandit Book

10. Automation, resources, and open routes

Canonical node identitydeclaration:BanditRLProof.StochasticGradientBandit.measurable_twoArmInverseRecurrenceBound

Reading membership is not a proof dependency. Exact assumptions remain in the Lean statement.

theorem measurable_twoArmInverseRecurrenceBound (eta Delta : Real) (n : Nat) : Measurable (twoArmInverseRecurrenceBound eta Delta : History.FinitePairHistory (Fin 2) Real n -> Real)
structure BanditRLProof.StochasticGradientBandit.TwoArmBoundedFixedMeanEnvironmentContract Compiled

Uniform source model for the two-arm Theorem-1 route. The same `mean` is used at the initial pair and at every history-dependent successor reward law. This is a conditional fixed-mean contract, not an independence assertion.

Used in these reading views: Bandit Book

10. Automation, resources, and open routes

Canonical node identitydeclaration:BanditRLProof.StochasticGradientBandit.TwoArmBoundedFixedMeanEnvironmentContract

Reading membership is not a proof dependency. Exact assumptions remain in the Lean statement.

structure TwoArmBoundedFixedMeanEnvironmentContract {Env : Type v} [MeasurableSpace Env] (environment : Thompson.MeasurableHistoryEnvironment Env (Fin 2) Real) (mean : Fin 2 -> Real) : Prop where
theorem BanditRLProof.StochasticGradientBandit.integral_measurableTwoArmHistoryStepKernel_forwardSuccessor_le Compiled

Forward recurrence on the jointly measurable environment/history kernel.

Used in these reading views: Bandit Book

10. Automation, resources, and open routes

Canonical node identitydeclaration:BanditRLProof.StochasticGradientBandit.integral_measurableTwoArmHistoryStepKernel_forwardSuccessor_le

Reading membership is not a proof dependency. Exact assumptions remain in the Lean statement.

theorem integral_measurableTwoArmHistoryStepKernel_forwardSuccessor_le {Env : Type v} [MeasurableSpace Env] (eta Delta : Real) (heta : 0 <= eta) (environment : Thompson.MeasurableHistoryEnvironment Env (Fin 2) Real) (n : Nat) (env : Env) (history : History.FinitePairHistory (Fin 2) Real n) (mean : Fin 2 -> Real) (hreward : forall selected, ∀ᵐ reward ∂environment.feedback n (env, (history, selected)), |reward| <= 1) (hmean : forall selected, integral (environment.feedback n (env, (history, selected))) id = mean selected) (hgap : mean 0 - mean 1 = Delta) : integral (Thompson.measurableEnvironmentHistoryStepKernel (historyAlgorithm (fun _ : Fin 2 => 0) eta) environment n (env, history)) (twoArmForwardSuccessorPotential eta history) <= twoArmForwardRecurrenceBound eta Delta history
theorem BanditRLProof.StochasticGradientBandit.integral_measurableTwoArmHistoryStepKernel_inverseSuccessor_le Compiled

Inverse recurrence on the jointly measurable environment/history kernel.

Used in these reading views: Bandit Book

10. Automation, resources, and open routes

Canonical node identitydeclaration:BanditRLProof.StochasticGradientBandit.integral_measurableTwoArmHistoryStepKernel_inverseSuccessor_le

Reading membership is not a proof dependency. Exact assumptions remain in the Lean statement.

theorem integral_measurableTwoArmHistoryStepKernel_inverseSuccessor_le {Env : Type v} [MeasurableSpace Env] (eta Delta : Real) (heta : 0 <= eta) (environment : Thompson.MeasurableHistoryEnvironment Env (Fin 2) Real) (n : Nat) (env : Env) (history : History.FinitePairHistory (Fin 2) Real n) (mean : Fin 2 -> Real) (hreward : forall selected, ∀ᵐ reward ∂environment.feedback n (env, (history, selected)), |reward| <= 1) (hmean : forall selected, integral (environment.feedback n (env, (history, selected))) id = mean selected) (hgap : mean 0 - mean 1 = Delta) : integral (Thompson.measurableEnvironmentHistoryStepKernel (historyAlgorithm (fun _ : Fin 2 => 0) eta) environment n (env, history)) (twoArmInverseSuccessorPotential eta history) <= twoArmInverseRecurrenceBound eta Delta history
theorem BanditRLProof.StochasticGradientBandit.integral_measurableTwoArmHistoryStepKernel_forwardSuccessor_le_of_contract Compiled

The uniform environment contract supplies the forward recurrence at every environment value and retained history.

Used in these reading views: Bandit Book

10. Automation, resources, and open routes

Canonical node identitydeclaration:BanditRLProof.StochasticGradientBandit.integral_measurableTwoArmHistoryStepKernel_forwardSuccessor_le_of_contract

Reading membership is not a proof dependency. Exact assumptions remain in the Lean statement.

theorem integral_measurableTwoArmHistoryStepKernel_forwardSuccessor_le_of_contract {Env : Type v} [MeasurableSpace Env] (eta Delta : Real) (heta : 0 <= eta) (environment : Thompson.MeasurableHistoryEnvironment Env (Fin 2) Real) (mean : Fin 2 -> Real) (contract : TwoArmBoundedFixedMeanEnvironmentContract environment mean) (hgap : mean 0 - mean 1 = Delta) (n : Nat) (env : Env) (history : History.FinitePairHistory (Fin 2) Real n) : integral (Thompson.measurableEnvironmentHistoryStepKernel (historyAlgorithm (fun _ : Fin 2 => 0) eta) environment n (env, history)) (twoArmForwardSuccessorPotential eta history) <= twoArmForwardRecurrenceBound eta Delta history
theorem BanditRLProof.StochasticGradientBandit.integral_measurableTwoArmHistoryStepKernel_inverseSuccessor_le_of_contract Compiled

The same contract supplies the inverse recurrence at every successor.

Used in these reading views: Bandit Book

10. Automation, resources, and open routes

Canonical node identitydeclaration:BanditRLProof.StochasticGradientBandit.integral_measurableTwoArmHistoryStepKernel_inverseSuccessor_le_of_contract

Reading membership is not a proof dependency. Exact assumptions remain in the Lean statement.

theorem integral_measurableTwoArmHistoryStepKernel_inverseSuccessor_le_of_contract {Env : Type v} [MeasurableSpace Env] (eta Delta : Real) (heta : 0 <= eta) (environment : Thompson.MeasurableHistoryEnvironment Env (Fin 2) Real) (mean : Fin 2 -> Real) (contract : TwoArmBoundedFixedMeanEnvironmentContract environment mean) (hgap : mean 0 - mean 1 = Delta) (n : Nat) (env : Env) (history : History.FinitePairHistory (Fin 2) Real n) : integral (Thompson.measurableEnvironmentHistoryStepKernel (historyAlgorithm (fun _ : Fin 2 => 0) eta) environment n (env, history)) (twoArmInverseSuccessorPotential eta history) <= twoArmInverseRecurrenceBound eta Delta history
def BanditRLProof.StochasticGradientBandit.twoArmTrajectoryMeasure Compiled

Canonical two-arm trajectory measure under zero initialization.

Used in these reading views: Bandit Book

10. Automation, resources, and open routes

Canonical node identitydeclaration:BanditRLProof.StochasticGradientBandit.twoArmTrajectoryMeasure

Reading membership is not a proof dependency. Exact assumptions remain in the Lean statement.

def twoArmTrajectoryMeasure {Env : Type v} [MeasurableSpace Env] (prior : Measure Env) (eta : Real) (environment : Thompson.MeasurableHistoryEnvironment Env (Fin 2) Real) : Measure (Env × ((k : Nat) -> Fin 2 × Real))
def BanditRLProof.StochasticGradientBandit.twoArmEnvironmentPrefix Compiled

The environment together with the visible inclusive prefix through `n`.

Used in these reading views: Bandit Book

10. Automation, resources, and open routes

Canonical node identitydeclaration:BanditRLProof.StochasticGradientBandit.twoArmEnvironmentPrefix

Reading membership is not a proof dependency. Exact assumptions remain in the Lean statement.

def twoArmEnvironmentPrefix {Env : Type v} (n : Nat) (sample : Env × ((k : Nat) -> Fin 2 × Real)) : Env × History.FinitePairHistory (Fin 2) Real n
def BanditRLProof.StochasticGradientBandit.twoArmNextPair Compiled

The next generated action/reward pair after the inclusive prefix.

Used in these reading views: Bandit Book

10. Automation, resources, and open routes

Canonical node identitydeclaration:BanditRLProof.StochasticGradientBandit.twoArmNextPair

Reading membership is not a proof dependency. Exact assumptions remain in the Lean statement.

def twoArmNextPair {Env : Type v} (n : Nat) (sample : Env × ((k : Nat) -> Fin 2 × Real)) : Fin 2 × Real
theorem BanditRLProof.StochasticGradientBandit.measurable_twoArmEnvironmentPrefix Compiled

No declaration docstring is present; use the chapter context and exact statement below.

Used in these reading views: Bandit Book

10. Automation, resources, and open routes

Canonical node identitydeclaration:BanditRLProof.StochasticGradientBandit.measurable_twoArmEnvironmentPrefix

Reading membership is not a proof dependency. Exact assumptions remain in the Lean statement.

theorem measurable_twoArmEnvironmentPrefix {Env : Type v} [MeasurableSpace Env] (n : Nat) : Measurable (twoArmEnvironmentPrefix (Env := Env) n)
theorem BanditRLProof.StochasticGradientBandit.measurable_twoArmNextPair Compiled

No declaration docstring is present; use the chapter context and exact statement below.

Used in these reading views: Bandit Book

10. Automation, resources, and open routes

Canonical node identitydeclaration:BanditRLProof.StochasticGradientBandit.measurable_twoArmNextPair

Reading membership is not a proof dependency. Exact assumptions remain in the Lean statement.

theorem measurable_twoArmNextPair {Env : Type v} [MeasurableSpace Env] (n : Nat) : Measurable (twoArmNextPair (Env := Env) n)
def BanditRLProof.StochasticGradientBandit.twoArmPrefixSigma Compiled

The sigma-algebra generated by retaining the environment and the inclusive trace prefix through `n`.

Used in these reading views: Bandit Book

10. Automation, resources, and open routes

Canonical node identitydeclaration:BanditRLProof.StochasticGradientBandit.twoArmPrefixSigma

Reading membership is not a proof dependency. Exact assumptions remain in the Lean statement.

@[reducible] def twoArmPrefixSigma {Env : Type v} [MeasurableSpace Env] (n : Nat) : MeasurableSpace (Env × ((k : Nat) -> Fin 2 × Real))
theorem BanditRLProof.StochasticGradientBandit.twoArmPrefixSigma_mono Compiled

No declaration docstring is present; use the chapter context and exact statement below.

Used in these reading views: Bandit Book

10. Automation, resources, and open routes

Canonical node identitydeclaration:BanditRLProof.StochasticGradientBandit.twoArmPrefixSigma_mono

Reading membership is not a proof dependency. Exact assumptions remain in the Lean statement.

theorem twoArmPrefixSigma_mono {Env : Type v} [MeasurableSpace Env] {n m : Nat} (hnm : n <= m) : twoArmPrefixSigma (Env := Env) n <= twoArmPrefixSigma (Env := Env) m
def BanditRLProof.StochasticGradientBandit.twoArmPrefixFiltration Compiled

The retained environment/prefix sigma-algebras form the canonical discrete-time filtration needed by the later tower argument.

Used in these reading views: Bandit Book

10. Automation, resources, and open routes

Canonical node identitydeclaration:BanditRLProof.StochasticGradientBandit.twoArmPrefixFiltration

Reading membership is not a proof dependency. Exact assumptions remain in the Lean statement.

def twoArmPrefixFiltration {Env : Type v} [MeasurableSpace Env] : Filtration Nat (inferInstance : MeasurableSpace (Env × ((k : Nat) -> Fin 2 × Real))) where
theorem BanditRLProof.StochasticGradientBandit.measurable_twoArmForwardTrajectorySuccessorPotential Compiled

No declaration docstring is present; use the chapter context and exact statement below.

Used in these reading views: Bandit Book

10. Automation, resources, and open routes

Canonical node identitydeclaration:BanditRLProof.StochasticGradientBandit.measurable_twoArmForwardTrajectorySuccessorPotential

Reading membership is not a proof dependency. Exact assumptions remain in the Lean statement.

theorem measurable_twoArmForwardTrajectorySuccessorPotential {Env : Type v} [MeasurableSpace Env] (eta : Real) (n : Nat) : Measurable (fun sample : Env × ((k : Nat) -> Fin 2 × Real) => twoArmForwardSuccessorPotential eta (twoArmEnvironmentPrefix n sample).2 (twoArmNextPair n sample))
theorem BanditRLProof.StochasticGradientBandit.measurable_twoArmInverseTrajectorySuccessorPotential Compiled

No declaration docstring is present; use the chapter context and exact statement below.

Used in these reading views: Bandit Book

10. Automation, resources, and open routes

Canonical node identitydeclaration:BanditRLProof.StochasticGradientBandit.measurable_twoArmInverseTrajectorySuccessorPotential

Reading membership is not a proof dependency. Exact assumptions remain in the Lean statement.

theorem measurable_twoArmInverseTrajectorySuccessorPotential {Env : Type v} [MeasurableSpace Env] (eta : Real) (n : Nat) : Measurable (fun sample : Env × ((k : Nat) -> Fin 2 × Real) => twoArmInverseSuccessorPotential eta (twoArmEnvironmentPrefix n sample).2 (twoArmNextPair n sample))
theorem BanditRLProof.StochasticGradientBandit.trajectoryPrefix_condDistrib_integral_forwardSuccessor_le Compiled

On the actual canonical trajectory, the conditional-distribution integral of the forward successor potential obeys the source recurrence for almost every retained environment/prefix.

Used in these reading views: Bandit Book

10. Automation, resources, and open routes

Canonical node identitydeclaration:BanditRLProof.StochasticGradientBandit.trajectoryPrefix_condDistrib_integral_forwardSuccessor_le

Reading membership is not a proof dependency. Exact assumptions remain in the Lean statement.

theorem trajectoryPrefix_condDistrib_integral_forwardSuccessor_le {Env : Type v} [MeasurableSpace Env] [StandardBorelSpace Env] (prior : Measure Env) [IsFiniteMeasure prior] (eta Delta : Real) (heta : 0 <= eta) (environment : Thompson.MeasurableHistoryEnvironment Env (Fin 2) Real) (mean : Fin 2 -> Real) (contract : TwoArmBoundedFixedMeanEnvironmentContract environment mean) (hgap : mean 0 - mean 1 = Delta) (n : Nat) : ∀ᵐ context ∂(twoArmTrajectoryMeasure prior eta environment).map (twoArmEnvironmentPrefix n), integral (condDistrib (twoArmNextPair n) (twoArmEnvironmentPrefix n) (twoArmTrajectoryMeasure prior eta environment) context) (twoArmForwardSuccessorPotential eta context.2) <= twoArmForwardRecurrenceBound eta Delta context.2
theorem BanditRLProof.StochasticGradientBandit.trajectoryPrefix_condDistrib_integral_inverseSuccessor_le Compiled

The inverse-potential recurrence transported to the same canonical trajectory conditional distribution.

Used in these reading views: Bandit Book

10. Automation, resources, and open routes

Canonical node identitydeclaration:BanditRLProof.StochasticGradientBandit.trajectoryPrefix_condDistrib_integral_inverseSuccessor_le

Reading membership is not a proof dependency. Exact assumptions remain in the Lean statement.

theorem trajectoryPrefix_condDistrib_integral_inverseSuccessor_le {Env : Type v} [MeasurableSpace Env] [StandardBorelSpace Env] (prior : Measure Env) [IsFiniteMeasure prior] (eta Delta : Real) (heta : 0 <= eta) (environment : Thompson.MeasurableHistoryEnvironment Env (Fin 2) Real) (mean : Fin 2 -> Real) (contract : TwoArmBoundedFixedMeanEnvironmentContract environment mean) (hgap : mean 0 - mean 1 = Delta) (n : Nat) : ∀ᵐ context ∂(twoArmTrajectoryMeasure prior eta environment).map (twoArmEnvironmentPrefix n), integral (condDistrib (twoArmNextPair n) (twoArmEnvironmentPrefix n) (twoArmTrajectoryMeasure prior eta environment) context) (twoArmInverseSuccessorPotential eta context.2) <= twoArmInverseRecurrenceBound eta Delta context.2