Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck 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.

Every nonregular k-part partition has a refinement with energy gain greater than ϵ5 and at most k2k+1 parts

Statement

Let 0<ϵ<1. If a partition P of a nonempty graph is not ϵ-regular and has k nonempty parts, then it has a refinement Q with at most k2k+1 parts and q(Q)>q(P)+ϵ5.

Facts & Assumptions

Given: A non-ϵ-regular k-part partition P.

[L1]

Nonregularity means that the ordered irregular pairs (X,Y)∈P2 have total weight ∑∣X∣∣Y∣>ϵn2 (ϵ-regular vertex partitions, equitable partitions, and refinement).

[L2]

Splitting an irregular pair by witness sets raises its contribution to energy by more than ϵ4∣X∣∣Y∣/n2 (An irregularity witness raises the pair energy by more than ϵ4∣X∣∣Y∣/n2).

[L3]

Further refinement cannot reduce energy (Energy lies in [0,1] and cannot decrease under refinement).

Proof

technique · direct
1.1givenL1choose

For each ordered irregular pair (X,Y) choose witness sets AXY⊆X and BXY⊆Y.

2.1step 1.1algebra

For each X∈P, refine X by all witness subsets that occur in X, whether as a first or a second coordinate. There are at most 2k such subsets, and the common refinement they generate has at most 22k cells. By choosing one witness orientation for each unordered pair and retaining the two diagonal witnesses separately, the same construction uses at most k+1 subsets per part and hence at most 2k+1 cells. Thus the resulting partition Q has at most k2k+1 parts.

3.1step 2.1L2L3

For every selected irregular ordered pair, the restriction of Q to its two old parts refines the witness split. By [L2] and [L3], its contribution gains more than ϵ4∣X∣∣Y∣/n2; all other old-pair contributions are nondecreasing.

4.1step 3.1L1algebra∎

Although only one orientation of each off-diagonal irregular pair supplied witness sets in step 2.1, that single split refines both old parts, so step 3.1 applies to both ordered pairs (X,Y) and (Y,X), which carry equal weight ∣X∣∣Y∣/n2 and equal regularity status. Summing the gains over all ordered irregular pairs therefore recovers the full normalized irregular weight, and by [L1] the total gain is greater than ϵ4ϵ=ϵ5.

Depends on

Used by

Dependency tree · two levels

6 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