Lean module · Foundations
BanditRLProof.LowerBounds.RelativeEntropyFiltration
Recovery of relative entropy from a filtration resolving the RN density.
Module map
Imports
BanditRLProof.LowerBounds.InformationTheory
Imported by
BanditRLProof.LowerBounds.BanditHistoryDataProcessing, BanditRLProof.LowerBounds.FinitePartitionKLRecovery
Declarations
Open an item to read its exact compact statement and source link. Detailed teaching notes are linked when registered.
theorem
BanditRLProof.LowerBounds.relativeEntropy_trim_eq_lintegral_condExp
Compiled
Trimmed KL as the convex lower integral of the conditional RN density.
Used in these reading views: Bandit Book
1. Finite bandits, traces, and regret
Canonical node identity
declaration:BanditRLProof.LowerBounds.relativeEntropy_trim_eq_lintegral_condExpReading membership is not a proof dependency. Exact assumptions remain in the Lean statement.
theorem relativeEntropy_trim_eq_lintegral_condExp {α : Type*} {m m₀ : MeasurableSpace α} (P Q : @Measure α m₀) [IsFiniteMeasure P] [IsFiniteMeasure Q] (hm : m ≤ m₀) (h : P ≪ Q) : @relativeEntropy α m (P.trim hm) (Q.trim hm) = ∫⁻ x, ENNReal.ofReal (InformationTheory.klFun (Q[fun y => (P.rnDeriv Q y).toReal | m] x)) ∂Q
theorem
BanditRLProof.LowerBounds.relativeEntropy_map_eq_trim_of_absolutelyContinuous
Compiled
A measurable observation has the same KL as restriction to its generated sigma-algebra.
Used in these reading views: Bandit Book
1. Finite bandits, traces, and regret
Canonical node identity
declaration:BanditRLProof.LowerBounds.relativeEntropy_map_eq_trim_of_absolutelyContinuousReading membership is not a proof dependency. Exact assumptions remain in the Lean statement.
theorem relativeEntropy_map_eq_trim_of_absolutelyContinuous {α β : Type*} [mα : MeasurableSpace α] [mβ : MeasurableSpace β] (P Q : Measure α) [IsFiniteMeasure P] [IsFiniteMeasure Q] (h : P ≪ Q) (f : α → β) (hf : Measurable f) : relativeEntropy (P.map f) (Q.map f) = @relativeEntropy α (mβ.comap f) (P.trim hf.comap_le) (Q.trim hf.comap_le)
theorem
BanditRLProof.LowerBounds.relativeEntropy_eq_iSup_trim_of_density_measurable
Compiled
Resolving the RN density along a filtration recovers KL, including infinite KL.
Used in these reading views: Bandit Book
1. Finite bandits, traces, and regret
Canonical node identity
declaration:BanditRLProof.LowerBounds.relativeEntropy_eq_iSup_trim_of_density_measurableReading membership is not a proof dependency. Exact assumptions remain in the Lean statement.
theorem relativeEntropy_eq_iSup_trim_of_density_measurable {α : Type*} [m₀ : MeasurableSpace α] (P Q : Measure α) [IsFiniteMeasure P] [IsFiniteMeasure Q] (h : P ≪ Q) (F : Filtration ℕ m₀) (hDensity : StronglyMeasurable[⨆ n, F n] (fun x => (P.rnDeriv Q x).toReal)) : relativeEntropy P Q = ⨆ n, @relativeEntropy α (F n) (P.trim (F.le n)) (Q.trim (F.le n))
def
BanditRLProof.LowerBounds.densityApproximationFiltration
Compiled
Natural filtration of the finite-valued lower approximations to a density.
Used in these reading views: Bandit Book
1. Finite bandits, traces, and regret
Canonical node identity
declaration:BanditRLProof.LowerBounds.densityApproximationFiltrationReading membership is not a proof dependency. Exact assumptions remain in the Lean statement.
def densityApproximationFiltration {α : Type*} [m : MeasurableSpace α] (r : α → ENNReal) : Filtration ℕ m
theorem
BanditRLProof.LowerBounds.measurable_density_iSup_approximationFiltration
Compiled
The limiting sigma-algebra of the approximation filtration resolves the density.
Used in these reading views: Bandit Book
1. Finite bandits, traces, and regret
Canonical node identity
declaration:BanditRLProof.LowerBounds.measurable_density_iSup_approximationFiltrationReading membership is not a proof dependency. Exact assumptions remain in the Lean statement.
theorem measurable_density_iSup_approximationFiltration {α : Type*} [m : MeasurableSpace α] (r : α → ENNReal) (hr : Measurable r) : Measurable[⨆ n, densityApproximationFiltration r n] r
theorem
BanditRLProof.LowerBounds.relativeEntropy_eq_iSup_densityApproximation_trim
Compiled
RN KL is recovered along a concretely constructed simple-approximation filtration.
Used in these reading views: Bandit Book
1. Finite bandits, traces, and regret
Canonical node identity
declaration:BanditRLProof.LowerBounds.relativeEntropy_eq_iSup_densityApproximation_trimReading membership is not a proof dependency. Exact assumptions remain in the Lean statement.
theorem relativeEntropy_eq_iSup_densityApproximation_trim {α : Type*} [m : MeasurableSpace α] (P Q : Measure α) [IsFiniteMeasure P] [IsFiniteMeasure Q] (h : P ≪ Q) : relativeEntropy P Q = ⨆ n, @relativeEntropy α (densityApproximationFiltration (P.rnDeriv Q) n) (P.trim ((densityApproximationFiltration (P.rnDeriv Q)).le n)) (Q.trim ((densityApproximationFiltration (P.rnDeriv Q)).le n))