`Learning.isAlgEnvSeqUntil_unique`🔗

Lemma

No docstring.

theorem

Learning.isAlgEnvSeqUntil_unique.{u_1, u_2, u_4, u_5} {𝓐 : Type u_1}
  {𝓨 : Type u_2} {m𝓐 : MeasurableSpace 𝓐} {m𝓨 : MeasurableSpace 𝓨}
  {Ω : Type u_4} {Ω' : Type u_5} {mΩ : MeasurableSpace Ω}
  {mΩ' : MeasurableSpace Ω'} {alg : Algorithm 𝓐 𝓨}
  {env : Environment 𝓐 𝓨} {P : MeasureTheory.Measure Ω}
  [MeasureTheory.IsProbabilityMeasure P] {P' : MeasureTheory.Measure Ω'}
  [MeasureTheory.IsProbabilityMeasure P'] {A₁ : ℕ → Ω → 𝓐}
  {R₁ : ℕ → Ω → 𝓨} {A₂ : ℕ → Ω' → 𝓐} {R₂ : ℕ → Ω' → 𝓨} {N : ℕ}
  (h1 : IsAlgEnvSeqUntil A₁ R₁ alg env P N)
  (h2 : IsAlgEnvSeqUntil A₂ R₂ alg env P' N) :
  MeasureTheory.Measure.map (fun ω n => (A₁ (↑n) ω, R₁ (↑n) ω)) P =
    MeasureTheory.Measure.map (fun ω n => (A₂ (↑n) ω, R₂ (↑n) ω)) P'
Learning.isAlgEnvSeqUntil_unique.{u_1,
    u_2, u_4, u_5}
  {𝓐 : Type u_1} {𝓨 : Type u_2}
  {m𝓐 : MeasurableSpace 𝓐}
  {m𝓨 : MeasurableSpace 𝓨} {Ω : Type u_4}
  {Ω' : Type u_5} {mΩ : MeasurableSpace Ω}
  {mΩ' : MeasurableSpace Ω'}
  {alg : Algorithm 𝓐 𝓨}
  {env : Environment 𝓐 𝓨}
  {P : MeasureTheory.Measure Ω}
  [MeasureTheory.IsProbabilityMeasure P]
  {P' : MeasureTheory.Measure Ω'}
  [MeasureTheory.IsProbabilityMeasure P']
  {A₁ : ℕ → Ω → 𝓐} {R₁ : ℕ → Ω → 𝓨}
  {A₂ : ℕ → Ω' → 𝓐} {R₂ : ℕ → Ω' → 𝓨}
  {N : ℕ}
  (h1 :
    IsAlgEnvSeqUntil A₁ R₁ alg env P N)
  (h2 :
    IsAlgEnvSeqUntil A₂ R₂ alg env P' N) :
  MeasureTheory.Measure.map
      (fun ω n => (A₁ (↑n) ω, R₁ (↑n) ω))
      P =
    MeasureTheory.Measure.map
      (fun ω n => (A₂ (↑n) ω, R₂ (↑n) ω))
      P'

Code

lemma isAlgEnvSeqUntil_unique (h1 : IsAlgEnvSeqUntil A₁ R₁ alg env P N)
    (h2 : IsAlgEnvSeqUntil A₂ R₂ alg env P' N) :
    P.map (fun ω (n : Iic N) ↦ (A₁ n ω, R₁ n ω)) =
      P'.map (fun ω (n : Iic N) ↦ (A₂ n ω, R₂ n ω))

Proof

by
  rw [eq_trajMeasure_map_frestrictLe_of_isAlgEnvSeqUntil h1,
    eq_trajMeasure_map_frestrictLe_of_isAlgEnvSeqUntil h2]

Actions: Source · Open Issue

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: 4 project declarations, 45 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.

Learning.isAlgEnvSeqUntil_unique🔗

`Learning.isAlgEnvSeqUntil_unique`🔗