LeanMachineLearning

Bandits.ArrayModel.instStandardBorelSpaceProbSpaceOfCountable๐Ÿ”—

Instance

No docstring.

๐Ÿ”—theorem
Bandits.ArrayModel.instStandardBorelSpaceProbSpaceOfCountable.{u_3, u_4}
  {๐“ : Type u_3} {R : Type u_4} [Countable ๐“] [MeasurableSpace R]
  [StandardBorelSpace R] : StandardBorelSpace (probSpace ๐“ R)
Bandits.ArrayModel.instStandardBorelSpaceProbSpaceOfCountable.{u_3,
    u_4}
  {๐“ : Type u_3} {R : Type u_4}
  [Countable ๐“] [MeasurableSpace R]
  [StandardBorelSpace R] :
  StandardBorelSpace (probSpace ๐“ R)

Code

instance {๐“ R : Type*} [Countable ๐“] [MeasurableSpace R] [StandardBorelSpace R] :
    StandardBorelSpace (probSpace ๐“ R)
Proof
inferInstanceAs (StandardBorelSpace ((โ„• โ†’ I) ร— (โ„• โ†’ ๐“ โ†’ R)))

Actions: Source ยท Open Issue

Meaning last changed in v4.34.0-rc2-1-g439785b (2026-08-23).

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: 2 project declarations, 66 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.