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.
Uniform two-sided expansion sufficient for global synchrony
Statement
Fix , and let be the constants in the positive-degree-envelope lemma. For all sufficiently large , uniformly over with , the graph is an -expander with probability at least where is the constant of the uniform-centered-adjacency lemma, , and . In particular , is fixed, and is bounded independently of .
Statement references
Facts & Assumptions
The norm failure probability is at most (Uniform small centered adjacency above logarithmic mean degree); the degree-envelope failure probability is at most (A positive minimum degree envelope at every fixed supercritical ratio). Their union obeys The finite union bound.
The exact centered matrices and expander predicate are those of Two-sided spectral expander — Definition 1.9; in particular, is real symmetric. For real , a real symmetric matrix of norm at most lies between and in Loewner order (Self-adjoint order, norm bounds and diagonal tests).
The graph law is the labelled loop-free independent-edge model of Erdős–Rényi random graph and high probability. Both probability estimates in [F1] apply to this same law.
The integral logarithm is unbounded above (The integral logarithm is unbounded above and below) and strictly increasing on (The integral logarithm is continuous and strictly increasing on (0,∞)), and for every (The integral logarithm L is the published natural logarithm).
Proof
Given: The graph parameters and constants in the Statement.
Goal: Establish the stated expander event and probability.
For any , [F4] gives an with . For every positive integer , monotonicity and identification give . Thus . Since and is fixed, uniformly over the admissible . Eventually , and , so both estimates in [F1] apply to [F3]. Outside the union of their failure events, all degrees are in and .
Write for the degree matrix. The definition yields the exact identity . The diagonal bounds and [F2] therefore imply By step 1.1 these imply , as required. This uses the actual loop-free degrees and centering, including the shift in .
Combining the adjacency and Laplacian conditions gives the declared expander event. The union bound in [F1] supplies its probability lower bound. The constants depend only on the fixed lower density ratio and not on the chosen sequence .
Depends on
- Uniform small centered adjacency above logarithmic mean degree
- A positive minimum degree envelope at every fixed supercritical ratio
- Two-sided spectral expander — Definition 1.9
- Self-adjoint order, norm bounds and diagonal tests
- The finite union bound
- The integral logarithm is unbounded above and below
- Erdős–Rényi random graph and high probability
- The integral logarithm is continuous and strictly increasing on (0,∞)
- The integral logarithm L is the published natural logarithm
Dependency tree · 2 levels
Each result is drawn at its shortest distance from this item. Arrows run from prerequisites to the items that use them; this item has a heavier outline. External source nodes link directly to the cited text. The view shows up to two dependency steps; open a prerequisite to continue.