Lemma 31
OpenQAlgorithms.Papers.Independent.Intakenext100.P56.cmi_classical_conditioningAll systems are finite-dimensional complex Hilbert spaces with nonempty finite bases. States are positive semidefinite operators of trace one; pure kets have norm one. All marginal states below are partial traces of the stated joint state. Logarithms are natural, and spectral powers vanish on the kernel, including at exponent zero.
Let be a finite law and be states. For and , ,
At the continuous endpoint, . The exponential uses base , as required by the paper's natural logarithms. The identity describes classical conditioning.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P56
noncomputable section
open Filter Topology
open scoped Matrix ComplexConjugate ComplexOrder
namespace QAlgorithms.Papers.Independent.Intakenext100.P56
attribute [local instance] Classical.propDecidable Classical.decEq
open QAlgorithms
open QAlgorithms.Papers.Independent.Information100.P56 (IsLaw entropy average holevo)
open QAlgorithms.Papers.Independent.Information100.P71 (supportPower)
open QAlgorithms.Papers.Independent.Dependency50.P21 (channelAdjoint petz extendedLog marginalAB)
open QAlgorithms.Papers.Independent.Information100.P21 (Op FiniteLOCC)
open QAlgorithms.Papers.Independent.Dependency50.P35 (marginalAC)
open QAlgorithms.Papers.Independent.Dependency50.P07 (bipartiteProduct)
open QAlgorithms.Papers.Independent.Information100.P67 (squaredFidelity)
open QAlgorithms.Papers.Independent.Advance50.P25 (renyiEntropyNats)
variable {A B C D E X : Type}
variable [Fintype A] [Fintype B] [Fintype C] [Fintype D] [Fintype E] [Fintype X]
variable [Nonempty A] [Nonempty B] [Nonempty C] [Nonempty D] [Nonempty E] [Nonempty X]
open scoped Matrix.Norms.L2Operator
/-- arXiv:1410.1443v3, PDF pp.33–34, Lemma 31, (A.12).
The removable one endpoint is stated separately, never by totalized division. -/
theorem cmi_classical_conditioning (a : ℝ) (ha : 0 < a)
(p : X → ℝ) (hp : IsLaw p) (rho : X → Op (A × (B × C)))
(hrho : ∀ x, IsDensityMatrix (rho x)) :
(a ≠ 1 → renyiCMI a (conditionedFlag p rho) =
a/(a-1) * Real.log (∑ x, p x * Real.exp ((a-1)/a * renyiCMI a (rho x)))) ∧
renyiCMI 1 (conditionedFlag p rho) = ∑ x, p x * renyiCMI 1 (rho x) := by sorry
end QAlgorithms.Papers.Independent.Intakenext100.P56
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be finite index types with decidable equality, let , let satisfy and , and let every be a positive semidefinite complex matrix of trace on . Write , using continuous functional calculus and the total real logarithm. For a matrix , write for functional calculus with the scalar function that is at and otherwise; in particular, uses value on the zero eigenspace. For a matrix on , let denote its indicated partial traces, and define
where acts as on and as the identity on , and . Form the flagged matrix on by
Then both assertions hold:
Zero probabilities are allowed, and density matrices are required even at those labels. The probability-law hypothesis cannot hold when is empty; together with the density hypotheses it also excludes empty subsystem types.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.