Alphabeta Math
PropositionStatement: AI-generatedProof: AI-generated
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 V be a finite set and let matrices act on CV with the vertex inner product and induced norm of Finite vertex Hilbert space in the article convention. A matrix B is Hermitian, or self-adjoint, when B=B∗, where B∗ is its conjugate transpose. A Hermitian matrix B is positive semidefinite if ⟨f,Bf⟩=f∗Bf≥0 for every f∈CV. For Hermitian matrices of the same size, write B⪯C when C−B is positive semidefinite. Let I be the identity matrix and let ∥B∥ denote the induced operator norm.

For every real symmetric matrix B and real b≥0, ∥B∥≤b if and only if −bI⪯B⪯bI. If B is Hermitian and aI⪯B⪯bI for real a,b, then a≤Bxx≤b for every x∈V. Order inequalities can be added: B⪯C and D⪯E imply B+D⪯C+E. They can also be restricted to a subspace W⊆CV: B⪯C implies ⟨w,Bw⟩≤⟨w,Cw⟩ for every w∈W. Equivalently, their compressions to W are ordered, where the compression of B is the map w↦PWBw and PW is orthogonal projection onto W. None of these statements requires a graph to be regular.

Facts & Assumptions

[F1]

The vertex space has inner product ⟨f,g⟩=∑x∈Vf(x)‾g(x), 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).

[F2]

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).

[F3]

The operator norm is zero on the zero space and otherwise is the maximum of ∥Bf∥2 over unit vectors f (The operator norm is zero on the zero domain and otherwise is max_‖ v‖=1‖ Tv‖).

[F4]

For a subspace W of a finite-dimensional inner product space, every z has a unique decomposition z=PWz+r with PWz∈W and r orthogonal to every vector of W; 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 V, 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.

1.1F1F2F3algebra

A Hermitian matrix B is normal because BB∗=B∗B. By [F2] and the convention transfer in [F1], it has an orthonormal eigenbasis u1,…,un. Each eigenvalue λj is real: λj=⟨uj,Buj⟩ is real by [F1]. For f=∑jcjuj, orthonormality gives ⟨f,Bf⟩=∑jλj∣cj∣2 and ∥Bf∥22=∑jλj2∣cj∣2. Thus, when n>0, [F3] gives ∥B∥=max⁡j∣λj∣: the upper bound follows from the latter sum for unit f, and an eigenvector attaining the maximum gives equality.

1.2F1algebra

For each x∈V, let ex be the function equal to 1 at x and 0 elsewhere. By [F1], ⟨ex,ex⟩=1 and ⟨ex,Bex⟩=Bxx. Testing B−aI and bI−B at ex proves a≤Bxx≤b.

1.3F1algebra

If B⪯C and D⪯E, their defining quadratic forms are nonnegative, and their sum is the quadratic form of (C+E)−(B+D); this proves addition. Restriction follows by testing the original inequality only on vectors w∈W.

1.4F1F4algebra

The vertex space is finite-dimensional by [F1], so [F4] applies to every subspace W, with the same orthogonality in the article convention. For z,t∈CV and scalars α,β, the vector αPWz+βPWt belongs to W, and its difference from αz+βt is orthogonal to W: pairing with any w∈W gives a linear combination of two zero pairings. Uniqueness in [F4] therefore gives PW(αz+βt)=αPWz+βPWt, so PW is linear. For w∈W, the orthogonality of z−PWz gives ⟨w,PWz⟩=⟨w,z⟩.

2.1F1F3step 1.1algebra

For real symmetric B, [F1] makes B Hermitian. By step 1.1, ∥B∥≤b is equivalent, for n>0, to −b≤λj≤b for all j. The displayed quadratic-form formula in step 1.1 shows that these inequalities imply ⟨f,(B+bI)f⟩≥0 and ⟨f,(bI−B)f⟩≥0 for every f. Conversely, testing those two forms at each uj gives −b≤λj≤b. Hence the two matrix-order inequalities are equivalent to the norm bound. If V is empty, the norm is zero by [F3] and both quadratic-form inequalities hold on the zero space, so the equivalence also holds.

3.1F1step 1.3step 1.4algebra∎

For Hermitian B and u,v∈W, step 1.4 and conjugate symmetry give ⟨u,PWBv⟩=⟨u,Bv⟩=⟨Bu,v⟩=⟨PWBu,v⟩. Thus the linear compression w↦PWBw is self-adjoint on W. Therefore ⟨w,PWBw⟩=⟨w,Bw⟩, and the same holds for C. The order of the compressions is consequently equivalent to the restricted quadratic-form inequality in step 1.3, including W={0}. These arguments involve only matrices and the stated inner product, so no graph regularity assumption is used. This proves all assertions.

Depends on

Used by · 16

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.