AFTD Auto-Formalizing Theoretical Domains

LownerHeinzCore.one_div_add_t_operatorConvexOn_Ici

theoremverifiedformalizationimported Lean

LownerHeinzCore.one_div_add_t_operatorConvexOn_Ici

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
theorem LownerHeinzCore.one_div_add_t_operatorConvexOn_Ici : โˆ€ (t : โ„), 0 < t โ†’
  OperatorConvexOn (๐“ := ๐“) (Set.Ici (0 : โ„)) (fun x : โ„ โ†ฆ 1 / (x + t))
Formalizes
QuantumInfo, `LownerHeinzCore.one_div_add_t_operatorConvexOn_Ici`
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 4

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
theorem LownerHeinzCore.one_div_add_t_operatorConvexOn_Ici : โˆ€ (t : โ„), 0 < t โ†’
  OperatorConvexOn (๐“ := ๐“) (Set.Ici (0 : โ„)) (fun x : โ„ โ†ฆ 1 / (x + t)) := by
  /-
  It follows from one_div_operatorConvexOn_Ioi
  -/
  intro t ht
  dsimp [OperatorConvexOn]
  intro A B ฮธ hA hB hฮธ0 hฮธ1 As Bs
  -- rewrite `1 / (x + t)` as `(x + t)โปยน` for `simp`/`cfc` lemmas
  simp only [one_div]
  -- Reduce to operator convexity of `x โ†ฆ xโปยน` on `Ioi 0` by shifting by `t`.
  set C : ๐“ := (1 - ฮธ) โ€ข A + ฮธ โ€ข B
  have hC : IsSelfAdjoint C := by
    simpa [C] using (IsSelfAdjoint.all (1 - ฮธ)).smul hA |>.add ((IsSelfAdjoint.all ฮธ).smul hB)
  set shift : โ„ โ†’ โ„ := fun x โ†ฆ x + t
  set T : ๐“ := algebraMap โ„ (๐“) t
  have hT : IsSelfAdjoint T := by
    simpa [T] using (IsSelfAdjoint.algebraMap (A := ๐“) (r := t)
      (hr := IsSelfAdjoint.all (t : โ„)))
  have A_nonneg : 0 โ‰ค A := by
    have h0 : 0 โ‰ค cfcR (fun x : โ„ โ†ฆ x) A := by
      dsimp [cfcR]
      apply cfc_nonneg
      intro x hx
      simpa [Set.Ici] using (As hx)
    simpa [cfcR, cfc_id' (R := โ„) (a := A) (ha := hA)] using h0
  have B_nonneg : 0 โ‰ค B := by
    have h0 : 0 โ‰ค cfcR (fun x : โ„ โ†ฆ x) B := by
      dsimp [cfcR]
      apply cfc_nonneg
      intro x hx
      simpa [Set.Ici] using (Bs hx)
    simpa [cfcR, cfc_id' (R := โ„) (a := B) (ha := hB)] using h0
  have C_nonneg : 0 โ‰ค C := by
    simpa [C] using add_nonneg (smul_nonneg (sub_nonneg.mpr hฮธ1) A_nonneg) (smul_nonneg hฮธ0 B_nonneg)
  have hA_shift : cfcR shift A = A + T := by
    dsimp [cfcR, shift, T]
    simpa [cfc_id' (R := โ„) (a := A) (ha := hA)] using
      (cfc_add_const (R := โ„) (A := ๐“) (p := IsSelfAdjoint) (r := t)
        (f := fun x : โ„ โ†ฆ x) (a := A) (ha := hA))
  have hB_shift : cfcR shift B = B + T := by
    dsimp [cfcR, shift, T]
    simpa [cfc_id' (R := โ„) (a := B) (ha := hB)] using
      (cfc_add_const (R := โ„) (A := ๐“) (p := IsSelfAdjoint) (r := t)
        (f := fun x : โ„ โ†ฆ x) (a := B) (ha := hB))
  have hC_shift : cfcR shift C = C + T := by
    dsimp [cfcR, shift, T]
    simpa [cfc_id' (R := โ„) (a := C) (ha := hC)] using
      (cfc_add_const (R := โ„) (A := ๐“) (p := IsSelfAdjoint) (r := t)
        (f := fun x : โ„ โ†ฆ x) (a := C) (ha := hC))
  set A1 : ๐“ := A + T
  set B1 : ๐“ := B + T
  set C1 : ๐“ := (1 - ฮธ) โ€ข A1 + ฮธ โ€ข B1
  have hA1_sa : IsSelfAdjoint A1 := by
    subst A1
    exact hA.add hT
  have hB1_sa : IsSelfAdjoint B1 := by
    subst B1
    exact hB.add hT
  have specA1 : spectrum โ„ A1 โІ Set.Ioi (0 : โ„) := by
    intro x hx
    have hs : spectrum โ„ (cfc shift A) = shift '' spectrum โ„ A := by
      simpa [shift] using
        (cfc_map_spectrum (R := โ„) (A := ๐“) (p := IsSelfAdjoint) (a := A)
          (f := shift) (ha := hA))
    have hx' : x โˆˆ shift '' spectrum โ„ A := by
      have hx0 : x โˆˆ spectrum โ„ (cfc shift A) := by
        have hval : cfc shift A = A1 := by
          simpa [cfcR, shift, A1] using hA_shift
        simpa [hval] using hx
      simpa [hs] using hx0
    rcases hx' with โŸจy, hy, rflโŸฉ
    have hy0 : 0 โ‰ค y := by
      simpa [Set.Ici] using (As hy)
    simpa [Set.Ioi] using (add_pos_of_nonneg_of_pos hy0 ht)
  have specB1 : spectrum โ„ B1 โІ Set.Ioi (0 : โ„) := by
    intro x hx
    have hs : spectrum โ„ (cfc shift B) = shift '' spectrum โ„ B := by
      simpa [shift] using
        (cfc_map_spectrum (R := โ„) (A := ๐“) (p := IsSelfAdjoint) (a := B)
          (f := shift) (ha := hB))
    have hx' : x โˆˆ shift '' spectrum โ„ B := by
      have hx0 : x โˆˆ spectrum โ„ (cfc shift B) := by
        have hval : cfc shift B = B1 := by
          simpa [cfcR, shift, B1] using hB_shift
        simpa [hval] using hx
      simpa [hs] using hx0
    rcases hx' with โŸจy, hy, rflโŸฉ
    have hy0 : 0 โ‰ค y := by
      simpa [Set.Ici] using (Bs hy)
    simpa [Set.Ioi] using (add_pos_of_nonneg_of_pos hy0 ht)
  have hC1 : C1 = C + T := by
    subst A1 B1 C1
    simp [C, add_assoc, add_left_comm, add_comm, smul_add]
  have hshift_ne0_A : โˆ€ x โˆˆ spectrum โ„ A, shift x โ‰  0 := by
    intro x hx
    have hx0 : 0 โ‰ค x := by
      simpa [Set.Ici] using (As hx)
    exact ne_of_gt (by simpa [shift] using (add_pos_of_nonneg_of_pos hx0 ht))
  have hshift_ne0_B : โˆ€ x โˆˆ spectrum โ„ B, shift x โ‰  0 := by
    intro x hx
    have hx0 : 0 โ‰ค x := by
      simpa [Set.Ici] using (Bs hx)
    exact ne_of_gt (by simpa [shift] using (add_pos_of_nonneg_of_pos hx0 ht))
  have hshift_ne0_C : โˆ€ x โˆˆ spectrum โ„ C, shift x โ‰  0 :=
    fun x hx โ†ฆ ne_of_gt (by simpa [shift] using (add_pos_of_nonneg_of_pos (spectrum_nonneg_of_nonneg C_nonneg hx) ht))
  have hA_inv : cfcR (fun x : โ„ โ†ฆ (x + t)โปยน) A = Ring.inverse A1 := by
    have h' : cfc (fun x : โ„ โ†ฆ (shift x)โปยน) A = Ring.inverse (cfc shift A) := by
      simpa [shift] using (cfc_inv (R := โ„) (A := ๐“) (p := IsSelfAdjoint)
        (f := shift) (a := A) hshift_ne0_A (ha := hA))
    have hval : cfc shift A = A1 := by
      simpa [cfcR, shift, A1] using hA_shift
    simpa [cfcR, shift, hval] using h'
  have hB_inv : cfcR (fun x : โ„ โ†ฆ (x + t)โปยน) B = Ring.inverse B1 := by
    have h' : cfc (fun x : โ„ โ†ฆ (shift x)โปยน) B = Ring.inverse (cfc shift B) := by
      simpa [shift] using (cfc_inv (R := โ„) (A := ๐“) (p := IsSelfAdjoint)
        (f := shift) (a := B) hshift_ne0_B (ha := hB))
    have hval : cfc shift B = B1 := by
      simpa [cfcR, shift, B1] using hB_shift
    simpa [cfcR, shift, hval] using h'
  have hC_inv : cfcR (fun x : โ„ โ†ฆ (x + t)โปยน) C = Ring.inverse (C + T) := by
    have h' : cfc (fun x : โ„ โ†ฆ (shift x)โปยน) C = Ring.inverse (cfc shift C) := by
      simpa [shift] using (cfc_inv (R := โ„) (A := ๐“) (p := IsSelfAdjoint)
        (f := shift) (a := C) hshift_ne0_C (ha := hC))
    have hval : cfc shift C = C + T := by
      simpa [cfcR, shift] using hC_shift
    simpa [cfcR, shift, hval] using h'
  have hA1_inv : cfcR (fun x : โ„ โ†ฆ xโปยน) A1 = Ring.inverse A1 := by
    dsimp [cfcR]
    simpa [cfc_id' (R := โ„) (a := A1) (ha := hA1_sa)] using
      (cfc_inv (R := โ„) (A := ๐“) (p := IsSelfAdjoint) (f := fun x : โ„ โ†ฆ x)
        (a := A1) (fun x hx โ†ฆ ne_of_gt (specA1 hx)) (ha := hA1_sa))
  have hB1_inv : cfcR (fun x : โ„ โ†ฆ xโปยน) B1 = Ring.inverse B1 := by
    dsimp [cfcR]
    simpa [cfc_id' (R := โ„) (a := B1) (ha := hB1_sa)] using
      (cfc_inv (R := โ„) (A := ๐“) (p := IsSelfAdjoint) (f := fun x : โ„ โ†ฆ x)
        (a := B1) (fun x hx โ†ฆ ne_of_gt (specB1 hx)) (ha := hB1_sa))
  have hA_eq : cfcR (fun x : โ„ โ†ฆ (x + t)โปยน) A = cfcR (fun x : โ„ โ†ฆ xโปยน) A1 := by
    simp [hA_inv, hA1_inv]
  have hB_eq : cfcR (fun x : โ„ โ†ฆ (x + t)โปยน) B = cfcR (fun x : โ„ โ†ฆ xโปยน) B1 := by
    simp [hB_inv, hB1_inv]
  have specC1 : spectrum โ„ C1 โІ Set.Ioi (0 : โ„) := by
    intro x hx
    have hs : spectrum โ„ (cfc shift C) = shift '' spectrum โ„ C := by
      simpa [shift] using
        (cfc_map_spectrum (R := โ„) (A := ๐“) (p := IsSelfAdjoint) (a := C)
          (f := shift) (ha := hC))
    have hx' : x โˆˆ shift '' spectrum โ„ C := by
      have hx0 : x โˆˆ spectrum โ„ (cfc shift C) := by
        have hval : cfc shift C = C + T := by
          simpa [cfcR, shift] using hC_shift
        have hval' : cfc shift C = C1 := by
          simpa [hC1] using hval
        simpa [hval'] using hx
      simpa [hs] using hx0
    rcases hx' with โŸจy, hy, rflโŸฉ
    have hy0 : 0 โ‰ค y := spectrum_nonneg_of_nonneg C_nonneg hy
    have : 0 < y + t := add_pos_of_nonneg_of_pos hy0 ht
    simpa [Set.Ioi] using this
  have hC1_ne0 : โˆ€ x โˆˆ spectrum โ„ C1, (x : โ„) โ‰  0 := fun x hx โ†ฆ ne_of_gt (specC1 hx)
  have hC1_sa : IsSelfAdjoint C1 := by
    simpa [hC1] using (hC.add hT)
  have hC1_inv : cfcR (fun x : โ„ โ†ฆ xโปยน) C1 = Ring.inverse C1 := by
    dsimp [cfcR]
    simpa [cfc_id' (R := โ„) (a := C1) (ha := hC1_sa)] using
      (cfc_inv (R := โ„) (A := ๐“) (p := IsSelfAdjoint) (f := fun x : โ„ โ†ฆ x)
        (a := C1) hC1_ne0 (ha := hC1_sa))
  have hC_eq : cfcR (fun x : โ„ โ†ฆ (x + t)โปยน) C = cfcR (fun x : โ„ โ†ฆ xโปยน) C1 := by
    calc
      cfcR (fun x : โ„ โ†ฆ (x + t)โปยน) C
          = Ring.inverse (C + T) := hC_inv
      _ = Ring.inverse C1 := by simp [hC1]
      _ = cfcR (fun x : โ„ โ†ฆ xโปยน) C1 := by simpa using hC1_inv.symm
  have hconv :
      cfcR (fun x : โ„ โ†ฆ xโปยน) C1
        โ‰ค (1 - ฮธ) โ€ข cfcR (fun x : โ„ โ†ฆ xโปยน) A1
          + ฮธ โ€ข cfcR (fun x : โ„ โ†ฆ xโปยน) B1 := by
    simpa [one_div] using
      (one_div_operatorConvexOn_Ioi  (A := A1) (B := B1) (t := ฮธ)
        hA1_sa hB1_sa hฮธ0 hฮธ1 specA1 specB1)
  -- conclude by rewriting everything to the shifted `1/x` convexity statement
  simpa [C, hC_eq, hA_eq, hB_eq] using hconv
See it in the graphDiscuss this resultChallenge it