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.
Finite spectral-band derivative estimates for adiabatic paths
Statement
Let be a finite-dimensional Hermitian path and a spectral projection of fixed rank separated from its complement by gap . Put . For any operator define its reduced-resolvent transform at by where is the set of distinct eigenvalues in and is the corresponding eigenspace projection. Then and The rank may count multiplicity; the argument only uses that the number of distinct band eigenvalues is at most .
Facts & Assumptions
Given: The finite path, the coherent gapped projection, and the gap convention from Finite adiabatic path model.
The band projection is (Finite gapped spectral projection regularity).
At each parameter value, has an orthogonal eigenspace decomposition (Self-adjoint and normal endomorphisms of a finite-dimensional real or complex inner product space, Complex spectral theorem: a normal endomorphism of a finite-dimensional complex inner product space has an orthonormal eigenbasis, and conversely).
On a nonzero domain the operator norm is defined by its maximum on unit vectors; on the zero domain it is zero. It is submultiplicative (The operator norm is zero on the zero domain and otherwise is max_{||v||=1} ||Tv||, The operator norm is submultiplicative and satisfies ||T^*T|| = ||T||^2).
Cauchy–Schwarz holds in the finite-dimensional inner-product spaces (Cauchy–Schwarz: , with equality exactly for dependent pairs).
For a finite-dimensional map , : Cauchy–Schwarz gives when both spaces are nonzero (choose when ), and the adjoint identity exchanges ; if a space is zero both map norms are zero (The adjoint is characterised by , The operator norm is zero on the zero domain and otherwise is max_{||v||=1} ||Tv||, Cauchy–Schwarz: , with equality exactly for dependent pairs).
Reduced resolvents on the complement obey because every complementary eigenvalue is at distance at least from every band eigenvalue; this follows by diagonalizing the self-adjoint restriction and applying the operator-norm definition.
Proof
Fix and write . The displayed definition makes off-diagonal: . On each band-to-complement block, multiplies by , giving ; on the reverse block it gives . Summing yields .
Choose an orthonormal basis of adapted to the mutually orthogonal . For each basis vector in , , so [F6] gives . For a unit vector , Cauchy–Schwarz [F4] yields , proving . Since each and is self-adjoint, taking adjoints in the defining sum gives . Applying the column estimate to and using [F5] gives . Since is off-diagonal, for one has ; hence its full norm is the maximum of the two block norms. This proves .
On a local fixed Riesz contour put and . Then . For , using gives Indeed, and ; adding the two commutator contributions cancels the middle terms. Write . On each band eigenspace , the Sylvester equations from this commutator give because and .
Differentiate and multiply on the left by and on the right by each . The resulting Sylvester equation is , so . Differentiating gives ; self-adjointness gives the other off-diagonal block by adjoint. These identities equal the reduced-resolvent formula for , proving . Step 2.1 then gives .
The diagonal blocks follow by expanding . In , the only non-holomorphic terms have the middle resolvent in , and their integrals are ; terms with all three resolvents in are holomorphic inside the contour. Hence . In , terms with three band resolvents have zero integral because their rational integrands decay as and all their poles lie inside the contour. The remaining terms have two band poles and one resolvent. Their scalar contour coefficient equals if by Cauchy's derivative formula, and equals if by the resolvent identity. Thus . Together with step 2.2, these blocks prove All contours enclose the whole band; coincident band eigenvalues are grouped into one , and the complementary resolvent is holomorphic throughout the enclosed region.
Differentiating the contour formula and using gives Apply step 3.2 to both terms and use from step 3.1. Their sum is because the remaining terms are . Negating this sum in the derivative formula yields The contour formula is local, so it remains valid at internal band eigenvalue coincidences; no selected eigenvalue is crossed by the contour.
Apply step 4.1 to . Since is off-diagonal, is block diagonal and has zero block. Also . Therefore The block estimate in step 2.1 bounds the first term by and the second by using submultiplicativity [F3] and step 3.1. This is the claimed bound.
Apply step 4.1 to . The products and are block diagonal, and . Hence The block bound from step 2.1 makes the first term at most . The second is at most , using submultiplicativity [F3] and steps 2.1 and 3.1.
Depends on
- Finite adiabatic path model
- Finite gapped spectral projection regularity
- The adjoint $T^*:W\to V$ is characterised by $\langle Tv,w\rangle_W=\langle v,T^*w\rangle_V$
- Self-adjoint and normal endomorphisms of a finite-dimensional real or complex inner product space
- The operator norm is zero on the zero domain and otherwise is max_{||v||=1} ||Tv||
- Complex spectral theorem: a normal endomorphism of a finite-dimensional complex inner product space has an orthonormal eigenbasis, and conversely
- The operator norm is submultiplicative and satisfies ||T^*T|| = ||T||^2
- Cauchy–Schwarz: $|\langle x,y\rangle|\le\|x\|\,\|y\|$, with equality exactly for dependent pairs
Used by
Dependency tree · two levels
39 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
- Sabine Jansen, Mary-Beth Ruskai, and Ruedi Seiler, Bounds for the adiabatic approximation with applications to quantum computation (standard reference, not scraped)
- Andrew M. Childs, Lecture Notes on Quantum Algorithms (standard reference, not scraped)