Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Classical reduction in a common eigenbasis

Proved
QAlgorithms.Papers.Independent.Support50.P19.commutingReduction

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

prove2quantum

Let α>1\alpha>1α>1, let (∣x⟩)x(|x\rangle)_x(∣x⟩)x​ be any orthonormal basis of a positive-dimensional finite complex space, and let ax,bx≥0a_x,b_x\ge0ax​,bx​≥0. Put A=∑xax∣x⟩⟨x∣A=\sum_xa_x|x\rangle\langle x|A=∑x​ax​∣x⟩⟨x∣ and B=∑xbx∣x⟩⟨x∣B=\sum_xb_x|x\rangle\langle x|B=∑x​bx​∣x⟩⟨x∣. Then

D~α(A∥B)=Dα(A∥B)=1α−1log⁡2∑xaxαbx1−α.\widetilde D_\alpha(A\Vert B)=D_\alpha(A\Vert B)=\frac1{\alpha-1}\log_2\sum_x a_x^\alpha b_x^{1-\alpha}.Dα​(A∥B)=Dα​(A∥B)=α−11​log2​x∑​axα​bx1−α​.

The right side is +∞+\infty+∞ if any ax>0a_x>0ax​>0 has bx=0b_x=0bx​=0; a term with ax=0a_x=0ax​=0 contributes zero, and a zero total has logarithm −∞-\infty−∞. Every commuting positive pair has this common-eigenbasis form. This identifies the classical specialization without imposing normalization.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P19
Formal statement
noncomputable section

open scoped Matrix ComplexOrder ComplexConjugate ENNReal

open Filter Topology

namespace QAlgorithms.Papers.Independent.Support50.P19

attribute [local instance] Classical.propDecidable Classical.decEq

open QAlgorithms.Papers.Independent.Dependency50.P35
  (tr Dominates spectralPower elog elogNN rawTrace cq)

open QAlgorithms.Papers.Independent.Dependency50.P09 (sandwichedD petzD relativeD)

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

open QAlgorithms.Papers.Independent.Information100.P27 (average)

open QAlgorithms.Papers.Independent.Information100.P67
  (IsIsometry receiverChannel complementaryChannel)

open QAlgorithms.Papers.Independent.Claimed50.P48 (FiniteKrausCP)

open QAlgorithms.Papers.Independent.Dependency50.P23
  (UACode uaCodeSuccess ordinaryClassicalCapacity IsEB IsHadamard)

open QAlgorithms.Papers.Independent.Information100.P08 (Ensemble)

open QAlgorithms.Papers.Independent.Information100.P71 (channelPower)

open QAlgorithms.Papers.Independent.Information100.P62 (tensorChannel)

open QAlgorithms.Papers.Independent.Information100.P63 (tensorPower)

open QAlgorithms.Papers.Independent.Claimed50.P26
  (CovariantIrreducible minOutput UnassistedExponentialConverse)

variable {I J K L : Type} [Fintype I] [Fintype J] [Fintype K] [Fintype L]

variable [DecidableEq I] [DecidableEq J] [DecidableEq K] [DecidableEq L]

/-- PDF p.12: simultaneous diagonalization in any orthonormal basis gives the classical
unnormalized expression, including unsupported and zero operators. -/
theorem commutingReduction [Nonempty I] (a : ℝ) (ha : 1 < a) (p q : I → ℝ)
    (hp : ∀ i, 0 ≤ p i) (hq : ∀ i, 0 ≤ q i) (U : Matrix.unitaryGroup I ℂ) :
    let A := (U : Matrix I I ℂ) * Matrix.diagonal (fun i => (p i : ℂ)) * (U : Matrix I I ℂ)ᴴ
    let B := (U : Matrix I I ℂ) * Matrix.diagonal (fun i => (q i : ℂ)) * (U : Matrix I I ℂ)ᴴ
    sandwichedD a A B = petzD a A B ∧ petzD a A B = classicalRenyiBits a p q := by sorry

end QAlgorithms.Papers.Independent.Support50.P19

end
Source
Strong converse for the classical capacity of entanglement-breaking and Hadamard channels via a sandwiched Renyi relative entropy, arXiv:1306.1586v4, PDF p. 12, commutingReduction
Read-back

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

Let III be any finite nonempty index set with decidable equality, let a>1a>1a>1 be real, let p,q:I→Rp,q:I\to\mathbb Rp,q:I→R satisfy pi,qi≥0p_i,q_i\ge0pi​,qi​≥0 for every iii, and let UUU be a unitary complex matrix indexed by III. Put A=Udiag⁡(p)U†A=U\operatorname{diag}(p)U^\daggerA=Udiag(p)U† and B=Udiag⁡(q)U†B=U\operatorname{diag}(q)U^\daggerB=Udiag(q)U†. For positive semidefinite XXX, let X[t]X^{[t]}X[t] send positive eigenvalues xxx to xtx^txt and zero eigenvalues to zero, and let L(x)=log⁡2x\mathcal L(x)=\log_2 xL(x)=log2​x for x>0x>0x>0 and −∞-\infty−∞ otherwise. Define Da(A∥B)D_a(A\|B)Da​(A∥B) and Pa(A∥B)P_a(A\|B)Pa​(A∥B) to be +∞+\infty+∞ if ker⁡B⊈ker⁡A\ker B\not\subseteq\ker AkerB⊆kerA, and otherwise to be, respectively,

L ⁣(Re⁡tr⁡[(B[(1−a)/(2a)]AB[(1−a)/(2a)])[a]])a−1,L ⁣(Re⁡tr⁡[A[a]B[1−a]])a−1.\frac{\mathcal L\!\left(\operatorname{Re}\operatorname{tr}\left[(B^{[(1-a)/(2a)]}AB^{[(1-a)/(2a)]})^{[a]}\right]\right)}{a-1}, \qquad \frac{\mathcal L\!\left(\operatorname{Re}\operatorname{tr}[A^{[a]}B^{[1-a]}]\right)}{a-1}.a−1L(Retr[(B[(1−a)/(2a)]AB[(1−a)/(2a)])[a]])​,a−1L(Retr[A[a]B[1−a]])​.

Then Da(A∥B)=Pa(A∥B)=Ca(p,q)D_a(A\|B)=P_a(A\|B)=C_a(p,q)Da​(A∥B)=Pa​(A∥B)=Ca​(p,q), where

Ca(p,q)={1a−1L ⁣(∑i∈I{0,pi=0,piaqi 1−a,pi≠0,),if every qi=0 implies pi=0,+∞,otherwise.C_a(p,q)= \begin{cases} \displaystyle\frac{1}{a-1}\mathcal L\!\left(\sum_{i\in I} \begin{cases}0,&p_i=0,\\p_i^a q_i^{\,1-a},&p_i\ne0,\end{cases}\right), &\text{if every }q_i=0\text{ implies }p_i=0,\\ +\infty,&\text{otherwise}. \end{cases}Ca​(p,q)=⎩⎨⎧​a−11​L(i∈I∑​{0,pia​qi1−a​,​pi​=0,pi​=0,​),+∞,​if every qi​=0 implies pi​=0,otherwise.​

No normalization of ppp or qqq is assumed. Zero coordinates are permitted; if all pi=0p_i=0pi​=0, all three quantities equal −∞-\infty−∞.

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