Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 2: summed branch contractivity

Open
QAlgorithms.Papers.Independent.Intakenext100.P42.branch_contractivity

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

prove2quantum

All registers are finite and nonempty; all input density matrices are positive semidefinite with trace one.

Under F2, F3, F5a, and unit-vector F5b on the coherent positive subnormalized domain, let ViV_iVi​ be a finite Kraus family with ∑iVi†Vi=I\sum_iV_i^\dagger V_i=I∑i​Vi†​Vi​=I. For density matrices σ,ρ\sigma,\rhoσ,ρ, set σi=ViσVi†\sigma_i=V_i\sigma V_i^\daggerσi​=Vi​σVi†​ and ρi=ViρVi†\rho_i=V_i\rho V_i^\daggerρi​=Vi​ρVi†​. Then

∑iD(σi∥ρi)≤D(σ∥ρ).\sum_iD(\sigma_i\Vert\rho_i)\le D(\sigma\Vert\rho).i∑​D(σi​∥ρi​)≤D(σ∥ρ).

The family need not be local; the inequality retains branch information.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P42
Formal statement
noncomputable section

open scoped Matrix ComplexConjugate ComplexOrder ENNReal Topology

namespace QAlgorithms.Papers.Independent.Intakenext100.P42

open QAlgorithms QAlgorithms.Entanglement

open QAlgorithms.Papers.Independent.Dependency50.P21 (relativeEntropy)

open QAlgorithms.Papers.Independent.Information100.P56 (entropy)

open QAlgorithms.Papers.Independent.Information100.P04 (copies)

open QAlgorithms.Papers.Independent.Bridge50.P49 (groupedProduct)

attribute [local instance] Classical.propDecidable Classical.decEq

/-- Theorem 2, PDF p.10: summed subnormalized branch contractivity.
Both states use forward conjugation; completeness is inherited from the setup. -/
theorem branch_contractivity (D : DistanceFamily) (h2 : UnitaryInvariantDistance D) (h3 : F3 D true)
    (h5a : F5a D) (h5b : F5b D)
    {I J K : Type} [Fintype I] [Fintype J] [Fintype K]
    [DecidableEq I] [DecidableEq J] [Nonempty I] [Nonempty J]
    (V : K → Matrix J I ℂ) (hV : IsKrausFamily V)
    (sigma rho : Matrix I I ℂ) (hsigma : IsDensityMatrix sigma) (hrho : IsDensityMatrix rho) :
    (∑ k, D (rectangularKrausBranch V sigma k) (rectangularKrausBranch V rho k)) ≤ D sigma rho := by sorry

end QAlgorithms.Papers.Independent.Intakenext100.P42

end
Source
Entanglement Measures and Purification Procedures, arXiv:quant-ph/9707035v2, PDF p. 10, Theorem 2: summed branch contractivity
Read-back

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

Let DDD be an extended real valued family on pairs of complex square matrices on finite types with decidable equality. Assume simultaneous unitary conjugation leaves DDD unchanged on density matrices; tensoring both arguments with αα†\alpha\alpha^\daggerαα† for any unit vector on a nonempty finite ancillary type with decidable equality leaves DDD unchanged on density matrices; and, for every complete finite family of mutually orthogonal Hermitian idempotents QkQ_kQk​,

D ⁣(∑kQkSQk,∑kQkRQk)=∑kD(QkSQk,QkRQk)D\!\left(\sum_kQ_kSQ_k,\sum_kQ_kRQ_k\right) =\sum_kD(Q_kSQ_k,Q_kRQ_k)D(k∑​Qk​SQk​,k∑​Qk​RQk​)=k∑​D(Qk​SQk​,Qk​RQk​)

for all density pairs S,RS,RS,R. These assumptions range over all nonempty finite underlying types with decidable equality. Additionally assume partial trace over any nonempty finite factor does not increase DDD for any pair of positive semidefinite matrices whose real traces are at most 111, including zero matrices; explicitly, (Tr⁡AZ)b,b′=∑aZ(a,b),(a,b′)(\operatorname{Tr}_A Z)_{b,b'}=\sum_aZ_{(a,b),(a,b')}(TrA​Z)b,b′​=∑a​Z(a,b),(a,b′)​. A density matrix means a positive semidefinite matrix with complex trace 111, and (αα†)a,b=αaαb‾(\alpha\alpha^\dagger)_{a,b}=\alpha_a\overline{\alpha_b}(αα†)a,b​=αa​αb​​. Then, for every pair of nonempty finite types I,JI,JI,J with decidable equality, every finite type KKK, every family of complex matrices Vk:J×I→CV_k:J\times I\to\mathbb CVk​:J×I→C satisfying ∑kVk†Vk=I\sum_kV_k^\dagger V_k=I∑k​Vk†​Vk​=I, and every density pair σ,ρ\sigma,\rhoσ,ρ on III,

∑kD(VkσVk†,VkρVk†)≤D(σ,ρ).\sum_kD(V_k\sigma V_k^\dagger,V_k\rho V_k^\dagger) \le D(\sigma,\rho).k∑​D(Vk​σVk†​,Vk​ρVk†​)≤D(σ,ρ).

The branch matrices in this sum are not normalized. No decidable equality or nonemptiness assumption is imposed on KKK; an empty KKK cannot satisfy the completeness equation because III is nonempty.

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

    Confirmed by the moderator at approval.

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