§5.4 (5.81)–(5.84): further conditional chain rules
OpenQAlgorithms.Papers.Independent.Intakenext100.P07.conditional_chain_variantsAll 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. Tildes denote sandwiched Rényi quantities and bars denote Petz quantities. Their trace functionals are and ; the divergences include division by inside the logarithm. Matrix powers vanish on the kernel, including power zero. The notation means support inclusion. The upward conditional entropy optimizes the negative divergence over normalized reference states on the conditioning system; the downward entropy uses the actual marginal. The notation denotes conditional von Neumann entropy.
For normalized ABC: Hbarα↑(AB|C)≤Hbar0↑(A|BC)+Hbarα↑(B|C); Htildeα↑(AB|C)≥Htildeα↓(A|BC)+Hmin(B|C); replacing the down entropy gives (5.84) with α=2−1/β and admissible positive orders.
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#5.chainvariants
Equations (5.81), (5.83), (5.84), PDF p.87. Each clause has its own order domain. -/
theorem conditional_chain_variants [Nonempty A] [Nonempty B] [Nonempty C]
(r : paperMat ((A × B) × C)) (hr : IsDensityMatrix r) :
(∀ a : ENNReal, a ≤ 2 → conditionalUp false a r ≤ conditionalUp false 0 (paperRegroup r)+conditionalUp false a (paperMarginalBC r)) ∧
(∀ a : ENNReal, 1/2 ≤ a → conditionalDown true a (paperRegroup r)+conditionalUp true ⊤ (paperMarginalBC r) ≤ conditionalUp true a r) ∧
(∀ a b : ENNReal, 1/2 ≤ a → 1/2 ≤ b → a = transformedOrder b →
conditionalUp true b (paperRegroup r)+conditionalUp true ⊤ (paperMarginalBC r) ≤ conditionalUp true a r) := 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 index types with decidable equality, and let on have trace one. Write
Define by functional calculus with the function zero at zero and elsewhere, define , and set , otherwise. For positive semidefinite , put
For real , at let equal if , and otherwise; at , let it equal
when or , and otherwise. Extend by , , and , with meaning . For on , define and
All optimizations and sums here are extended real, and the upward optimization includes zero. Define for , and otherwise. The assertion consists of the following three universally quantified inequalities:
In the last line, would give and therefore cannot satisfy the simultaneous hypothesis .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.