6.18
OpenQAlgorithms.Papers.Independent.Intakenext100.P07.classical_conditioning_boundAll quantum systems below are finite-dimensional complex Hilbert spaces of positive dimension, and logarithms are binary. A normalized state is positive semidefinite with trace one; a subnormalized state has trace at most one. Marginals are partial traces. Here is squared algebraic fidelity, is squared generalized fidelity, is purified distance, and . The symbols and denote conditional min- and max-entropy, with values and at zero. Smoothing optimizes over all subnormalized states in the purified-distance ball; every entropy radius satisfies .
For both smooth min and max, H^ε(A|YB)≥H^ε(A|B)−log dim Y when Y is classical.
This result records the source’s operational or structural relation, with the stated endpoint and attainment clauses retained.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P07
noncomputable section
open Filter
open scoped BigOperators Matrix ComplexConjugate ComplexOrder Matrix.Norms.L2Operator Topology
namespace QAlgorithms.Papers.Independent.Intakenext100.P07
attribute [local instance] Classical.propDecidable Classical.decEq
variable {I J A B C D X Y Z : Type*}
variable [Fintype I] [DecidableEq I] [Fintype J] [DecidableEq J]
variable [Fintype A] [DecidableEq A] [Fintype B] [DecidableEq B]
variable [Fintype C] [DecidableEq C] [Fintype D] [DecidableEq D]
variable [Fintype X] [DecidableEq X] [Fintype Y] [DecidableEq Y]
variable [Fintype Z] [DecidableEq Z]
/-- NODE paper:1504.00233#6.18
6.18, arXiv:1504.00233v5, PDF p.103. -/
theorem classical_conditioning_bound [Nonempty A] [Nonempty Y] [Nonempty B] (r : paperMat ((A × Y) × B))
(hr : paperSubnormalized r) (hc : ∀ a y b a' y' b', y ≠ y' → r ((a,y),b) ((a',y'),b') = 0)
(e : ℝ) (he : Radius r e) :
paperSmoothMin (paperTraceMiddle r) e-(Real.logb 2 (Fintype.card Y):EReal) ≤ paperSmoothMin (paperRegroup r) e ∧
paperSmoothMax (paperTraceMiddle r) e-(Real.logb 2 (Fintype.card Y):EReal) ≤ paperSmoothMax (paperRegroup r) e := by sorry
end QAlgorithms.Papers.Independent.Intakenext100.P07
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be finite nonempty types with decidable equality. Let be a complex matrix on , with , where , and suppose for all with . Let , which requires positive trace. Define , and define . For positive semidefinite matrices set , with square roots from spectral functional calculus, and . For a matrix on , define and , where and otherwise ; define and , with extended-real extrema. Regarding as and as , both inequalities hold:
The cases and are included.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.