Learning.RoundRobin.action_zero
No docstring.
Learning.RoundRobin.action_zero.{u_1, u_2} {๐จ : Type u_1} {m๐จ : MeasurableSpace ๐จ} {K : โ} {hK : 0 < K} {ฮฝ : ProbabilityTheory.Kernel (Fin K) ๐จ} [ProbabilityTheory.IsMarkovKernel ฮฝ] {ฮฉ : Type u_2} {mฮฉ : MeasurableSpace ฮฉ} {P : MeasureTheory.Measure ฮฉ} [MeasureTheory.IsProbabilityMeasure P] {A : โ โ ฮฉ โ Fin K} {Y : โ โ ฮฉ โ ๐จ} (h : IsAlgEnvSeqUntil A Y (roundRobinAlgorithm hK) (stationaryEnv ฮฝ) P 0) : A 0 =แต[P] fun x => โจ0, hKโฉLearning.RoundRobin.action_zero.{u_1, u_2} {๐จ : Type u_1} {m๐จ : MeasurableSpace ๐จ} {K : โ} {hK : 0 < K} {ฮฝ : ProbabilityTheory.Kernel (Fin K) ๐จ} [ProbabilityTheory.IsMarkovKernel ฮฝ] {ฮฉ : Type u_2} {mฮฉ : MeasurableSpace ฮฉ} {P : MeasureTheory.Measure ฮฉ} [MeasureTheory.IsProbabilityMeasure P] {A : โ โ ฮฉ โ Fin K} {Y : โ โ ฮฉ โ ๐จ} (h : IsAlgEnvSeqUntil A Y (roundRobinAlgorithm hK) (stationaryEnv ฮฝ) P 0) : A 0 =แต[P] fun x => โจ0, hKโฉ
Code
lemma action_zero
(h : IsAlgEnvSeqUntil A Y (roundRobinAlgorithm hK) (stationaryEnv ฮฝ) P 0) :
A 0 =แต[P] fun _ โฆ โจ0, hKโฉProof
by have : Nonempty (Fin K) := Fin.pos_iff_nonempty.mp hK exact h.action_zero_detAlgorithm
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: 9 project declarations, 56 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.