Learning.IsBayesAlgEnvSeq.integrable_uncurry_actionMean_comp
No docstring.
Learning.IsBayesAlgEnvSeq.integrable_uncurry_actionMean_comp.{u_1, u_2, u_4} {๐ : Type u_1} {๐ : Type u_2} {ฮฉ : Type u_4} [MeasurableSpace ๐] [MeasurableSpace ๐] [MeasurableSpace ฮฉ] [Countable ๐] [MeasurableSingletonClass ๐] {ฮบ : ProbabilityTheory.Kernel (๐ ร ๐) โ} {E : ฮฉ โ ๐} (hE : Measurable E) {f : ฮฉ โ ๐} (hf : Measurable f) {P : MeasureTheory.Measure ฮฉ} [MeasureTheory.IsFiniteMeasure P] {l u : โ} (hm : โ (e : ๐) (a : ๐), โซ (x : โ), id x โฮบ (e, a) โ Set.Icc l u) : MeasureTheory.Integrable (fun ฯ => actionMean ฮบ E (f ฯ) ฯ) PLearning.IsBayesAlgEnvSeq.integrable_uncurry_actionMean_comp.{u_1, u_2, u_4} {๐ : Type u_1} {๐ : Type u_2} {ฮฉ : Type u_4} [MeasurableSpace ๐] [MeasurableSpace ๐] [MeasurableSpace ฮฉ] [Countable ๐] [MeasurableSingletonClass ๐] {ฮบ : ProbabilityTheory.Kernel (๐ ร ๐) โ} {E : ฮฉ โ ๐} (hE : Measurable E) {f : ฮฉ โ ๐} (hf : Measurable f) {P : MeasureTheory.Measure ฮฉ} [MeasureTheory.IsFiniteMeasure P] {l u : โ} (hm : โ (e : ๐) (a : ๐), โซ (x : โ), id x โฮบ (e, a) โ Set.Icc l u) : MeasureTheory.Integrable (fun ฯ => actionMean ฮบ E (f ฯ) ฯ) P
Code
lemma integrable_uncurry_actionMean_comp [Countable ๐] [MeasurableSingletonClass ๐]
{ฮบ : Kernel (๐ ร ๐) โ} {E : ฮฉ โ ๐} (hE : Measurable E) {f : ฮฉ โ ๐} (hf : Measurable f)
{P : Measure ฮฉ} [IsFiniteMeasure P] {l u : โ} (hm : โ e a, (ฮบ (e, a))[id] โ (Set.Icc l u)) :
Integrable (fun ฯ โฆ actionMean ฮบ E (f ฯ) ฯ) PProof
by refine โจ(measurable_uncurry_actionMean_comp hE hf).aestronglyMeasurable, ?_โฉ apply HasFiniteIntegral.of_bounded filter_upwards with ฯ using abs_le_max_abs_abs (hm (E ฯ) (f ฯ)).1 (hm (E ฯ) (f ฯ)).2
Actions: Source ยท Open Issue
Meaning last changed in v4.34.0-rc2-1-g439785b (2026-08-23), the 2th recorded change.
Self-contained, with its dependencies inlined and proofs replaced by sorry: download the raw file ยท open it in the Lean web editor.
Dependency graph
Audit surface: 1 project declarations, 37 external constants
โ Proved: no sorry anywhere in its closure
This is the tool's own reading of one build's recorded axioms, and it is not robust against an author who wants it to pass. Checking meant to be relied on should go through Comparator, which replays the proof through the kernel from an export against an explicit list of permitted axioms.