spectral_distance_l2_sq
def
The squared Euclidean spectral distance between two eigenvalue sequences of length m is the sum of the squared differences of their coordinates.
Statement
def spectral_distance_l2_sq {m : ℕ} (s₁ s₂ : Fin m → ℝ) : ℝ- Defined in
- arXiv:2610.18636 Section 1, p. 3
- Verified
- 20 Oct 2026
- Axioms
- none listed
- Used by 3
- balanced_multipartite_nearest_spectral_distanceFor natural numbers r and n, balanced_multipartite_nearest_spectral_distance r n = c_r(n) is the infimum in ℝ (a minimum over a finite set…
- balanced_multipartite_nearest_spectral_distance_nonnegThe nearest squared spectral distance c_r(n) is nonnegative.
- 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 a natural number $m$ and two functions $s_1, s_2 : \mathrm{Fin}\ m \to \mathbb{R}$, spectral_distance_l2_sq is defined as $\sum_{i : \mathrm{Fin}\ m} (s_1(i) - s_2(i))^2$, the squared $L^2$ distance between $s_1$ and $s_2$.
Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.
Lean source view module on GitHub
/-- Squared Euclidean spectral distance between two eigenvalue sequences of length m. -/ def spectral_distance_l2_sq {m : ℕ} (s₁ s₂ : Fin m → ℝ) : ℝ := ∑ i : Fin m, (s₁ i - s₂ i) ^ 2