LeanMachineLearning

Learning.IsDeterministicAlgπŸ”—

Type Class

An algorithm is deterministic if its initial action and subsequent actions are determined by measurable functions (and not possibly random kernels).

πŸ”—type class
Learning.IsDeterministicAlg.{u_1, u_2} {𝓐 : Type u_1} {𝓨 : Type u_2}
  {m𝓐 : MeasurableSpace 𝓐} {m𝓨 : MeasurableSpace 𝓨}
  (alg : Algorithm 𝓐 𝓨) : Prop
Learning.IsDeterministicAlg.{u_1, u_2}
  {𝓐 : Type u_1} {𝓨 : Type u_2}
  {m𝓐 : MeasurableSpace 𝓐}
  {m𝓨 : MeasurableSpace 𝓨}
  (alg : Algorithm 𝓐 𝓨) : Prop

Code

class IsDeterministicAlg (alg : Algorithm 𝓐 𝓨) : Prop where exists_action0 : βˆƒ action0, alg.p0 = Measure.dirac action0 exists_nextAction n : βˆƒ (nextAction : (Iic n β†’ 𝓐 Γ— 𝓨) β†’ 𝓐) (h_meas : Measurable nextAction), alg.policy n = Kernel.deterministic nextAction h_meas

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: 1 project declarations, 24 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.