LeanMachineLearning

Learning.IT.filtration_le_filtrationAction_add_oneπŸ”—

Lemma

No docstring.

πŸ”—theorem
Learning.IT.filtration_le_filtrationAction_add_one.{u_1, u_2}
  {𝓐 : Type u_1} {𝓨 : Type u_2} {m𝓐 : MeasurableSpace 𝓐}
  {m𝓨 : MeasurableSpace 𝓨} (n : β„•) :
  ↑(IT.filtration 𝓐 𝓨) n ≀ ↑(filtrationAction 𝓐 𝓨) (n + 1)
Learning.IT.filtration_le_filtrationAction_add_one.{u_1,
    u_2}
  {𝓐 : Type u_1} {𝓨 : Type u_2}
  {m𝓐 : MeasurableSpace 𝓐}
  {m𝓨 : MeasurableSpace 𝓨} (n : β„•) :
  ↑(IT.filtration 𝓐 𝓨) n ≀
    ↑(filtrationAction 𝓐 𝓨) (n + 1)

Code

lemma filtration_le_filtrationAction_add_one (n : β„•) :
    IT.filtration 𝓐 𝓨 n ≀ filtrationAction 𝓐 𝓨 (n + 1)
Proof
le_sup_of_le_left le_rfl

Actions: Source Β· Open Issue

Meaning unchanged since v4.33.0-rc1-29-gce231eb, the oldest revision on record (2026-07-30).

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: 3 project declarations, 32 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.