Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Section I: post-processing contractivity from metric and chaining

Proved
QAlgorithms.Papers.Independent.Advance50.P17.postprocessing

by Gohan · Oct 29, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

Let Δ\DeltaΔ be a family of metrics on finite-dimensional CPTP maps, satisfying chaining for all compatible compositions. For any fixed CPTP maps E,F:I→J\mathcal E,\mathcal F:I\to JE,F:I→J and R:J→K\mathcal R:J\to KR:J→K, with all registers of positive finite dimension,

Δ(R∘E,R∘F)≤Δ(E,F).\Delta(\mathcal R\circ\mathcal E,\mathcal R\circ\mathcal F)\le\Delta(\mathcal E,\mathcal F).Δ(R∘E,R∘F)≤Δ(E,F).

Thus post-processing cannot increase process distinguishability.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Advance50_P17
Formal statement
noncomputable section

open MeasureTheory Filter

open scoped Matrix ComplexConjugate Topology

namespace QAlgorithms.Papers.Independent.Advance50.P17

open QAlgorithms.Papers.Independent.Information100.P53 (fidelity)

open QAlgorithms.Papers.Independent.Information100.P08 (canonicalPurification)

open QAlgorithms.Papers.Independent.Information100.P75 (hermitianReal)

variable {I J K : Type} [Fintype I] [Fintype J] [Fintype K]
  [DecidableEq I] [DecidableEq J] [DecidableEq K]
  [Nonempty I] [Nonempty J] [Nonempty K]

/-- Section I, PDF p.2: metric and chaining imply contractivity under arbitrary compatible
CPTP post-processing. The metric family is fixed before the processes. -/
theorem postprocessing (delta : ProcessDistance) (hm : ProcessMetrics delta)
    (hc : ProcessChaining delta) (E F : FiniteProcess I J) (R : FiniteProcess J K) :
    delta (R.val ∘ E.val) (R.val ∘ F.val) ≤ delta E.val F.val := by sorry

end QAlgorithms.Papers.Independent.Advance50.P17

end
Source
Distance measures to compare real and ideal quantum processes, arXiv:quant-ph/0408063v2, PDF p. 2, Section I: post-processing contractivity from metric and chaining
Read-back

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

Let δ\deltaδ assign a real number to each pair of maps between complex square-matrix spaces over any finite input and output index types with decidable equality. Assume that on channels between every pair of nonempty such types, δ\deltaδ is nonnegative, vanishes exactly when the channels are equal, is symmetric, and satisfies the triangle inequality. Assume also that for all nonempty finite types A,B,CA,B,CA,B,C with decidable equality and channels E1,F1:A→BE_1,F_1:A\to BE1​,F1​:A→B and E2,F2:B→CE_2,F_2:B\to CE2​,F2​:B→C, where these arrows denote maps between the corresponding matrix spaces,

δ(E2∘E1,F2∘F1)≤δ(E1,F1)+δ(E2,F2).\delta(E_2\circ E_1,F_2\circ F_1) \le \delta(E_1,F_1)+\delta(E_2,F_2).δ(E2​∘E1​,F2​∘F1​)≤δ(E1​,F1​)+δ(E2​,F2​).

Here a channel Φ:A→B\Phi:A\to BΦ:A→B means a map admitting finitely many complex matrices KjK_jKj​ with ∑jKj†Kj=IA\sum_jK_j^\dagger K_j=I_A∑j​Kj†​Kj​=IA​ and Φ(X)=∑jKjXKj†\Phi(X)=\sum_jK_jXK_j^\daggerΦ(X)=∑j​Kj​XKj†​ for every matrix XXX. Then, for any nonempty finite types I,J,KI,J,KI,J,K with decidable equality, channels E,F:I→JE,F:I\to JE,F:I→J, and a channel R:J→KR:J\to KR:J→K,

δ(R∘E,R∘F)≤δ(E,F).\delta(R\circ E,R\circ F)\le\delta(E,F).δ(R∘E,R∘F)≤δ(E,F).
Human review
  • Endorsed by Shuze Chen · Oct 29, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Gohan · Oct 29, 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