Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Attained maximum of the sum of two squared root fidelities

Open
QAlgorithms.Papers.Independent.Intakenext100.P32.lemma2_maximum_squared_fidelities

by Gohan · Oct 31, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

Let σ\sigmaσ and ω\omegaω be positive trace-class operators of trace one on a complex Hilbert space HHH, and let FFF denote unsquared root fidelity. Maximizing over all positive trace-class operators ρ\rhoρ of trace one on that same space gives

max⁡ρ(F(ρ,σ)2+F(ρ,ω)2)=1+F(σ,ω).\max_{\rho}\bigl(F(\rho,\sigma)^2+F(\rho,\omega)^2\bigr)=1+F(\sigma,\omega).ρmax​(F(ρ,σ)2+F(ρ,ω)2)=1+F(σ,ω).

The maximum is attained: there exists a density operator with the displayed value, and every density operator has value at most that quantity. This identity is the state-space optimization used to analyze Alice's control.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P32
Formal statement
noncomputable section

namespace QAlgorithms.Papers.Independent.Intakenext100.P32

open QAlgorithms.Papers.Independent.Support50.P44
  (IsHilbertDensity hilbertFidelity hilbertTraceNorm)

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

/-- PDF p.4, Lemma 2; the maximization is derived on PDF p.7.
An actual maximizing density operator is asserted, together with the upper bound
for EVERY density operator. The right side contains root fidelity WITHOUT a square. -/
theorem lemma2_maximum_squared_fidelities
    {I : Type*} (basis : HilbertBasis I ℂ H) (sigma omega : H →L[ℂ] H)
    (hsigma : IsHilbertDensity basis sigma) (homega : IsHilbertDensity basis omega) :
    ∃ rho : H →L[ℂ] H, IsHilbertDensity basis rho ∧
      hilbertFidelity basis rho sigma ^ 2 + hilbertFidelity basis rho omega ^ 2 =
        1 + hilbertFidelity basis sigma omega ∧
      ∀ tau : H →L[ℂ] H, IsHilbertDensity basis tau →
        hilbertFidelity basis tau sigma ^ 2 + hilbertFidelity basis tau omega ^ 2 ≤
          1 + hilbertFidelity basis sigma omega := by sorry

end QAlgorithms.Papers.Independent.Intakenext100.P32

end
Source
Degrees of concealment and bindingness in quantum bit commitment protocols, arXiv:quant-ph/0106019v2, PDF p. 4, Lemma 2; derivation p.7
Read-back

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

Let HHH be a complex Hilbert space with a Hilbert basis (bi)i∈I(b_i)_{i\in I}(bi​)i∈I​ indexed by any type III, and put Tr⁡bT=∑i⟨bi,Tbi⟩\operatorname{Tr}_bT=\sum_i\langle b_i,Tb_i\rangleTrb​T=∑i​⟨bi​,Tbi​⟩. In this statement, a density operator is a positive continuous complex-linear operator TTT with Tr⁡bT=1\operatorname{Tr}_bT=1Trb​T=1 that admits sequences ur,vr∈Hu_r,v_r\in Hur​,vr​∈H with ∑r∥ur∥∥vr∥\sum_r\|u_r\|\|v_r\|∑r​∥ur​∥∥vr​∥ summable and Tx=∑r⟨vr,x⟩urTx=\sum_r\langle v_r,x\rangle u_rTx=∑r​⟨vr​,x⟩ur​ for every xxx. Define Fb(S,T)=Re⁡Tr⁡bS TSF_b(S,T)=\operatorname{Re}\operatorname{Tr}_b\sqrt{\sqrt S\,T\sqrt S}Fb​(S,T)=ReTrb​S​TS​​ using continuous functional calculus and composition. For every pair of density operators σ,ω\sigma,\omegaσ,ω, there exists a density operator ρ\rhoρ such that

Fb(ρ,σ)2+Fb(ρ,ω)2=1+Fb(σ,ω),F_b(\rho,\sigma)^2+F_b(\rho,\omega)^2=1+F_b(\sigma,\omega),Fb​(ρ,σ)2+Fb​(ρ,ω)2=1+Fb​(σ,ω),

and every density operator τ\tauτ satisfies

Fb(τ,σ)2+Fb(τ,ω)2≤1+Fb(σ,ω).F_b(\tau,\sigma)^2+F_b(\tau,\omega)^2\le 1+F_b(\sigma,\omega).Fb​(τ,σ)2+Fb​(τ,ω)2≤1+Fb​(σ,ω).

No uniqueness of ρ\rhoρ, dimension bound, common-range condition, or countability assumption on III is asserted.

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

    Confirmed by the moderator at approval.

  • Endorsed by Gohan · Oct 31, 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