Alphabeta Math
TheoremStatement: AI-adaptedProof: 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 gapped adiabatic estimate

Statement

Assume the Axiom of Countable Choice (The Axiom of Countable Choice (ACω)). Let H:[0,1]→Herm⁡(Cd) be a map of class C2 into the Hermitian d×d matrices, let P(s) be the spectral projection of H(s) for a spectral cluster σP(s) that is separated from the complementary spectrum by a uniform gap: dist⁡(σP(s),σ(H(s))∖σP(s))≥g>0 for all s∈[0,1]. Require that the cluster is followed coherently: P(s) is continuous in operator norm (equivalently, it follows the local Riesz continuation of its initial cluster). Fix T>0. Let UT solve i ∂sUT(s)=TH(s)UT(s), UT(0)=I by the finite matrix construction below, and let UA solve i ∂sUA(s)=(TH(s)+i[P′(s),P(s)])UA(s), UA(0)=I (equivalently UA′=(−iTH+K)UA with K=[P′,P]). Then:

(a) P∈C2([0,1];End⁡(Cd)) and K=[P′,P] is anti-Hermitian of class C1 with [K,P]=P′.

(b) There is a C1 Hermitian X:[0,1]→End⁡(Cd) with [H(s),X(s)]=K(s) for all s.

(c) Intertwining. P(s)UA(s)=UA(s)P(0) for all s.

(d) Adiabatic estimate. With C:=2sup⁡s∥X(s)∥+∫01(∥X′(s)∥+∥K(s)∥∥X(s)∥)ds one has ∥(I−P(s))UT(s)P(0)∥≤CT(s∈[0,1]).

The estimate is finite-dimensional and conditional on the uniform positive gap; gap-closing families and unbounded families are not covered.

Facts & Assumptions

Given: CC, the C2 Hermitian family H, a continuously followed gapped spectral cluster P, and T>0. All matrix norms are operator norms unless marked HS. No restriction on the cluster rank or ordering inside it is imposed.

[F1]

Scalar circle integration is Cauchy's integral formula on a circle compactly contained in a disc of holomorphy. Every Hermitian matrix has an orthonormal eigenbasis: maximize its real quadratic form on the compact unit sphere, differentiate along each real and imaginary tangent direction to obtain an eigenvector, then restrict to its invariant orthogonal complement and induct on the finite dimension. This uses only finite-dimensional compactness and a finite induction, no family of varying eigenbases. Matrix operations, norms and adjoints are Self-adjoint and normal endomorphisms of a finite-dimensional real or complex inner product space, The operator norm as the least bound and as the unit-sphere or unit-ball supremum and A bounded linear operator between normed spaces. Continuous finite matrix integrals and primitives are taken entrywise; their elementary fundamental theorem gives the ODE construction below.

Proof

1.1givenF1constructalgebra

[The projection is C2 without assuming a smooth eigenbasis] Fix s0 and list the finitely many distinct eigenvalues of H(s0). Around each distinct eigenvalue belonging to the chosen cluster take a positively oriented small circle containing no other eigenvalue of H(s0), with disjoint closed discs. A finite choice of radii suffices; one can take the first sufficiently small positive rational radius for each center. Let Γ be their finite union. On Γ, z−H(s0) is invertible. Compactness and the Neumann formula show it remains invertible for all s sufficiently near s0. Define Ploc(s)=12πi∮Γ(z−H(s))−1 dz. Finite diagonalization at each fixed s and the scalar circle integral show that this is the orthogonal spectral projection onto the eigenvalues inside those discs. The inverse equations give R′=RH′R and R′′=RH′′R+2RH′RH′R. The local contour is fixed, so continuous differentiation under its finite integrals gives Ploc∈C2. Both P(s) and Ploc(s) are spectral projections of the same matrix and therefore commute. At s0 they coincide. By the assumed continuity and the just-proved local continuity, their difference has norm less than 1 on a smaller neighborhood. Distinct commuting orthogonal projections have difference norm 1: simultaneous decomposition into their intersection and the two difference subspaces gives a unit vector with difference equal to ±1 if they differ. Hence P=Ploc there. This proves P∈C2 locally everywhere, and thus on [0,1] with one-sided endpoint derivatives. It also shows that its rank is constant, without imposing a new rank hypothesis. If the cluster is empty or full, continuity makes that condition locally persistent by the same projection-distance argument; the projection is identically 0 or I on the connected interval, and the subsequent proof reduces to K=X=0. This handles any original empty-cluster convention without a nonempty-cluster restriction.

2.1givenF1constructalgebrastep 1.1

[Projection identities and elementary ODE construction] Differentiate P2=P to obtain P′=P′P+PP′ and PP′P=0. Because P=P∗, also P′=P′∗. Thus K=P′P−PP′ is C1, K∗=−K, and [K,P]=P′P+PP′=P′. For any continuous matrix coefficient B(s), define V0(s)=I and Vj+1(s)=∫0sB(r)Vj(r) dr. If M=sup⁡∥B∥, induction gives ∥Vj(s)∥≤(Ms)j/j!. The uniformly convergent sum V=∑jVj solves V=I+∫0sBV and hence V′=BV by the fundamental theorem of calculus. For two solutions with the same initial value, iterating the integral difference bound gives ∥V−V~∥≤Mj/j!sup⁡∥V−V~∥ for every j, proving uniqueness as j→∞. The same recursion works for any initial matrix. For anti-Hermitian B, differentiation gives (V∗V)′=V∗(B∗+B)V=0, so V∗V=I; in finite dimension injectivity implies surjectivity, giving VV∗=I. Thus V is unitary. This local construction avoids both the incorrect generic ordered-integral formula and every autonomous spectral/group theorem. Apply it to B=K to obtain W′=KW, W(0)=I. Since K∈C1, the equation makes W∈C2. Differentiating W∗PW yields dds(W∗PW)=W∗(P′−[K,P])W=0, so W∗P(s)W=P(0)=:P0. This is the correct Kato transport, with (W∗)′=−W∗K. No choice of instantaneous eigenvectors is involved.

