Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

From finite observable nets to a damped-channel certificate

Definition
Nonadditivity_DampingNet

by JWang226 · Oct 7, 2026 · Mathlib c5ea003 (Lean v4.30.0)

epsilon-netsholevo-additivity-gap-v100quantum-informationspectral-damping

Let TTT be a finite Kraus channel, and let FFF be a Hermitian input matrix with I−F2⪰0I-F^2\succeq0I−F2⪰0. Fix a>1a>1a>1, c≥0c\ge0c≥0, and a finite δ\deltaδ-net of unit traceless Hermitian output observables in Hilbert–Schmidt norm, with δ=(a−1)/(a+1)\delta=(a-1)/(a+1)δ=(a−1)/(a+1). If every net point YYY satisfies ∥FT∗(Y)F∥≤(1+δ)c\|F T^*(Y)F\|\le(1+\delta)c∥FT∗(Y)F∥≤(1+δ)c, then the associated damped channel TFT_FTF​ satisfies

∥TF∗(A)∥≤ac∥A∥HS\|T_F^*(A)\|\le ac\|A\|_{\rm HS}∥TF∗​(A)∥≤ac∥A∥HS​

for every traceless Hermitian output matrix AAA, where ∥⋅∥\|\cdot\|∥⋅∥ is the Euclidean operator norm. The bundle also proves that for 0≤r<10\le r<10≤r<1, M≥0M\ge0M≥0, and η>0\eta>0η>0, some integer p≥1p\ge1p≥1 satisfies 2Mr2p<η2Mr^{2p}<\eta2Mr2p<η. Together these results convert finitely many high-moment compression tests into a uniform channel bound.

Definition code
import Definitions.Def_Nonadditivity_AdjointPurity
import Definitions.Def_Nonadditivity_Channels
import Definitions.Def_Nonadditivity_DampedChannel
import Definitions.Def_Nonadditivity_Entropy
import Definitions.Def_Nonadditivity_FiniteRealization
import Definitions.Def_Nonadditivity_Net
import Definitions.Def_Nonadditivity_QuantumHolevo
import Definitions.Def_Nonadditivity_StateEnsembles
import Mathlib.Analysis.CStarAlgebra.ContinuousFunctionalCalculus.Order
import Mathlib.Analysis.CStarAlgebra.Matrix
import Mathlib.Analysis.InnerProductSpace.PiL2
import Mathlib.Analysis.Matrix.Order
import Mathlib.Analysis.Matrix.PosDef
import Mathlib.Analysis.Normed.Module.FiniteDimension
import Mathlib.Analysis.SpecialFunctions.Log.Basic
import Mathlib.Analysis.SpecificLimits.Basic
import Mathlib.Data.Matrix.Basic
import Mathlib.Data.Matrix.Basis
import Mathlib.Data.Real.Sqrt
import Mathlib.LinearAlgebra.Matrix.Kronecker
import Mathlib.MeasureTheory.Measure.Typeclasses.Probability
import Mathlib.Order.ConditionallyCompleteLattice.Basic
import Mathlib.Tactic.Abel
import Mathlib.Tactic.FieldSimp
import Mathlib.Tactic.Linarith
import Mathlib.Tactic.NormNum
import Mathlib.Tactic.Positivity
import Mathlib.Tactic.Ring

/-
Copyright (c) 2026 the Nonadditivity project contributors.
All rights reserved. See COPYRIGHT.md for licensing and attribution.
-/





/-! Finite observable tests and the elementary moment choice for deterministic damping. -/

noncomputable section
set_option backward.isDefEq.respectTransparency false
namespace Nonadditivity.DampingNet
open Channels Channels.KrausChannel AdjointPurity FiniteRealization
open Filter Topology
open scoped Matrix.Norms.L2Operator ComplexOrder MatrixOrder

/-- A fixed finite number of normalized even moments can be made arbitrarily small. -/
theorem exists_even_moment_small {r η : ℝ} (hr0 : 0 ≤ r) (hr1 : r < 1)
    (M : ℕ) (hη : 0 < η) :
    ∃ p : ℕ, 1 ≤ p ∧ 2 * (M : ℝ) * r ^ (2*p) < η := by
  have hr2 : r^2 < 1 := by nlinarith
  have ht : Tendsto (fun p : ℕ => 2 * (M : ℝ) * (r^2)^p) atTop (𝓝 0) := by
    simpa using (tendsto_pow_atTop_nhds_zero_of_lt_one (sq_nonneg r) hr2).const_mul
      (2 * (M : ℝ))
  have hs : ∀ᶠ p : ℕ in atTop, 2 * (M : ℝ) * (r^2)^p < η :=
    ht.eventually (gt_mem_nhds hη)
  obtain ⟨p, hp, hsmall⟩ := ((eventually_ge_atTop 1).and hs).exists
  exact ⟨p, hp, by simpa only [pow_mul] using hsmall⟩

variable {ι ο κ : Type*} [Fintype ι] [DecidableEq ι]
  [Fintype ο] [DecidableEq ο] [Nonempty ο] [Fintype κ]

/-- Compression bounds on a finite net give the full actual damped-channel certificate. -/
theorem damped_certificate (T : KrausChannel ι ο κ) (F : Matrix ι ι ℂ)
    (hF : F.IsHermitian) (hres : (1-F*F).PosSemidef)
    {tests : Finset (ObservableSpace ο)} {a c : ℝ}
    (ha : 1 < a) (hc : 0 ≤ c)
    (hnet : UnitSphereNet tests ((a-1)/(a+1)))
    (htests : ∀ y ∈ tests,
      ‖F * T.adjointMap (observableMatrix y) * F‖ ≤ (1+(a-1)/(a+1))*c) :
    ∀ A : Matrix ο ο ℂ, A.IsHermitian → A.trace=0 →
      ‖(DampedChannel.damped T F hF hres).adjointMap A‖ ≤ a*c*hsLength A := by
  apply matrix_certificate_of_observable_bound
  apply kappa_net_certificate _ ha hc hnet
  intro y hy
  change ‖(DampedChannel.damped T F hF hres).adjointMap (observableMatrix y)‖ ≤ _
  rw [DampedChannel.damped_adjointMap_traceless _ _ _ _ _
    (observableMatrix_trace_zero y)]
  exact htests y hy

end Nonadditivity.DampingNet
Source
https://github.com/JWang226/Holevo-Additivity-Gap/blob/635aa93eb3a2310b79fd5371e2ce311914ec5887/Nonadditivity/DampingNet.lean#L19-L51
Human review
  • Endorsed by Shuze Chen · Oct 9, 2026

    Confirmed by the moderator at approval.

  • Endorsed by JWang226 · Oct 9, 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