LeanMachineLearning

Learning.feedbackCondAction_obliviousEnv๐Ÿ”—

Lemma

No docstring.

๐Ÿ”—theorem
Learning.feedbackCondAction_obliviousEnv.{u_1, u_2} {๐“ : Type u_1} {๐“จ : Type u_2} {m๐“ : MeasurableSpace ๐“} {m๐“จ : MeasurableSpace ๐“จ} (ฮฝ : โ„• โ†’ ProbabilityTheory.Kernel ๐“ ๐“จ) [hฮฝ : โˆ€ (n : โ„•), ProbabilityTheory.IsMarkovKernel (ฮฝ n)] (n : โ„•) : feedbackCondAction (obliviousEnv ฮฝ) n = ฮฝ n
Learning.feedbackCondAction_obliviousEnv.{u_1, u_2} {๐“ : Type u_1} {๐“จ : Type u_2} {m๐“ : MeasurableSpace ๐“} {m๐“จ : MeasurableSpace ๐“จ} (ฮฝ : โ„• โ†’ ProbabilityTheory.Kernel ๐“ ๐“จ) [hฮฝ : โˆ€ (n : โ„•), ProbabilityTheory.IsMarkovKernel (ฮฝ n)] (n : โ„•) : feedbackCondAction (obliviousEnv ฮฝ) n = ฮฝ n

Code

lemma feedbackCondAction_obliviousEnv (ฮฝ : โ„• โ†’ Kernel ๐“ ๐“จ) [hฮฝ : โˆ€ n, IsMarkovKernel (ฮฝ n)]
    (n : โ„•) :
    feedbackCondAction (obliviousEnv ฮฝ) n = ฮฝ n
Proof
by
  rcases isEmpty_or_nonempty ๐“ with h๐“ | h๐“
  ยท ext a : 1
    exact h๐“.elim a
  rcases isEmpty_or_nonempty ๐“จ with hR | hR
  ยท refine absurd (hฮฝ 0) ?_
    simp only [Subsingleton.eq_zero ฮฝ, Pi.zero_apply]
    exact Kernel.not_isMarkovKernel_zero
  have : Nonempty (Iic n โ†’ ๐“ ร— ๐“จ) := โŸจfun _ โ†ฆ (h๐“.some, hR.some)โŸฉ
  have h_eq_zero := ฮฝ0_eq_feedbackCondAction (obliviousEnv ฮฝ)
  have h_eq := feedback_eq_feedbackCondAction (obliviousEnv ฮฝ) (n - 1)
  cases n with
  | zero => exact h_eq_zero.symm
  | succ n =>
    simp only [Nat.add_one_sub_one, obliviousEnv_feedback, add_tsub_cancel_right] at h_eq
    rw [โ† Kernel.prodMkLeft_inj (ฮณ := Iic n โ†’ ๐“ ร— ๐“จ)]
    exact h_eq.symm

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: 5 project declarations, 31 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.