3.1givenF1constructalgebrastep 1.1step 2.1

[Smooth Hermitian commutator solution for any separated cluster] Put H~=W∗HW and K~=W∗KW. Then H~∈C2, K~∈C1, and [H~,P0]=0. The matrix K~ is anti-Hermitian and has only cross blocks with respect to P0, because PKP=(I−P)K(I−P)=0. Let V be the fixed finite-dimensional complex vector space of matrices Y with P0YP0=(I−P0)Y(I−P0)=0. The linear map Ls:V→V, Ls(Y)=[H~(s),Y], is C2 as a matrix-valued map on this fixed space. To prove invertibility at each s, diagonalize the two Hermitian diagonal blocks of H~(s) at that one time. In these finite bases every cross entry is multiplied by λ−μ, where λ belongs to the cluster and μ to its complement, or the reverse. The given full complementary spectral gap gives ∣λ−μ∣≥g. Thus all cross coefficients are invertible and ∥Ls−1Y∥HS≤g−1∥Y∥HS. This diagonalization is only a pointwise verification of a uniquely determined inverse; no simultaneous choice of bases over an uncountable interval is made. In fixed coordinates on V, the Neumann inverse or adjugate formula proves Ls−1 is C2; its derivative is −Ls−1Ls′Ls−1. Define X~=Ls−1K~, which is C1. Since K~∗=−K~ and [H~,Y]∗=−[H~,Y∗], taking adjoints of the equation shows [H~,X~∗]=K~. Both X~ and X~∗ lie in V, so uniqueness gives X~∗=X~. Set X=WX~W∗. It is C1, Hermitian, and [H,X]=K. If V={0}, use its unique zero inverse solution X=0; the proof has no division by a nonexistent cross entry.

4.1givenF1constructalgebrastep 1.1step 2.1step 3.1

[Physical and modified finite propagators and intertwining] Apply the matrix ODE construction of step 2.1 to BT=−iTH and BA=−iTH+K. Both coefficients are anti-Hermitian and continuous. It supplies unique C1 unitary matrices UT,UA with initial value I. Multiplication of the second differential equation by i gives exactly the original self-adjoint-generator equation iUA′=(TH+iK)UA. Because [H,P]=0, product differentiation gives dds(UA∗PUA)=UA∗(P′+iT[H,P]−[K,P])UA=0. Thus UA∗P(s)UA=P(0), or P(s)UA(s)=UA(s)P(0). This establishes the original transport conclusion for every T>0.

5.1givenF1constructalgebrastep 1.1step 2.1step 3.1step 4.1∎

[Exact integration identity and the unchanged error constant] Set D=UA∗UT and F=UA∗XUT. The equations give (UA∗)′=UA∗(iTH−K) and UT′=−iTHUT. Therefore D′=−UA∗KUT,F′=UA∗(X′−KX+iT[H,X])UT=UA∗(X′−KX+iTK)UT. Substitution, with all signs retained, gives iTD′=−F′+UA∗(X′−KX)UT. Integrating from 0 to s, and using D(0)=I, F(0)=X(0), yields iT(D(s)−I)=−F(s)+X(0)+∫0sUA(r)∗(X′(r)−K(r)X(r))UT(r) dr. The unitaries have norm 1, X∈C1, and the interval is compact. Hence ∥D(s)−I∥≤2sup⁡r∈[0,1]∥X(r)∥+∫01(∥X′(r)∥+∥K(r)∥∥X(r)∥) drT=CT. The constant is exactly the original public constant, finite and independent of T. Finally, UT=UAD and transport gives (I−P(s))UA(s)P(0)=0. Therefore ∥(I−P(s))UT(s)P(0)∥=∥(I−P(s))UA(s)(D(s)−I)P(0)∥≤∥D(s)−I∥≤C/T. This holds for every T>0 and s∈[0,1], including zero leakage at s=0. No eigenvalue ordering within the cluster, rank-one hypothesis, stronger derivative hypothesis, or changed error constant has been used.

Why coherent selection is required

Pointwise spectral separation does not imply coherent selection. Let d=2, H(s)=diag⁡(0,1), and choose σP(s)={0} for s<1/2, σP(s)={1} for s≥1/2. The matrix family is C∞, both clusters have uniform gap 1, and both projections have rank 1. Nevertheless P jumps by operator norm 1 at 1/2. Thus conclusion (a) is false and the subsequent P′ and UA are undefined. For s>1/2, the ordinary propagator is diagonal and the leakage from the initial 0 eigenspace is exactly 1, so a uniform C/T theorem would fail as T→∞ even if the undefined modified objects were omitted.

Depends on

Dependency tree · 2 levels

Sources