Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedSession-authored (Fable 5 assisted)precheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 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.

Equitable strong regularity lemma: a very regular refinement that changes energy only slightly

Statement

Let ϵ0ϵ1ϵ2>0 and let m01. There is M=M((ϵi),m0) such that every finite graph G with V(G)m0 has equitable partitions P,Q satisfying

  1. Q refines P;
  2. P is ϵ0-regular;
  3. Q is ϵP-regular;
  4. q(Q)q(P)+ϵ0; and
  5. m0P and QM.

Facts & Assumptions

Given: A nonincreasing positive sequence (ϵi)i0, an integer m01, and a finite graph G of order nm0.

[L1]

For every 0<ϵ<1 and k01 there is K(ϵ,k0) such that every partition into at most k0 nonempty parts has an ϵ-regular refinement into at most K parts, which may be chosen equitable when the given partition is equitable (A prescribed finite vertex partition has a bounded ϵ-regular refinement, equitable when the initial partition is equitable).

[L2]

For every 0<ϵ<1 and m01 there is M0(ϵ,m0) such that every graph of order at least M0 has an equitable ϵ-regular partition into k parts with m0kM0 (Szemerédi regularity lemma with an equitable partition and an explicit tower-type upper bound for graphs of order at least m0).

[L3]

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

[L4]

An equitable partition has part sizes differing by at most one, and a partition is ϵ-regular when its irregular ordered pairs carry total weight at most ϵn2 (ϵ-regular vertex partitions, equitable partitions, and refinement).

[L5]

(X,Y) is ϵ-regular when every AX and BY with AϵX and BϵY satisfies d(A,B)d(X,Y)ϵ (ϵ-regular pairs and self-regular vertex sets).

Proof

technique · direct
1.1

If ϵϵ then every ϵ-regular pair is ϵ-regular, because the subsets tested at parameter ϵ are among those tested at ϵ; by [L4] the same monotonicity passes to partitions. So replacing each ϵi by min(ϵi,1/2) keeps the sequence positive and nonincreasing and only strengthens every conclusion, and we may assume ϵi<1 for all i. Let M0=M0(ϵ0,m0) be the constant of [L2].

givenL2L4L5choose
2.1

Small graphs. Suppose m0n<M0 and let P=Q be the partition of V(G) into singletons. It refines itself, is equitable, and has nm0 parts. The only subset of a singleton of size at least ϵ times its size is the singleton itself, so by [L5] every pair of singletons is ϵ-regular for every ϵ>0, giving conclusions 2 and 3; and q(Q)=q(P) gives conclusion 4.

step 1.1L4L5
2.2

Large graphs. Suppose nM0. Use [L2] to choose an equitable ϵ0-regular partition P0 with m0P0M0. Having constructed Pi, apply [L1] to Pi with parameter ϵPi to choose an equitable refinement Pi+1 that is ϵPi-regular.

step 1.1L1L2inductionchoose
3.1

Each part count is bounded by a function of the preceding one and the fixed sequence, so for every fixed number of stages all Pi are bounded independently of G. A refinement has at least as many parts as the partition it refines, so PiP0m0 for every i.

step 2.2L1induction
3.2

Set R=1/ϵ0+1. If q(Pi+1)>q(Pi)+ϵ0 for every i<R, telescoping would give q(PR)>1, contrary to [L3]. Hence some i<R satisfies q(Pi+1)q(Pi)+ϵ0; put P=Pi and Q=Pi+1.

step 2.2L3algebrachoose
4.1

Step 2.2 supplies refinement, equitability, and ϵP-regularity of Q. Also P is ϵ0-regular: this holds for P0 by construction, and every later Pi is ϵPi1-regular with ϵPi1ϵ0, which gives ϵ0-regularity by step 1.1. Step 3.1 gives Pm0 and step 3.2 the energy bound.

step 1.1step 2.2step 3.1step 3.2algebra
5.1

Let M be the largest of M0 and the recursively obtained part-count bounds through stage R. Step 2.1 settles n<M0 and steps 3.1 and 4.1 settle nM0, so in both cases QM and all five conclusions hold.

step 2.1step 3.1step 4.1

Depends on

Used by

Dependency tree · next 3 levels

Direct dependencies and their dependencies through the next three levels: 15 results over 9 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