Learning.Hist.map
From the authors
Transport a history round-wise.
-
๐ : Type u_1 -
๐' : Type u_2 -
๐ : Type u_4 -
๐' : Type u_5 -
๐จ : Type u_7 -
๐จ' : Type u_8
-
fo : ๐ โ ๐' -
fa : ๐ โ ๐' -
fy : ๐จ โ ๐จ' -
n : โ -
h : Hist ๐ ๐ ๐จ nHistory ofncomplete rounds;n = 0is the empty history.
Hist ๐' ๐' ๐จ' nfun i => Round.map fo fa fy (h i)Nat : TypeThe natural numbers, starting at zero. This type is special-cased by both the kernel and the compiler, and overridden with an efficient implementation. Both use a fast arbitrary-precision arithmetic library (usually [GMP](https://gmplib.org/)); at runtime, `Nat` values that are sufficiently small are unboxed.
Learning.Hist : Type u_5 โ Type u_6 โ Type u_7 โ โ โ Type (max (max u_7 u_6) u_5)History of `n` complete rounds; `n = 0` is the empty history.Go to its page
Learning.Round.map : {๐ : Type u_1} โ
{๐' : Type u_2} โ
{๐ : Type u_4} โ
{๐' : Type u_5} โ
{๐จ : Type u_7} โ
{๐จ' : Type u_8} โ (๐ โ ๐') โ (๐ โ ๐') โ (๐จ โ ๐จ') โ Learning.Round ๐ ๐ ๐จ โ Learning.Round ๐' ๐' ๐จ'Transport a round along maps of the observation, the action and the feedback.Go to its page
Code
def Hist.map (fo : ๐ โ ๐') (fa : ๐ โ ๐') (fy : ๐จ โ ๐จ') {n : โ} (h : Hist ๐ ๐ ๐จ n) :
Hist ๐' ๐' ๐จ' n :=
fun i โฆ Round.map fo fa fy (h i)New in v4.34.0-rc2-74-ge05e4f3 (2026-09-10), and its meaning has not changed since.
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: 6 project declarations, 6 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.