AFTD Auto-Formalizing Theoretical Domains

LownerHeinzCore.posSemidef_block_one_inv

theoremverifiedformalizationimported Lean

LownerHeinzCore.posSemidef_block_one_inv

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open LownerHeinzCore 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 [NonnegSpectrumClass โ„ ๐“] in
lemma LownerHeinzCore.posSemidef_block_one_inv {A : ๐“} (hA : IsSelfAdjoint A)
    (As : spectrum โ„ A โІ Set.Ioi (0 : โ„)) :
    Matrix.PosSemidef
      (!![A, 1; 1, cfcR (fun x : โ„ โ†ฆ xโปยน) A] : Matrix (Fin 2) (Fin 2) ๐“)
Formalizes
QuantumInfo, `LownerHeinzCore.posSemidef_block_one_inv`
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
Built on 1
Used by 1

Lean source view module on GitHub

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open LownerHeinzCore 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 [NonnegSpectrumClass โ„ ๐“] in
lemma LownerHeinzCore.posSemidef_block_one_inv {A : ๐“} (hA : IsSelfAdjoint A)
    (As : spectrum โ„ A โІ Set.Ioi (0 : โ„)) :
    Matrix.PosSemidef
      (!![A, 1; 1, cfcR (fun x : โ„ โ†ฆ xโปยน) A] : Matrix (Fin 2) (Fin 2) ๐“) := by
  -- Gram matrix construction using `A^{1/2}` and `A^{-1/2}`
  set sqrtA : ๐“ := cfcR (fun x : โ„ โ†ฆ x ^ ((1 : โ„) / 2)) A
  set invSqrtA : ๐“ := cfcR (fun x : โ„ โ†ฆ x ^ ((-1 : โ„) / 2)) A
  set v : Fin 2 โ†’ ๐“ := fun i => if i = 0 then sqrtA else invSqrtA
  have posV : Matrix.PosSemidef (Matrix.vecMulVec v (star v)) := by
    simpa using (Matrix.posSemidef_vecMulVec_self_star (R := ๐“) v)
  have hsqrtA : IsSelfAdjoint sqrtA := by
    dsimp [sqrtA, cfcR]
    exact cfc_predicate _ _
  have hinvSqrtA : IsSelfAdjoint invSqrtA := by
    dsimp [invSqrtA, cfcR]
    exact cfc_predicate _ _
  have hcont_sqrt : ContinuousOn (fun x : โ„ โ†ฆ x ^ ((1 : โ„) / 2)) (spectrum โ„ A) :=
    fun x hx => (Real.continuousAt_rpow_const x _ (Or.inl (ne_of_gt (As hx)))).continuousWithinAt
  have hcont_invSqrt : ContinuousOn (fun x : โ„ โ†ฆ x ^ ((-1 : โ„) / 2)) (spectrum โ„ A) :=
    fun x hx => (Real.continuousAt_rpow_const x _ (Or.inl (ne_of_gt (As hx)))).continuousWithinAt
  have sqrtA_mul_invSqrtA : sqrtA * invSqrtA = (1 : ๐“) := by
    dsimp [sqrtA, invSqrtA, cfcR]
    rw [โ† cfc_mul _ _ A hcont_sqrt hcont_invSqrt, โ† cfc_const_one โ„ A]
    apply cfc_congr
    intro x hx
    dsimp only
    rw [โ† Real.rpow_add (As hx), show ((1 : โ„) / 2 + (-1) / 2 : โ„) = 0 from by ring, Real.rpow_zero]
  have invSqrtA_mul_sqrtA : invSqrtA * sqrtA = (1 : ๐“) := by
    dsimp [sqrtA, invSqrtA, cfcR]
    rw [โ† cfc_mul _ _ A hcont_invSqrt hcont_sqrt, โ† cfc_const_one โ„ A]
    apply cfc_congr
    intro x hx
    dsimp only
    rw [โ† Real.rpow_add (As hx), show ((-1 : โ„) / 2 + (1 : โ„) / 2 : โ„) = 0 from by ring, Real.rpow_zero]
  have invSqrtA_mul_invSqrtA : invSqrtA * invSqrtA = cfcR (fun x : โ„ โ†ฆ x ^ (-1 : โ„)) A := by
    dsimp [invSqrtA, cfcR]
    rw [โ† cfc_mul _ _ A hcont_invSqrt hcont_invSqrt]
    apply cfc_congr
    intro x hx
    dsimp only
    rw [โ† Real.rpow_add (As hx), show ((-1 : โ„) / 2 + (-1 : โ„) / 2 : โ„) = -1 from by ring]
  have sqrtA_mul_sqrtA : sqrtA * sqrtA = A := by
    dsimp [sqrtA, cfcR]
    rw [โ† cfc_mul _ _ A hcont_sqrt hcont_sqrt]
    calc
      cfcR (fun x : โ„ โ†ฆ x ^ ((1 : โ„) / 2) * x ^ ((1 : โ„) / 2)) A =
          cfcR (fun x : โ„ โ†ฆ x) A := by
            apply cfc_congr
            intro x hx
            dsimp only
            rw [โ† Real.rpow_add (As hx), show ((1 : โ„) / 2 + (1 : โ„) / 2 : โ„) = 1 from by ring, Real.rpow_one]
      _ = A := cfc_id' (R := โ„) (a := A) (ha := hA)
  have invA_eq : cfcR (fun x : โ„ โ†ฆ x ^ (-1 : โ„)) A = cfcR (fun x : โ„ โ†ฆ xโปยน) A := by
    dsimp [cfcR]
    apply cfc_congr
    intro x hx
    have hxne : x โ‰  0 := ne_of_gt (As hx)
    simpa [hxne] using (Real.rpow_neg_one x)
  have hEq : Matrix.vecMulVec v (star v) = (!![A, 1; 1, cfcR (fun x : โ„ โ†ฆ xโปยน) A] :
      Matrix (Fin 2) (Fin 2) (๐“)) := by
    ext i j
    fin_cases i <;> fin_cases j <;>
      simp [Matrix.vecMulVec_apply, v, hsqrtA.star_eq, hinvSqrtA.star_eq, sqrtA_mul_sqrtA,
        sqrtA_mul_invSqrtA, invSqrtA_mul_sqrtA, invSqrtA_mul_invSqrtA, invA_eq]
  simpa [hEq] using posV
See it in the graphDiscuss this resultChallenge it