Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-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.

Finite spectral-band derivative estimates for adiabatic paths

Statement

Let H(s) be a C2 finite-dimensional Hermitian path and P(s) a C2 spectral projection of fixed rank m≥1 separated from its complement by gap g(s)>0. Put Q=I−P. For any operator X define its reduced-resolvent transform at s by X~=−∑λ∈ΛP(PλXR^λ+R^λXPλ),R^λ=Q(H∣ran⁡Q−λI)−1Q, where ΛP is the set of distinct eigenvalues in ran⁡P and Pλ is the corresponding eigenspace projection. Then P˙=H˙~,∥X~∥≤m∥X∥g,∥QX~P∥≤m∥QXP∥g,∥PX~Q∥≤m∥PXQ∥g, ∥P˙∥≤m∥H˙∥g,∥QP¨P∥≤m∥H¨∥g+4m∥H˙∥2g2, and ∥QP˙~˙P∥≤m∥QP¨P∥g+2m∥H˙∥∥P˙∥g2. The rank m may count multiplicity; the argument only uses that the number of distinct band eigenvalues is at most m.

Facts & Assumptions

Given: The finite path, the coherent gapped projection, and the gap convention from Finite adiabatic path model.

[F1]

The band projection is C2 (Finite gapped spectral projection regularity).

[F3]

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

[F5]

For a finite-dimensional map A, ∥A∥=∥A∗∥: Cauchy–Schwarz gives ∥A∥=max⁡∥x∥=∥y∥=1∣⟨Ax,y⟩∣ when both spaces are nonzero (choose y=Ax/∥Ax∥ when Ax≠0), and the adjoint identity exchanges x,y; if a space is zero both map norms are zero (The adjoint T∗:W→V is characterised by ⟨Tv,w⟩W=⟨v,T∗w⟩V, The operator norm is zero on the zero domain and otherwise is max_{||v||=1} ||Tv||, Cauchy–Schwarz: ∣⟨x,y⟩∣≤∥x∥ ∥y∥, with equality exactly for dependent pairs).

[F6]

Reduced resolvents on the complement obey ∥R^λ∥≤1/g because every complementary eigenvalue is at distance at least g from every band eigenvalue; this follows by diagonalizing the self-adjoint restriction and applying the operator-norm definition.

Proof

1.1givenF2F3algebra

Fix s and write P=∑λ∈ΛPPλ. The displayed definition makes X~ off-diagonal: PX~P=QX~Q=0. On each band-to-complement block, [H,X~] multiplies −PλXR^λ by λ−H∣Q, giving PλXQ; on the reverse block it gives −QXPλ. Summing yields [H,X~]=PX−XP.

2.1F2F3F4F5F6step 1.1algebra

Choose an orthonormal basis e1,…,em of ran⁡P adapted to the mutually orthogonal Pλ. For each basis vector ej in ran⁡Pλ, QX~ej=−R^λQXej, so [F6] gives ∑j∥QX~ej∥2≤g−2∑j∥QXej∥2≤m∥QXP∥2/g2. For a unit vector u=∑jujej, Cauchy–Schwarz [F4] yields ∥QX~Pu∥≤∑j∣uj∣∥QX~ej∥≤(∑j∣uj∣2)1/2(∑j∥QX~ej∥2)1/2, proving ∥QX~P∥≤m∥QXP∥/g. Since each R^λ and Pλ is self-adjoint, taking adjoints in the defining sum gives X∗~=X~∗. Applying the column estimate to X∗ and using [F5] gives ∥PX~Q∥≤m∥PXQ∥/g. Since X~ is off-diagonal, for u=p+q one has ∥X~u∥2=∥PX~Qq∥2+∥QX~Pp∥2; hence its full norm is the maximum of the two block norms. This proves ∥X~∥≤m∥X∥/g.

2.2F1F2step 1.1algebra

