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

The occupied spectral projector has no continuous extension through a zero gap

Example

For n=2,r=1, let H(t)=diag⁡(−t,t). For every t≠0 the lowest eigenvalue is simple, so its occupied projector is defined; at t=0 the occupied/unoccupied gap vanishes and the lowest rank-one projector is not unique. The two one-sided limits of the defined projectors differ.

Facts & Assumptions

Given: The Hermitian path H(t)=diag⁡(−t,t) and the rank-one lowest-eigenvalue projector Π1(H(t)) when the gap is positive.

[F1]

The occupied projector is uniquely defined only on a domain with a strict rth gap (The occupied-projector response map on its strict-gap domain).

Verification

1.1givenF1algebra

If t>0, then −t<t and the lowest eigenvector is e1, so Π1(H(t))=e1e1∗. If t<0, then t<−t and the lowest eigenvector is e2, so Π1(H(t))=e2e2∗.

1.2givenF1algebra

At t=0, both eigenvalues equal 0, so the gap is 0 and every rank-one orthogonal projector onto a line is a lowest-eigenspace projector; there is no unique Π1(H(0)) under [F1].

2.1step 1.1step 1.2algebra∎

The limits as t↓0 and t↑0 are respectively e1e1∗ and e2e2∗, which are distinct because their Frobenius distance is 2. Thus no continuous extension of the uniquely gapped projector exists at t=0.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

3 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