Learning.IsAlgEnvSeq.isAlgEnvSeqUntil🔗

Learning.IsAlgEnvSeq.isAlgEnvSeqUntil.{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 : ℕ) :
  IsAlgEnvSeqUntil A Y alg env P N
Learning.IsAlgEnvSeq.isAlgEnvSeqUntil.{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 : ℕ) :
  IsAlgEnvSeqUntil A Y alg env P N

lemma IsAlgEnvSeq.isAlgEnvSeqUntil (h : IsAlgEnvSeq A Y alg env P) (N : ℕ) :
    IsAlgEnvSeqUntil A Y alg env P N where
  measurable_action

h.measurable_action
  measurable_feedback := h.measurable_feedback
  hasLaw_action_zero := h.hasLaw_action_zero
  hasCondDistrib_feedback_zero := h.hasCondDistrib_feedback_zero
  hasCondDistrib_action n _ := h.hasCondDistrib_action n
  hasCondDistrib_feedback n _ := h.hasCondDistrib_feedback n

Meaning last changed in v4.34.0-rc2-1-g439785b (2026-08-23), the 4th 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: 5 project declarations, 41 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.