ContinuousLinearMap.support_eq_sup_eigenspace_nonzero
theoremverifiedformalizationimported Lean
The support of a Hermitian matrix is the sum of its nonzero eigenspaces.
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in open ContinuousLinearMap in variable {n 𝕜 : Type*} [Fintype n] [RCLike 𝕜] in theorem ContinuousLinearMap.support_eq_sup_eigenspace_nonzero (A : EuclideanSpace 𝕜 n →L[𝕜] EuclideanSpace 𝕜 n) (hA : A.IsSymmetric) : A.range = ⨆ μ ≠ 0, Module.End.eigenspace A μ
- Formalizes
- QuantumInfo, `ContinuousLinearMap.support_eq_sup_eigenspace_nonzero`
- Lean proof
- By Alex Meiburg, from github.com/leanprover-community/physlib at
e411c6e89692(Copyright (c) 2025 Alex Meiburg. All rights reserved, Apache-2.0). Compiled here against leanprover/lean4:v4.33.1, Mathlib v4.33.1; written for leanprover/lean4:v4.34.1.ContinuousLinearMap.support_eq_sup_eigenspace_nonzero← ContinuousLinearMap.support_eq_sup_eigenspace_nonzero (QuantumInfo/ForMathlib/ContinuousLinearMap.lean:45): verbatim
- Verified
- 17 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext
Lean source view module on GitHub
set_option autoImplicit true in set_option relaxedAutoImplicit true in open ContinuousLinearMap in variable {n 𝕜 : Type*} [Fintype n] [RCLike 𝕜] in /-- The support of a Hermitian matrix is the sum of its nonzero eigenspaces. -/ theorem ContinuousLinearMap.support_eq_sup_eigenspace_nonzero (A : EuclideanSpace 𝕜 n →L[𝕜] EuclideanSpace 𝕜 n) (hA : A.IsSymmetric) : A.range = ⨆ μ ≠ 0, Module.End.eigenspace A μ := by apply le_antisymm · rintro x ⟨y, hy⟩ have h_decomp : y ∈ ⨆ (μ : 𝕜), Module.End.eigenspace A.toLinearMap μ := by have h_orth := hA.orthogonalComplement_iSup_eigenspaces_eq_bot rw [Submodule.orthogonal_eq_bot_iff] at h_orth rw [h_orth] exact Submodule.mem_top; rw [Submodule.mem_iSup_iff_exists_finsupp] at h_decomp rcases h_decomp with ⟨f, hf₁, hf₂⟩ have h_apply_A : A y = ∑ i ∈ f.support, A (f i) := by rw [← hf₂, map_finsuppSum] exact rfl have h_eigen (i) : A (f i) = (i : 𝕜) • f i := Module.End.mem_eigenspace_iff.mp (hf₁ i) rw [← hy, coe_coe, h_apply_A, Finset.sum_congr rfl (fun i _ ↦ h_eigen i)] refine Submodule.sum_mem _ fun i _ ↦ ?_ by_cases hi0 : i = 0 · simp [hi0] · apply Submodule.smul_mem apply Submodule.mem_iSup_of_mem i exact Submodule.mem_iSup_of_mem hi0 (hf₁ i) · simp only [iSup_le_iff] intro μ hμ x hx use μ⁻¹ • x simp_all