Proposition 20: alternative output-space equality condition
OpenQAlgorithms.Papers.Independent.Intakethird100.P52.output_space_equalityAll Hilbert spaces below are finite dimensional and nonzero over . A density operator is positive semidefinite with trace one. Every spectral power is zero on the kernel, including zero and negative powers. Information quantities use base-two logarithms, with ; the operator logarithms in exponential formulas are natural logarithms.
Let be a density operator on , let be an operator on without a trace constraint, and let be CPTP. Its adjoint is the Hilbert–Schmidt adjoint. Write
Assume , , and that is strict: for every . The channel is sufficient for when one CPTP map satisfies and .
Define the output-space operator
For every ,
The supporting inequality (A.16) also gives . For every , .
This is a distinct equality criterion on the output algebra, together with its inventoried supporting trace bound.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakethird100_P52
noncomputable section
open scoped Matrix ComplexOrder
namespace QAlgorithms.Papers.Independent.Intakethird100.P52
attribute [local instance] Classical.propDecidable Classical.decEq
open QAlgorithms.Papers.Independent.Information100.P63 (Mat)
open QAlgorithms.Papers.Independent.Dependency50.P21 (channelAdjoint petz marginalAB)
open QAlgorithms.Papers.Independent.Dependency50.P35 (tr elog maxRelative)
open QAlgorithms.Papers.Independent.Information100.P71 (supportPower)
open QAlgorithms.Papers.Independent.Renew46.P35 (HasMarkovBlocks)
/-- Proposition 20, PDF p.19, equation (A.1): the distinct output-space
equality criterion, its supporting trace bound (A.16), p.21, and
sandwiched nonnegativity at every order above one. -/
theorem output_space_equality {H K : Type} [Fintype H] [Fintype K]
[DecidableEq H] [DecidableEq K] [Nonempty H] [Nonempty K]
(rho sigma : Mat H) (hrho : IsDensityMatrix rho)
(hrhoPD : rho.PosDef) (hsigmaPD : sigma.PosDef)
(N : Superop H K) (hN : IsStrictChannel N) :
(∀ a : ℝ, 1 < a ∧ a < 2 →
0 ≤ renyiDifference a rho sigma N ∧
(renyiDifference a rho sigma N = 0 ↔ outputReference a rho sigma N = N rho) ∧
1 ≤ tr (outputReference a rho sigma N)) ∧
(∀ a : ℝ, 1 < a → 0 ≤ deltaTilde a rho sigma N) := by sorry
end QAlgorithms.Papers.Independent.Intakethird100.P52
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be finite, nonempty index types with decidable equality. Let be positive definite complex matrices on , where is positive semidefinite with trace , and has no assumed trace normalization. Let have a finite Kraus representation , with , and suppose that maps every positive definite matrix to a positive definite matrix. Write , define , and let denote spectral functional calculus with value for and for , including at exponent . Set
where for and otherwise, so are extended-real quantities. For every real with , the declaration asserts , the equivalence , and . It also asserts for every real , without the upper bound in this latter assertion.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.