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.
Self-adjoint order, norm bounds and diagonal tests
Statement
Let be a finite set and let matrices act on with the vertex inner product and induced norm of Finite vertex Hilbert space in the article convention. A matrix is Hermitian, or self-adjoint, when , where is its conjugate transpose. A Hermitian matrix is positive semidefinite if for every . For Hermitian matrices of the same size, write when is positive semidefinite. Let be the identity matrix and let denote the induced operator norm.
For every real symmetric matrix and real , if and only if . If is Hermitian and for real , then for every . Order inequalities can be added: and imply . They can also be restricted to a subspace : implies for every . Equivalently, their compressions to are ordered, where the compression of is the map and is orthogonal projection onto . None of these statements requires a graph to be regular.
Facts & Assumptions
The vertex space has inner product , and conjugate transpose represents the adjoint. A self-adjoint matrix has real quadratic values in this convention (Finite vertex Hilbert space in the article convention).
A normal endomorphism of a finite-dimensional complex inner product space has an orthonormal eigenbasis (Complex spectral theorem: a normal endomorphism of a finite-dimensional complex inner product space has an orthonormal eigenbasis, and conversely).
The operator norm is zero on the zero space and otherwise is the maximum of over unit vectors (The operator norm is zero on the zero domain and otherwise is max_‖ v‖=1‖ Tv‖).
For a subspace of a finite-dimensional inner product space, every has a unique decomposition with and orthogonal to every vector of ; this defines orthogonal projection (The orthogonal projection P_Wv is the W-component in V=W⊕ W^⊥). Orthogonality is unchanged by the convention transfer in [F1].
Proof
Given: A finite set , Hermitian matrices of the indicated sizes, and real bounds as in the statement.
Goal: Prove the norm-order equivalence, diagonal bounds, addition and restriction rules.
A Hermitian matrix is normal because . By [F2] and the convention transfer in [F1], it has an orthonormal eigenbasis . Each eigenvalue is real: is real by [F1]. For , orthonormality gives and . Thus, when , [F3] gives : the upper bound follows from the latter sum for unit , and an eigenvector attaining the maximum gives equality.
For each , let be the function equal to at and elsewhere. By [F1], and . Testing and at proves .
If and , their defining quadratic forms are nonnegative, and their sum is the quadratic form of ; this proves addition. Restriction follows by testing the original inequality only on vectors .
The vertex space is finite-dimensional by [F1], so [F4] applies to every subspace , with the same orthogonality in the article convention. For and scalars , the vector belongs to , and its difference from is orthogonal to : pairing with any gives a linear combination of two zero pairings. Uniqueness in [F4] therefore gives , so is linear. For , the orthogonality of gives .
For real symmetric , [F1] makes Hermitian. By step 1.1, is equivalent, for , to for all . The displayed quadratic-form formula in step 1.1 shows that these inequalities imply and for every . Conversely, testing those two forms at each gives . Hence the two matrix-order inequalities are equivalent to the norm bound. If is empty, the norm is zero by [F3] and both quadratic-form inequalities hold on the zero space, so the equivalence also holds.
For Hermitian and , step 1.4 and conjugate symmetry give . Thus the linear compression is self-adjoint on . Therefore , and the same holds for . The order of the compressions is consequently equivalent to the restricted quadratic-form inequality in step 1.3, including . These arguments involve only matrices and the stated inner product, so no graph regularity assumption is used. This proves all assertions.
Depends on
- Finite vertex Hilbert space in the article convention
- Complex spectral theorem: a normal endomorphism of a finite-dimensional complex inner product space has an orthonormal eigenbasis, and conversely
- The operator norm is zero on the zero domain and otherwise is max_‖ v‖=1‖ Tv‖
- The orthogonal projection P_Wv is the W-component in V=W⊕ W^⊥
Used by · 16
- Loewner order, Hermitian inner product, and operator norm
- Regular adjacency expansion supplies two-sided expansion
- Degree bounds from two-sided expansion — Lemma 3.1
- Degree control implies two-sided expansion — Proposition 3.2
- Failure of symmetric Laplacian control near threshold
- Cheeger lower bound — Remark 3.5
- An explicit eight-phase weighted stability certificate
- Transverse positivity for the special spinning family
- Expected extreme eigenvalues from finite Gaussian comparison
- Even trace moments transfer from the operator norm
- The unnormalized Laplacian needs its own degree deviation
- A negative adjacency eigenvalue survives all-ones centering
- Covariance under a common positive rescaling of weights
- Weighted spectral bounds control the degree without loops
- Normalized graph Laplacian and its nontrivial spectrum
- Uniform two-sided expansion sufficient for global synchrony
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.