Learning.IT.feedback_eq_eval_comp_hist
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.
feedback_eq_eval_comp_hist๐
Learning.IT.feedback_eq_eval_comp_histNo docstring.
Learning.IT.feedback_eq_eval_comp_hist.{u_1, u_2} {๐ : Type u_1} {๐จ : Type u_2} (n : โ) : feedback n = (fun x => Prod.snd (x โจn, โฏโฉ)) โ hist nLearning.IT.feedback_eq_eval_comp_hist.{u_1, u_2} {๐ : Type u_1} {๐จ : Type u_2} (n : โ) : feedback n = (fun x => Prod.snd (x โจn, โฏโฉ)) โ hist n
Code
lemma feedback_eq_eval_comp_hist (n : โ) :
feedback (๐Used by (1)
Actions: Source ยท Open Issue
Proof
๐) (๐จ := ๐จ) n = (fun x โฆ (x โจn, by simpโฉ).2) โ (hist n) := rfl
Dependency graph
Type dependencies (2)
feedback๐
Learning.IT.feedback
feedback n is the feedback at time n. This is a random variable on the measurable space
โ โ ๐ ร ๐จ.
Learning.IT.feedback.{u_1, u_2} {๐ : Type u_1} {๐จ : Type u_2} (n : โ) (h : โ โ ๐ ร ๐จ) : ๐จLearning.IT.feedback.{u_1, u_2} {๐ : Type u_1} {๐จ : Type u_2} (n : โ) (h : โ โ ๐ ร ๐จ) : ๐จ
Code
def feedback (n : โ) (h : โ โ ๐ ร ๐จ) : ๐จ := (h n).2
Used by (16)
Actions: Source ยท Open Issue
hist๐
Learning.IT.hist
hist n is the history up to time n. This is a random variable on the measurable space
โ โ ๐ ร ๐จ.
Learning.IT.hist.{u_1, u_2} {๐ : Type u_1} {๐จ : Type u_2} (n : โ) (h : โ โ ๐ ร ๐จ) : โฅ(Finset.Iic n) โ ๐ ร ๐จLearning.IT.hist.{u_1, u_2} {๐ : Type u_1} {๐จ : Type u_2} (n : โ) (h : โ โ ๐ ร ๐จ) : โฅ(Finset.Iic n) โ ๐ ร ๐จ
Code
def hist (n : โ) (h : โ โ ๐ ร ๐จ) : Iic n โ ๐ ร ๐จ := fun i โฆ h i
Used by (23)
Actions: Source ยท Open Issue