Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§2, p. 4, Case 4 — f(b)=t(2s−b+1,k)+b(n−2s+b−1)f(b)=t(2s-b+1,k)+b(n-2s+b-1)f(b)=t(2s−b+1,k)+b(n−2s+b−1) has strictly increasing differences

Proved
TuranMatching.Clique.f_discrete_convex

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≥2k\ge2k≥2, n≥2s+1n\ge2s+1n≥2s+1, and

f(b)=t(2s−b+1,k)+b (n−2s+b−1).f(b)=t(2s-b+1,k)+b\,(n-2s+b-1).f(b)=t(2s−b+1,k)+b(n−2s+b−1).

For every bbb with b+2≤s−⌊s/(k−1)⌋b+2\le s-\lfloor s/(k-1)\rfloorb+2≤s−⌊s/(k−1)⌋ (so that bbb, b+1b+1b+1 and b+2b+2b+2 all lie in the range of Case 4),

f(b+1)−f(b) < f(b+2)−f(b+1).f(b+1)-f(b)\ <\ f(b+2)-f(b+1).f(b+1)−f(b) < f(b+2)−f(b+1).

So fff is discretely convex on the range of Case 4, and its maximum over that range is attained at an endpoint.

Formalization Note fff is integer-valued (fCase4), with 2s−b+12s-b+12s−b+1 a natural subtraction that is exact on the range. "Increasing" is taken strictly, as the linear part grows by 222 and the Turán bracket shrinks by at most 111. The paper says "every kkk"; the restriction k≥2k\ge2k≥2 is needed because G(n,k,s)G(n,k,s)G(n,k,s) has k−1k-1k−1 classes of total size sss, which is impossible for k=1k=1k=1 and s>0s>0s>0, and no graph on n≥1n\ge1n≥1 vertices has clique number at most 000.

Preamble
import Mathlib
import Definitions.Def_TuranMatching_Clique_Setting

open Finset SimpleGraph
Formal statement
namespace TuranMatching.Clique

theorem f_discrete_convex (n k s b : ℕ) (hk : 2 ≤ k) (hn : 2 * s + 1 ≤ n)
    (hb : b + 2 ≤ s - s / (k - 1)) :
    fCase4 n k s (b + 1) - fCase4 n k s b < fCase4 n k s (b + 2) - fCase4 n k s (b + 1) := by sorry

end TuranMatching.Clique
Source
Alon and Frankl, Turán graphs with bounded matching number, arXiv:2210.15076v1, p. 4, Case 4 (definition of f and "f(b + 1) − f(b) is an increasing function of b")
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