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
Statement
Let and let . Define Every graph of order has an equitable -regular vertex partition into parts with In particular, the displayed recurrence is a tower-type upper bound depending only on and .
Facts & Assumptions
Given: Parameters and a graph as in the Statement.
A non--regular -part partition has a refinement of at most parts whose energy gains more than (Every nonregular -part partition has a refinement with energy gain greater than and at most parts).
Partition energy lies in and is nondecreasing under refinement (Energy lies in and cannot decrease under refinement).
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).
, a sum over ordered pairs of parts with nonnegative weights and densities in (The mean-square density, or energy, of a vertex partition).
Proof
Each factor is at least , so . Choose an equitable partition of into exactly nonempty parts, whose sizes are then or ; this is possible because .
Equitisation. Let be equitable with parts, let refine with at most parts, put , and suppose . Order so that each part of is an interval and each cell of is an interval inside its part, and cut each part into consecutive pieces of sizes or . Writing and , every piece has size or , because forces and . So the resulting is an equitable refinement of with exactly parts.
Call a piece dirty when it is not contained in a single cell of , and let be the union of the dirty pieces. A piece is dirty exactly when it contains a boundary between two consecutive -cells of the same part, and each of the at most such boundaries lies in one piece, so there are at most dirty pieces. Each has size at most , using and . Hence .
Energy loss. Let be the common refinement of and . It refines , so by [L2]. Every piece outside lies in one -cell and is therefore itself a cell of , 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 , and those pairs carry total weight at most ; since each squared density lies in , their contribution to each of and lies in . Hence .
One round. Suppose is equitable, refines , has parts with , and is not -regular. Apply [L1] to obtain a refinement with at most parts and , and let be the partition step 1.2 builds from and with . Its hypothesis holds because makes . So is equitable, refines and hence , has parts with , and step 3.1 gives .
If none of were -regular, iterating step 4.1 would produce with , contradicting the bound of [L2].
Hence some with is -regular, and step 4.1 makes it equitable with parts satisfying . That is the asserted partition.
Depends on
- Every nonregular $k$-part partition has a refinement with energy gain greater than $\epsilon^5$ and at most $k2^{k+1}$ parts
- Energy lies in $[0,1]$ and cannot decrease under refinement
- $\epsilon$-regular vertex partitions, equitable partitions, and refinement
- The mean-square density, or energy, of a vertex partition
Used by
- Ordinary regularity gives tower upper bounds; strong regularity gives wowzer upper bounds only when the regularity sequence depends on the coarse part count Remark
- Equitable strong regularity lemma: a very regular refinement that changes energy only slightly Theorem
- Every finite graph has a linearly large ε-self-regular vertex subset Theorem
- Graph removal lemma for a fixed ordinary subgraph Theorem
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
- Y. Zhao, Graph Theory and Additive Combinatorics, Theorem 2.1.20 (standard reference, not scraped)
- D. Conlon and J. Fox, Graph removal lemmas, sec. 2.1 (standard reference, not scraped)