Proposition 20
OpenQAlgorithms.Papers.Independent.Intakenext100.P56.discord_rank_oneAll systems are finite-dimensional complex Hilbert spaces with nonempty finite bases. States are positive semidefinite operators of trace one; pure kets have norm one. All marginal states below are partial traces of the stated joint state. Logarithms are natural, and spectral powers vanish on the kernel, including at exponent zero.
For and every state ,
The right side uses arbitrary finite rank-one POVMs and their actual measurement dilations. The kets need not be normalized or mutually orthogonal, and zero effects can be deleted. The assertion equates infima and does not assert attainment.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P56
noncomputable section
open Filter Topology
open scoped Matrix ComplexConjugate ComplexOrder
namespace QAlgorithms.Papers.Independent.Intakenext100.P56
attribute [local instance] Classical.propDecidable Classical.decEq
open QAlgorithms
open QAlgorithms.Papers.Independent.Information100.P56 (IsLaw entropy average holevo)
open QAlgorithms.Papers.Independent.Information100.P71 (supportPower)
open QAlgorithms.Papers.Independent.Dependency50.P21 (channelAdjoint petz extendedLog marginalAB)
open QAlgorithms.Papers.Independent.Information100.P21 (Op FiniteLOCC)
open QAlgorithms.Papers.Independent.Dependency50.P35 (marginalAC)
open QAlgorithms.Papers.Independent.Dependency50.P07 (bipartiteProduct)
open QAlgorithms.Papers.Independent.Information100.P67 (squaredFidelity)
open QAlgorithms.Papers.Independent.Advance50.P25 (renyiEntropyNats)
variable {A B C D E X : Type}
variable [Fintype A] [Fintype B] [Fintype C] [Fintype D] [Fintype E] [Fintype X]
variable [Nonempty A] [Nonempty B] [Nonempty C] [Nonempty D] [Nonempty E] [Nonempty X]
open scoped Matrix.Norms.L2Operator
/-- arXiv:1410.1443v3, PDF pp.17–18, Proposition 20: equality of infima. -/
theorem discord_rank_one (a : ℝ) (ha : DPOrder a)
(rho : Op (A × B)) (hrho : IsDensityMatrix rho) :
renyiDiscord a rho = rankOneDiscord a rho := by sorry
end QAlgorithms.Papers.Independent.Intakenext100.P56
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For finite register types , with decidable equality, every with , and every positive semidefinite trace-one matrix on , the following two extended-real infima are equal:
The vectors are not required to have norm , and zero vectors are allowed. For a family , the matrix used in these objectives has entries
For on , write
where acts on , subscripts denote partial traces, and applies the scalar function , for , by spectral functional calculus. Both infima embed real objectives into the extended reals and exclude zero outcomes; an empty infimum is . Natural logarithms and inverses retain their total real conventions at zero.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.