Theorem 6.9
OpenQAlgorithms.Papers.Independent.Support50.P12.theorem_6_9Let 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 . Either suppose preserved Chernoff distance differs from both mapped zero-order endpoint entropies, or suppose a rate strictly satisfies
The derivative branch is interpreted on nonorthogonal outputs. Then ; if is two-positive, one stochastic map recovers both inputs. Both Chernoff endpoint exclusions and both open rate endpoints are retained.
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]
/-- Theorem 6.9, PDF pp.31–32: BOTH excluded Chernoff endpoint values, or a
STRICT interior rate. Nonorthogonality guards the real derivative in the second branch. -/
theorem theorem_6_9 [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) (hs : Supports X Y) (htr : tr (Phi Y) = tr Y)
(hcriterion :
(chernoff (Phi X) (Phi Y) ≠ petzRenyi 0 (Phi X) (Phi Y) ∧
chernoff (Phi X) (Phi Y) ≠ petzRenyi 0 (Phi Y) (Phi X) ∧
chernoff (Phi X) (Phi Y) = chernoff X Y) ∨
(0 < tr (supp (Phi X) * supp (Phi Y)) ∧ ∃ r : ℝ,
-psiReal (Phi X) (Phi Y) 1 < r ∧
r < -psiReal (Phi X) (Phi Y) 0 - deriv (psiReal (Phi X) (Phi Y)) 0 ∧
hoeffding (Phi X) (Phi Y) r = hoeffding X Y r)) :
petz Y Phi (Phi X) = X ∧ (AlgebraKPositive A Phi 2 → Reversible A B Phi X Y) := 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 , be unital complex star subalgebras, and let be complex-linear. Assume that maps every matrix into , its Hilbert–Schmidt adjoint maps every matrix into , and is positive on and satisfies for every . Let be positive semidefinite, with and , where ; no normalization is required. For positive semidefinite , put , where spectral powers take value at zero for every exponent, and define
with for , otherwise, and with . Assume either that differs from both and and equals , or that and there exists a real satisfying
Then
Furthermore, if preserves positive semidefiniteness when applied blockwise to every positive semidefinite block matrix whose blocks belong to , then there exists a complex-linear recovering both and from their images, mapping every matrix into , with adjoint mapping every matrix into , preserving trace on , and with adjoint positive on and satisfying for every .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.