LeanMachineLearning

Learning.IsAlgEnvSeq.filtrationAction_le_filtrationπŸ”—

Lemma

No docstring.

πŸ”—theorem
Learning.IsAlgEnvSeq.filtrationAction_le_filtration.{u_1, u_2, u_3}
  {𝓐 : Type u_1} {𝓨 : Type u_2} {Ξ© : Type u_3} {m𝓐 : MeasurableSpace 𝓐}
  {m𝓨 : MeasurableSpace 𝓨} {mΞ© : MeasurableSpace Ξ©} {A : β„• β†’ Ξ© β†’ 𝓐}
  {Y : β„• β†’ Ξ© β†’ 𝓨} {alg : Algorithm 𝓐 𝓨} {env : Environment 𝓐 𝓨}
  {P : MeasureTheory.Measure Ξ©} [MeasureTheory.IsFiniteMeasure P]
  (h : IsAlgEnvSeq A Y alg env P) (n : β„•) :
  ↑(filtrationAction h) n ≀ ↑(filtration h) n
Learning.IsAlgEnvSeq.filtrationAction_le_filtration.{u_1,
    u_2, u_3}
  {𝓐 : Type u_1} {𝓨 : Type u_2}
  {Ξ© : Type u_3} {m𝓐 : MeasurableSpace 𝓐}
  {m𝓨 : MeasurableSpace 𝓨}
  {mΞ© : MeasurableSpace Ξ©} {A : β„• β†’ Ξ© β†’ 𝓐}
  {Y : β„• β†’ Ξ© β†’ 𝓨} {alg : Algorithm 𝓐 𝓨}
  {env : Environment 𝓐 𝓨}
  {P : MeasureTheory.Measure Ξ©}
  [MeasureTheory.IsFiniteMeasure P]
  (h : IsAlgEnvSeq A Y alg env P)
  (n : β„•) :
  ↑(filtrationAction h) n ≀
    ↑(filtration h) n

Code

lemma filtrationAction_le_filtration (h : IsAlgEnvSeq A Y alg env P) (n : β„•) :
    h.filtrationAction n ≀ h.filtration n
Proof
by
  cases n with
  | zero =>
    rw [h.filtrationAction_zero_eq_comap]
    exact measurable_iff_comap_le.mp (h.adapted_action 0)
  | succ m =>
    rw [h.filtrationAction_eq_comap (m + 1) (Nat.succ_ne_zero m), ← measurable_iff_comap_le]
    exact ((h.adapted_history m).mono (h.filtration.mono m.le_succ) le_rfl).prodMk
      (h.adapted_action (m + 1))

Actions: Source Β· Open Issue

New in v4.34.0-rc2-5-g9fd4a57 (2026-08-23), and its meaning has not changed since.

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: 6 project declarations, 58 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.