AFTD Auto-Formalizing Theoretical Domains

LownerHeinzCore.schur_conj_eq_diagonal

theoremverifiedformalizationimported Lean

LownerHeinzCore.schur_conj_eq_diagonal

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
universe u v in
open CFC in
variable {๐“ : Type u} in
variable [CStarAlgebra ๐“] [PartialOrder ๐“] [StarOrderedRing ๐“] in
variable [Nontrivial ๐“] in
variable [NonnegSpectrumClass โ„ ๐“] in
omit [Nontrivial (๐“)] in
omit [PartialOrder ๐“] [StarOrderedRing ๐“] [NonnegSpectrumClass โ„ ๐“] in
lemma LownerHeinzCore.schur_conj_eq_diagonal {C D invC : ๐“} (hInvC_sa : IsSelfAdjoint invC)
    (invC_mul_C : invC * C = (1 : ๐“)) (C_mul_invC : C * invC = (1 : ๐“)) :
    star (!![(1 : ๐“), -invC; 0, 1] : Matrix (Fin 2) (Fin 2) (๐“))
        * (!![C, 1; 1, D] : Matrix (Fin 2) (Fin 2) (๐“))
        * (!![(1 : ๐“), -invC; 0, 1] : Matrix (Fin 2) (Fin 2) (๐“))
      = Matrix.diagonal (fun i : Fin 2 => if i = 0 then C else D - invC)
Formalizes
QuantumInfo, `LownerHeinzCore.schur_conj_eq_diagonal`
Lean proof
By Kei Tsukamoto, Kento Mori, Hayata Yamasaki, from github.com/leanprover-community/physlib at e411c6e89692 (Copyright (c) 2026 Hayata Yamasaki. 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.
Verified
17 Oct 2026
Axioms
Classical.choiceQuot.soundpropext
Used by 1

Lean source view module on GitHub

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
universe u v in
open CFC in
variable {๐“ : Type u} in
variable [CStarAlgebra ๐“] [PartialOrder ๐“] [StarOrderedRing ๐“] in
variable [Nontrivial ๐“] in
variable [NonnegSpectrumClass โ„ ๐“] in
omit [Nontrivial (๐“)] in
omit [PartialOrder ๐“] [StarOrderedRing ๐“] [NonnegSpectrumClass โ„ ๐“] in
lemma LownerHeinzCore.schur_conj_eq_diagonal {C D invC : ๐“} (hInvC_sa : IsSelfAdjoint invC)
    (invC_mul_C : invC * C = (1 : ๐“)) (C_mul_invC : C * invC = (1 : ๐“)) :
    star (!![(1 : ๐“), -invC; 0, 1] : Matrix (Fin 2) (Fin 2) (๐“))
        * (!![C, 1; 1, D] : Matrix (Fin 2) (Fin 2) (๐“))
        * (!![(1 : ๐“), -invC; 0, 1] : Matrix (Fin 2) (Fin 2) (๐“))
      = Matrix.diagonal (fun i : Fin 2 => if i = 0 then C else D - invC) := by
  set U : Matrix (Fin 2) (Fin 2) (๐“) := !![(1 : ๐“), -invC; 0, 1]
  have hstarU : star U = !![(1 : ๐“), 0; -invC, 1] := by
    dsimp [U]
    ext i j
    fin_cases i <;> fin_cases j <;> simp [hInvC_sa.star_eq]
  have hP :
      star U * (!![C, 1; 1, D] : Matrix (Fin 2) (Fin 2) (๐“)) =
        !![C, 1; -invC * C + 1, -invC + D] := by
    simp [hstarU, U]
  have hQ :
      star U * (!![C, 1; 1, D] : Matrix (Fin 2) (Fin 2) (๐“)) * U =
        !![C, 0; 0, D - invC] := by
    have hstep :
        star U * (!![C, 1; 1, D] : Matrix (Fin 2) (Fin 2) (๐“)) * U =
          (!![C, 1; -invC * C + 1, -invC + D] : Matrix (Fin 2) (Fin 2) (๐“)) * U := by
      simpa [mul_assoc] using congrArg (fun X => X * U) hP
    dsimp [U] at hstep โŠข
    simp [hstep, C_mul_invC, invC_mul_C, sub_eq_add_neg, add_comm]
  have hdiag :
      (Matrix.diagonal (fun i : Fin 2 => if i = 0 then C else D - invC)) =
        (!![C, 0; 0, D - invC] : Matrix (Fin 2) (Fin 2) (๐“)) := by
    ext i j
    fin_cases i <;> fin_cases j <;> simp [Matrix.diagonal]
  simpa [hdiag] using hQ
See it in the graphDiscuss this resultChallenge it