Corollary 6
OpenQAlgorithms.Papers.Independent.Gap48.P18.pointwise_decrease_coefficients_control_entropyLet be a nonempty closed convex finite-capacity set. If every has , then is regular and entropy is bounded on . If every decrease coefficient is zero, then
These are pointwise assumptions; no uniform gap of the coefficients below one is imposed.
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
/-- Corollary 6, arXiv:quant-ph/0510073v2, PDF pp.34.
-/
theorem pointwise_decrease_coefficients_control_entropy {I : Type}
[Countable I] [Nonempty I] (A : Set (State I)) (hA : A.Nonempty)
(hclosed : IsClosed A) (hconvex : CoefficientConvexStates A) (hfinite : setChiCapacity A < ⊤) :
((∀ rho ∈ A, decreaseCoefficient rho < 1) → ChiRegular A ∧ entropySup A < ⊤) ∧
((∀ rho ∈ A, decreaseCoefficient rho = 0) → FiniteContinuousOn stateEntropyNats A) := 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 countable nonempty label set and a nonempty closed set of states on , with a specified nonemptiness witness, whose coefficient matrices form a convex set over . A state is a complex matrix with a representation , where and , having real nonnegative finite quadratic forms and summable real diagonal of sum . Let be the infimum of those sums over all such representations, with empty infimum ; closedness and continuity use the state topology generated by for states and . For finite principal compressions define
where , and matrix logarithms use continuous functional calculus with the total natural logarithm. For a Borel measure on states, put and , and let be the supremum of over probability measures with finite topological support contained in , with empty supremum . Assume . For a state , define
where is given by continuous functional calculus and the infimum is in , with empty infimum . If for every , then , and has the following regularity property: it is nonempty, , and there exists a state such that for every , and either and every sequence in the set
with satisfies , or is finite everywhere on and continuous on . Independently, if for every , then for every and the -valued function is continuous on . The first premise gives a separate strict inequality for each state, with no common bound below assumed.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.