Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Section 3.2 / (20),(21): exact embedding and dimensional obstruction

Proved
QAlgorithms.Papers.Independent.Gap20.P07.idealSimulationError

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

prove2quantum

Let n,m≥1n,m\ge1n,m≥1 be integers and let Δ(idn,idm)\Delta(\mathrm{id}_n,\mathrm{id}_m)Δ(idn​,idm​) be the infimum of the full-cb error over all CPTP encoders and decoders simulating an ideal mmm-level system through an ideal nnn-level system. Then

m≤n ⟹ Δ=0,m≥n ⟹ Δ≥1−nm.m\le n\ \Longrightarrow\ \Delta=0,\qquad m\ge n\ \Longrightarrow\ \Delta\ge1-\frac nm.m≤n ⟹ Δ=0,m≥n ⟹ Δ≥1−mn​.

The first branch pads the logical m×mm\times mm×m matrix into n×nn\times nn×n matrices; the second is the dimensional obstruction. These estimates include equal dimensions.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Gap20_P07
Formal statement
noncomputable section

open Filter MeasureTheory

open scoped Topology ENNReal NNReal Matrix ComplexOrder ComplexConjugate

attribute [local instance] Classical.propDecidable

attribute [local instance] Classical.decEq

attribute [local instance] IsStarNormal.instContinuousFunctionalCalculus

namespace QAlgorithms.Papers.Independent.Gap20.P07

open QAlgorithms

open QAlgorithms.RealRegisters (Hilbert)

open QAlgorithms.Papers.Independent.Dependency50.P33
  (State IsTraceClass IsTraceClassChannel traceSize rankOne tensorApply)

open QAlgorithms.Papers.Independent.Frontier30.P14
  (Operation isometryCoeff conjugateKernel)

open QAlgorithms.Papers.Independent.Claimed50.P35
  (stabilizedTraceClassNorm traceClassTensorMap traceClassChannelPower
   transpose transposeBound TraceLinear tracePair MeasurePrepare)

open QAlgorithms.Papers.Independent.Gap48.P29 (fe FiniteCPMap)

/-- PDF pp.9--10, (20)--(21): exact embedding and dimensional obstruction.
The surrounding prose reverses the padding dimensions; the formulas fix them. -/
theorem idealSimulationError (n m : ℕ) (hn : 0 < n) (hm : 0 < m) :
    (m ≤ n → codingSimulationDistance (id : Operation (Fin n) (Fin n))
      (id : Operation (Fin m) (Fin m)) = 0) ∧
    (n ≤ m → ENNReal.ofReal (1 - (n : ℝ) / m) ≤
      codingSimulationDistance (id : Operation (Fin n) (Fin n)) (id : Operation (Fin m) (Fin m))) := by sorry

end QAlgorithms.Papers.Independent.Gap20.P07

end
Source
Tema Con Variazioni: Quantum Channel Capacity, arXiv:quant-ph/0311037v1, PDF p. 9, Section 3.2 / (20),(21): exact embedding and dimensional obstruction
Read-back

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

For every pair of natural numbers n,m>0n,m>0n,m>0, let idn,idm\mathrm{id}_n,\mathrm{id}_midn​,idm​ denote the identity maps on the respective complex matrix spaces. Define τ(X)∈[0,∞]\tau(X)\in[0,\infty]τ(X)∈[0,∞] as the infimum of ∑r≥0∥ur∥∥vr∥\sum_{r\ge0}\|u_r\|\|v_r\|∑r≥0​∥ur​∥∥vr​∥ over expansions Xij=∑r≥0ur(i)vr(j)‾X_{ij}=\sum_{r\ge0}u_r(i)\overline{v_r(j)}Xij​=∑r≥0​ur​(i)vr​(j)​ by square-summable vectors for which that sum is finite; trace class means that at least one such expansion exists, and an empty infimum is +∞+\infty+∞. A density is trace class with positive semidefinite finite principal restrictions and summable real diagonal of sum 111. A channel preserves trace-class matrices, is additive and complex-homogeneous on them, and preserves densities under every finite ancillary extension. For any map FFF, write ∥F∥st\|F\|_{\mathrm{st}}∥F∥st​ for the supremum of τ((F⊗idr)X)\tau((F\otimes\mathrm{id}_r)X)τ((F⊗idr​)X) over integers r≥0r\ge0r≥0 and trace-class XXX with τ(X)≤1\tau(X)\le1τ(X)≤1, where the ancillary extension applies FFF separately to each matrix block with fixed ancillary indices. Let

δn,m=inf⁡E:Cm×m→Cn×n channelD:Cn×n→Cm×m channel∥D∘E−idm∥st.\delta_{n,m} = \inf_{\substack{E:\mathbb C^{m\times m}\to\mathbb C^{n\times n}\ \mathrm{channel}\\ D:\mathbb C^{n\times n}\to\mathbb C^{m\times m}\ \mathrm{channel}}} \|D\circ E-\mathrm{id}_m\|_{\mathrm{st}}.δn,m​=E:Cm×m→Cn×n channelD:Cn×n→Cm×m channel​inf​∥D∘E−idm​∥st​.

Then both implications hold:

m≤n ⟹ δn,m=0,n≤m ⟹ max⁡ ⁣(0,1−nm)≤δn,m.m\le n\ \Longrightarrow\ \delta_{n,m}=0, \qquad n\le m\ \Longrightarrow\ \max\!\left(0,1-\frac nm\right)\le\delta_{n,m}.m≤n ⟹ δn,m​=0,n≤m ⟹ max(0,1−mn​)≤δn,m​.

When n=mn=mn=m, both implications apply and give zero error and a zero lower bound. The assertion concerns an infimum and does not assert that an encoder–decoder pair attains it.

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