Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedSession-authored (Fable 5 assisted)precheck passaudited 2026-08-16
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

Szemerédi regularity lemma with an equitable partition and an explicit tower-type upper bound for graphs of order at least m0

Statement

Let 0<ϵ<1 and let m01. Define mr+1=mrϵ52mr+5,R=2ϵ5,M=mR. Every graph G of order nM has an equitable ϵ-regular vertex partition into k parts with m0kM. In particular, the displayed recurrence is a tower-type upper bound depending only on ϵ and m0.

Facts & Assumptions

Given: Parameters ϵ,m0 and a graph G as in the Statement.

[L1]

A non-ϵ-regular k-part partition has a refinement of at most k2k+1 parts whose energy gains more than ϵ5 (Every nonregular k-part partition has a refinement with energy gain greater than ϵ5 and at most k2k+1 parts).

[L2]

Partition energy lies in [0,1] and is nondecreasing under refinement (Energy lies in [0,1] and cannot decrease under refinement).

[L3]

An equitable partition has part sizes differing by at most one, and regularity is measured by the total weight of its irregular ordered pairs (ϵ-regular vertex partitions, equitable partitions, and refinement).

[L4]

q(P)=n2A,BPABd(A,B)2, a sum over ordered pairs of parts with nonnegative weights AB/n2 and densities in [0,1] (The mean-square density, or energy, of a vertex partition).

Proof

technique · direct
1.1

Each factor ϵ52mr+5 is at least 1, so m0m1mR=Mn. Choose an equitable partition P0 of V(G) into exactly m0 nonempty parts, whose sizes are then n/m0 or n/m0; this is possible because nMm0.

givenL3algebrachoose
1.2

Equitisation. Let P be equitable with k parts, let R refine P with at most K=k2k+1 parts, put p=ϵ52k+5, and suppose kpn. Order V(G) so that each part of P is an interval and each cell of R is an interval inside its part, and cut each part X into p consecutive pieces of sizes X/p or X/p. Writing a=n/k and t=a/p1, every piece has size t or t+1, because X{a,a+1} forces X/pt and X/pt+1. So the resulting P is an equitable refinement of P with exactly kp parts.

givenL3algebraconstruct
2.1

Call a piece dirty when it is not contained in a single cell of R, and let D be the union of the dirty pieces. A piece is dirty exactly when it contains a boundary between two consecutive R-cells of the same part, and each of the at most Kk such boundaries lies in one piece, so there are at most K dirty pieces. Each has size at most X/p2X/p4n/(kp), using pX and Xn/k2n/k. Hence D4Kn/(kp)=2k+3n/pϵ5n/4.

step 1.2algebra
3.1

Energy loss. Let S be the common refinement of P and R. It refines R, so q(S)q(R) by [L2]. Every piece outside D lies in one R-cell and is therefore itself a cell of S, so in the sums of [L4] the two energies agree term by term on ordered pairs of such pieces. Every other ordered pair has an entry inside D, and those pairs carry total weight at most 2Dn/n2=2D/n; since each squared density lies in [0,1], their contribution to each of q(S) and q(P) lies in [0,2D/n]. Hence q(P)q(S)2D/nq(R)ϵ5/2.

step 2.1L2L4algebra
4.1

One round. Suppose Pr is equitable, refines P0, has kr parts with m0krmr, and is not ϵ-regular. Apply [L1] to obtain a refinement Rr with at most kr2kr+1 parts and q(Rr)>q(Pr)+ϵ5, and let Pr+1 be the partition step 1.2 builds from Pr and Rr with pr=ϵ52kr+5. Its hypothesis krprn holds because krmr makes krprmr+1Mn. So Pr+1 is equitable, refines Pr and hence P0, has kr+1=krpr parts with m0krkr+1mr+1, and step 3.1 gives q(Pr+1)>q(Pr)+ϵ5/2.

step 1.1step 1.2step 3.1L1induction
5.1

If none of P0,,PR1 were ϵ-regular, iterating step 4.1 would produce PR with q(PR)>q(P0)+Rϵ5/22ϵ5ϵ5/2=1, contradicting the bound q1 of [L2].

step 4.1L2inductionalgebra
6.1

Hence some Pr with r<R is ϵ-regular, and step 4.1 makes it equitable with kr parts satisfying m0krmrM. That is the asserted partition.

step 4.1step 5.1L3

Depends on

Used by

Dependency tree · next 3 levels

Direct dependencies and their dependencies through the next three levels: 13 results over 8 levels. An arrow runs from a result to what uses it, and this result sits at the bottom with a heavier outline. Click the chart to enlarge it.

Sources