`Learning.pullCount_eq_sum`🔗

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

`pullCount_eq_sum`🔗

LemmaLearning.pullCount_eq_sum

Details

No docstring.

theorem

Learning.pullCount_eq_sum.{u_1, u_3} {𝓐 : Type u_1} {Ω : Type u_3}
  [DecidableEq 𝓐] {A : ℕ → Ω → 𝓐} (a : 𝓐) (t : ℕ) (ω : Ω) :
  pullCount A a t ω = ∑ s ∈ Finset.range t, if A s ω = a then 1 else 0
Learning.pullCount_eq_sum.{u_1, u_3}
  {𝓐 : Type u_1} {Ω : Type u_3}
  [DecidableEq 𝓐] {A : ℕ → Ω → 𝓐} (a : 𝓐)
  (t : ℕ) (ω : Ω) :
  pullCount A a t ω =
    ∑ s ∈ Finset.range t,
      if A s ω = a then 1 else 0

Code

lemma pullCount_eq_sum (a : 𝓐) (t : ℕ) (ω : Ω) :
    pullCount A a t ω = ∑ s ∈ range t, if A s ω = a then 1 else 0

Type uses (1)

pullCount

Used by (8)

Actions: Source · Open Issue

Proof

by simp [pullCount]

Dependency graph

Type dependencies (1)

`pullCount`🔗

DefinitionLearning.pullCount

Details

Number of times action a was chosen up to time t (excluding t).

def

Learning.pullCount.{u_1, u_3} {𝓐 : Type u_1} {Ω : Type u_3}
  [DecidableEq 𝓐] (A : ℕ → Ω → 𝓐) (a : 𝓐) (t : ℕ) (ω : Ω) : ℕ
Learning.pullCount.{u_1, u_3}
  {𝓐 : Type u_1} {Ω : Type u_3}
  [DecidableEq 𝓐] (A : ℕ → Ω → 𝓐) (a : 𝓐)
  (t : ℕ) (ω : Ω) : ℕ

Code

noncomputable
def pullCount (A : ℕ → Ω → 𝓐) (a : 𝓐) (t : ℕ) (ω : Ω) : ℕ :=
  #(filter (fun s ↦ A s ω = a) (range t))

Used by (146)

Actions: Source · Open Issue

Learning.pullCount_eq_sum🔗

pullCount_eq_sum🔗

pullCount🔗

`Learning.pullCount_eq_sum`🔗

`pullCount_eq_sum`🔗

`pullCount`🔗