Corollary 22
OpenQAlgorithms.Papers.Independent.Intakenext100.P56.maximally_entangled_discordAll 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.
Let , where and both Schmidt families are orthonormal. For ,
An unused orthogonal complement in is allowed. The optimization still ranges over arbitrary rank-one POVMs; the proof's equal-probability sentence is not used to restrict them.
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 p.21, Corollary 22, (5.40).
Schmidt rank equals |A|; B may contain an unused orthogonal complement. -/
theorem maximally_entangled_discord (a : ℝ) (ha : DPOrder a)
(d : ℕ) (hd : 0 < d) (hdA : d = Fintype.card A)
(U : Matrix A (Fin d) ℂ) (V : Matrix B (Fin d) ℂ)
(hU : Uᴴ * U = 1) (hV : Vᴴ * V = 1) :
renyiDiscord a (pureDensity (maxEntangledKet d U V)) =
(Real.log (Fintype.card A) : EReal) := 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, let , , let be a positive integer equal to , and let and be matrices satisfying and . Define
Then , with the right-hand side embedded into the extended reals, where is defined as follows. For every positive integer and positive semidefinite family on summing to , form
Its objective, viewing its registers as with , , , is
where acts on , and is spectral functional calculus with value at a zero eigenvalue and otherwise. The quantity is the extended-real infimum of these objectives. The hypotheses include , in which case the asserted value is ; they do not require to be surjective.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.