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.
Regularity survives sufficiently small changes of vertices and cross-edges
Statement
Let . There is with the following property. If is -regular, are obtained by adding or deleting at most and vertices respectively, and at most cross-edge incidences are changed, then is -regular.
Facts & Assumptions
Given: Parameters and an edited pair as in the Statement.
In an -regular pair, every subpair meeting the relative-size thresholds has density within of the original density (-regular pairs and self-regular vertex sets).
Proof
Choose so small that , , and .
Suppose, for contradiction, that and witness failure of -regularity. Put and . The vertex-change bounds and step 1.1 give and .
Removing the added vertices and accounting for the changed incidences changes either the witness density or the full-pair density by at most ; this follows by dividing at most the affected rows, columns, and changed incidences by the lower bounds .
Hence , contradicting [L1].
The contradiction proves that every sufficiently small edit, in particular the chosen , leaves the pair -regular.
Depends on
Used by
Dependency tree · next 3 levels
Direct dependencies and their dependencies through the next three levels: 4 results over 4 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, Exercise 2.1.6 (standard reference, not scraped)