Corollary 9
OpenQAlgorithms.Papers.Independent.Gap48.P18.invariant_information_radiusLet be nonempty and let be any subfamily of the CPTP maps carrying into its closed convex hull and preserving its capacity. Let be their common fixed states. Then
An empty indexing set gives infinity. If that intersection is the singleton , the capacity is , and at finite capacity . This allows symmetry reduction of the information radius.
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 9, arXiv:quant-ph/0510073v2, PDF pp.35.
-/
theorem invariant_information_radius {I : Type} [Countable I] [Nonempty I]
(A : Set (State I)) (hA : A.Nonempty) (F : Set (StateChannel I I))
(hF : F ⊆ PreservingChannels A) :
setChiCapacity A = (⨅ sigma : {s : State I // CommonChannelInvariant F s ∧ s ∈ stateClosedConvexHull A},
radius A sigma.val) ∧
({s : State I | CommonChannelInvariant F s ∧ s ∈ stateClosedConvexHull A} = ∅ → setChiCapacity A = ⊤) ∧
(∀ sigma : State I, sigma ∈ stateClosedConvexHull A → CommonChannelInvariant F sigma →
(∀ tau ∈ stateClosedConvexHull A, CommonChannelInvariant F tau → tau = sigma) →
setChiCapacity A = radius A sigma ∧
(setChiCapacity A < ⊤ → optimalAverage A hA = 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 matrix is trace class here when it admits with and ; is the infimum of these costs in , with empty infimum . States are trace-class matrices whose finite quadratic forms are real and nonnegative and whose real diagonal is summable with sum ; their topology is generated by , . Define as the supremum over finite principal compressions , including the empty compression, of if , and otherwise, where in and . For probability measures set and ; let be the supremum of over Borel probability measures with finite topological support contained in . Write for states approximable to every positive -error by matrices in the real convex hull of 's coefficient matrices, and . A state channel consists of a matrix map preserving trace class, additive and complex homogeneous on trace-class inputs, such that for every and every state on , the matrix with entries , indexed by , is a state, together with a specified action on states whose coefficient matrix is . The condition has no input state and is vacuous. Let be nonempty and any set of state channels, every member of which satisfies and . Put . Then
and implies , consistently with the empty infimum being . Furthermore, for every fixed by all channels in , if every other such fixed state in equals , then ; if also , then , where is defined by choosing a state satisfying for all if one exists, and otherwise choosing a member of . The family may be empty, in which case every state satisfies its fixed-state condition.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.