§4.3.3 (4.84): measured endpoint representation
OpenQAlgorithms.Papers.Independent.Intakenext100.P07.measured_endpointsAll 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.
For α=1/2 or ∞, Dtildeα(ρ||σ)=max over single-copy measurements Dα(Mρ||Mσ); hence positivity-preserving trace-preserving maps suffice for DPI at these endpoints.
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#4.measuredendpoints
Equation (4.84) and following remarks, PDF p.68. Printed: M(rho) twice.
Changed: M(sigma) in the second argument. Why: the left side and its DPI application require sigma. -/
theorem measured_endpoints [Nonempty I] [Nonempty J] (r s : paperMat I)
(hr : r.PosSemidef) (hne : r ≠ 0) (hs : s.PosSemidef) (a : ENNReal) (ha : a = 1/2 ∨ a = ⊤) :
(∃ m : ℕ, 0 < m ∧ ∃ M : Fin m → paperMat I, IsPOVM M ∧
paperRenyi true r s a = paperRenyi false (measureOutput M r) (measureOutput M s) a ∧
∀ k : ℕ, 0 < k → ∀ N : Fin k → paperMat I, IsPOVM N →
paperRenyi false (measureOutput N r) (measureOutput N s) a ≤ paperRenyi true r s a) ∧
(∀ E : paperMat I →ₗ[ℂ] paperMat J, (∀ R : paperMat I, R.PosSemidef → (E R).PosSemidef) →
(∀ R : paperMat I, (E R).trace = R.trace) → paperRenyi true (E r) (E s) a ≤ paperRenyi true r s a) ∧
(∀ b : ENNReal, 1/2 ≤ b → ∀ E : paperMat I →ₗ[ℂ] paperMat J,
(∀ n : ℕ, ∀ R : paperMat (Fin n → I), R.PosSemidef → (piSuperop (fun _ : Fin n => E) R).PosSemidef) →
(∀ R : paperMat I, (E R).trace = R.trace) → paperRenyi true (E r) (E s) b ≤ paperRenyi true r s b) := 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 nonempty finite types with decidable equality, and let be complex square matrices indexed by , with positive semidefinite and . Let satisfy or . The following notation specifies the divergences used in the assertion. Write when is positive semidefinite, and when . Let be the real continuous functional calculus applied to the function that is at and elsewhere, and let be the functional calculus of the total real function , whose value at is . Put and otherwise, as an extended real number. For a positive finite order , define
For either choice , define to be if , and otherwise; for , define to be
if or , and otherwise. All arithmetic in this expression after applying is extended real arithmetic. Define
where real is embedded into the extended reals, so an empty first set has infimum . Then there exist an integer and positive semidefinite matrices summing to the identity such that, writing ,
and every integer and every positive semidefinite family summing to the identity satisfy . Moreover, every complex linear map from -indexed matrices to -indexed matrices that preserves positive semidefiniteness and preserves the complex trace of every matrix satisfies . Finally, for every with , every such complex linear trace-preserving map satisfies , provided that for every natural number , including , the map defined entrywise by
preserves positive semidefiniteness; here is the matrix unit, range over functions into , and the empty product for is .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.