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

Regularity survives sufficiently small changes of vertices and cross-edges

Statement

Let 0<ϵ<ϵ′≤1. There is δ>0 with the following property. If (X,Y) is ϵ-regular, X′,Y′ are obtained by adding or deleting at most δ∣X∣ and δ∣Y∣ vertices respectively, and at most δ∣X∣∣Y∣ cross-edge incidences are changed, then (X′,Y′) is ϵ′-regular.

Facts & Assumptions

Given: Parameters and an edited pair as in the Statement.

[L1]

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

technique · contradiction
1.1givenchoose

Choose δ>0 so small that 2δ<ϵ′−ϵ, δ<1/2, and 20δ/ϵ2<ϵ′−ϵ.

2.1assume-contrastep 1.1algebra

Suppose, for contradiction, that A′⊆X′ and B′⊆Y′ witness failure of ϵ′-regularity. Put A=A′∩X and B=B′∩Y. The vertex-change bounds and step 1.1 give ∣A∣≥ϵ∣X∣ and ∣B∣≥ϵ∣Y∣.

3.1step 1.1step 2.1algebra

Removing the added vertices and accounting for the changed incidences changes either the witness density or the full-pair density by at most 10δ/ϵ2; this follows by dividing at most the affected rows, columns, and δ∣X∣∣Y∣ changed incidences by the lower bounds ∣A′∣∣B′∣≥ϵ2(1−δ)2∣X∣∣Y∣.

4.1step 3.1L1algebra

Hence ∣d(A,B)−d(X,Y)∣>ϵ′−20δ/ϵ2>ϵ, contradicting [L1].

5.1step 4.1discharge-contradiction∎

The contradiction proves that every sufficiently small edit, in particular the chosen δ, leaves the pair ϵ′-regular.

Depends on

Used by

Dependency tree · two levels

2 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