Learning.measurable_history
This page has the declaration's own card below, then its dependency graph, then a card for each dependency (type dependencies first, then the rest of the transitive closure). For a theorem, the graph and the dependency cards only follow its statement's dependencies (its proof is replaced by sorry, so what it proves doesn't depend on how); for everything else, both the type and the body/value are followed, since their content is part of what later declarations build on.
measurable_history๐
Learning.measurable_historyNo docstring.
Learning.measurable_history.{u_1, u_2, u_3} {๐ : Type u_1} {๐จ : Type u_2} {ฮฉ : Type u_3} {m๐ : MeasurableSpace ๐} {m๐จ : MeasurableSpace ๐จ} {mฮฉ : MeasurableSpace ฮฉ} {A : โ โ ฮฉ โ ๐} {Y : โ โ ฮฉ โ ๐จ} (hA : โ (n : โ), Measurable (A n)) (hY : โ (n : โ), Measurable (Y n)) (n : โ) : Measurable (history A Y n)Learning.measurable_history.{u_1, u_2, u_3} {๐ : Type u_1} {๐จ : Type u_2} {ฮฉ : Type u_3} {m๐ : MeasurableSpace ๐} {m๐จ : MeasurableSpace ๐จ} {mฮฉ : MeasurableSpace ฮฉ} {A : โ โ ฮฉ โ ๐} {Y : โ โ ฮฉ โ ๐จ} (hA : โ (n : โ), Measurable (A n)) (hY : โ (n : โ), Measurable (Y n)) (n : โ) : Measurable (history A Y n)
Code
lemma measurable_history (hA : โ n, Measurable (A n))
(hY : โ n, Measurable (Y n)) (n : โ) :
Measurable (history A Y n)Type uses (1)
Used by (10)
Actions: Source ยท Open Issue
Proof
by unfold history fun_prop
Dependency graph
Type dependencies (1)
history๐
Learning.history
History of the algorithm-environment sequence up to time n.
Learning.history.{u_1, u_2, u_3} {๐ : Type u_1} {๐จ : Type u_2} {ฮฉ : Type u_3} (A : โ โ ฮฉ โ ๐) (Y : โ โ ฮฉ โ ๐จ) (n : โ) (ฯ : ฮฉ) : โฅ(Finset.Iic n) โ ๐ ร ๐จLearning.history.{u_1, u_2, u_3} {๐ : Type u_1} {๐จ : Type u_2} {ฮฉ : Type u_3} (A : โ โ ฮฉ โ ๐) (Y : โ โ ฮฉ โ ๐จ) (n : โ) (ฯ : ฮฉ) : โฅ(Finset.Iic n) โ ๐ ร ๐จ
Code
def history (A : โ โ ฮฉ โ ๐) (Y : โ โ ฮฉ โ ๐จ) (n : โ) (ฯ : ฮฉ) : Iic n โ ๐ ร ๐จ := fun i โฆ (A i ฯ, Y i ฯ)
Actions: Source ยท Open Issue