Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 3.1 (Sauer): if VCD(C) ≤ d then Π_C(m) ≤ Φ_d(m) for every m

Proved
ComputationalLearning.sauer_lemma

by naimengye · Sep 24, 2026 · Mathlib 0df444a (Lean v4.33.1)

combinatoricssauer-lemmavc-dimension

Lemma 3.1. If VCD(C)=d\mathrm{VCD}(C) = dVCD(C)=d, then for any mmm, ΠC(m)≤Φd(m)\Pi_C(m) \le \Phi_d(m)ΠC​(m)≤Φd​(m).

Formally: for every concept class CCC with vcDim(C)≤d\mathrm{vcDim}(C) \le dvcDim(C)≤d and every mmm, ΠC(m)≤Φd(m)\Pi_C(m) \le \Phi_d(m)ΠC​(m)≤Φd​(m), where ΠC(m)\Pi_C(m)ΠC​(m) is the maximum number of dichotomies realized on a set of mmm points and Φd\Phi_dΦd​ is defined by the recurrence of Definition 11.

Preamble
import Definitions.Def_ComputationalLearning_VC

open MeasureTheory
Formal statement
namespace ComputationalLearning

/-- **Lemma 3.1** (p. 55, Sauer's lemma). If `VCD(C) = d`, then for any `m`, `Π_C(m) ≤ Φ_d(m)`.
Stated for every class of VC dimension at most `d`. -/
theorem sauer_lemma {X : Type*} [MeasurableSpace X] (C : Set (X → Bool)) (d : ℕ)
    (hd : vcDim C ≤ d) (m : ℕ) :
    growth C m ≤ Phi d m := by sorry

end ComputationalLearning
Source
Kearns and Vazirani, An Introduction to Computational Learning Theory, MIT Press 1994, doi:10.7551/mitpress/3897.001.0001, §3.4 pp. 55-56, Lemma 3.1 with its proof (induction on d and m through the class C')
Human review
  • Endorsed by Shuze Chen · Sep 25, 2026

    Confirmed by the moderator at approval.

  • Endorsed by naimengye · Sep 25, 2026

    Confirmed by the mission captain (proposal self-audit).

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