Lean module · Probability layer
BanditRLProof.ConcentrationFixedMGF
This module isolates the part of a martingale Bernstein/Freedman route that does not depend on the particular one-step exponential inequality. Unlike HasSubgaussianMGF, the upper bound is required at one fixed tilt only. Exponential integrability at every real multiple is retained because it is the regularity needed to compose kernel laws.
Module map
Imports
No project-local imports.
Imported by
BanditRLProof, BanditRLProof.ConcentrationConditionalMGF, BanditRLProof.ConcentrationQuadraticFixedMGF, BanditRLProof.ConcentrationSubGaussian, BanditRLProof.Exp3ComparatorBernstein, BanditRLProof.RL.FiniteHorizonAdaptiveCumulativeUCBVISameSourceConfidence
Declarations
Open an item to read its exact compact statement and source link. Detailed teaching notes are linked when registered.
structure
BanditRLProof.Concentration.Kernel.HasMGFUpperBoundAt
Compiled
A kernel-valued MGF upper bound at one fixed tilt. Integrability is required at every tilt so that successive conditional laws can be composed without adding boundedness assumptions.
Used in these reading views: Bandit Book · Reinforcement Learning Book · Online Learning Book
2. Probability, kernels, filtrations, and concentration
Canonical node identity
declaration:BanditRLProof.Concentration.Kernel.HasMGFUpperBoundAtReading membership is not a proof dependency. Exact assumptions remain in the Lean statement.
structure HasMGFUpperBoundAt (X : Ω → ℝ) (t ψ : ℝ) (κ : ProbabilityTheory.Kernel Ω' Ω) (ν : Measure Ω' := by volume_tac) : Prop where
lemma
BanditRLProof.Concentration.Kernel.HasMGFUpperBoundAt.ae_integrable_exp_mul
Compiled
No declaration docstring is present; use the chapter context and exact statement below.
Used in these reading views: Bandit Book · Reinforcement Learning Book · Online Learning Book
2. Probability, kernels, filtrations, and concentration
Canonical node identity
declaration:BanditRLProof.Concentration.Kernel.HasMGFUpperBoundAt.ae_integrable_exp_mulReading membership is not a proof dependency. Exact assumptions remain in the Lean statement.
lemma ae_integrable_exp_mul (h : HasMGFUpperBoundAt X t ψ κ ν) (s : ℝ) : ∀ᵐ ω' ∂ν, Integrable (fun y ↦ exp (s * X y)) (κ ω')
lemma
BanditRLProof.Concentration.Kernel.HasMGFUpperBoundAt.ae_forall_integrable_exp_mul
Compiled
No declaration docstring is present; use the chapter context and exact statement below.
Used in these reading views: Bandit Book · Reinforcement Learning Book · Online Learning Book
2. Probability, kernels, filtrations, and concentration
Canonical node identity
declaration:BanditRLProof.Concentration.Kernel.HasMGFUpperBoundAt.ae_forall_integrable_exp_mulReading membership is not a proof dependency. Exact assumptions remain in the Lean statement.
lemma ae_forall_integrable_exp_mul (h : HasMGFUpperBoundAt X t ψ κ ν) : ∀ᵐ ω' ∂ν, ∀ s, Integrable (fun ω ↦ exp (s * X ω)) (κ ω')
lemma
BanditRLProof.Concentration.Kernel.HasMGFUpperBoundAt.congr
Compiled
No declaration docstring is present; use the chapter context and exact statement below.
Used in these reading views: Bandit Book · Reinforcement Learning Book · Online Learning Book
2. Probability, kernels, filtrations, and concentration
Canonical node identity
declaration:BanditRLProof.Concentration.Kernel.HasMGFUpperBoundAt.congrReading membership is not a proof dependency. Exact assumptions remain in the Lean statement.
lemma congr {Y : Ω -> Real} (h : HasMGFUpperBoundAt X t ψ κ ν) (hXY : X =ᵐ[κ ∘ₘ ν] Y) : HasMGFUpperBoundAt Y t ψ κ ν where
lemma
BanditRLProof.Concentration.Kernel.HasMGFUpperBoundAt.congr_iff
Compiled
No declaration docstring is present; use the chapter context and exact statement below.
Used in these reading views: Bandit Book · Reinforcement Learning Book · Online Learning Book
2. Probability, kernels, filtrations, and concentration
Canonical node identity
declaration:BanditRLProof.Concentration.Kernel.HasMGFUpperBoundAt.congr_iffReading membership is not a proof dependency. Exact assumptions remain in the Lean statement.
lemma congr_iff {Y : Ω -> Real} (hXY : X =ᵐ[κ ∘ₘ ν] Y) : HasMGFUpperBoundAt X t ψ κ ν ↔ HasMGFUpperBoundAt Y t ψ κ ν
lemma
BanditRLProof.Concentration.Kernel.HasMGFUpperBoundAt.memLp_exp_mul
Compiled
No declaration docstring is present; use the chapter context and exact statement below.
Used in these reading views: Bandit Book · Reinforcement Learning Book · Online Learning Book
2. Probability, kernels, filtrations, and concentration
Canonical node identity
declaration:BanditRLProof.Concentration.Kernel.HasMGFUpperBoundAt.memLp_exp_mulReading membership is not a proof dependency. Exact assumptions remain in the Lean statement.
lemma memLp_exp_mul (h : HasMGFUpperBoundAt X t ψ κ ν) (s : ℝ) (p : ℝ≥0) : MemLp (fun ω ↦ exp (s * X ω)) p (κ ∘ₘ ν)
lemma
BanditRLProof.Concentration.Kernel.HasMGFUpperBoundAt.zero_kernel
Compiled
No declaration docstring is present; use the chapter context and exact statement below.
Used in these reading views: Bandit Book · Reinforcement Learning Book · Online Learning Book
2. Probability, kernels, filtrations, and concentration
Canonical node identity
declaration:BanditRLProof.Concentration.Kernel.HasMGFUpperBoundAt.zero_kernelReading membership is not a proof dependency. Exact assumptions remain in the Lean statement.
lemma zero_kernel : HasMGFUpperBoundAt X t ψ (0 : ProbabilityTheory.Kernel Ω' Ω) ν
lemma
BanditRLProof.Concentration.Kernel.HasMGFUpperBoundAt.zero_measure
Compiled
No declaration docstring is present; use the chapter context and exact statement below.
Used in these reading views: Bandit Book · Reinforcement Learning Book · Online Learning Book
2. Probability, kernels, filtrations, and concentration
Canonical node identity
declaration:BanditRLProof.Concentration.Kernel.HasMGFUpperBoundAt.zero_measureReading membership is not a proof dependency. Exact assumptions remain in the Lean statement.
lemma zero_measure : HasMGFUpperBoundAt X t ψ κ (0 : Measure Ω')
lemma
BanditRLProof.Concentration.Kernel.HasMGFUpperBoundAt.prodMkLeft_compProd
Compiled
No declaration docstring is present; use the chapter context and exact statement below.
Used in these reading views: Bandit Book · Reinforcement Learning Book · Online Learning Book
2. Probability, kernels, filtrations, and concentration
Canonical node identity
declaration:BanditRLProof.Concentration.Kernel.HasMGFUpperBoundAt.prodMkLeft_compProdReading membership is not a proof dependency. Exact assumptions remain in the Lean statement.
lemma prodMkLeft_compProd {η : ProbabilityTheory.Kernel Ω Ω''} (h : HasMGFUpperBoundAt Y t ψY η (κ ∘ₘ ν)) : HasMGFUpperBoundAt Y t ψY (ProbabilityTheory.Kernel.prodMkLeft Ω' η) (ν ⊗ₘ κ)
lemma
BanditRLProof.Concentration.Kernel.HasMGFUpperBoundAt.integrable_exp_add_compProd
Compiled
No declaration docstring is present; use the chapter context and exact statement below.
Used in these reading views: Bandit Book · Reinforcement Learning Book · Online Learning Book
2. Probability, kernels, filtrations, and concentration
Canonical node identity
declaration:BanditRLProof.Concentration.Kernel.HasMGFUpperBoundAt.integrable_exp_add_compProdReading membership is not a proof dependency. Exact assumptions remain in the Lean statement.
lemma integrable_exp_add_compProd {η : ProbabilityTheory.Kernel (Ω' × Ω) Ω''} [ProbabilityTheory.IsZeroOrMarkovKernel η] (hX : HasMGFUpperBoundAt X t ψ κ ν) (hY : HasMGFUpperBoundAt Y t ψY η (ν ⊗ₘ κ)) (s : ℝ) : Integrable (fun ω ↦ exp (s * (X ω.1 + Y ω.2))) ((κ ⊗ₖ η) ∘ₘ ν)
theorem
BanditRLProof.Concentration.Kernel.HasMGFUpperBoundAt.add_compProd
Compiled
No declaration docstring is present; use the chapter context and exact statement below.
Used in these reading views: Bandit Book · Reinforcement Learning Book · Online Learning Book
2. Probability, kernels, filtrations, and concentration
Canonical node identity
declaration:BanditRLProof.Concentration.Kernel.HasMGFUpperBoundAt.add_compProdReading membership is not a proof dependency. Exact assumptions remain in the Lean statement.
theorem add_compProd {η : ProbabilityTheory.Kernel (Ω' × Ω) Ω''} [ProbabilityTheory.IsZeroOrMarkovKernel η] (hX : HasMGFUpperBoundAt X t ψ κ ν) (hY : HasMGFUpperBoundAt Y t ψY η (ν ⊗ₘ κ)) : HasMGFUpperBoundAt (fun p ↦ X p.1 + Y p.2) t (ψ + ψY) (κ ⊗ₖ η) ν
lemma
BanditRLProof.Concentration.Kernel.HasMGFUpperBoundAt.add_comp
Compiled
No declaration docstring is present; use the chapter context and exact statement below.
Used in these reading views: Bandit Book · Reinforcement Learning Book · Online Learning Book
2. Probability, kernels, filtrations, and concentration
Canonical node identity
declaration:BanditRLProof.Concentration.Kernel.HasMGFUpperBoundAt.add_compReading membership is not a proof dependency. Exact assumptions remain in the Lean statement.
lemma add_comp {η : ProbabilityTheory.Kernel Ω Ω''} [ProbabilityTheory.IsZeroOrMarkovKernel η] (hX : HasMGFUpperBoundAt X t ψ κ ν) (hY : HasMGFUpperBoundAt Y t ψY η (κ ∘ₘ ν)) : HasMGFUpperBoundAt (fun p ↦ X p.1 + Y p.2) t (ψ + ψY) (κ ⊗ₖ ProbabilityTheory.Kernel.prodMkLeft Ω' η) ν
structure
BanditRLProof.Concentration.HasMGFUpperBoundAt
Compiled
A measure-level MGF upper bound at one fixed tilt.
Used in these reading views: Bandit Book · Reinforcement Learning Book · Online Learning Book
2. Probability, kernels, filtrations, and concentration
Canonical node identity
declaration:BanditRLProof.Concentration.HasMGFUpperBoundAtReading membership is not a proof dependency. Exact assumptions remain in the Lean statement.
structure HasMGFUpperBoundAt (X : Ω → ℝ) (t ψ : ℝ) (μ : Measure Ω := by volume_tac) : Prop where
lemma
BanditRLProof.Concentration.hasMGFUpperBoundAt_iff_kernel
Compiled
No declaration docstring is present; use the chapter context and exact statement below.
Used in these reading views: Bandit Book · Reinforcement Learning Book · Online Learning Book
2. Probability, kernels, filtrations, and concentration
Canonical node identity
declaration:BanditRLProof.Concentration.hasMGFUpperBoundAt_iff_kernelReading membership is not a proof dependency. Exact assumptions remain in the Lean statement.
lemma hasMGFUpperBoundAt_iff_kernel : HasMGFUpperBoundAt X t ψ μ ↔ Kernel.HasMGFUpperBoundAt X t ψ (ProbabilityTheory.Kernel.const Unit μ) (Measure.dirac ())
lemma
BanditRLProof.Concentration.HasMGFUpperBoundAt.of_map
Compiled
No declaration docstring is present; use the chapter context and exact statement below.
Used in these reading views: Bandit Book · Reinforcement Learning Book · Online Learning Book
2. Probability, kernels, filtrations, and concentration
Canonical node identity
declaration:BanditRLProof.Concentration.HasMGFUpperBoundAt.of_mapReading membership is not a proof dependency. Exact assumptions remain in the Lean statement.
lemma of_map {Ω' : Type*} {mΩ' : MeasurableSpace Ω'} {μ' : Measure Ω'} {Z : Ω' → Ω} (hZ : AEMeasurable Z μ') (h : HasMGFUpperBoundAt X t ψ (μ'.map Z)) : HasMGFUpperBoundAt (X ∘ Z) t ψ μ' where
lemma
BanditRLProof.Concentration.HasMGFUpperBoundAt.id_map_iff
Compiled
No declaration docstring is present; use the chapter context and exact statement below.
Used in these reading views: Bandit Book · Reinforcement Learning Book · Online Learning Book
2. Probability, kernels, filtrations, and concentration
Canonical node identity
declaration:BanditRLProof.Concentration.HasMGFUpperBoundAt.id_map_iffReading membership is not a proof dependency. Exact assumptions remain in the Lean statement.
lemma id_map_iff (hX : AEMeasurable X μ) : HasMGFUpperBoundAt id t ψ (μ.map X) ↔ HasMGFUpperBoundAt X t ψ μ
theorem
BanditRLProof.Concentration.HasMGFUpperBoundAt.compensated
Compiled
Subtracting a deterministic log-MGF budget turns a fixed-tilt bound into a unit-tilt zero-budget bound. This is the algebraic step used to iterate exponential supermartingale increments.
Used in these reading views: Bandit Book · Reinforcement Learning Book · Online Learning Book
2. Probability, kernels, filtrations, and concentration
Canonical node identity
declaration:BanditRLProof.Concentration.HasMGFUpperBoundAt.compensatedReading membership is not a proof dependency. Exact assumptions remain in the Lean statement.
theorem compensated (h : HasMGFUpperBoundAt X t ψ μ) : HasMGFUpperBoundAt (fun ω => t * X ω - ψ) 1 0 μ
def
BanditRLProof.Concentration.HasCondMGFUpperBoundAt
Compiled
Conditional fixed-tilt MGF bound, expressed through Mathlib's conditional expectation kernel.
Used in these reading views: Bandit Book · Reinforcement Learning Book · Online Learning Book
2. Probability, kernels, filtrations, and concentration
Canonical node identity
declaration:BanditRLProof.Concentration.HasCondMGFUpperBoundAtReading membership is not a proof dependency. Exact assumptions remain in the Lean statement.
def HasCondMGFUpperBoundAt (X : Ω → ℝ) (t ψ : ℝ) (μ : Measure Ω := by volume_tac) [IsFiniteMeasure μ] : Prop
lemma
BanditRLProof.Concentration.HasMGFUpperBoundAt.trim
Compiled
No declaration docstring is present; use the chapter context and exact statement below.
Used in these reading views: Bandit Book · Reinforcement Learning Book · Online Learning Book
2. Probability, kernels, filtrations, and concentration
Canonical node identity
declaration:BanditRLProof.Concentration.HasMGFUpperBoundAt.trimReading membership is not a proof dependency. Exact assumptions remain in the Lean statement.
lemma trim (hm : m ≤ mΩ) (hXm : Measurable[m] X) (hX : HasMGFUpperBoundAt X t ψ μ) : HasMGFUpperBoundAt X t ψ (μ.trim hm) where
theorem
BanditRLProof.Concentration.HasMGFUpperBoundAt.add_of_hasCondMGFUpperBoundAt
Compiled
No declaration docstring is present; use the chapter context and exact statement below.
Used in these reading views: Bandit Book · Reinforcement Learning Book · Online Learning Book
2. Probability, kernels, filtrations, and concentration
Canonical node identity
declaration:BanditRLProof.Concentration.HasMGFUpperBoundAt.add_of_hasCondMGFUpperBoundAtReading membership is not a proof dependency. Exact assumptions remain in the Lean statement.
theorem add_of_hasCondMGFUpperBoundAt {Y : Ω → ℝ} {ψX ψY : ℝ} (hm : m ≤ mΩ) (hX : HasMGFUpperBoundAt X t ψX (μ.trim hm)) (hY : HasCondMGFUpperBoundAt m hm Y t ψY μ) : HasMGFUpperBoundAt (X + Y) t (ψX + ψY) μ
lemma
BanditRLProof.Concentration.HasMGFUpperBoundAt.measure_ge_le_exp_add
Compiled
No declaration docstring is present; use the chapter context and exact statement below.
Used in these reading views: Bandit Book · Reinforcement Learning Book · Online Learning Book
2. Probability, kernels, filtrations, and concentration
Canonical node identity
declaration:BanditRLProof.Concentration.HasMGFUpperBoundAt.measure_ge_le_exp_addReading membership is not a proof dependency. Exact assumptions remain in the Lean statement.
lemma measure_ge_le_exp_add (h : HasMGFUpperBoundAt X t ψ μ) (ε : ℝ) (ht : 0 ≤ t) : μ.real {ω | ε ≤ X ω} ≤ exp (-t * ε + ψ)
theorem
BanditRLProof.Concentration.HasMGFUpperBoundAt.sum_of_hasCondMGFUpperBoundAt
Compiled
No declaration docstring is present; use the chapter context and exact statement below.
Used in these reading views: Bandit Book · Reinforcement Learning Book · Online Learning Book
2. Probability, kernels, filtrations, and concentration
Canonical node identity
declaration:BanditRLProof.Concentration.HasMGFUpperBoundAt.sum_of_hasCondMGFUpperBoundAtReading membership is not a proof dependency. Exact assumptions remain in the Lean statement.
theorem HasMGFUpperBoundAt.sum_of_hasCondMGFUpperBoundAt [IsZeroOrProbabilityMeasure μ] (h_adapted : StronglyAdapted ℱ Y) (h0 : HasMGFUpperBoundAt (Y 0) t (ψY 0) μ) (n : ℕ) (h_mgf : ∀ i < n - 1, HasCondMGFUpperBoundAt (ℱ i) (ℱ.le i) (Y (i + 1)) t (ψY (i + 1)) μ) : HasMGFUpperBoundAt (fun ω ↦ ∑ i ∈ Finset.range n, Y i ω) t (∑ i ∈ Finset.range n, ψY i) μ
theorem
BanditRLProof.Concentration.measure_sum_ge_le_of_hasCondMGFUpperBoundAt
Compiled
Fixed-tilt Chernoff bound for a strongly adapted finite sum with conditional MGF budgets.
Used in these reading views: Bandit Book · Reinforcement Learning Book · Online Learning Book
2. Probability, kernels, filtrations, and concentration
Canonical node identity
declaration:BanditRLProof.Concentration.measure_sum_ge_le_of_hasCondMGFUpperBoundAtReading membership is not a proof dependency. Exact assumptions remain in the Lean statement.
theorem measure_sum_ge_le_of_hasCondMGFUpperBoundAt [IsZeroOrProbabilityMeasure μ] (h_adapted : StronglyAdapted ℱ Y) (h0 : HasMGFUpperBoundAt (Y 0) t (ψY 0) μ) (n : ℕ) (h_mgf : ∀ i < n - 1, HasCondMGFUpperBoundAt (ℱ i) (ℱ.le i) (Y (i + 1)) t (ψY (i + 1)) μ) (ε : ℝ) (ht : 0 ≤ t) : μ.real {ω | ε ≤ ∑ i ∈ Finset.range n, Y i ω} ≤ exp (-t * ε + ∑ i ∈ Finset.range n, ψY i)
theorem
BanditRLProof.Concentration.measure_sum_ge_inter_sum_le_of_compensated_hasCondMGFUpperBoundAt
Compiled
Fixed-tilt tail bound with a random predictable compensator retained in the event. The conditional MGF hypotheses are imposed on the compensated increments `tilt * Y i - varianceCoeff * V i`; on the event where the cumulative compensator is at most `varianceBudget`, their exponential tail controls the uncompensated sum.
Used in these reading views: Bandit Book · Reinforcement Learning Book · Online Learning Book
2. Probability, kernels, filtrations, and concentration
Canonical node identity
declaration:BanditRLProof.Concentration.measure_sum_ge_inter_sum_le_of_compensated_hasCondMGFUpperBoundAtReading membership is not a proof dependency. Exact assumptions remain in the Lean statement.
theorem measure_sum_ge_inter_sum_le_of_compensated_hasCondMGFUpperBoundAt [IsZeroOrProbabilityMeasure μ] (Y V : ℕ → Ω → ℝ) (n : ℕ) (tilt varianceCoeff threshold varianceBudget : ℝ) (h_adapted : StronglyAdapted ℱ (fun i ω => tilt * Y i ω - varianceCoeff * V i ω)) (h0 : HasMGFUpperBoundAt (fun ω => tilt * Y 0 ω - varianceCoeff * V 0 ω) 1 0 μ) (h_mgf : ∀ i < n - 1, HasCondMGFUpperBoundAt (ℱ i) (ℱ.le i) (fun ω => tilt * Y (i + 1) ω - varianceCoeff * V (i + 1) ω) 1 0 μ) (htilt : 0 ≤ tilt) (hvarianceCoeff : 0 ≤ varianceCoeff) : μ {ω | threshold ≤ ∑ i ∈ Finset.range n, Y i ω ∧ (∑ i ∈ Finset.range n, V i ω) ≤ varianceBudget} ≤ ENNReal.ofReal (Real.exp (-tilt * threshold + varianceCoeff * varianceBudget))