LeanMachineLearning

MeasureTheory.measurable_sum_range_of_le๐Ÿ”—

Lemma

No docstring.

๐Ÿ”—theorem
MeasureTheory.measurable_sum_range_of_le.{u_1} {ฮฑ : Type u_1} {mฮฑ : MeasurableSpace ฮฑ} {f : โ„• โ†’ ฮฑ โ†’ โ„} {g : ฮฑ โ†’ โ„•} {n : โ„•} (hg_le : โˆ€ (a : ฮฑ), g a โ‰ค n) (hf : โˆ€ (i : โ„•), Measurable (f i)) (hg : Measurable g) : Measurable fun a => โˆ‘ i โˆˆ Finset.range (g a), f i a
MeasureTheory.measurable_sum_range_of_le.{u_1} {ฮฑ : Type u_1} {mฮฑ : MeasurableSpace ฮฑ} {f : โ„• โ†’ ฮฑ โ†’ โ„} {g : ฮฑ โ†’ โ„•} {n : โ„•} (hg_le : โˆ€ (a : ฮฑ), g a โ‰ค n) (hf : โˆ€ (i : โ„•), Measurable (f i)) (hg : Measurable g) : Measurable fun a => โˆ‘ i โˆˆ Finset.range (g a), f i a

Code

lemma measurable_sum_range_of_le {f : โ„• โ†’ ฮฑ โ†’ โ„} {g : ฮฑ โ†’ โ„•} {n : โ„•}
    (hg_le : โˆ€ a, g a โ‰ค n) (hf : โˆ€ i, Measurable (f i)) (hg : Measurable g) :
    Measurable (fun a โ†ฆ โˆ‘ i โˆˆ range (g a), f i a)
Proof
by
  have h_eq : (fun a โ†ฆ โˆ‘ i โˆˆ range (g a), f i a)
      = fun a โ†ฆ โˆ‘ i โˆˆ range (n + 1), if g a = i then โˆ‘ j โˆˆ range i, f j a else 0 := by
    ext ฯ‰
    rw [sum_ite_eq_of_mem]
    grind
  rw [h_eq]
  refine measurable_sum _ fun n hn โ†ฆ ?_
  refine Measurable.ite ?_ (by fun_prop) (by fun_prop)
  exact (measurableSet_singleton _).preimage (by fun_prop)

Actions: Source ยท Open Issue

Meaning last changed in v4.34.0-rc2-1-g439785b (2026-08-23).

Self-contained, with its dependencies inlined and proofs replaced by sorry: download the raw file ยท open it in the Lean web editor.

Dependency graph

Nothing to draw. Its statement rests on no other declaration in this project, and names nothing from a package left unaudited โ€” so the graph is this declaration alone. That is the answer, not a missing picture.

Audit surface: 0 project declarations, 11 external constants

โœ“ Proved: no sorry anywhere in its closure

This is the tool's own reading of one build's recorded axioms, and it is not robust against an author who wants it to pass. Checking meant to be relied on should go through Comparator, which replays the proof through the kernel from an export against an explicit list of permitted axioms.