LeanMachineLearning

Learning.RoundRobin.pullCount_eq_one๐Ÿ”—

Lemma

No docstring.

๐Ÿ”—theorem
Learning.RoundRobin.pullCount_eq_one.{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
      (K - 1))
  (a : Fin K) : pullCount A a K =แต[P] fun x => 1
Learning.RoundRobin.pullCount_eq_one.{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 (K - 1))
  (a : Fin K) :
  pullCount A a K =แต[P] fun x => 1

Code

lemma pullCount_eq_one
    (h : IsAlgEnvSeqUntil A Y (roundRobinAlgorithm hK) (stationaryEnv ฮฝ) P (K - 1)) (a : Fin K) :
    pullCount A a K =แต[P] fun _ โ†ฆ 1
Proof
by
  suffices pullCount A a (K * 1) =แต[P] fun _ โ†ฆ 1 by simpa using this
  refine pullCount_mul 1 (P := P) (ฮฝ := ฮฝ) (Y := Y) (hK := hK) ?_ a
  simpa

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: 10 project declarations, 65 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.