Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Exact tangle and I-concurrence of two-qudit isotropic states

Open
QAlgorithms.Papers.Independent.Intakethird100.P21.isotropic_exact

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

prove2quantum

Let d≥3d\ge3d≥3 be an integer and 0≤F≤10\le F\le10≤F≤1. Put Φd=d−1/2∑j=1d∣j,j⟩\Phi_d=d^{-1/2}\sum_{j=1}^d|j,j\rangleΦd​=d−1/2∑j=1d​∣j,j⟩, Pd=∣Φd⟩⟨Φd∣P_d=|\Phi_d\rangle\langle\Phi_d|Pd​=∣Φd​⟩⟨Φd​∣, and ρd,F=FPd+(1−F)(I−Pd)/(d2−1)\rho_{d,F}=FP_d+(1-F)(I-P_d)/(d^2-1)ρd,F​=FPd​+(1−F)(I−Pd​)/(d2−1). Let CCC be the convex roof of pure I-concurrence 2(1−tr⁡ρA2)\sqrt{2(1-\operatorname{tr}\rho_A^2)}2(1−trρA2​)​, and let τ\tauτ be the separate convex roof of its square. Define ad=4(d−1)/d2a_d=4(d-1)/d^2ad​=4(d−1)/d2, γ=F/d+(d−1)(1−F)/d\gamma=\sqrt{F/d}+\sqrt{(d-1)(1-F)/d}γ=F/d​+(d−1)(1−F)/d​, δ=F/d−(1−F)/(d(d−1))\delta=\sqrt{F/d}-\sqrt{(1-F)/(d(d-1))}δ=F/d​−(1−F)/(d(d−1))​, and qd(F)=2(1−γ4−(d−1)δ4)q_d(F)=2(1-\gamma^4-(d-1)\delta^4)qd​(F)=2(1−γ4−(d−1)δ4). Then ρd,F\rho_{d,F}ρd,F​ is a density operator and

