hn_eigenvalue_shift_identity
For any natural number n and real numbers l1, l2, l3, if l1 + l2 + l3 = n and Lam = 2 * (n : ℝ) - l1, then (n : ℝ) + l3 = Lam - l2.
Statement
theorem hn_eigenvalue_shift_identity (n : ℕ) (l1 l2 l3 : ℝ) (hsum : l1 + l2 + l3 = (n : ℝ)) : let Lam := 2 * (n : ℝ) - l1 (n : ℝ) + l3 = Lam - l2
- Source
- arXiv:2610.18636 Theorem 5 proof
- Verified
- 21 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Used by 1
- spectral_distances_knnn_hn_eigenvaluesLet n >= 2 and let l1, l2, l3 be real numbers such that l1 + l2 + l3 = n, l1 < 2 * n, 0 < l2, and -n < l3. Let Lam = 2 * n - l1. Then 0 <…
Read back from the Lean
For every natural number $n$ and all real numbers $l_1$, $l_2$, and $l_3$, if $l_1 + l_2 + l_3 = n$ (as a real number), then letting $\Lambda = 2n - l_1$, it holds that $n + l_3 = \Lambda - l_2$.
Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.
The proof, explained
The proof defines Lam = 2n - l1 and then applies linear arithmetic to deduce n + l3 = Lam - l2 from the eigenvalue sum condition l1 + l2 + l3 = n.
(n : ℝ) + l3 = Lam - l2
Introduce the definition Lam = 2n - l1. Substituting this into Lam - l2 gives 2n - l1 - l2, which equals n + l3 because l1 + l2 + l3 = n. The goal is closed by linear arithmetic.
intro Lam linarith
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.
/-- Eigenvalue shift identity n + l3 = Lam - l2 from the eigenvalue sum. -/theorem hn_eigenvalue_shift_identity (n : ℕ) (l1 l2 l3 : ℝ) (hsum : l1 + l2 + l3 = (n : ℝ)) : let Lam := 2 * (n : ℝ) - l1 (n : ℝ) + l3 = Lam - l2 := by intro Lam linarith