Conservation and ordering of symmetric information
OpenQAlgorithms.Papers.Independent.Intakethird100.P14.information_transformLet be a binary-input classical–quantum channel with normalized density outputs. Construct the channels and exactly by (14)–(15): apply the binary polar kernel to two independent uniform bits, average the second bit for , and retain the first bit as a classical register for . Their uniform-prior Holevo informations, measured in bits, satisfy
This includes both numbered assertions and the immediately displayed consequence. The channels are constructed from ; conservation is not a premise on arbitrary supplied channels. These identities describe movement of information away from the center while preserving total rate.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakethird100_P14
noncomputable section
namespace QAlgorithms.Papers.Independent.Intakethird100.P14
open Filter MeasureTheory
open scoped ENNReal NNReal ComplexOrder BigOperators
open QAlgorithms.RealRegisters (Hilbert)
open QAlgorithms.Papers.Independent.Dependency50.P33 (IsDensity)
open QAlgorithms.Papers.Independent.Dependency50.P13 (compression)
open QAlgorithms.Papers.Independent.Renew46.P44 (wordOutput)
attribute [local instance] Classical.propDecidable Classical.decEq
/-- Proposition 8 and its displayed consequence, PDF p.7; proof pp.10–11.
The minus/plus channels are computed from W, not supplied with conservation
as a hypothesis. Uniform independent bits are in (14)–(15). -/
theorem information_transform {I : Type} (W : Bit → OutputCoefficients I) (hW : IsBinaryCqChannel W) :
symmetricInformation (channelMinus W) + symmetricInformation (channelPlus W) =
2 * symmetricInformation W ∧
symmetricInformation (channelMinus W) ≤ symmetricInformation (channelPlus W) ∧
symmetricInformation (channelMinus W) ≤ symmetricInformation W ∧
symmetricInformation W ≤ symmetricInformation (channelPlus W) := by sorry
end QAlgorithms.Papers.Independent.Intakethird100.P14
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be any type and complex arrays on . Assume each array admits a nuclear expansion with and , every finite quadratic form of is real and nonnegative, and its real diagonal is summable with sum . For any array , let be a chosen bounded operator with coordinate coefficients , or if no such operator exists. Define by taking the supremum over every and every orthonormal -tuple in the relevant space: with and , its contribution is if , and otherwise is
where matrix functions use the continuous functional calculus and the real logarithm has its total value . Define . The binary arrays on and on are given by and , with addition modulo . Then
These are equalities and inequalities in the extended nonnegative reals; no finiteness hypothesis is imposed on these quantities, and the defining supremum includes the empty orthonormal family .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.