Positive Petz payoff uniformly near order one
OpenQAlgorithms.Papers.Independent.Intakenext100.P15.petz_positive_payoff_near_oneAll Hilbert spaces are finite-dimensional and nonzero. A density operator is positive semidefinite with trace one; singular states are included. All logarithms are base two. For real , denotes the sandwiched Rényi divergence and the traditional Petz divergence, with value on support failure and negative spectral powers taken on the support.
Write , where is unnormalized, and . Its reference marginal is and its channel-input marginal is . Define over all normalized densities. The finite attained extrema are retained as conclusions in the minimax statement.
Define with Umegaki divergence, and . For CPTP and real ,
For every order in this neighborhood the Petz channel supremum is finite and attained by an input density. The neighborhood depends on and is uniform over all input states. Restricting it within order two preserves the near-one claim and avoids the unrestricted maximum defect of (6.6).
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P15
noncomputable section
open scoped Matrix ComplexOrder ComplexConjugate Topology
open Filter
namespace QAlgorithms.Papers.Independent.Intakenext100.P15
attribute [local instance] Classical.propDecidable
attribute [local instance] Classical.decEq
-- These are pinned accepted definitions, not other chunks from the current run.
open QAlgorithms.Papers.Independent.Bridge50.P43 (NormalizedDensity payoff)
open QAlgorithms.Papers.Independent.Dependency50.P09 (Divergence logExt sandwichedD petzD)
open QAlgorithms.Papers.Independent.Information100.P34 (choi)
open QAlgorithms.Papers.Independent.Information100.P63 (schatten)
open QAlgorithms.Papers.Independent.Information100.P71
(supportPower SupportIncluded stateRelative channelPower diamond)
/-- PDF p.17, Lemma 10, (6.43). The Petz channel information is only used in
a right neighborhood of one, chosen within alpha<2. Its finite maximum is attained
in that neighborhood; no all-order Petz maximum is asserted. -/
theorem petz_positive_payoff_near_one
{A B : Type} [Fintype A] [Fintype B] [DecidableEq A] [DecidableEq B]
[Nonempty A] [Nonempty B] (N : Superop A B) (hN : IsChannel N)
(R : ℝ) (hR : channelInfo stateRelative N < (R : EReal)) :
∃ beta : ℝ, 1 < beta ∧ beta < 2 ∧ ∀ alpha : ℝ, 1 < alpha → alpha < beta →
0 < payoff alpha R (channelInfo (petzD alpha) N) ∧
∃ (v : ℝ) (rho : NormalizedDensity A),
channelInfo (petzD alpha) N = (v : EReal) ∧ inputInfo (petzD alpha) N rho = (v : EReal) := by sorry
end QAlgorithms.Papers.Independent.Intakenext100.P15
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be finite nonempty index sets with decidable equality, and let be a map from complex matrices on to complex matrices on admitting a finite Kraus representation with . A density matrix means a positive semidefinite matrix of trace . For positive semidefinite , write for spectral functional calculus with value at zero eigenvalues and at nonzero eigenvalues. Let be the matrix on with , where is the matrix unit, and set . For a divergence , define
The divergence used in the hypothesis is unless both matrices are density matrices and ; otherwise it equals
where , the logarithm and are applied by functional calculus, and . For , is if , and otherwise equals , with for and for . For every real satisfying , the assertion is that there exists a real with such that, for every real with ,
and there exist a real and an input density matrix such that . All divergence extrema and the payoff use extended-real arithmetic; the real value and maximizing input may depend on .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.