Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Corollary 9

Open
QAlgorithms.Papers.Independent.Gap48.P18.invariant_information_radius

by Goku · Oct 22, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

Let AAA be nonempty and let F0F_0F0​ be any subfamily of the CPTP maps carrying AAA into its closed convex hull and preserving its capacity. Let InvF0\mathrm{Inv}_{F_0}InvF0​​ be their common fixed states. Then

Cˉ(A)=inf⁡σ∈InvF0∩co⁡‾Asup⁡ρ∈AD(ρ∥σ).\bar C(A)=\inf_{\sigma\in\mathrm{Inv}_{F_0}\cap\overline{\operatorname{co}}A}\sup_{\rho\in A}D(\rho\|\sigma).Cˉ(A)=σ∈InvF0​​∩coAinf​ρ∈Asup​D(ρ∥σ).

An empty indexing set gives infinity. If that intersection is the singleton {σ0}\{\sigma_0\}{σ0​}, the capacity is sup⁡ρ∈AD(ρ∥σ0)\sup_{\rho\in A}D(\rho\|\sigma_0)supρ∈A​D(ρ∥σ0​), and at finite capacity Ω(A)=σ0\Omega(A)=\sigma_0Ω(A)=σ0​. This allows symmetry reduction of the information radius.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Gap48_P18
Formal statement
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
Source
Entropic characteristics of subsets of states, arXiv:quant-ph/0510073v2, PDF p. 35, Corollary 9
Read-back

What the Lean code literally says, in plain math · gpt-6.1-sol

Let III be an at most countable, nonempty index set. A matrix is trace class here when it admits Xij=∑mum,ivm,j‾X_{ij}=\sum_m u_{m,i}\overline{v_{m,j}}Xij​=∑m​um,i​vm,j​​ with um,vm∈ℓ2(I;C)u_m,v_m\in\ell^2(I;\mathbb C)um​,vm​∈ℓ2(I;C) and ∑m∥um∥∥vm∥<∞\sum_m\|u_m\|\|v_m\|<\infty∑m​∥um​∥∥vm​∥<∞; T(X)T(X)T(X) is the infimum of these costs in [0,∞][0,\infty][0,∞], with empty infimum ∞\infty∞. States are trace-class matrices whose finite quadratic forms are real and nonnegative and whose real diagonal is summable with sum 111; their topology is generated by T(R−R0)<εT(R-R_0)<\varepsilonT(R−R0​)<ε, ε>0\varepsilon>0ε>0. Define D(X∥Y)D(X\|Y)D(X∥Y) as the supremum over finite principal compressions B=Xs,C=YsB=X_s,C=Y_sB=Xs​,C=Ys​, including the empty compression, of [Re⁡tr⁡(Blog⁡cfcB−Blog⁡cfcC+C−B)]+[\operatorname{Re}\operatorname{tr}(B\log_{\mathrm{cfc}}B-B\log_{\mathrm{cfc}}C+C-B)]_+[Retr(Blogcfc​B−Blogcfc​C+C−B)]+​ if ker⁡C⊆ker⁡B\ker C\subseteq\ker BkerC⊆kerB, and ∞\infty∞ otherwise, where [r]+=max⁡(r,0)[r]_+=\max(r,0)[r]+​=max(r,0) in [0,∞][0,\infty][0,∞] and log⁡0=0\log0=0log0=0. For probability measures set (mμ)ij=∫Rij dμ(R)(m_\mu)_{ij}=\int R_{ij}\,d\mu(R)(mμ​)ij​=∫Rij​dμ(R) and χ(μ)=∫−D(R∥mμ) dμ(R)\chi(\mu)=\int^-D(R\|m_\mu)\,d\mu(R)χ(μ)=∫−D(R∥mμ​)dμ(R); let C(B)C(B)C(B) be the supremum of χ(μ)\chi(\mu)χ(μ) over Borel probability measures with finite topological support contained in BBB. Write H(B)H(B)H(B) for states approximable to every positive TTT-error by matrices in the real convex hull of BBB's coefficient matrices, and rB(σ)=sup⁡R∈BD(R∥σ)r_B(\sigma)=\sup_{R\in B}D(R\|\sigma)rB​(σ)=supR∈B​D(R∥σ). A state channel consists of a matrix map Φ\PhiΦ preserving trace class, additive and complex homogeneous on trace-class inputs, such that for every n≥0n\ge0n≥0 and every state RRR on I×{0,…,n−1}I\times\{0,\ldots,n-1\}I×{0,…,n−1}, the matrix with entries Φ((R(i,a),(j,b))i,j)p,q\Phi((R_{(i,a),(j,b)})_{i,j})_{p,q}Φ((R(i,a),(j,b)​)i,j​)p,q​, indexed by (p,a),(q,b)(p,a),(q,b)(p,a),(q,b), is a state, together with a specified action ϕ\phiϕ on states whose coefficient matrix is Φ(R)\Phi(R)Φ(R). The n=0n=0n=0 condition has no input state and is vacuous. Let AAA be nonempty and FFF any set of state channels, every member of which satisfies ϕ(A)⊆H(A)\phi(A)\subseteq H(A)ϕ(A)⊆H(A) and C(ϕ(A))=C(A)C(\phi(A))=C(A)C(ϕ(A))=C(A). Put K={σ∈H(A):ϕ(σ)=σ for every channel in F}K=\{\sigma\in H(A):\phi(\sigma)=\sigma\text{ for every channel in }F\}K={σ∈H(A):ϕ(σ)=σ for every channel in F}. Then

C(A)=inf⁡σ∈KrA(σ),C(A)=\inf_{\sigma\in K}r_A(\sigma),C(A)=σ∈Kinf​rA​(σ),

and K=∅K=\varnothingK=∅ implies C(A)=∞C(A)=\inftyC(A)=∞, consistently with the empty infimum being ∞\infty∞. Furthermore, for every σ∈H(A)\sigma\in H(A)σ∈H(A) fixed by all channels in FFF, if every other such fixed state in H(A)H(A)H(A) equals σ\sigmaσ, then C(A)=rA(σ)C(A)=r_A(\sigma)C(A)=rA​(σ); if also C(A)<∞C(A)<\inftyC(A)<∞, then OA=σO_A=\sigmaOA​=σ, where OAO_AOA​ is defined by choosing a state ω\omegaω satisfying D(R∥ω)≤C(A)D(R\|\omega)\le C(A)D(R∥ω)≤C(A) for all R∈AR\in AR∈A if one exists, and otherwise choosing a member of AAA. The family FFF may be empty, in which case every state satisfies its fixed-state condition.

Human review
  • Endorsed by Shuze Chen · Oct 22, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Goku · Oct 22, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me