Alphabeta Math
AlgorithmAlgorithm: Literature-sourcedProof: 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.

Certified Hermitian eigenvalue intervals from residual and Gram bounds

Definition

Input n≥1, a nonempty family of Hermitian n×n matrices enclosed by complex rectangles, a point matrix V∈Cn×n, a real diagonal matrix Θ∈Rn×n, and proposed nonnegative bounds δ,ρ,MA,MΘ,τ. Treat point data as exact dyadics and the family as any subset of its enclosure.

  1. With outward interval evaluation, enclose V∗V−I and every AV−VΘ for the full family. Form Frobenius upper bounds d,r for these two matrices. Also form Frobenius upper bounds mA for every A in the family and mΘ for Θ. If any enclosure or square-root operation is non-finite, return inconclusive.

  2. Verify by outward scalar comparisons that d≤δ<1, r≤ρ, mA≤MA, mΘ≤MΘ, and that 1−1−δ≤τ. If any comparison is undecided or false, return inconclusive with the failed check. Otherwise outward-compute a finite upper bound ηˉ≥ρ+(MA+MΘ)τ. For each increasingly sorted diagonal entry θ(k), outward-compute finite endpoints ℓk≤θ(k)−ηˉ and uk≥θ(k)+ηˉ, and set Ik=[ℓk,uk]. If the radius bound or any final endpoint cannot be enclosed finitely, return inconclusive; otherwise return certified with radius bound ηˉ and intervals I1,…,In.

The checks use the Frobenius norm as an upper bound for the operator 2-norm. An inconclusive check makes no statement about the true spectrum.

Depends on

Used by

Dependency tree · two levels

26 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