τ(ρd,F)={0F≤1/d,qd(F)1/d<F≤ad,2d(F−1)d−1+2(d−1)dad<F≤1,C(ρd,F)={0F≤1/d,2dd−1(F−1/d)1/d<F≤1.\tau(\rho_{d,F})=\begin{cases}0&F\le1/d,\\q_d(F)&1/d<F\le a_d,\\\dfrac{2d(F-1)}{d-1}+\dfrac{2(d-1)}d&a_d<F\le1,\end{cases} \qquad C(\rho_{d,F})=\begin{cases}0&F\le1/d,\\\sqrt{\dfrac{2d}{d-1}}(F-1/d)&1/d<F\le1.\end{cases}τ(ρd,F​)=⎩⎨⎧​0qd​(F)d−12d(F−1)​+d2(d−1)​​F≤1/d,1/d<F≤ad​,ad​<F≤1,​C(ρd,F​)=⎩⎨⎧​0d−12d​​(F−1/d)​F≤1/d,1/d<F≤1.​

These are exact mixed-state entanglement formulas; in general the tangle is not the square of mixed-state concurrence.

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.13, (3.41)--(3.42), inheriting d>=3 from p.12:
exact mixed-state tangle and I-concurrence, over the full physical F interval. -/
theorem isotropic_exact (d : ℕ) (hd : 3 ≤ d) (F : ℝ) (hF : F ∈ Set.Icc (0 : ℝ) 1) :
    IsDensityMatrix (isotropicDensityAtFidelity d F) ∧
    tangle (isotropicDensityAtFidelity d F) = tangleFormula d F ∧
    concurrence (isotropicDensityAtFidelity d F) = concurrenceFormula d F := by sorry

end QAlgorithms.Papers.Independent.Intakethird100.P21

end
Source
I-concurrence and tangle for isotropic states, arXiv:quant-ph/0208002v1, PDF p. 13, §3.4.3, (3.41)–(3.42): exact tangle and I-concurrence of two-qudit isotropic states
Read-back

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

For every natural number d≥3d\ge3d≥3 and every real F∈[0,1]F\in[0,1]F∈[0,1], let

Φd=1d∑i<d∣i,i⟩,ρF=F∣Φd⟩⟨Φd∣+1−Fd2−1(I−∣Φd⟩⟨Φd∣).\Phi_d=\frac1{\sqrt d}\sum_{i<d}|i,i\rangle,\qquad \rho_F=F|\Phi_d\rangle\langle\Phi_d| +\frac{1-F}{d^2-1}\bigl(I-|\Phi_d\rangle\langle\Phi_d|\bigr).Φd​=d​1​i<d∑​∣i,i⟩,ρF​=F∣Φd​⟩⟨Φd​∣+d2−11−F​(I−∣Φd​⟩⟨Φd​∣).

For a vector ψ\psiψ, put Aψ=Tr⁡2(∣ψ⟩⟨ψ∣)A_\psi=\operatorname{Tr}_2(|\psi\rangle\langle\psi|)Aψ​=Tr2​(∣ψ⟩⟨ψ∣), T0(ψ)=2(1−Re⁡tr⁡(Aψ2))T_0(\psi)=2(1-\operatorname{Re}\operatorname{tr}(A_\psi^2))T0​(ψ)=2(1−Retr(Aψ2​)), and C0(ψ)=T0(ψ)C_0(\psi)=\sqrt{T_0(\psi)}C0​(ψ)=T0​(ψ)​; define T(ρ)T(\rho)T(ρ) and C(ρ)C(\rho)C(ρ) as the respective infima of ∑kwkT0(ψk)\sum_kw_kT_0(\psi_k)∑k​wk​T0​(ψk​) and ∑kwkC0(ψk)\sum_kw_kC_0(\psi_k)∑k​wk​C0​(ψk​) over all finite decompositions ρ=∑kwk∣ψk⟩⟨ψk∣\rho=\sum_kw_k|\psi_k\rangle\langle\psi_k|ρ=∑k​wk​∣ψk​⟩⟨ψk​∣ into unit vectors with nonnegative weights summing to 111. Then ρF\rho_FρF​ is positive semidefinite with trace 111, and, writing

F∗=4(d−1)d2,u=Fd+(d−1)(1−F)d,v=Fd−1−Fd(d−1),F_*=\frac{4(d-1)}{d^2},\qquad u=\sqrt{\frac Fd}+\sqrt{\frac{(d-1)(1-F)}d},\qquad v=\sqrt{\frac Fd}-\sqrt{\frac{1-F}{d(d-1)}},F∗​=d24(d−1)​,u=dF​​+d(d−1)(1−F)​​,v=dF​​−d(d−1)1−F​​,

its two infima satisfy

T(ρF)={0,F≤1/d,2(1−u4−(d−1)v4),1/d<F≤F∗,2d(F−1)d−1+2(d−1)d,F>1/d, F>F∗,C(ρF)={0,F≤1/d,2dd−1(F−1/d),F>1/d.T(\rho_F)= \begin{cases} 0,&F\le1/d,\\ 2(1-u^4-(d-1)v^4),&1/d<F\le F_*,\\ \dfrac{2d(F-1)}{d-1}+\dfrac{2(d-1)}d,&F>1/d,\ F>F_*, \end{cases} \qquad C(\rho_F)= \begin{cases} 0,&F\le1/d,\\ \sqrt{\dfrac{2d}{d-1}}(F-1/d),&F>1/d. \end{cases}T(ρF​)=⎩⎨⎧​0,2(1−u4−(d−1)v4),d−12d(F−1)​+d2(d−1)​,​F≤1/d,1/d<F≤F∗​,F>1/d, F>F∗​,​C(ρF​)=⎩⎨⎧​0,d−12d​​(F−1/d),​F≤1/d,F>1/d.​

The endpoints F=0,1,1/dF=0,1,1/dF=0,1,1/d, and F∗F_*F∗​ are included according to the displayed non-strict inequalities.

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