On a local fixed Riesz contour put Rz=(H−zI)−1 and R^z=Q(H∣Q−zI)−1Q. Then X~=(2πi)−1∮RzXRz dz. For G(A,B)=(2πi)−1∮RzARzBRz dz, using [H−z,Rz]=0 gives [H,G(A,B)]=12πi∮(ARzBRz−RzARzB) dz=AB~−A~B. Indeed, Rz[H−z,A]Rz=ARz−RzA and Rz[H−z,B]Rz=BRz−RzB; adding the two commutator contributions cancels the middle terms. Write C=AB~−A~B. On each band eigenspace Pλ, the Sylvester equations from this commutator give PGQ=PC~Q,QGP=−QC~P, because PλC~Q=−PλCR^λ and QC~Pλ=−R^λCPλ.

3.1F1F2F3step 1.1step 2.1algebra

Differentiate HP=PH and multiply on the left by Q and on the right by each Pλ. The resulting Sylvester equation is (H∣Q−λI)QP˙Pλ=−QH˙Pλ, so QP˙Pλ=−R^λH˙Pλ. Differentiating P2=P gives PP˙P=QP˙Q=0; self-adjointness gives the other off-diagonal block by adjoint. These identities equal the reduced-resolvent formula for H˙~, proving P˙=H˙~. Step 2.1 then gives ∥P˙∥≤m∥H˙∥/g.

3.2F1F2step 2.2algebra

The diagonal blocks follow by expanding Rz=∑λ∈ΛPPλ/(λ−z)+R^z. In QGQ, the only non-holomorphic terms have the middle resolvent in Pλ, and their integrals are −R^λAPλBR^λ; terms with all three resolvents in Q are holomorphic inside the contour. Hence QGQ=−QA~B~Q. In PGP, terms with three band resolvents have zero integral because their rational integrands decay as z−3 and all their poles lie inside the contour. The remaining terms have two band poles λ,μ and one Q resolvent. Their scalar contour coefficient equals R^λ2 if λ=μ by Cauchy's derivative formula, and equals (R^λ−R^μ)/(λ−μ)=R^λR^μ if λ≠μ by the resolvent identity. Thus PGP=PA~B~P. Together with step 2.2, these blocks prove G(A,B)=(P−Q)(A~B~+AB~~−A~B~). All contours enclose the whole band; coincident band eigenvalues are grouped into one Pλ, and the complementary resolvent is holomorphic throughout the enclosed region.

4.1F1F2step 3.1step 3.2algebra

Differentiating the contour formula and using R˙z=−RzH˙Rz gives X~˙=X˙~−G(H˙,X)−G(X,H˙). Apply step 3.2 to both G terms and use P˙=H˙~ from step 3.1. Their sum is (P−Q)(P˙X~+X~P˙+[H˙,X~]~−[P˙,X]~), because the remaining terms are H˙X~+XP˙−P˙X−X~H˙~=[H˙,X~]~−[P˙,X]~. Negating this sum in the derivative formula yields X~˙=X˙~+(Q−P)(P˙X~+X~P˙+[H˙,X~]~−[P˙,X]~). The contour formula is local, so it remains valid at internal band eigenvalue coincidences; no selected eigenvalue is crossed by the contour.

5.1F2F3step 2.1step 3.1step 4.1algebra

Apply step 4.1 to X=H˙. Since H˙~=P˙ is off-diagonal, P˙2 is block diagonal and has zero QP block. Also [P˙,H˙]=−[H˙,P˙]. Therefore QP¨P=QH¨~P+2Q[H˙,P˙]~P. The block estimate in step 2.1 bounds the first term by m∥H¨∥/g and the second by 2(m/g)∥[H˙,P˙]∥≤4m∥H˙∥∥P˙∥/g≤4m∥H˙∥2/g2 using submultiplicativity [F3] and step 3.1. This is the claimed bound.

6.1F2F3step 2.1step 3.1step 4.1algebra∎

Apply step 4.1 to X=P˙. The products P˙P˙~ and P˙~P˙ are block diagonal, and [P˙,P˙]=0. Hence QP˙~˙P=QP¨~P+Q[H˙,P˙~]~P. The block bound from step 2.1 makes the first term at most m∥QP¨P∥/g. The second is at most (m/g)∥[H˙,P˙~]∥≤(2m/g)∥H˙∥∥P˙~∥≤2m∥H˙∥∥P˙∥/g2, using submultiplicativity [F3] and steps 2.1 and 3.1.

Depends on

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