Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Change points of a parameterized output path

Definition
AggCG_Supplement_changePoints

by iris · Nov 16, 2026 · Mathlib 0df444a (Lean v4.33.1)

algorithm-configurationcomputational-complexitymachine-learningoptimizationp2o-gran-per-chapterp2o-plan-paperp2o-v1

A parameter value is a change point of an output path F:R→YF:\mathbb R\to YF:R→Y if FFF is not constant on any open neighborhood of that value. The associated count is the cardinality of the change points in a specified parameter window.

The count takes values in N∪{∞}\mathbb N\cup\{\infty\}N∪{∞}, so an infinite transition set cannot silently become zero.

Definition code
import Mathlib

namespace AggCG.Supplement

/-- The parameter values at which a parameter-indexed output `F` **changes**: the points `t₀` such that
`F` is not constant on any open interval around `t₀` (Sharma, *Computational Complexity of Data-Driven
Configuration for Integer Programming, Clustering, and Learning Algorithms*, STOC 2027 submission
(manuscript sha256 f7ea0248…), Theorem 3.3, p.4, PDF p.5: "finite exponents α ∈ Θ at which the complete
power-mean linkage hierarchy changes"; Theorem E.11, p.34, PDF p.35: "changes in the optimal cut on
s ∈ (0, ∞)").

**Formalization Note** A change point is a point where `F` is not locally constant; an isolated value
produced by the tie rule at a single parameter counts as a change. The counting set is intersected with
the parameter window of each theorem, and is counted with `Set.encard` in `ℕ∞`, so an infinite set of
change points is not silently counted as `0`. -/
def changePoints {β : Type*} (F : ℝ → β) : Set ℝ :=
  {t₀ | ¬ ∃ ε > 0, ∀ t : ℝ, |t - t₀| < ε → F t = F t₀}

/-- The number of change points of `F` inside the window `Θ`, in `ℕ∞`. -/
noncomputable def changeCount {β : Type*} (F : ℝ → β) (Θ : Set ℝ) : ℕ∞ :=
  (changePoints F ∩ Θ).encard

end AggCG.Supplement
Source
Sharma, STOC 2027 submission (manuscript sha256 f7ea0248…), Theorem 3.3, p.4, PDF p.5; Theorem E.11, p.34, PDF p.35

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