Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Squared-fidelity variation is bounded by sine distance

Open
QAlgorithms.Papers.Independent.Intakenext100.P97.fidelity_variation

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

prove2quantum

All states are positive semidefinite, trace-one matrices, including pure and rank-deficient states. Write F(ρ,σ)F(\rho,\sigma)F(ρ,σ) for squared Uhlmann fidelity, f=F(ρ1,ρ2)f=\sqrt{F(\rho_1,\rho_2)}f=F(ρ1​,ρ2​)​, and D(ρ,σ)=1−F(ρ,σ)=sin⁡Δ(ρ,σ)D(\rho,\sigma)=\sqrt{1-F(\rho,\sigma)}=\sin\Delta(\rho,\sigma)D(ρ,σ)=1−F(ρ,σ)​=sinΔ(ρ,σ).

For any three density operators χ,ω,ρ\chi,\omega,\rhoχ,ω,ρ on the same finite-dimensional system,

∣F(χ,ρ)−F(ω,ρ)∣≤D(χ,ω).|F(\chi,\rho)-F(\omega,\rho)|\le D(\chi,\omega).∣F(χ,ρ)−F(ω,ρ)∣≤D(χ,ω).

This controls changes in fidelity with a fixed reference state, including equality and orthogonality of χ\chiχ and ω\omegaω.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P97
Formal statement
noncomputable section

open scoped Matrix ComplexConjugate

namespace QAlgorithms.Papers.Independent.Intakenext100.P97

open QAlgorithms.Papers.Independent.Information100.P67
  (squaredFidelity sineDistance receiverChannel)

open QAlgorithms.Papers.Independent.Dependency50.P48 (densityPower)

/-- PDF p.2, §II, Lemma 1, Eq. (5). Absolute-value bars are visible
in the PDF; `F` is squared fidelity, not the root fidelity. -/
theorem fidelity_variation {d : ℕ} (chi omega rho : Matrix (Fin d) (Fin d) ℂ)
    (hchi : IsDensityMatrix chi) (homega : IsDensityMatrix omega)
    (hrho : IsDensityMatrix rho) :
    |squaredFidelity chi rho - squaredFidelity omega rho| ≤ sineDistance chi omega := by sorry

end QAlgorithms.Papers.Independent.Intakenext100.P97

end
Source
Lower bound on the relative error of mixed-state cloning and related operations, arXiv:quant-ph/0208159v2, PDF p. 2, §II, Lemma 1, Eq. (5)
Read-back

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

For every natural number ddd and every three positive semidefinite complex d×dd\times dd×d matrices χ,ω,ρ\chi,\omega,\rhoχ,ω,ρ, each of trace 111, define

F(X,Y)=Re⁡tr⁡X YX.F(X,Y)=\operatorname{Re}\operatorname{tr}\sqrt{\sqrt X\,Y\sqrt X}.F(X,Y)=RetrX​YX​​.

The theorem asserts

∣F(χ,ρ)2−F(ω,ρ)2∣≤1−F(χ,ω)2.\left|F(\chi,\rho)^2-F(\omega,\rho)^2\right| \le \sqrt{1-F(\chi,\omega)^2}.​F(χ,ρ)2−F(ω,ρ)2​≤1−F(χ,ω)2​.

Here matrix square roots are those supplied by real continuous functional calculus. No distinctness assumption is imposed. Although d=0d=0d=0 is quantified over, its trace-111 hypotheses cannot be satisfied.

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