Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Few common representatives for the floors of finitely many nondecreasing affine functions

Proved
OAI.Problem310.ScaleDiscretization.exists_affine_floor_representatives

by Shuze Chen · Oct 16, 2026 · Mathlib 0df444a (Lean v4.33.1)

combinatoricsoai-mathreal-analysis

Let ι\iotaι be a finite index set, let a≤ba\le ba≤b be real numbers, and let ui,vi∈Ru_i,v_i\in\mathbb{R}ui​,vi​∈R for i∈ιi\in\iotai∈ι, with vi≥0v_i\ge0vi​≥0 for every iii. Consider the nondecreasing affine functions t↦ui+vitt\mapsto u_i+v_itt↦ui​+vi​t on [a,b][a,b][a,b].

Theorem. There is a finite set R⊆[a,b]R\subseteq[a,b]R⊆[a,b] with

∣R∣≤1+∑i∈ι⌈vi(b−a)⌉|R|\le 1+\sum_{i\in\iota}\bigl\lceil v_i(b-a)\bigr\rceil∣R∣≤1+i∈ι∑​⌈vi​(b−a)⌉

such that for every t∈[a,b]t\in[a,b]t∈[a,b] there is t′∈Rt'\in Rt′∈R with ⌊ui+vit′⌋=⌊ui+vit⌋\lfloor u_i+v_it'\rfloor=\lfloor u_i+v_it\rfloor⌊ui​+vi​t′⌋=⌊ui​+vi​t⌋ simultaneously for all i∈ιi\in\iotai∈ι.

Thus the vector of integer parts (⌊ui+vit⌋)i∈ι\bigl(\lfloor u_i+v_it\rfloor\bigr)_{i\in\iota}(⌊ui​+vi​t⌋)i∈ι​ takes at most 1+∑i⌈vi(b−a)⌉1+\sum_i\lceil v_i(b-a)\rceil1+∑i​⌈vi​(b−a)⌉ values on [a,b][a,b][a,b], and each value is attained on a fixed finite subset of the interval. The bound depends only on the total displacements vi(b−a)v_i(b-a)vi​(b−a), not on the offsets uiu_iui​.

Formalization Note The bound is stated as (1 + ∑ i, ⌈v i * (b - a)⌉).toNat; since vi≥0v_i\ge0vi​≥0 and b≥ab\ge ab≥a, every ceiling is nonnegative, so the truncation at 000 is immaterial.

Preamble
import Mathlib
import Definitions.Def_DyadicAvoidance
import Definitions.Def_OAI_MeasureTheory_DyadicAvoidance_PeriodicBasic
import Definitions.Def_OAI_MeasureTheory_DyadicAvoidance_GridSeparation
import Definitions.Def_OAI_MeasureTheory_DyadicAvoidance_FiniteTableModel
import Definitions.Def_OAI_MeasureTheory_DyadicAvoidance_OrderedRouting
import Definitions.Def_OAI_MeasureTheory_DyadicAvoidance_RoutingPath
import Definitions.Def_OAI_MeasureTheory_DyadicAvoidance_CenterRouteExposure
import Definitions.Def_OAI_MeasureTheory_DyadicAvoidance_ExceptionalCenters
import Definitions.Def_OAI_MeasureTheory_DyadicAvoidance_CenterFailureBound
import Definitions.Def_OAI_MeasureTheory_DyadicAvoidance_FirstDefault
import Definitions.Def_OAI_MeasureTheory_DyadicAvoidance_ConcreteLabelMeasures
import Definitions.Def_OAI_MeasureTheory_DyadicAvoidance_CenterFirstDefault
import Definitions.Def_OAI_MeasureTheory_DyadicAvoidance_RandomSetDensity
import Definitions.Def_OAI_MeasureTheory_DyadicAvoidance_RoutedSetDensity
import Definitions.Def_OAI_MeasureTheory_DyadicAvoidance_RoutedExposure
import Definitions.Def_OAI_MeasureTheory_DyadicAvoidance_FirstDefaultSelection
import Definitions.Def_OAI_MeasureTheory_DyadicAvoidance_FiniteLocalPredicate
import Definitions.Def_OAI_MeasureTheory_DyadicAvoidance_WindowData
import Definitions.Def_OAI_MeasureTheory_DyadicAvoidance_WindowTableModel

open OAI OAI.Problem310
universe u_α u_ι
open scoped BigOperators
Formal statement
theorem OAI.Problem310.ScaleDiscretization.exists_affine_floor_representatives {ι : Type u_ι} [Fintype ι]
    (a b : ℝ) (hab : a ≤ b) (u v : ι → ℝ) (hv : ∀ i, 0 ≤ v i) :
    ∃ R : Finset ℝ,
      (∀ t ∈ R, t ∈ Set.Icc a b) ∧
      R.card ≤ (1 + ∑ i, ⌈v i * (b - a)⌉).toNat ∧
      ∀ t ∈ Set.Icc a b, ∃ t' ∈ R,
        ∀ i, ⌊u i + v i * t'⌋ = ⌊u i + v i * t⌋ := by sorry
Source
https://github.com/openai/math/blob/1581d4cbdd69a0faf34b2089614fe2a814316a6a/lean/OAI/MeasureTheory/DyadicAvoidance/MonotoneRepresentatives.lean#L76-L104

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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me