Learning.Hist.measurable_map
No docstring.
-
๐ : Type u_1m๐ : MeasurableSpace ๐A measurable space is a space equipped with a ฯ-algebra. -
๐' : Type u_2m๐' : MeasurableSpace ๐' -
๐ : Type u_4m๐ : MeasurableSpace ๐ -
๐' : Type u_5m๐' : MeasurableSpace ๐' -
๐จ : Type u_7m๐จ : MeasurableSpace ๐จ -
๐จ' : Type u_8m๐จ' : MeasurableSpace ๐จ'
-
fo : ๐ โ ๐' -
fa : ๐ โ ๐' -
fy : ๐จ โ ๐จ' -
n : โ
-
hfo : Measurable foA functionfbetween measurable spaces is measurable if the preimage of every measurable set is measurable. -
hfa : Measurable fa -
hfy : Measurable fy
Measurable (map fo fa fy)MeasurableSpace : Type u_6 โ Type u_6A measurable space is a space equipped with a ฯ-algebra.
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.
Measurable : {ฮฑ : Type u_1} โ {ฮฒ : Type u_2} โ [MeasurableSpace ฮฑ] โ [MeasurableSpace ฮฒ] โ (ฮฑ โ ฮฒ) โ PropA function `f` between measurable spaces is measurable if the preimage of every measurable set is measurable.
Learning.Hist.map : {๐ : Type u_1} โ
{๐' : Type u_2} โ
{๐ : Type u_4} โ
{๐' : Type u_5} โ
{๐จ : Type u_7} โ
{๐จ' : Type u_8} โ (๐ โ ๐') โ (๐ โ ๐') โ (๐จ โ ๐จ') โ {n : โ} โ Learning.Hist ๐ ๐ ๐จ n โ Learning.Hist ๐' ๐' ๐จ' nTransport a history round-wise.Go to its page
Code
lemma Hist.measurable_map (hfo : Measurable fo) (hfa : Measurable fa) (hfy : Measurable fy)
(n : โ) :
Measurable (Hist.map fo fa fy (n := n))Proof
by unfold Hist.map; fun_prop
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: 7 project declarations, 10 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.