Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicablePipeline-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.

The occupied-projector response map on its strict-gap domain

Definition

Let n≥2, 1≤r<n, and use the real Hermitian matrix space Hn and projector set Pr of Rank-r orthogonal projector domain. Let U⊆Hn be open and let F:U→Hn be a specified map. For a Hermitian matrix H, write its eigenvalues with multiplicity in ascending order as λ1(H)≤⋯≤λn(H). Write σ(H):={λj(H):1≤j≤n} for its finite spectrum, with multiplicity omitted in this set notation. For any Hermitian H with λr(H)<λr+1(H), write Πr(H) for the orthogonal projector onto the sum of eigenspaces belonging to its r lowest eigenvalues. At a point X∈U where λr(F(X))<λr+1(F(X)), define Φ(X):=Πr(F(X)). The strict gap separates the occupied cluster from the unoccupied cluster; eigenvalue multiplicities within either cluster are allowed. The construction's well-definedness as a unique member of Pr is proved in A strict occupied gap defines a unique rank-r spectral projector ↗.

A set K⊆U has a uniform occupied/unoccupied gap g>0 when the displayed gap is at least g for every X∈K. A self-consistent fixed point is a point X∗ with Φ(X∗)=X∗. Its fixed-point residual is ρ(X):=∥X−Φ(X)∥F whenever Φ(X) is defined. The map is not asserted to be contractive merely because its gap is positive.

Depends on

Used by

Dependency tree · two levels

10 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