Learning.IT.step_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.
step_eq_eval_comp_hist๐
Learning.IT.step_eq_eval_comp_histNo docstring.
Learning.IT.step_eq_eval_comp_hist.{u_1, u_2} {๐ : Type u_1} {๐จ : Type u_2} (n : โ) : step n = (fun x => x โจn, โฏโฉ) โ hist nLearning.IT.step_eq_eval_comp_hist.{u_1, u_2} {๐ : Type u_1} {๐จ : Type u_2} (n : โ) : step n = (fun x => x โจn, โฏโฉ) โ hist n
Code
lemma step_eq_eval_comp_hist (n : โ) :
step (๐Used by (1)
Actions: Source ยท Open Issue
Proof
๐) (๐จ := ๐จ) n = (fun x โฆ x โจn, by simpโฉ) โ (hist n) := rfl
Dependency graph
Type dependencies (2)
step๐
Learning.IT.step
Action and feedback at step n.
Learning.IT.step.{u_1, u_2} {๐ : Type u_1} {๐จ : Type u_2} (n : โ) (h : โ โ ๐ ร ๐จ) : ๐ ร ๐จLearning.IT.step.{u_1, u_2} {๐ : Type u_1} {๐จ : Type u_2} (n : โ) (h : โ โ ๐ ร ๐จ) : ๐ ร ๐จ
Code
def step (n : โ) (h : โ โ ๐ ร ๐จ) : ๐ ร ๐จ := h n
Used by (13)
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