Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Pure-state fidelity bound with the support-qualified equality case

Open
QAlgorithms.Papers.Independent.Intakethird100.P21.fidelity_maximization

by Gohan · Nov 1, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

Let d≥2d\ge2d≥2, let μ1,…,μd≥0\mu_1,\ldots,\mu_d\ge0μ1​,…,μd​≥0 sum to one, and let UA,UBU_A,U_BUA​,UB​ be local unitaries. Put V=UATUBV=U_A^T U_BV=UAT​UB​, Φd=d−1/2∑k∣k,k⟩\Phi_d=d^{-1/2}\sum_k|k,k\rangleΦd​=d−1/2∑k​∣k,k⟩, and ψ=(UA⊗UB)∑kμk∣k,k⟩\psi=(U_A\otimes U_B)\sum_k\sqrt{\mu_k}|k,k\rangleψ=(UA​⊗UB​)∑k​μk​​∣k,k⟩. The squared overlap satisfies

⟨Φd∣ψ⟩⟨ψ∣Φd⟩=F(μ,V):=1d∣∑kμkVkk∣2≤F(μ,I).\langle\Phi_d|\psi\rangle\langle\psi|\Phi_d\rangle =F(\mu,V):=\frac1d\left|\sum_k\sqrt{\mu_k}V_{kk}\right|^2 \le F(\mu,I).⟨Φd​∣ψ⟩⟨ψ∣Φd​⟩=F(μ,V):=d1​​k∑​μk​​Vkk​​2≤F(μ,I).

Equality holds exactly when there exists a common complex phase zzz, ∣z∣=1|z|=1∣z∣=1, such that Vkk=zV_{kk}=zVkk​=z for every kkk with μk>0\mu_k>0μk​>0. With full Schmidt support this is equivalent to V=zIV=zIV=zI.

This supplies the fidelity maximization used in the scalar reduction. The product order and support qualifier correct the printed prose; the inequality retains zero Schmidt probabilities.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakethird100_P21
Formal statement
noncomputable section

namespace QAlgorithms.Papers.Independent.Intakethird100.P21

open scoped Matrix ComplexConjugate

open Filter

open QAlgorithms

open QAlgorithms.Papers.Independent.Information100.P03
  (PureEnsemble convexRoof pureConcurrence concurrence SchmidtData schmidtVector)

attribute [local instance] Classical.propDecidable Classical.decEq

/-- PDF p.6, (3.6)--(3.7), corrected: V=UA-transpose times UB.
Printed unrestricted equality iff V is scalar fails for zero Schmidt probabilities;
the common phase is required exactly on their positive support. -/
theorem fidelity_maximization (d : ℕ) (hd : 2 ≤ d) (mu : SchmidtProbabilities d)
    (UA UB : Matrix.unitaryGroup (Fin d) ℂ) :
    let V := (UA : Matrix (Fin d) (Fin d) ℂ)ᵀ * (UB : Matrix (Fin d) (Fin d) ℂ)
    maximallyEntangledOverlap (pureDensity (act (Matrix.kronecker (UA : Matrix (Fin d) (Fin d) ℂ)
      (UB : Matrix (Fin d) (Fin d) ℂ)) (canonicalVector mu))) = fidelityProfile mu V ∧
    fidelityProfile mu V ≤ fidelityProfile mu 1 ∧
    (fidelityProfile mu V = fidelityProfile mu 1 ↔
      ∃ z : ℂ, ‖z‖ = 1 ∧ ∀ k, 0 < mu.probability k → V k k = z) := by sorry

end QAlgorithms.Papers.Independent.Intakethird100.P21

end
Source
I-concurrence and tangle for isotropic states, arXiv:quant-ph/0208002v1, PDF p. 6, §3.1, (3.6)–(3.7): pure-state fidelity bound and its equality condition
Read-back

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

For every natural number d≥2d\ge2d≥2, every collection μ0,…,μd−1≥0\mu_0,\ldots,\mu_{d-1}\ge0μ0​,…,μd−1​≥0 summing to 111, and every pair of unitary complex d×dd\times dd×d matrices UA,UBU_A,U_BUA​,UB​, let

ψμ=∑k<dμk∣k,k⟩,Φd=1d∑k<d∣k,k⟩,V=UATUB.\psi_\mu=\sum_{k<d}\sqrt{\mu_k}|k,k\rangle,\qquad \Phi_d=\frac1{\sqrt d}\sum_{k<d}|k,k\rangle,\qquad V=U_A^{\mathsf T}U_B.ψμ​=k<d∑​μk​​∣k,k⟩,Φd​=d​1​k<d∑​∣k,k⟩,V=UAT​UB​.

Then, with ψ=(UA⊗UB)ψμ\psi=(U_A\otimes U_B)\psi_\muψ=(UA​⊗UB​)ψμ​,

Re⁡tr⁡(∣Φd⟩⟨Φd∣ ∣ψ⟩⟨ψ∣)=∣∑k<dμk Vkk∣2d≤(∑k<dμk)2d.\operatorname{Re}\operatorname{tr} \bigl(|\Phi_d\rangle\langle\Phi_d|\,|\psi\rangle\langle\psi|\bigr) =\frac{\left|\sum_{k<d}\sqrt{\mu_k}\,V_{kk}\right|^2}{d} \le\frac{\left(\sum_{k<d}\sqrt{\mu_k}\right)^2}{d}.Retr(∣Φd​⟩⟨Φd​∣∣ψ⟩⟨ψ∣)=d​∑k<d​μk​​Vkk​​2​≤d(∑k<d​μk​​)2​.

Equality in the displayed inequality holds if and only if there exists a complex number zzz with ∣z∣=1|z|=1∣z∣=1 such that Vkk=zV_{kk}=zVkk​=z for every kkk with μk>0\mu_k>0μk​>0. Zero probabilities are allowed, and the equality condition imposes no diagonal-entry requirement at those indices.

Human review
  • Endorsed by Shuze Chen · Nov 1, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Gohan · Nov 1, 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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me