LeanMachineLearning

Learning.feedbackCondAction๐Ÿ”—

Definition

The kernel representing the conditional distribution of the feedback given the action at time n in an oblivious environment.

๐Ÿ”—def
Learning.feedbackCondAction.{u_1, u_2} {๐“ : Type u_1} {๐“จ : Type u_2}
  {m๐“ : MeasurableSpace ๐“} {m๐“จ : MeasurableSpace ๐“จ}
  (env : Environment ๐“ ๐“จ) [h_obl : IsObliviousEnv env] (n : โ„•) :
  ProbabilityTheory.Kernel ๐“ ๐“จ
Learning.feedbackCondAction.{u_1, u_2}
  {๐“ : Type u_1} {๐“จ : Type u_2}
  {m๐“ : MeasurableSpace ๐“}
  {m๐“จ : MeasurableSpace ๐“จ}
  (env : Environment ๐“ ๐“จ)
  [h_obl : IsObliviousEnv env] (n : โ„•) :
  ProbabilityTheory.Kernel ๐“ ๐“จ

Code

noncomputable def feedbackCondAction (env : Environment ๐“ ๐“จ) [h_obl : IsObliviousEnv env] (n : โ„•) : Kernel ๐“ ๐“จ := h_obl.exists_eq_prodMkLeft.choose n

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: 2 project declarations, 27 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.