Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Every measurement outcome is stable in sine distance

Open
QAlgorithms.Papers.Independent.Intakenext100.P97.measurement_outcome_stability

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Δ(ρ,σ).

Let χ\chiχ and ω\omegaω be density operators on the same finite-dimensional system. For any measurement outcome with effect 0⪯Ea⪯I0\preceq E_a\preceq I0⪯Ea​⪯I, put p(a∣ρ)=Tr⁡(Eaρ)p(a\mid\rho)=\operatorname{Tr}(E_a\rho)p(a∣ρ)=Tr(Ea​ρ). Then

∣p(a∣χ)−p(a∣ω)∣≤D(χ,ω).|p(a\mid\chi)-p(a\mid\omega)|\le D(\chi,\omega).∣p(a∣χ)−p(a∣ω)∣≤D(χ,ω).

This single-outcome estimate holds for arbitrary measurements: every outcome is an effect, and every effect is an outcome of the two-outcome POVM {Ea,I−Ea}\{E_a,I-E_a\}{Ea​,I−Ea​}.

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 2, Eq. (7). An arbitrary outcome effect covers
all measurements, without restricting their number of outcomes. -/
theorem measurement_outcome_stability {d : ℕ}
    (chi omega effect : Matrix (Fin d) (Fin d) ℂ)
    (hchi : IsDensityMatrix chi) (homega : IsDensityMatrix omega)
    (heffect : IsEffect effect) :
    |effectProb effect chi - effectProb effect omega| ≤ 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 2, Eq. (7)
Read-back

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

For every natural number ddd, every two positive semidefinite complex d×dd\times dd×d matrices χ,ω\chi,\omegaχ,ω of trace 111, and every complex d×dd\times dd×d matrix MMM such that both MMM and I−MI-MI−M are positive semidefinite, the theorem asserts

∣Re⁡tr⁡(Mχ)−Re⁡tr⁡(Mω)∣≤1−[Re⁡tr⁡χ ωχ]2.\left|\operatorname{Re}\operatorname{tr}(M\chi) -\operatorname{Re}\operatorname{tr}(M\omega)\right| \le \sqrt{1-\left[\operatorname{Re}\operatorname{tr} \sqrt{\sqrt\chi\,\omega\sqrt\chi}\right]^2}.∣Retr(Mχ)−Retr(Mω)∣≤1−[Retrχ​ωχ​​]2​.

The matrix square roots use real continuous functional calculus. The two states need not be distinct. The quantified case d=0d=0d=0 has no matrices satisfying the trace-111 hypotheses.

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