Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

tensor-distance-fidelity: Trace-norm tensor perturbation≤sum of factor perturbations; overlap infidelity of tensor products≤sum of factor overlap infideliti

Proved
QAlgorithms.Papers.Independent.Renew46.P43.tensorPerturbation

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

prove2quantum

Let ρ1,σ1\rho_1,\sigma_1ρ1​,σ1​ be normalized states on one finite system and ρ2,σ2\rho_2,\sigma_2ρ2​,σ2​ normalized states on another. The norm is the unhalved trace norm and the fidelity is overlap Tr⁡(ρσ)\operatorname{Tr}(\rho\sigma)Tr(ρσ).

∥ρ1⊗ρ2−σ1⊗σ2∥1≤∥ρ1−σ1∥1+∥ρ2−σ2∥1,1−Tr⁡((ρ1⊗ρ2)(σ1⊗σ2))≤∑i=12(1−Tr⁡(ρiσi)).\|\rho_1\otimes\rho_2-\sigma_1\otimes\sigma_2\|_1\le\|\rho_1-\sigma_1\|_1+\|\rho_2-\sigma_2\|_1,\quad1-\operatorname{Tr}((\rho_1\otimes\rho_2)(\sigma_1\otimes\sigma_2))\le\sum_{i=1}^2(1-\operatorname{Tr}(\rho_i\sigma_i)).∥ρ1​⊗ρ2​−σ1​⊗σ2​∥1​≤∥ρ1​−σ1​∥1​+∥ρ2​−σ2​∥1​,1−Tr((ρ1​⊗ρ2​)(σ1​⊗σ2​))≤i=1∑2​(1−Tr(ρi​σi​)).

This is the source result with its stated operational or information-theoretic domain.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Renew46_P43
Formal statement
noncomputable section

namespace QAlgorithms.Papers.Independent.Renew46.P43

open scoped BigOperators Matrix ComplexConjugate ComplexOrder ENNReal Matrix.Norms.L2Operator

open Filter MeasureTheory

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

open QAlgorithms.Papers.Independent.Information100.P06 (Below)

open QAlgorithms.Papers.Independent.Information100.P60 (copies relativeBits)

open QAlgorithms.Papers.Independent.Dependency50.P19 (count both)

open QAlgorithms.Papers.Independent.Information100.P22 (coherentInformation)

attribute [local instance] Classical.propDecidable Classical.decEq

/-- Unnumbered tensor inequalities, PDF p.8. All four factors are normalized. -/
theorem tensorPerturbation {I J : Type*} [Fintype I] [Fintype J] [DecidableEq I] [DecidableEq J]
    (rho1 sigma1 : Matrix I I ℂ) (rho2 sigma2 : Matrix J J ℂ)
    (hrho1 : IsDensityMatrix rho1) (hsigma1 : IsDensityMatrix sigma1)
    (hrho2 : IsDensityMatrix rho2) (hsigma2 : IsDensityMatrix sigma2) :
    traceNorm (Matrix.kronecker rho1 rho2 - Matrix.kronecker sigma1 sigma2) ≤
      traceNorm (rho1 - sigma1) + traceNorm (rho2 - sigma2) ∧
    1 - effectProb (Matrix.kronecker rho1 rho2) (Matrix.kronecker sigma1 sigma2) ≤
      (1 - effectProb rho1 sigma1) + (1 - effectProb rho2 sigma2) := by sorry

end QAlgorithms.Papers.Independent.Renew46.P43

end
Source
Coding Theorems of Quantum Information Theory, arXiv:quant-ph/9907077v1, PDF p. 8, tensor-distance-fidelity
Read-back

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

For any finite types I,JI,JI,J, each equipped with decidable equality, let ρ1,σ1\rho_1,\sigma_1ρ1​,σ1​ be complex matrices indexed by III, and let ρ2,σ2\rho_2,\sigma_2ρ2​,σ2​ be complex matrices indexed by JJJ. Assume all four matrices are positive semidefinite and have trace 111. Writing ∥M∥1=Re⁡tr⁡M†M\|M\|_1=\operatorname{Re}\operatorname{tr}\sqrt{M^\dagger M}∥M∥1​=RetrM†M​, where the square root is defined by functional calculus, both inequalities hold:

∥ρ1⊗ρ2−σ1⊗σ2∥1≤∥ρ1−σ1∥1+∥ρ2−σ2∥1\|\rho_1\otimes\rho_2-\sigma_1\otimes\sigma_2\|_1 \le\|\rho_1-\sigma_1\|_1+\|\rho_2-\sigma_2\|_1∥ρ1​⊗ρ2​−σ1​⊗σ2​∥1​≤∥ρ1​−σ1​∥1​+∥ρ2​−σ2​∥1​

and

1−Re⁡tr⁡ ⁣((ρ1⊗ρ2)(σ1⊗σ2))≤(1−Re⁡tr⁡(ρ1σ1))+(1−Re⁡tr⁡(ρ2σ2)).1-\operatorname{Re}\operatorname{tr} \!\left((\rho_1\otimes\rho_2)(\sigma_1\otimes\sigma_2)\right) \le \left(1-\operatorname{Re}\operatorname{tr}(\rho_1\sigma_1)\right) +\left(1-\operatorname{Re}\operatorname{tr}(\rho_2\sigma_2)\right).1−Retr((ρ1​⊗ρ2​)(σ1​⊗σ2​))≤(1−Retr(ρ1​σ1​))+(1−Retr(ρ2​σ2​)).

If either indexing type is empty, its trace-one hypotheses cannot be satisfied.

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