Alphabeta Math
ExampleConstruction: AI-adaptedVerification: 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.

Gap-closing failure

Example

Let σz=diag⁡(1,−1) on C2, with orthonormal basis e↑=(1,0), e↓=(0,1). Let H(s)=sσz for s∈[−1,1], and let UT solve iUT′=TH(s)UT, UT(−1)=I, for T>0. For s≠0 define P+(s) to be the spectral projection onto the ordered upper eigenvalue E+(s)=∣s∣.

(a) The eigenvalues are s and −s, so their separation 2∣s∣ closes at 0. The uniform positive-gap hypothesis of Finite gapped adiabatic estimate fails.

(b) The ordered upper projection is P+(s)=diag⁡(0,1) for s<0 and P+(s)=diag⁡(1,0) for s>0. Its distinct one-sided limits preclude a continuous extension through 0. At the crossing H(0)=0, the spectral projection for its only eigenvalue is I, not a distinguished rank-one projection. Assigning any rank-one projection at the crossing does not repair the unequal one-sided limits.

(c) The exact propagator is UT(s)=exp⁡[−iTσz(s2−1)/2], so UT(1)=I and

∥(I−P+(1))UT(1)P+(−1)∥=1(T>0).

Thus upper-energy tracking fails maximally at the endpoints. This is the ordered branch for which the leakage assertion is made.

(d) There is nevertheless a continuous constant rank-one branch P↓=diag⁡(0,1) whose vectors obey H(s)e↓=−se↓ for every s. It starts at energy +1 at s=−1, ends at energy −1 at s=1, and satisfies (I−P↓)UT(s)P↓=0 for every s,T. At s=0 this is a subprojection of the degenerate eigenspace; it is not the rank-two full spectral projection EH(0)({0}). The original claim that no continuous rank-one eigenbranch can pass through this crossing was false.

Verification

Given: the explicit diagonal matrices, s∈[−1,1] and T>0, with P+ defined only for s≠0 and its endpoint values as above.

[F1] Direct matrix multiplication gives H(s)e↑=se↑, H(s)e↓=−se↓, and σz2=I; these agree with Finite spin matrices (e).

[F2] The explicit matrix exponential can be differentiated entrywise. If V and W both solve iZ′=TH(s)Z with the same initial matrix, their difference D has (D∗D)′=iD∗THD−iD∗THD=0, so D=0. This supplies the uniqueness actually needed here without consuming the defective generic Dyson ordering.

1.1F1algebra

The two scalar eigenvalues in [F1] have distance 2∣s∣, which tends to zero at the crossing. For s<0 the larger one is −s with eigenspace Ce↓; for s>0 it is s with eigenspace Ce↑. Their orthogonal projections differ by diag⁡(1,−1) in norm 1, so no choice at s=0 gives a continuous ordered-upper projection. The zero matrix at 0 has only the full eigenspace C2 as its nonzero spectral projection.

2.1F1F2step 1.1algebra

Set VT(s)=diag⁡(e−iT(s2−1)/2,eiT(s2−1)/2). Entrywise differentiation gives iVT′=TsσzVT and VT(−1)=I. Hence [F2] identifies UT=VT. At s=1 both phases are 1, and (I−P+(1))UT(1)P+(−1)=diag⁡(0,1), an orthogonal projection of norm 1. This proves the full leakage assertion for every T>0.

3.1F1step 2.1algebra∎

The constant projection P↓ has H(s)P↓=−sP↓ by [F1], commutes with UT(s) by step 2.1, and gives zero leakage out of its fixed range. It therefore exhibits the continuous eigenvector counterbranch through the crossing and disproves the old unqualified no-continuous-rank-one-branch assertion, while preserving the ordered-upper failure just proved.

Depends on

Dependency tree · 2 levels

Sources