Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

The polynomial bound on Φ_d(m) (p. 57): Φ_d(m) = 2^m for m ≤ d, and Φ_d(m) ≤ (em/d)^d for m ≥ d ≥ 1

Proved
ComputationalLearning.phi_polynomial_bound

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

combinatoricsvc-dimension

p. 57. For m≤dm \le dm≤d, Φd(m)=2m\Phi_d(m) = 2^mΦd​(m)=2m. For m>dm > dm>d, since 0≤d/m≤10 \le d/m \le 10≤d/m≤1, (dm)dΦd(m)≤∑i=0d(mi)(dm)i≤(1+dm)m<ed\big(\tfrac{d}{m}\big)^d \Phi_d(m) \le \sum_{i=0}^{d}\binom{m}{i}\big(\tfrac{d}{m}\big)^i \le \big(1 + \tfrac{d}{m}\big)^m < e^d(md​)dΦd​(m)≤∑i=0d​(im​)(md​)i≤(1+md​)m<ed, so Φd(m)≤(emd)d=O(md)\Phi_d(m) \le \big(\tfrac{em}{d}\big)^d = O(m^d)Φd​(m)≤(dem​)d=O(md).

Formally: for all d,md, md,m: if m≤dm \le dm≤d then Φd(m)=2m\Phi_d(m) = 2^mΦd​(m)=2m; and if 1≤d≤m1 \le d \le m1≤d≤m then Φd(m)≤(em/d)d\Phi_d(m) \le (em/d)^dΦd​(m)≤(em/d)d (as real numbers; at m=dm = dm=d this is 2d≤ed2^d \le e^d2d≤ed).

Preamble
import Definitions.Def_ComputationalLearning_VC

open MeasureTheory
Formal statement
namespace ComputationalLearning

/-- **The polynomial bound on `Φ_d(m)`** (p. 57): for `m ≤ d`, `Φ_d(m) = 2^m`, and for `m ≥ d ≥ 1`,
`Φ_d(m) ≤ (em/d)^d = O(m^d)`. -/
theorem phi_polynomial_bound (d m : ℕ) :
    (m ≤ d → Phi d m = 2 ^ m) ∧
    (1 ≤ d → d ≤ m → (Phi d m : ℝ) ≤ (Real.exp 1 * m / d) ^ d) := 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 p. 57, the bound Φ_d(m) ≤ (em/d)^d = O(m^d)
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