Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Fidelity concavity and orthogonal-block equality

Open
QAlgorithms.Papers.Independent.Support50.P44.fidelity_concavity

by Goku · Oct 23, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

Let ρ,ρ′,σ,σ′\rho,\rho',\sigma,\sigma'ρ,ρ′,σ,σ′ be density operators on a complex separable Hilbert space, and let p∈[0,1]p\in[0,1]p∈[0,1]. Write F(ρ,σ)=∥ρσ∥1F(\rho,\sigma)=\|\sqrt\rho\sqrt\sigma\|_1F(ρ,σ)=∥ρ​σ​∥1​ for root fidelity. Then

F(pρ+(1−p)ρ′,pσ+(1−p)σ′)≥pF(ρ,σ)+(1−p)F(ρ′,σ′).F(p\rho+(1-p)\rho',p\sigma+(1-p)\sigma')\ge pF(\rho,\sigma)+(1-p)F(\rho',\sigma').F(pρ+(1−p)ρ′,pσ+(1−p)σ′)≥pF(ρ,σ)+(1−p)F(ρ′,σ′).

Equality holds when each of ρ\rhoρ and σ\sigmaσ has support orthogonal to the support of each of ρ′\rho'ρ′ and σ′\sigma'σ′. This includes both endpoint probabilities and identifies the exact behavior of distinguishable blocks.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P44
Formal statement
noncomputable section

namespace QAlgorithms.Papers.Independent.Support50.P44

open QAlgorithms.Papers.Independent.Dependency50.P13 (IsTraceClass compression)

open QAlgorithms.Papers.Independent.Dependency50.P21 (marginalAB)

open QAlgorithms.Papers.Independent.Renew46.P37 (classicalKL)

open Filter

open scoped ENNReal ComplexOrder Matrix

attribute [local instance] Classical.propDecidable

attribute [local instance] Classical.decEq

variable {H : Type*} [NormedAddCommGroup H] [InnerProductSpace ℂ H] [CompleteSpace H]

/-- PDF p.23, Lemma A.1, (136): joint root-fidelity concavity and all four
cross-block conditions for equality. -/
theorem fidelity_concavity {I : Type*} [Countable I] (b : HilbertBasis I ℂ H)
    (rho rho2 sigma sigma2 : H →L[ℂ] H)
    (hrho : IsHilbertDensity b rho) (hrho2 : IsHilbertDensity b rho2)
    (hsigma : IsHilbertDensity b sigma) (hsigma2 : IsHilbertDensity b sigma2)
    (p : ℝ) (hp0 : 0 ≤ p) (hp1 : p ≤ 1) :
    p * hilbertFidelity b rho sigma + (1-p) * hilbertFidelity b rho2 sigma2 ≤
      hilbertFidelity b (hilbertMix p rho rho2) (hilbertMix p sigma sigma2) ∧
    (OrthogonalBlocks rho rho2 sigma sigma2 →
      hilbertFidelity b (hilbertMix p rho rho2) (hilbertMix p sigma sigma2) =
        p * hilbertFidelity b rho sigma + (1-p) * hilbertFidelity b rho2 sigma2) := by sorry

end QAlgorithms.Papers.Independent.Support50.P44

end
Source
Universal recovery map for approximate Markov chains, arXiv:1504.07251v3, PDF p. 23, Lemma A.1
Read-back

What the Lean code literally says, in plain math · gpt-6.1-sol

Let HHH be a complex Hilbert space, let III be a countable type, and let b=(bi)i∈Ib=(b_i)_{i\in I}b=(bi​)i∈I​ be a Hilbert basis of HHH. Write tr⁡b(T)=∑i⟨bi,Tbi⟩\operatorname{tr}_b(T)=\sum_i\langle b_i,Tb_i\rangletrb​(T)=∑i​⟨bi​,Tbi​⟩. Let ρ,ρ2,σ,σ2\rho,\rho_2,\sigma,\sigma_2ρ,ρ2​,σ,σ2​ be bounded complex linear operators on HHH, each positive and having tr⁡b(T)=1\operatorname{tr}_b(T)=1trb​(T)=1, and each trace class in the following sense: there exist sequences ur,vr∈Hu_r,v_r\in Hur​,vr​∈H with ∑r∥ur∥∥vr∥<∞\sum_r\|u_r\|\|v_r\|<\infty∑r​∥ur​∥∥vr​∥<∞ and Tx=∑r⟨vr,x⟩urTx=\sum_r\langle v_r,x\rangle u_rTx=∑r​⟨vr​,x⟩ur​ for every x∈Hx\in Hx∈H. Define

Fb(S,T)=Re⁡tr⁡b ⁣(S TS),F_b(S,T)=\operatorname{Re}\operatorname{tr}_b\!\left(\sqrt{\sqrt S\,T\sqrt S}\right),Fb​(S,T)=Retrb​(S​TS​​),

where the square roots use continuous functional calculus. For every real ppp with 0≤p≤10\le p\le10≤p≤1,

pFb(ρ,σ)+(1−p)Fb(ρ2,σ2)≤Fb ⁣(pρ+(1−p)ρ2, pσ+(1−p)σ2).pF_b(\rho,\sigma)+(1-p)F_b(\rho_2,\sigma_2) \le F_b\!\left(p\rho+(1-p)\rho_2,\ p\sigma+(1-p)\sigma_2\right).pFb​(ρ,σ)+(1−p)Fb​(ρ2​,σ2​)≤Fb​(pρ+(1−p)ρ2​, pσ+(1−p)σ2​).

Moreover, if the four operator products ρρ2\rho\rho_2ρρ2​, ρσ2\rho\sigma_2ρσ2​, σρ2\sigma\rho_2σρ2​, and σσ2\sigma\sigma_2σσ2​ are all zero, this inequality is an equality. Both endpoints p=0p=0p=0 and p=1p=1p=1 are included.

Human review
  • Endorsed by Shuze Chen · Oct 24, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Goku · Oct 24, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me