Bandits.ArrayModel.action_add_one_eq🔗

Bandits.ArrayModel.action_add_one_eq.{u_1, u_2} {𝓐 : Type u_1}
  {R : Type u_2} {m𝓐 : MeasurableSpace 𝓐} {mR : MeasurableSpace R}
  [Nonempty 𝓐] [StandardBorelSpace 𝓐] [DecidableEq 𝓐]
  (alg : Learning.Algorithm 𝓐 R) (n : ℕ) :
  action alg (n + 1) = fun ω =>
    algFunction alg n (hist alg ω n) (Prod.fst ω (n + 1))
Bandits.ArrayModel.action_add_one_eq.{u_1,
    u_2}
  {𝓐 : Type u_1} {R : Type u_2}
  {m𝓐 : MeasurableSpace 𝓐}
  {mR : MeasurableSpace R} [Nonempty 𝓐]
  [StandardBorelSpace 𝓐] [DecidableEq 𝓐]
  (alg : Learning.Algorithm 𝓐 R) (n : ℕ) :
  action alg (n + 1) = fun ω =>
    algFunction alg n (hist alg ω n)
      (Prod.fst ω (n + 1))

lemma action_add_one_eq [DecidableEq 𝓐] (alg : Algorithm 𝓐 R) (n : ℕ) :
    action alg (n + 1) = fun ω ↦ algFunction alg n (hist alg ω n) (ω.1 (n + 1))

by
  ext ω
  rw [action, hist_add_one]
  simp only [add_le_iff_nonpos_right, nonpos_iff_eq_zero, one_ne_zero, ↓reduceDIte]

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