LeanMachineLearning exposition

Learning.IT.measurable_action🔗

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.

Minimal Lean file

measurable_action🔗

LemmaLearning.IT.measurable_action
Details

No docstring.

🔗theorem
Learning.IT.measurable_action.{u_1, u_2} {𝓐 : Type u_1} {𝓨 : Type u_2}
  {m𝓐 : MeasurableSpace 𝓐} {m𝓨 : MeasurableSpace 𝓨} (n : ℕ) :
  Measurable (action n)
Learning.IT.measurable_action.{u_1, u_2}
  {𝓐 : Type u_1} {𝓨 : Type u_2}
  {m𝓐 : MeasurableSpace 𝓐}
  {m𝓨 : MeasurableSpace 𝓨} (n : ℕ) :
  Measurable (action n)

Code

lemma measurable_action (n : ℕ) : Measurable (action n (𝓐
Type uses (1)
Used by (14)

Actions: Source · Open Issue

Proof
𝓐) (𝓨 := 𝓨)) := by
  unfold action; fun_prop

Dependency graph

Type dependencies (1)

action🔗

DefinitionLearning.IT.action
Details

action n is the action pulled at time n. This is a random variable on the measurable space ℕ → 𝓐 × 𝓨.

🔗def
Learning.IT.action.{u_1, u_2} {𝓐 : Type u_1} {𝓨 : Type u_2} (n : ℕ)
  (h : ℕ → 𝓐 × 𝓨) : 𝓐
Learning.IT.action.{u_1, u_2}
  {𝓐 : Type u_1} {𝓨 : Type u_2} (n : ℕ)
  (h : ℕ → 𝓐 × 𝓨) : 𝓐

Code

def action (n : ℕ) (h : ℕ → 𝓐 × 𝓨) : 𝓐 := (h n).1
Used by (31)

Actions: Source · Open Issue