Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§2, p. 4, Case 4 — t(N+1,k)−t(N,k)=N−⌊N/k⌋t(N+1,k)-t(N,k)=N-\lfloor N/k\rfloort(N+1,k)−t(N,k)=N−⌊N/k⌋ is non-decreasing in NNN with steps at most 111

Proved
TuranMatching.Clique.turan_increment

by mikedeng1 · Oct 8, 2026 · Mathlib 0df444a (Lean v4.33.1)

extremal-graph-theorymatching-numberp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1turan-number

Let k≥1k\ge1k≥1 and N≥0N\ge0N≥0, and write Δ(N)=t(N+1,k)−t(N,k)\Delta(N)=t(N+1,k)-t(N,k)Δ(N)=t(N+1,k)−t(N,k). Then

  1. Δ(N)=N−⌊N/k⌋\Delta(N)=N-\lfloor N/k\rfloorΔ(N)=N−⌊N/k⌋, the total size of the largest k−1k-1k−1 classes of T(N,k)T(N,k)T(N,k);
  2. Δ(N)≤Δ(N+1)\Delta(N)\le\Delta(N+1)Δ(N)≤Δ(N+1);
  3. Δ(N+1)≤Δ(N)+1\Delta(N+1)\le\Delta(N)+1Δ(N+1)≤Δ(N)+1.

Equivalently, when the number of vertices decreases by one, Δ\DeltaΔ can only decrease, and by at most 111:

0 ≤ Δ(N+1)−Δ(N) ≤ 1.0\ \le\ \Delta(N+1)-\Delta(N)\ \le\ 1 .0 ≤ Δ(N+1)−Δ(N) ≤ 1.

This is the fact behind the discrete convexity of fff in Case 4.

Formalization Note The differences are computed in ℤ; ⌊N/k⌋\lfloor N/k\rfloor⌊N/k⌋ is natural division. The statement holds for every k≥1k\ge1k≥1; the paper uses it for k≥2k\ge2k≥2.

Preamble
import Mathlib
import Definitions.Def_TuranMatching_Clique_Setting

open Finset SimpleGraph
Formal statement
namespace TuranMatching.Clique

theorem turan_increment (k : ℕ) (hk : 1 ≤ k) (N : ℕ) :
    ((turanNum (N + 1) k : ℤ) - turanNum N k = (N : ℤ) - (N / k : ℕ)) ∧
    ((turanNum (N + 1) k : ℤ) - turanNum N k ≤ (turanNum (N + 2) k : ℤ) - turanNum (N + 1) k) ∧
    ((turanNum (N + 2) k : ℤ) - turanNum (N + 1) k ≤ (turanNum (N + 1) k : ℤ) - turanNum N k + 1) := by sorry

end TuranMatching.Clique
Source
Alon and Frankl, Turán graphs with bounded matching number, arXiv:2210.15076v1, p. 4, Case 4 ("When b increases by 1, … by at most 1 …")
Human review
  • Endorsed by Shuze Chen · Oct 8, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 8, 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