§7.2 (7.13): Maassen–Uffink relation
OpenQAlgorithms.Papers.Independent.Intakenext100.P07.maassen_uffinkAll quantum systems below are finite-dimensional complex Hilbert spaces of positive dimension, and logarithms are binary. A normalized state is positive semidefinite with trace one; a subnormalized state has trace at most one. Marginals are partial traces. Tildes denote sandwiched Rényi quantities and bars denote Petz quantities. Their trace functionals are and ; the divergences include division by inside the logarithm. Matrix powers vanish on the kernel, including power zero. The notation means support inclusion. The upward conditional entropy optimizes the negative divergence over normalized reference states on the conditioning system; the downward entropy uses the actual marginal. The notation denotes conditional von Neumann entropy. In hypothesis testing, and , with . The value minimizes the first error subject to the second being at most .
For two ONBs of A, normalized state ρ_A, conjugate orders α,β≥1/2 with 1/α+1/β=2, the actual basis outcome Rényi entropies obey Hα(X)+Hβ(Y)≥−log max_{x,y}|<φx|θy>|².
This result records the source’s operational or structural relation, with the stated endpoint and attainment clauses retained.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P07
noncomputable section
open Filter
open scoped BigOperators Matrix ComplexConjugate ComplexOrder Matrix.Norms.L2Operator Topology
namespace QAlgorithms.Papers.Independent.Intakenext100.P07
attribute [local instance] Classical.propDecidable Classical.decEq
variable {I J A B C D X Y Z : Type*}
variable [Fintype I] [DecidableEq I] [Fintype J] [DecidableEq J]
variable [Fintype A] [DecidableEq A] [Fintype B] [DecidableEq B]
variable [Fintype C] [DecidableEq C] [Fintype D] [DecidableEq D]
variable [Fintype X] [DecidableEq X] [Fintype Y] [DecidableEq Y]
variable [Fintype Z] [DecidableEq Z]
/-- NODE paper:1504.00233#7.maassenuffink
§7.2 (7.13): Maassen–Uffink relation, arXiv:1504.00233v5, PDF p.116. -/
theorem maassen_uffink [Nonempty I] (r U V : paperMat I) (hr : IsDensityMatrix r)
(hU : Uᴴ*U = 1) (hV : Vᴴ*V = 1) (a b : ℝ) (ha : 1/2 ≤ a) (hb : 1/2 ≤ b) (hab : 1/a+1/b = 2) :
-paperRenyi false (basisLaw U r) 1 (ENNReal.ofReal a)-paperRenyi false (basisLaw V r) 1 (ENNReal.ofReal b) ≥ -paperLogE (basisOverlap U V) := by sorry
end QAlgorithms.Papers.Independent.Intakenext100.P07
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be a finite nonempty index type with decidable equality, let be complex square matrices on , assume and , and assume and . Let satisfy and . Define the diagonal matrices
and the real number . Write , where and otherwise, let using the total real logarithm, and let , otherwise. For the positive orders used here, define
as an extended-real quantity; this is the stated divergence with second argument the identity matrix, whose kernel is zero. Then
The order-one cases use the separate first branch rather than division by , and all subtraction and comparison in the asserted inequality take place in the extended reals.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.