Classical reduction in a common eigenbasis
ProvedQAlgorithms.Papers.Independent.Support50.P19.commutingReductionLet , let be any orthonormal basis of a positive-dimensional finite complex space, and let . Put and . Then
The right side is if any has ; a term with contributes zero, and a zero total has logarithm . Every commuting positive pair has this common-eigenbasis form. This identifies the classical specialization without imposing normalization.
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P19
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
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be any finite nonempty index set with decidable equality, let be real, let satisfy for every , and let be a unitary complex matrix indexed by . Put and . For positive semidefinite , let send positive eigenvalues to and zero eigenvalues to zero, and let for and otherwise. Define and to be if , and otherwise to be, respectively,
Then , where
No normalization of or is assumed. Zero coordinates are permitted; if all , all three quantities equal .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.