Proposition 6.3
OpenQAlgorithms.Papers.Independent.Support50.P12.proposition_6_3Let and be concrete unital algebras on nonzero finite-dimensional complex Hilbert spaces, and let be complex linear. The adjoint is for . A substochastic map has a Schwarz-contracting adjoint; stochastic additionally means trace preserving. Let . Powers are zero on kernels and traces are not normalized. Write for the unnormalized Petz Rényi entropy, , , and . Logarithms are natural and . The Petz map is .
Assume is substochastic and . Then
Both are equalities if one substochastic reverse map recovers both inputs. These are distinguishability monotonicities beyond a single -divergence.
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P12
noncomputable section
namespace QAlgorithms.Papers.Independent.Support50.P12
open Filter MeasureTheory Set
open QAlgorithms.Papers.Independent.Information100.P60 (Mat copies)
open QAlgorithms.Papers.Independent.Information100.P30 (MatrixMap)
open QAlgorithms.Papers.Independent.Dependency50.P28 (tr LE logNonnegativeExtended pinch)
open QAlgorithms.Papers.Independent.Dependency50.P21 (channelAdjoint spectralFunction petz relativeEntropy)
open QAlgorithms.Papers.Independent.Frontier18.P17 (hs)
open QAlgorithms.Papers.Independent.Next46.P23 (Supports)
open QAlgorithms.Papers.Independent.Support21.P03 (ExtendedConvex)
open QAlgorithms (spectralProjector)
open QAlgorithms.Learning (IsDistribution)
open QAlgorithms.Papers.Independent.Information100.P04 (absOp)
open scoped BigOperators Matrix ComplexConjugate ComplexOrder ENNReal Topology Kronecker
attribute [local instance] Classical.propDecidable Classical.decEq
open QAlgorithms.Papers.Independent.Information100.P71 (supportPower)
variable {I J K : Type} [Fintype I] [DecidableEq I] [Fintype J] [DecidableEq J]
[Fintype K] [DecidableEq K]
/-- Proposition 6.3, PDF p.29: both monotonicities, and equality under one
substochastic map recovering both inputs. -/
theorem proposition_6_3 [Nonempty I] [Nonempty J] (A : Alg I) (B : Alg J) (Phi : MatrixMap I J)
(hp : Substochastic A B Phi) (X Y : Mat I) (hX : X ∈ A) (hY : Y ∈ A)
(hXp : X.PosSemidef) (hYp : Y.PosSemidef) (htr : tr (Phi Y) = tr Y) :
chernoff (Phi X) (Phi Y) ≤ chernoff X Y ∧
(∀ r : ℝ, hoeffding (Phi X) (Phi Y) r ≤ hoeffding X Y r) ∧
((∃ Psi : MatrixMap J I, Substochastic B A Psi ∧ Psi (Phi X) = X ∧ Psi (Phi Y) = Y) →
chernoff (Phi X) (Phi Y) = chernoff X Y ∧
∀ r : ℝ, hoeffding (Phi X) (Phi Y) r = hoeffding X Y r) := by sorry
end QAlgorithms.Papers.Independent.Support50.P12
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 and be unital complex star subalgebras, and let be complex-linear. Let be its Hilbert–Schmidt adjoint, explicitly
Assume that for every matrix , that for every matrix , that sends positive semidefinite elements of to positive semidefinite matrices, and that for every , where matrix inequalities mean positive semidefinite differences. Let be positive semidefinite and assume . For positive semidefinite , define by spectral calculus with value at the zero eigenvalue for every exponent, put
where for and otherwise, and the suprema and arithmetic are extended-real. Then
If there exists a complex-linear satisfying the same four algebra-extension, positivity and adjoint Schwarz conditions with exchanged, and satisfying and , then both inequalities are equalities, the second for every real . Neither nor is required to have trace one or to be nonzero.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.