Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-6-luna)
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.

Large clock-penalty perturbation

Statement

Let H=S⊕S⊥ be finite-dimensional, let H1=H1∗ with ∥H1∥≤K, and let H2=H2∗≥0 satisfy H2∣S=0 and H2∣S⊥≥I. For J>2K, set HJ=H1+JH2, and let μ1≤μ2≤⋯ be the eigenvalues of the compression A=PSH1∣S, where dim⁡S≥2. With ϵJ=K2/(J−2K), the two smallest eigenvalues of HJ obey μk−ϵJ≤λk(HJ)≤μk(k=1,2). Consequently λ2(HJ)−λ1(HJ)≥(μ2−μ1)−ϵJ; positivity of this bound requires the separate condition ϵJ<μ2−μ1. Every unit eigenvector x=s+t of HJ with eigenvalue λ≤K also satisfies ∥t∥≤K∥s∥/(J−2K). Thus J>2K alone supplies no general gap conclusion.

Facts & Assumptions

Given: The orthogonal splitting S⊕S⊥, the operators and bounds in the Statement, and the ordered eigenvalues of the finite-dimensional Hermitian compressions.

[F2]

The operator norm is the maximum of ∥Tv∥ over unit vectors (The operator norm is zero on the zero domain and otherwise is max_{||v||=1} ||Tv||).

Proof

1.1givenF1F2algebra

Write HJ in blocks as (ABB∗D) for S⊕S⊥. Then ∥B∥≤K and D=QSH1QS+JQSH2QS≥(J−K)I by [F1]–[F2]. For real λ≤K, D−λI≥(J−2K)I>0, so the Schur complement Sλ=A−λI−B(D−λI)−1B∗ is defined and 0≤B(D−λI)−1B∗≤ϵJI.

2.1step 1.1constructalgebra

The invertible block triangular change of variables completing the square in ⟨(HJ−λ)x,x⟩ gives the direct sum quadratic form of Sλ and D−λI. Since the latter is positive definite, the largest dimension of a subspace on which HJ−λI is negative definite equals the corresponding dimension for Sλ. This follows directly because the triangular change is an invertible linear map and hence preserves subspace dimension and signs of the quadratic form.

2.2givenF1step 1.1algebra

For k=1,2, the span of the first k eigenvectors of A is a k-dimensional subspace of S on which the Rayleigh quotient of HJ is at most μk. If HJ had fewer than k eigenvalues at most μk, that subspace would contain a nonzero vector orthogonal to its first k−1 eigenvectors, whose Rayleigh quotient would be strictly larger than μk, a contradiction. Thus λk(HJ)≤μk≤K.

3.1step 1.1step 2.1step 2.2algebra

Fix k=1 or 2 and suppose λ<μk−ϵJ. Then λ<K, and step 1.1 gives Sλ≥A−(λ+ϵJ)I. Since λ+ϵJ<μk, at most k−1 eigenvalues of Sλ are negative. By step 2.1, at most k−1 eigenvalues of HJ−λI are negative. Letting λ increase to μk−ϵJ proves λk(HJ)≥μk−ϵJ. The gap estimate follows by subtracting the bounds for k=1,2.

4.1givenF1F2step 1.1algebra∎

If x=s+t is a unit eigenvector of eigenvalue λ≤K, its S⊥ block equation is B∗s+(D−λI)t=0. By step 1.1, ∥(D−λI)−1∥≤1/(J−2K); then [F2] yields ∥t∥≤K∥s∥/(J−2K). No lower bound on the compressed gap was used in this leakage estimate. For a counterexample to any gap conclusion from J>2K alone, take dim⁡S=2, H1=0, and H2=0 on S and I on S⊥; then K=0, every J>0 satisfies J>2K, and the lowest eigenvalue of HJ has multiplicity two. Hence the separate compressed-gap condition is necessary.

Depends on

Used by

Dependency tree · two levels

9 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