Alphabeta MathHow 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.
The mean-square density, or energy, of a vertex partition
Definition
Let have order . For vertex sets and partitions of , of into nonempty sets, define their pair energy by For a vertex partition of (-regular vertex partitions, equitable partitions, and refinement), its energy, or mean-square density, is using the ordered-pair density of Edge counts and densities between nonempty vertex sets. The empty partition of the null graph has energy .
Depends on
Used by
- A prescribed finite vertex partition has a bounded ε-regular refinement, equitable when the initial partition is equitable Corollary
- The trivial partition has energy d(G)², while the singleton partition records every adjacency Example
- A small energy increment makes fine-pair densities close to their coarse densities almost everywhere Lemma
- An irregularity witness raises the pair energy by more than ε⁴|X||Y|/n² Lemma
- Energy lies in [0,1] and cannot decrease under refinement Lemma
- Szemerédi regularity lemma with an equitable partition and an explicit tower-type upper bound for graphs of order at least m₀ Theorem
Dependency tree · two levels
5 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- Y. Zhao, Graph Theory and Additive Combinatorics, Definition 2.1.10 (standard reference, not scraped)
- D. Conlon and J. Fox, Graph removal lemmas, sec. 2.1 (standard reference, not scraped)