Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

An event-free partition for finitely many event times

Proved
OpenGA.exists_event_free_partition

by Xinze-Li-Moqian · Sep 9, 2026 · Mathlib 0df444a (Lean v4.33.1)

bishop-gromovgeometric-analysispoincare-conjecturericci-flow

If a finite set of real event times is contained in (0,T)(0,T)(0,T) with T>0T>0T>0, there is a finite strictly increasing partition 0=t0<⋯<tn=T0=t_0<\cdots<t_n=T0=t0​<⋯<tn​=T, n>0n>0n>0, all of whose open subintervals contain no event.

Preamble
import Mathlib.MeasureTheory.Integral.IntervalIntegral.Basic
import Mathlib.MeasureTheory.Integral.Lebesgue.Add
import Mathlib.Data.Finset.Sort
import Mathlib.Data.Set.Finite.Basic
import Mathlib.Algebra.Order.Archimedean.Basic
import Mathlib.Algebra.Order.BigOperators.Group.Finset
import Mathlib.Tactic.Linarith

set_option autoImplicit false
open MeasureTheory Set Filter
open scoped ENNReal BigOperators Topology
Formal statement
theorem OpenGA.exists_event_free_partition {events : Set ℝ} {T : ℝ}
    (hfinite : events.Finite) (hinside : events ⊆ Ioo 0 T) (hT : 0 < T) :
    ∃ n : ℕ, 0 < n ∧ ∃ times : ℕ → ℝ,
      times 0 = 0 ∧ times n = T ∧
      (∀ i ≤ n, times i ∈ Icc 0 T) ∧
      (∀ i < n, times i < times (i + 1)) ∧
      (∀ i < n, Disjoint events (Ioo (times i) (times (i + 1)))) := by sorry
Source
OpenGA, OpenGALib/Analysis/FiniteEventPartition.lean. Analytic nonaccumulation mechanism: Kleiner-Lott Section 3.5, p. 13, https://arxiv.org/pdf/math/0605667v5#page=13; comparison of scales in Sublemma 79.23, p. 157.

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me