Proposition 6a
OpenQAlgorithms.Papers.Independent.Gap48.P18.layer_entropy_and_relative_entropyChoose an eigenbasis of a density state and let consist of all density states with the same diagonal as in that basis. The layer is compact and convex, and
Entropy is finite and continuous on the layer exactly when . In that case every has finite entropy and relative entropy, with . If , every pure state in the layer has infinite relative entropy to . This describes entropy within a fixed diagonal layer.
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
/-- Proposition 6a, arXiv:quant-ph/0510073v2, PDF pp.22,23.
Chosen eigenbasis is the coordinate basis; hdiag enforces it. Repeated eigenvalues do not erase the choice. The finite difference is written additively after both finiteness conclusions. -/
theorem layer_entropy_and_relative_entropy {I : Type} [Countable I] [Nonempty I]
(sigma : State I) (hdiag : Diagonal sigma) :
IsCompact (layer sigma) ∧ CoefficientConvexStates (layer sigma) ∧
entropySup (layer sigma) = stateEntropyNats sigma ∧
(FiniteContinuousOn stateEntropyNats (layer sigma) ↔ stateEntropyNats sigma < ⊤) ∧
(stateEntropyNats sigma < ⊤ → ∀ rho ∈ layer sigma,
stateEntropyNats rho < ⊤ ∧ stateRelativeEntropyNats rho sigma < ⊤ ∧
stateRelativeEntropyNats rho sigma + stateEntropyNats rho = stateEntropyNats sigma) ∧
(stateEntropyNats sigma = ⊤ → ∀ rho : PureState I,
rho.val ∈ layer sigma → stateRelativeEntropyNats rho.val sigma = ⊤) := 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 an at most countable, nonempty index set. A state is a complex matrix admitting an expansion , with and , whose finite quadratic forms are real and nonnegative and whose real diagonal is summable with sum . Let be the infimum of the expansion costs , with empty infimum , and use the state topology generated by for . Define as the supremum, over all finite principal compressions , including the empty one, of
and define , where is if , and is otherwise. Here denotes in , and the functional calculus uses the total real logarithm with . For every state with whenever , let . Then is compact, its coefficient matrices form a real convex set, and
Moreover, is finite everywhere and continuous on if and only if . If , then every satisfies , , and . If , then every pure state —meaning a state with for some of norm —satisfies .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.