Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Qutrit saturation of D+F=1 and necessity of dimension three in the interior

Open
QAlgorithms.Papers.Independent.Intakenext100.P32.qutrit_linear_saturation

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

prove2quantum

For 0≤λ≤10\le\lambda\le10≤λ≤1, define density matrices on C3\mathbb C^3C3 by ρ0(λ)=diag⁡(λ,1−λ,0)\rho_0(\lambda)=\operatorname{diag}(\lambda,1-\lambda,0)ρ0​(λ)=diag(λ,1−λ,0) and ρ1(λ)=diag⁡(0,1−λ,λ)\rho_1(\lambda)=\operatorname{diag}(0,1-\lambda,\lambda)ρ1​(λ)=diag(0,1−λ,λ). Their trace distance D=12Tr⁡∣ρ0−ρ1∣D=\tfrac12\operatorname{Tr}|\rho_0-\rho_1|D=21​Tr∣ρ0​−ρ1​∣ and unsquared root fidelity F=Tr⁡∣ρ0ρ1∣F=\operatorname{Tr}|\sqrt{\rho_0}\sqrt{\rho_1}|F=Tr∣ρ0​​ρ1​​∣ satisfy

D(ρ0(λ),ρ1(λ))=λ,F(ρ0(λ),ρ1(λ))=1−λ,D+F=1.D(\rho_0(\lambda),\rho_1(\lambda))=\lambda,\qquad F(\rho_0(\lambda),\rho_1(\lambda))=1-\lambda,\qquad D+F=1.D(ρ0​(λ),ρ1​(λ))=λ,F(ρ0​(λ),ρ1​(λ))=1−λ,D+F=1.

For any density operators on any complex Hilbert space satisfying D+F=1D+F=1D+F=1 and 0<F<10<F<10<F<1, their two supports cannot be contained in a common subspace of dimension at most two. Together these assertions show that dimension three is the smallest possible common ambient dimension for interior saturation.

The family includes both endpoints. The interior qualification corrects the printed dimension claim: identical states and orthogonal pure states already saturate at the endpoints. This correction requires independent moderation.

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.8, Section VI.B: the qutrit family has D=lam and F=1-lam,
including both endpoints. Source correction: the printed claim that dimension
three is necessary requires INTERIOR saturation, 0<F<1; identical states and
orthogonal pure states are endpoint counterexamples. The second clause excludes
common support of dimension at most two for every interior saturating pair,
on arbitrary Hilbert spaces. Independent moderation of this correction is pending. -/
theorem qutrit_linear_saturation
    {I : Type*} (basis : HilbertBasis I ℂ H) :
    (∀ lam : ℝ, 0 ≤ lam → lam ≤ 1 →
      IsDensityMatrix (qutritToken false lam) ∧
      IsDensityMatrix (qutritToken true lam) ∧
      traceNorm (qutritToken false lam - qutritToken true lam) / 2 = lam ∧
      rootFidelity (qutritToken false lam) (qutritToken true lam) = 1 - lam ∧
      traceNorm (qutritToken false lam - qutritToken true lam) / 2 +
        rootFidelity (qutritToken false lam) (qutritToken true lam) = 1) ∧
    (∀ rho sigma : H →L[ℂ] H,
      IsHilbertDensity basis rho → IsHilbertDensity basis sigma →
      hilbertTraceNorm basis (rho - sigma) / 2 + hilbertFidelity basis rho sigma = 1 →
      0 < hilbertFidelity basis rho sigma → hilbertFidelity basis rho sigma < 1 →
      ¬ CommonQubitSupport rho sigma) := 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. 8, §VI.B, first explicit family
Read-back

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

Let HHH be a complex Hilbert space and (bi)i∈I(b_i)_{i\in I}(bi​)i∈I​ a Hilbert basis indexed by any type III. Set Q0(λ)=diag⁡(λ,1−λ,0)Q_0(\lambda)=\operatorname{diag}(\lambda,1-\lambda,0)Q0​(λ)=diag(λ,1−λ,0) and Q1(λ)=diag⁡(0,1−λ,λ)Q_1(\lambda)=\operatorname{diag}(0,1-\lambda,\lambda)Q1​(λ)=diag(0,1−λ,λ). For finite matrices define N(X)=Re⁡tr⁡X∗XN(X)=\operatorname{Re}\operatorname{tr}\sqrt{X^*X}N(X)=RetrX∗X​ and F(X,Y)=Re⁡tr⁡X YXF(X,Y)=\operatorname{Re}\operatorname{tr}\sqrt{\sqrt X\,Y\sqrt X}F(X,Y)=RetrX​YX​​, with square roots given by continuous functional calculus. The declaration asserts both that, for every real λ\lambdaλ with 0≤λ≤10\le\lambda\le10≤λ≤1, the matrices Q0(λ),Q1(λ)Q_0(\lambda),Q_1(\lambda)Q0​(λ),Q1​(λ) are positive semidefinite with trace one and

N(Q0(λ)−Q1(λ))2=λ,F(Q0(λ),Q1(λ))=1−λ,N(Q0(λ)−Q1(λ))2+F(Q0(λ),Q1(λ))=1,\frac{N(Q_0(\lambda)-Q_1(\lambda))}{2}=\lambda,\qquad F(Q_0(\lambda),Q_1(\lambda))=1-\lambda,\qquad \frac{N(Q_0(\lambda)-Q_1(\lambda))}{2}+F(Q_0(\lambda),Q_1(\lambda))=1,2N(Q0​(λ)−Q1​(λ))​=λ,F(Q0​(λ),Q1​(λ))=1−λ,2N(Q0​(λ)−Q1​(λ))​+F(Q0​(λ),Q1​(λ))=1,

including the endpoints λ=0,1\lambda=0,1λ=0,1; and that the following implication holds for every pair of continuous complex-linear operators ρ,σ\rho,\sigmaρ,σ on HHH. Write Tr⁡bT=∑i⟨bi,Tbi⟩\operatorname{Tr}_bT=\sum_i\langle b_i,Tb_i\rangleTrb​T=∑i​⟨bi​,Tbi​⟩, Nb(T)=Re⁡Tr⁡bT∗TN_b(T)=\operatorname{Re}\operatorname{Tr}_b\sqrt{T^*T}Nb​(T)=ReTrb​T∗T​, and Fb(ρ,σ)=Re⁡Tr⁡bρ σρF_b(\rho,\sigma)=\operatorname{Re}\operatorname{Tr}_b\sqrt{\sqrt\rho\,\sigma\sqrt\rho}Fb​(ρ,σ)=ReTrb​ρ​σρ​​. Suppose each of ρ,σ\rho,\sigmaρ,σ is positive, has basis trace one, and 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, using its own sequences. If

Nb(ρ−σ)2+Fb(ρ,σ)=1and0<Fb(ρ,σ)<1,\frac{N_b(\rho-\sigma)}2+F_b(\rho,\sigma)=1 \quad\text{and}\quad 0<F_b(\rho,\sigma)<1,2Nb​(ρ−σ)​+Fb​(ρ,σ)=1and0<Fb​(ρ,σ)<1,

then there is no finite-dimensional complex subspace of HHH of dimension at most two containing both ranges.

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