op223_matrix_spectrum_abs_le
A real matrix whose spectral radius is at most a nonnegative threshold has every real spectral value bounded in absolute value by that threshold.
Statement
theorem op223_matrix_spectrum_abs_le {n : Type*} [Fintype n] [DecidableEq n] (A : Matrix n n ℝ) (t : ℝ) (ht : 0 ≤ t) (hr : spectralRadius ℝ A ≤ ENNReal.ofReal t) : ∀ z ∈ spectrum ℝ A, |z| ≤ t
- Source
- arXiv:2610.17078 Open Problem 6.1; experiments 22883 and 22914
- Verified
- 12 Nov 2026
- Axioms
Classical.choiceQuot.soundpropext- Used by 1
- op223_matrix_spectral_lowerA negative quadratic form for tI minus a Hermitian real matrix certifies that its real spectral radius exceeds t.
The proof, explained
The spectral radius of a matrix is defined as the supremum of the norms of all elements in its spectrum. Given an eigenvalue z in the real spectrum, its norm is bounded above by the spectral radius and therefore by ENNReal.ofReal t. Since t ≥ 0, this inequality transfers from the extended nonnegative reals back to ℝ as ‖z‖ ≤ t, which simplifies to |z| ≤ t because the norm on ℝ is the absolute value.
For any z in the real spectrum of A, its norm in the extended nonnegative reals is at most ENNReal.ofReal t.
Fix z ∈ spectrum ℝ A. By definition, the spectral radius of A is the supremum of ‖w‖₊ over all w ∈ spectrum ℝ A. Since z belongs to the spectrum, le_iSup₂ shows that ‖z‖₊ ≤ spectralRadius ℝ A. Combining this with the hypothesis hr yields ‖z‖₊ ≤ ENNReal.ofReal t.
uses
le_iSup₂intro z hz have hz' : (‖z‖₊ : ℝ≥0∞) ≤ ENNReal.ofReal t := (le_iSup₂ z hz).trans hr
The real norm ‖z‖ is at most t.
Using ENNReal.coe_nnreal_eq to rewrite the coercion ‖z‖₊ as ENNReal.ofReal ‖z‖, the inequality becomes ENNReal.ofReal ‖z‖ ≤ ENNReal.ofReal t. Because t is nonnegative (ht), ENNReal.ofReal_le_ofReal_iff allows converting this inequality back into the real inequality ‖z‖ ≤ t.
uses
ENNReal.coe_nnreal_eq,ENNReal.ofReal_le_ofReal_iffrw [ENNReal.coe_nnreal_eq, ENNReal.ofReal_le_ofReal_iff ht] at hz'
|z| ≤ t, completing the proof.
For a real number, the norm equals the absolute value by Real.norm_eq_abs. Rewriting ‖z‖ to |z| in the inequality ‖z‖ ≤ t gives |z| ≤ t.
uses
Real.norm_eq_abssimpa [Real.norm_eq_abs] using hz'
le_iSup₂- An element f(i, j) in a doubly indexed family is at most the supremum over all pairs, ⨆ i, ⨆ j, f(i, j).
ENNReal.coe_nnreal_eq- Coercing a nonnegative real r to the extended nonnegative reals equals ENNReal.ofReal r.
ENNReal.ofReal_le_ofReal_iff- For real numbers p and q with 0 ≤ q, ENNReal.ofReal p ≤ ENNReal.ofReal q if and only if p ≤ q.
Real.norm_eq_abs- For any real number r, its norm ‖r‖ equals its absolute value |r|.
Written by a model (gemini-3.8-flash) from the Lean proof and the goal states Lean reported at each step. Lean verified the proof; this explanation is a reading aid and is not itself machine-checked.
Lean source view module on GitHub
Choose a tactic — a marked line — to see the goals Lean had before and after it, as in Lean’s infoview. Step with ← → or j k.
open Matrixopen scoped ENNRealtheorem op223_matrix_spectrum_abs_le {n : Type*} [Fintype n] [DecidableEq n] (A : Matrix n n ℝ) (t : ℝ) (ht : 0 ≤ t) (hr : spectralRadius ℝ A ≤ ENNReal.ofReal t) : ∀ z ∈ spectrum ℝ A, |z| ≤ t := by intro z hz have hz' : (‖z‖₊ : ℝ≥0∞) ≤ ENNReal.ofReal t := (le_iSup₂ z hz).trans hr rw [ENNReal.coe_nnreal_eq, ENNReal.ofReal_le_ofReal_iff ht] at hz' simpa [Real.norm_eq_abs] using hz'