`BookProof.InverseTransform.seedSet_cover` (hp : ∀ i, 0 ≤ p i) (hsum : cdf p n = 1) : (⋃ k ∈ Finset.range n, seedSet p k) = Set.Ico (0 : ℝ) 1

Proved

BookProof.InverseTransform.seedSet_cover

by leonardopedro · Oct 9, 2026 · Mathlib 0df444a (Lean v4.33.1)

theoremstimepiece

Prove the following Lean 4 theorem from ChapterInverseTransform.

BookProof.InverseTransform.seedSet_cover (hp : ∀ i, 0 ≤ p i) (hsum : cdf p n = 1) : (⋃ k ∈ Finset.range n, seedSet p k) = Set.Ico (0 : ℝ) 1

Formalization note: Lean 4 identifier BookProof.InverseTransform.seedSet_cover.

Preamble

-- Generated from ChapterInverseTransform.lean — theorem BookProof.InverseTransform.seedSet_cover
import Mathlib
import Definitions.Def_ChapterInverseTransform
open BookProof.InverseTransform



open MeasureTheory Set Function

variable {n : ℕ} (p : ℕ → ℝ)

Formal statement

theorem BookProof.InverseTransform.seedSet_cover (hp : ∀ i, 0 ≤ p i) (hsum : cdf p n = 1) :
    (⋃ k ∈ Finset.range n, seedSet p k) = Set.Ico (0 : ℝ) 1 := by sorry

View graph