amp_damping_shift_spectral_max_re
The largest real part of an eigenvalue of $L_c = G + c\,\mathrm{id}$ is $c$.
Statement
theorem amp_damping_shift_spectral_max_re (d : ℕ) (h : 2 ≤ d) (c : ℝ) :
spectral_max_re d (amp_damping_generator d h + (c : ℂ) • LinearMap.id) = c- Formalizes
- arXiv:2610.37187 Proposition 9 (eq. 7.1), s(L_c) = c
- Verified
- 08 Nov 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 4
- amp_damping_generatorThe $\mathbb{C}$-linear map $G : M_d(\mathbb{C}) \to M_d(\mathbb{C})$ (bundled as a linear endomorphism, for $d \ge 2$),…
- spectral_max_reThe maximal real part s(Φ) of an eigenvalue of a linear map Φ on d × d complex matrices is the supremum of the real parts of the elements…
- p_amp_dampingThe projection matrix P = |1⟩⟨1| onto the second standard basis state in dimension d ≥ 2.
- v_amp_dampingThe matrix unit V = |0⟩⟨1| in the standard basis of d × d complex matrices for d ≥ 2.
- Used by 1
- amp_damping_shift_sharp_spectral_boundFix $d \ge 2$, $V = |0\rangle\langle 1|$, $P = |1\rangle\langle 1|$, $G(X) = VXV^\dagger - \tfrac12(PX + XP)$ and…
Read back from the Lean
For every natural number $d$ satisfying $2 \le d$, and for every real number $c$, the supremum of the real parts of the spectrum of the operator $\mathcal{L} + c \operatorname{id}$ on $M_d(\mathbb{C})$ is equal to $c$, where $\mathcal{L}$ is the amplitude damping generator amp_damping_generator d h.
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 computes the spectrum of the shifted amplitude damping generator L_c. First, it derives the coordinate-wise action of L_c on an arbitrary matrix. Using this formula, it shows that the only possible eigenvalues of L_c are c, c - 1/2, and c - 1, and verifies that c is indeed an eigenvalue with eigenvector |0><0|. Finally, it deduces that the maximum real part of the spectrum is c.
Action on matrix elements
Evaluating the Lindbladian on matrix entries.
theorem amp_damping_spmax_apply_entry (d : ℕ) (h : 2 ≤ d) (c : ℝ) (X : Matrix (Fin d) (Fin d) ℂ) (i j : Fin d) : ((amp_damping_generator d h + (c : ℂ) • LinearMap.id : Module.End ℂ (Matrix (Fin d) (Fin d) ℂ)) X) i j = (if i = ⟨0, by omega⟩ ∧ j = ⟨0, by omega⟩ then X ⟨1, by omega⟩ ⟨1, by omega⟩ else 0) - (1/2 : ℂ) * ((if i = ⟨1, by omega⟩ then X i j else 0) + (if j = ⟨1, by omega⟩ then X i j else 0)) + c * X i j := by simp only [amp_damping_generator, LinearMap.add_apply, LinearMap.sub_apply, LinearMap.comp_apply, LinearMap.smul_apply, LinearMap.mulLeft_apply, LinearMap.mulRight_apply, LinearMap.id_apply, Matrix.add_apply, Matrix.sub_apply, Matrix.smul_apply, smul_eq_mul] simp [v_amp_damping, p_amp_damping, Matrix.mul_apply, Matrix.star_apply, ite_and, Finset.sum_ite_eq'] simp only [apply_ite (starRingEnd ℂ), map_one, map_zero, mul_ite, mul_one, mul_zero, Finset.sum_ite_eq', Finset.mem_univ, if_true] by_cases hi : i = ⟨1, by omega⟩ <;> by_cases hj : j = ⟨1, by omega⟩ <;> simp [hi, hj]
Spectrum is contained in {c, c - 1/2, c - 1}
Showing any eigenvalue must be one of these values.
theorem amp_damping_spmax_mem_spectrum_cases (d : ℕ) (h : 2 ≤ d) (c : ℝ) (μ : ℂ) (hμ : μ ∈ spectrum ℂ (amp_damping_generator d h + (c : ℂ) • LinearMap.id : Module.End ℂ (Matrix (Fin d) (Fin d) ℂ))) : μ = c ∨ μ = c - 1/2 ∨ μ = c - 1 := by rw [← Module.End.hasEigenvalue_iff_mem_spectrum] at hμ obtain ⟨X, hX⟩ := hμ.exists_hasEigenvector by_contra hne push Not at hne obtain ⟨h1, h2, h3⟩ := hne apply hX.2 have eq : ∀ i j, μ * X i j = (if i = ⟨0, by omega⟩ ∧ j = ⟨0, by omega⟩ then X ⟨1, by omega⟩ ⟨1, by omega⟩ else 0) - (1/2 : ℂ) * ((if i = ⟨1, by omega⟩ then X i j else 0) + (if j = ⟨1, by omega⟩ then X i j else 0)) + c * X i j := by intro i j rw [← amp_damping_spmax_apply_entry d h c X i j, hX.apply_eq_smul] simp have h01 : (⟨0, by omega⟩ : Fin d) ≠ ⟨1, by omega⟩ := by simp [Fin.ext_iff] have hx11 : X ⟨1, by omega⟩ ⟨1, by omega⟩ = 0 := by have e := eq ⟨1, by omega⟩ ⟨1, by omega⟩ simp only [h01.symm, false_and, if_false, if_true] at e have : (μ - (c - 1)) * X ⟨1, by omega⟩ ⟨1, by omega⟩ = 0 := by linear_combination e rcases mul_eq_zero.mp this with h' | h' · exact absurd (sub_eq_zero.mp h') h3 · exact h' ext i j have e := eq i j by_cases hi : i = ⟨1, by omega⟩ <;> by_cases hj : j = ⟨1, by omega⟩ · subst hi; subst hj; simpa using hx11 · subst hi simp only [h01.symm, false_and, hj, if_false, if_true] at e have : (μ - (c - 1/2)) * X ⟨1, by omega⟩ j = 0 := by linear_combination e rcases mul_eq_zero.mp this with h' | h' · exact absurd (sub_eq_zero.mp h') h2 · simpa using h' · subst hj simp only [h01.symm, and_false, hi, if_false, if_true] at e have : (μ - (c - 1/2)) * X i ⟨1, by omega⟩ = 0 := by linear_combination e rcases mul_eq_zero.mp this with h' | h' · exact absurd (sub_eq_zero.mp h') h2 · simpa using h' · simp only [hi, hj, if_false] at e have : (μ - c) * X i j = (if i = ⟨0, by omega⟩ ∧ j = ⟨0, by omega⟩ then X ⟨1, by omega⟩ ⟨1, by omega⟩ else 0) := by linear_combination e rw [hx11, ite_self] at this rcases mul_eq_zero.mp this with h' | h' · exact absurd (sub_eq_zero.mp h') h1 · simpa using h'
c is an eigenvalue
Showing c is in the spectrum using an explicit eigenvector.
theorem amp_damping_spmax_mem_c (d : ℕ) (h : 2 ≤ d) (c : ℝ) : (c : ℂ) ∈ spectrum ℂ (amp_damping_generator d h + (c : ℂ) • LinearMap.id : Module.End ℂ (Matrix (Fin d) (Fin d) ℂ)) := by rw [← Module.End.hasEigenvalue_iff_mem_spectrum] apply Module.End.hasEigenvalue_of_hasEigenvector (x := Matrix.single ⟨0, by omega⟩ ⟨0, by omega⟩ 1) refine ⟨?_, ?_⟩ · rw [Module.End.mem_eigenspace_iff] ext i j rw [amp_damping_spmax_apply_entry] have h01 : (⟨0, by omega⟩ : Fin d) ≠ ⟨1, by omega⟩ := by simp [Fin.ext_iff] simp [Matrix.single_apply, h01.symm] split_ifs <;> simp_all · intro h0 have := congrFun (congrFun h0 ⟨0, by omega⟩) ⟨0, by omega⟩ simp at this
The spectral bound is c
Concluding the supremum of real parts is c.
theorem amp_damping_shift_spectral_max_re (d : ℕ) (h : 2 ≤ d) (c : ℝ) : spectral_max_re d (amp_damping_generator d h + (c : ℂ) • LinearMap.id) = c := by unfold spectral_max_re apply IsGreatest.csSup_eq refine ⟨⟨(c : ℂ), amp_damping_spmax_mem_c d h c, by simp⟩, ?_⟩ rintro x ⟨μ, hμ, rfl⟩ rcases amp_damping_spmax_mem_spectrum_cases d h c μ hμ with rfl | rfl | rfl <;> norm_num
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.
theorem amp_damping_spmax_apply_entry (d : ℕ) (h : 2 ≤ d) (c : ℝ) (X : Matrix (Fin d) (Fin d) ℂ) (i j : Fin d) : ((amp_damping_generator d h + (c : ℂ) • LinearMap.id : Module.End ℂ (Matrix (Fin d) (Fin d) ℂ)) X) i j = (if i = ⟨0, by omega⟩ ∧ j = ⟨0, by omega⟩ then X ⟨1, by omega⟩ ⟨1, by omega⟩ else 0) - (1/2 : ℂ) * ((if i = ⟨1, by omega⟩ then X i j else 0) + (if j = ⟨1, by omega⟩ then X i j else 0)) + c * X i j := by simp only [amp_damping_generator, LinearMap.add_apply, LinearMap.sub_apply, LinearMap.comp_apply, LinearMap.smul_apply, LinearMap.mulLeft_apply, LinearMap.mulRight_apply, LinearMap.id_apply, Matrix.add_apply, Matrix.sub_apply, Matrix.smul_apply, smul_eq_mul] simp [v_amp_damping, p_amp_damping, Matrix.mul_apply, Matrix.star_apply, ite_and, Finset.sum_ite_eq'] simp only [apply_ite (starRingEnd ℂ), map_one, map_zero, mul_ite, mul_one, mul_zero, Finset.sum_ite_eq', Finset.mem_univ, if_true] by_cases hi : i = ⟨1, by omega⟩ <;> by_cases hj : j = ⟨1, by omega⟩ <;> simp [hi, hj]theorem amp_damping_spmax_mem_spectrum_cases (d : ℕ) (h : 2 ≤ d) (c : ℝ) (μ : ℂ) (hμ : μ ∈ spectrum ℂ (amp_damping_generator d h + (c : ℂ) • LinearMap.id : Module.End ℂ (Matrix (Fin d) (Fin d) ℂ))) : μ = c ∨ μ = c - 1/2 ∨ μ = c - 1 := by rw [← Module.End.hasEigenvalue_iff_mem_spectrum] at hμ obtain ⟨X, hX⟩ := hμ.exists_hasEigenvector by_contra hne push Not at hne obtain ⟨h1, h2, h3⟩ := hne apply hX.2 have eq : ∀ i j, μ * X i j = (if i = ⟨0, by omega⟩ ∧ j = ⟨0, by omega⟩ then X ⟨1, by omega⟩ ⟨1, by omega⟩ else 0) - (1/2 : ℂ) * ((if i = ⟨1, by omega⟩ then X i j else 0) + (if j = ⟨1, by omega⟩ then X i j else 0)) + c * X i j := by intro i j rw [← amp_damping_spmax_apply_entry d h c X i j, hX.apply_eq_smul] simp have h01 : (⟨0, by omega⟩ : Fin d) ≠ ⟨1, by omega⟩ := by simp [Fin.ext_iff] have hx11 : X ⟨1, by omega⟩ ⟨1, by omega⟩ = 0 := by have e := eq ⟨1, by omega⟩ ⟨1, by omega⟩ simp only [h01.symm, false_and, if_false, if_true] at e have : (μ - (c - 1)) * X ⟨1, by omega⟩ ⟨1, by omega⟩ = 0 := by linear_combination e rcases mul_eq_zero.mp this with h' | h' · exact absurd (sub_eq_zero.mp h') h3 · exact h' ext i j have e := eq i j by_cases hi : i = ⟨1, by omega⟩ <;> by_cases hj : j = ⟨1, by omega⟩ · subst hi; subst hj; simpa using hx11 · subst hi simp only [h01.symm, false_and, hj, if_false, if_true] at e have : (μ - (c - 1/2)) * X ⟨1, by omega⟩ j = 0 := by linear_combination e rcases mul_eq_zero.mp this with h' | h' · exact absurd (sub_eq_zero.mp h') h2 · simpa using h' · subst hj simp only [h01.symm, and_false, hi, if_false, if_true] at e have : (μ - (c - 1/2)) * X i ⟨1, by omega⟩ = 0 := by linear_combination e rcases mul_eq_zero.mp this with h' | h' · exact absurd (sub_eq_zero.mp h') h2 · simpa using h' · simp only [hi, hj, if_false] at e have : (μ - c) * X i j = (if i = ⟨0, by omega⟩ ∧ j = ⟨0, by omega⟩ then X ⟨1, by omega⟩ ⟨1, by omega⟩ else 0) := by linear_combination e rw [hx11, ite_self] at this rcases mul_eq_zero.mp this with h' | h' · exact absurd (sub_eq_zero.mp h') h1 · simpa using h'theorem amp_damping_spmax_mem_c (d : ℕ) (h : 2 ≤ d) (c : ℝ) : (c : ℂ) ∈ spectrum ℂ (amp_damping_generator d h + (c : ℂ) • LinearMap.id : Module.End ℂ (Matrix (Fin d) (Fin d) ℂ)) := by rw [← Module.End.hasEigenvalue_iff_mem_spectrum] apply Module.End.hasEigenvalue_of_hasEigenvector (x := Matrix.single ⟨0, by omega⟩ ⟨0, by omega⟩ 1) refine ⟨?_, ?_⟩ · rw [Module.End.mem_eigenspace_iff] ext i j rw [amp_damping_spmax_apply_entry] have h01 : (⟨0, by omega⟩ : Fin d) ≠ ⟨1, by omega⟩ := by simp [Fin.ext_iff] simp [Matrix.single_apply, h01.symm] split_ifs <;> simp_all · intro h0 have := congrFun (congrFun h0 ⟨0, by omega⟩) ⟨0, by omega⟩ simp at thistheorem amp_damping_shift_spectral_max_re (d : ℕ) (h : 2 ≤ d) (c : ℝ) : spectral_max_re d (amp_damping_generator d h + (c : ℂ) • LinearMap.id) = c := by unfold spectral_max_re apply IsGreatest.csSup_eq refine ⟨⟨(c : ℂ), amp_damping_spmax_mem_c d h c, by simp⟩, ?_⟩ rintro x ⟨μ, hμ, rfl⟩ rcases amp_damping_spmax_mem_spectrum_cases d h c μ hμ with rfl | rfl | rfl <;> norm_num