Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicable
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.

Adjacency spectral expander — Definition 1.3

PDF p. 6: Definition 1.3; PDF p. 7: Definition 1.3 and continuation

Definition

Let G=(V,E) be a finite undirected graph with n=∣V∣>0 vertices and adjacency matrix A. Its entries Axy record adjacency, including any diagonal loop entries under the graph convention. Let J be the V×V all-ones matrix, and let d∗ and α be real parameters. The centered adjacency matrix is ΔA=A−(d∗/n)J. Its operator norm is ∥ΔA∥=sup⁡f≠0∥ΔAf∥2/∥f∥2, where f∈CV and ∥f∥2=(∑x∈V∣f(x)∣2)1/2.

The graph G is an (n,d∗,α)-expander if ∥ΔA∥≤αd∗, equivalently, if ∥A−(d∗/n)J∥≤αd∗. The reference parameter d∗ need not be the degree of every vertex; this definition does not require regularity.

Justification

The graph notation supplies the finite vertex set and adjacency matrix, with the stated diagonal convention (Adjacency, degrees, graph Laplacian, and spectral notation). Since n>0, the centered-matrix definition supplies the uniquely defined matrix ΔA=A−(d∗/n)J for each real d∗ (Centered graph matrices and reference degree). The operator norm is finite and well defined on this finite-dimensional vertex space (Loewner order, Hermitian inner product, and operator norm). Consequently the displayed inequality is a well-defined predicate, and its two forms agree by substitution. The inequality itself imposes any restrictions needed on the product αd∗; no positivity assumption is needed merely to define the predicate.

Source notes

The definition is attributed to Expander graphs are globally synchronizing, Definition 1.3. The article's subsequent regular-graph spectral characterization is stated separately.

Depends on

Used by · 31

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.

Sources