Lemma 6
OpenQAlgorithms.Papers.Independent.Gap48.P18.tail_layer_prescribed_relative_entropyLet have infinite entropy. Let contain the states with the same diagonal and no off-diagonal entries involving an index below . For every finite and integer ,
with every off-diagonal entry involving an index above also zero. Thus only a finite band of coherences is needed to realize each prescribed relative entropy.
import Definitions.Def_QAlgorithms_Papers_Independent_Gap48_P18
noncomputable section
open MeasureTheory Filter
open scoped ENNReal NNReal Topology Matrix.Norms.L2Operator
open QAlgorithms.Papers.Independent.Dependency50.P33
(State PureState traceSize traceClosure IsTraceClassChannel productCoeff)
open QAlgorithms.Papers.Independent.Frontier18.P07
(GeneralizedEnsemble HasFiniteSupport HasAverage averageCoefficients
extendedEntropyNats extendedRelativeEntropyNats
finiteEnsembleCapacity pureStates)
open QAlgorithms.Papers.Independent.Frontier18.P01 (traceFirst traceSecond)
namespace QAlgorithms.Papers.Independent.Gap48.P18
attribute [local instance] Classical.propDecidable Classical.decEq
/-- Lemma 6, arXiv:quant-ph/0510073v2, PDF pp.59.
Source basis index k=1 corresponds to Lean coordinate 0; all inequalities use i+1. Infinite entropy is a hypothesis. -/
theorem tail_layer_prescribed_relative_entropy (sigma : State ℕ)
(hdiag : Diagonal sigma) (hinfinite : stateEntropyNats sigma = ⊤)
(c : ℝ≥0) (n : ℕ) (hn : 1 ≤ n) :
∃ (m : ℕ) (rho : State ℕ), rho ∈ tailLayer sigma n ∧
stateRelativeEntropyNats rho sigma = (c : ℝ≥0∞) ∧
∀ i j, i ≠ j → (m < i + 1 ∨ m < j + 1) → rho.coefficients i j = 0 := by sorry
end QAlgorithms.Papers.Independent.Gap48.P18
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be a state on . A state here is a complex matrix with an expansion , where and , with every finite quadratic form real and nonnegative, and with summable real diagonal of sum . For a finite , write for the principal compression and , and define
Here , the logarithm is natural with its total real convention , and matrix logarithms use continuous functional calculus. Suppose that whenever , and . For every nonnegative real and every natural number , there exist a natural number and a state such that
and, for every distinct ,
Thus the conditions concern off-diagonal entries only; the entire diagonal remains prescribed by . The case is included, has no stated positive lower bound, and for the first off-diagonal vanishing condition is vacuous.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.