LeanMachineLearning

Learning.absolutelyContinuous_uniformAlgorithmπŸ”—

Lemma

No docstring.

πŸ”—theorem
Learning.absolutelyContinuous_uniformAlgorithm.{u_1, u_2} {𝓐 : Type u_1}
  {𝓨 : Type u_2} {m𝓐 : MeasurableSpace 𝓐} {m𝓨 : MeasurableSpace 𝓨}
  [Finite 𝓐] [Nonempty 𝓐] {alg : Algorithm 𝓐 𝓨} :
  Algorithm.AbsolutelyContinuous alg uniformAlgorithm
Learning.absolutelyContinuous_uniformAlgorithm.{u_1,
    u_2}
  {𝓐 : Type u_1} {𝓨 : Type u_2}
  {m𝓐 : MeasurableSpace 𝓐}
  {m𝓨 : MeasurableSpace 𝓨} [Finite 𝓐]
  [Nonempty 𝓐] {alg : Algorithm 𝓐 𝓨} :
  Algorithm.AbsolutelyContinuous alg
    uniformAlgorithm

Code

lemma absolutelyContinuous_uniformAlgorithm [Finite 𝓐] [Nonempty 𝓐] {alg : Algorithm 𝓐 𝓨} :
    alg β‰ͺₐ uniformAlgorithm where
  p0
Proof
Measure.absolutelyContinuous_of_measure_singleton_ne_zero
    (by simp [uniformAlgorithm, uniformOn, ← pos_iff_ne_zero, cond_pos_of_inter_ne_zero])
  policy n h := Measure.absolutelyContinuous_of_measure_singleton_ne_zero
    (by simp [uniformAlgorithm, uniformOn, ← pos_iff_ne_zero, cond_pos_of_inter_ne_zero])

Actions: Source Β· Open Issue

Meaning last changed in v4.34.0-rc2-1-g439785b (2026-08-23), the 3th 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, 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.