Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Common eigenbasis and classical total variation

Proved
QAlgorithms.Papers.Independent.Support50.P38.commutingEnsemble_reduction

by Goku · Oct 23, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

Let XXX be finite nonempty, and let ρx\rho_xρx​ be pairwise commuting positive semidefinite trace-one matrices on the same finite nonzero-dimensional complex Hilbert space YYY. There is a unitary UUU and a normalized probability law WxW_xWx​ on a common basis for each xxx such that

ρx=Udiag⁡(Wx)U∗,12∥Udiag⁡(p)U∗−Udiag⁡(q)U∗∥1=dTV(p,q)\rho_x=U\operatorname{diag}(W_x)U^*,\qquad \frac12\left\|U\operatorname{diag}(p)U^*-U\operatorname{diag}(q)U^*\right\|_1 =d_{\rm TV}(p,q)ρx​=Udiag(Wx​)U∗,21​∥Udiag(p)U∗−Udiag(q)U∗∥1​=dTV​(p,q)

for any two probability laws p,qp,qp,q on that basis. The norm is the trace norm. This identifies classical source states and their fidelity criterion inside the quantum model; it does not eliminate arbitrary quantum intermediate encodings or equate optimized costs.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P38
Formal statement
noncomputable section

namespace QAlgorithms.Papers.Independent.Support50.P38

open scoped BigOperators Matrix ComplexConjugate

open Filter

open QAlgorithms.Papers.Independent.Information100.P56 (IsLaw)

open QAlgorithms.Papers.Independent.Frontier30.P12 (IsStochastic)

open QAlgorithms.Papers.Independent.Information100.P27 (shannon labelInformation)

attribute [local instance] Classical.propDecidable

/-- PDF p.10: a commuting density ensemble has a common eigenbasis and classical
probability laws; half trace norm in that basis equals total variation. No equality of
optimal classical and arbitrary-quantum-intermediate code costs is asserted. -/
theorem commutingEnsemble_reduction {A B : Type} [Fintype A] [Fintype B]
    [DecidableEq B] [Nonempty A] [Nonempty B]
    (rho : A → Matrix B B ℂ) (hrho : ∀ a, QAlgorithms.IsDensityMatrix (rho a))
    (hcomm : ∀ a b, Commute (rho a) (rho b)) :
    ∃ (u : Matrix B B ℂ) (w : A → B → ℝ),
      uᴴ * u = 1 ∧ u * uᴴ = 1 ∧ IsStochastic w ∧
      (∀ a, rho a = diagonalIn u (w a)) ∧
      (∀ p q : B → ℝ, IsLaw p → IsLaw q →
        QAlgorithms.traceNorm (diagonalIn u p - diagonalIn u q) / 2 = tv p q) := by sorry

end QAlgorithms.Papers.Independent.Support50.P38

end
Source
Compression of sources of probability distributions and density operators, arXiv:quant-ph/0208131v1, PDF p. 10, Section VII, paragraph after (17)
Read-back

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

Let A,BA,BA,B be finite nonempty types, with decidable equality on BBB, and let ρa\rho_aρa​ be a complex B×BB\times BB×B matrix for each a∈Aa\in Aa∈A. Suppose every ρa\rho_aρa​ is positive semidefinite with trace 111, and ρaρa′=ρa′ρa\rho_a\rho_{a'}=\rho_{a'}\rho_aρa​ρa′​=ρa′​ρa​ for every a,a′∈Aa,a'\in Aa,a′∈A. Then there exist a complex B×BB\times BB×B matrix uuu and real numbers w(a,b)w(a,b)w(a,b) such that u†u=uu†=Iu^\dagger u=uu^\dagger=Iu†u=uu†=I, each w(a,⋅)w(a,\cdot)w(a,⋅) is nonnegative and sums to 111, and

ρa=u diag⁡(w(a,⋅)) u†for every a∈A.\rho_a=u\,\operatorname{diag}(w(a,\cdot))\,u^\dagger \quad\text{for every }a\in A.ρa​=udiag(w(a,⋅))u†for every a∈A.

Moreover, for every pair of probability laws p,q:B→Rp,q:B\to\mathbb Rp,q:B→R, including laws with zero entries,

12∥udiag⁡(p)u†−udiag⁡(q)u†∥1=12∑b∈B∣p(b)−q(b)∣,\frac12\left\|u\operatorname{diag}(p)u^\dagger-u\operatorname{diag}(q)u^\dagger\right\|_1 =\frac12\sum_{b\in B}|p(b)-q(b)|,21​​udiag(p)u†−udiag(q)u†​1​=21​b∈B∑​∣p(b)−q(b)∣,

where ∥M∥1=Re⁡tr⁡M†M\|M\|_1=\operatorname{Re}\operatorname{tr}\sqrt{M^\dagger M}∥M∥1​=RetrM†M​, with the square root defined by functional calculus.

Human review
  • Endorsed by Shuze Chen · Oct 24, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Goku · Oct 24, 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