Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Binary and i.i.d. tensor additivity

Proved
QAlgorithms.Papers.Independent.Support50.P23.alphaAdditivity

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

prove2quantum

Let ρAB,τCD\rho_{AB},\tau_{CD}ρAB​,τCD​ and reference states σB,ωD\sigma_B,\omega_DσB​,ωD​ be normalized on arbitrary finite-dimensional nonzero complex systems. For every α∈[0,∞]\alpha\in[0,\infty]α∈[0,∞], with factors regrouped as AC,BDAC,BDAC,BD,

Hα(AC∣BD)ρ⊗τ∣σ⊗ω=Hα(A∣B)ρ∣σ+Hα(C∣D)τ∣ω.H_\alpha(AC|BD)_{\rho\otimes\tau|\sigma\otimes\omega} =H_\alpha(A|B)_{\rho|\sigma}+H_\alpha(C|D)_{\tau|\omega}.Hα​(AC∣BD)ρ⊗τ∣σ⊗ω​=Hα​(A∣B)ρ∣σ​+Hα​(C∣D)τ∣ω​.

In particular, for every integer n≥1n\ge1n≥1,

Hα(An∣Bn)ρ⊗n∣σ⊗n=nHα(A∣B)ρ∣σ.H_\alpha(A^n|B^n)_{\rho^{\otimes n}|\sigma^{\otimes n}} =nH_\alpha(A|B)_{\rho|\sigma}.Hα​(An∣Bn)ρ⊗n∣σ⊗n​=nHα​(A∣B)ρ∣σ​.

The two factors can have different dimensions. These identities are the product scaling used in the finite-block bound.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P23
Formal statement
noncomputable section

open Filter

open scoped ENNReal ComplexConjugate ComplexOrder

namespace QAlgorithms.Papers.Independent.Support50.P23

attribute [local instance] Classical.propDecidable

-- Exact accepted bodies. Other similarly named catalogue entries use different
-- smoothing, conditioning order, logarithm base, or channel-level objects.

open QAlgorithms.Papers.Independent.Gap20.P03 (fixedMin)

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

open QAlgorithms.Papers.Independent.Information100.P67 (IsSubnormalized)

open QAlgorithms.Papers.Independent.Information100.P69 (matrixPower)

variable {A B C D I : Type*}

variable [Fintype A] [Fintype B] [Fintype C] [Fintype D] [Fintype I]

variable [DecidableEq A] [DecidableEq B] [DecidableEq C] [DecidableEq D] [DecidableEq I]

/-- Section II, PDF p.4, (18): arbitrary binary tensor additivity and its displayed
i.i.d. specialization for positive n, including all endpoint orders. -/
theorem alphaAdditivity [Nonempty A] [Nonempty B]
    (rho : Matrix (A × B) (A × B) ℂ) (sigma : Matrix B B ℂ)
    (hrho : IsDensityMatrix rho) (hsigma : IsDensityMatrix sigma) (alpha : ℝ≥0∞) :
    (∀ {C D : Type*} [Fintype C] [Fintype D] [DecidableEq C] [DecidableEq D]
      [Nonempty C] [Nonempty D]
      (tau : Matrix (C × D) (C × D) ℂ) (omega : Matrix D D ℂ),
      IsDensityMatrix tau → IsDensityMatrix omega →
        alphaEntropy (independentProduct rho tau) (Matrix.kronecker sigma omega) alpha =
          alphaEntropy rho sigma alpha + alphaEntropy tau omega alpha) ∧
    (∀ n : ℕ, 0 < n →
      alphaEntropy (jointPower rho n) (matrixPower sigma n) alpha =
        n • alphaEntropy rho sigma alpha) := by sorry

end QAlgorithms.Papers.Independent.Support50.P23

end
Source
A Fully Quantum Asymptotic Equipartition Property, arXiv:0811.1221v3, PDF p. 4, Section II, unnumbered: tensor additivity, (18)
Read-back

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

Let A,BA,BA,B be nonempty finite types with decidable equality, let ρ\rhoρ on CA×B\mathbb C^{A\times B}CA×B and σ\sigmaσ on CB\mathbb C^BCB be positive semidefinite matrices of trace 111, and let α∈[0,+∞]\alpha\in[0,+\infty]α∈[0,+∞]. For any such pair R,ΣR,\SigmaR,Σ, write J=I⊗ΣJ=I\otimes\SigmaJ=I⊗Σ, set HJ(R)=Re⁡tr⁡[Rlog⁡2J]−Re⁡tr⁡[Rlog⁡2R]H_J(R)=\operatorname{Re}\operatorname{tr}[R\log_2J]-\operatorname{Re}\operatorname{tr}[R\log_2R]HJ​(R)=Retr[Rlog2​J]−Retr[Rlog2​R] if ker⁡J⊆ker⁡R\ker J\subseteq\ker RkerJ⊆kerR, and set it to −∞-\infty−∞ otherwise; define Ft(R,Σ)=HJ(R)F_t(R,\Sigma)=H_J(R)Ft​(R,Σ)=HJ​(R) at t=1t=1t=1, Ft=−∞F_t=-\inftyFt​=−∞ when t>1t>1t>1 and that support inclusion fails, and otherwise Ft=(1−t)−1ℓ(Re⁡tr⁡[RtJ[1−t]])F_t=(1-t)^{-1}\ell(\operatorname{Re}\operatorname{tr}[R^tJ^{[1-t]}])Ft​=(1−t)−1ℓ(Retr[RtJ[1−t]]), where J[u]J^{[u]}J[u] assigns 000 at zero eigenvalues and ℓ(0)=−∞\ell(0)=-\inftyℓ(0)=−∞, ℓ(x)=log⁡2x\ell(x)=\log_2xℓ(x)=log2​x for x≠0x\ne0x=0. Define Hα(R,Σ)=Fα(R,Σ)H_\alpha(R,\Sigma)=F_\alpha(R,\Sigma)Hα​(R,Σ)=Fα​(R,Σ) for finite positive α\alphaα, H0(R,Σ)=sup⁡t>0Ft(R,Σ)H_0(R,\Sigma)=\sup_{t>0}F_t(R,\Sigma)H0​(R,Σ)=supt>0​Ft​(R,Σ), and H+∞(R,Σ)=inf⁡t>0Ft(R,Σ)H_{+\infty}(R,\Sigma)=\inf_{t>0}F_t(R,\Sigma)H+∞​(R,Σ)=inft>0​Ft​(R,Σ), with extended-real arithmetic. Then for every pair of nonempty finite types C,DC,DC,D with decidable equality and every pair of positive semidefinite trace-one matrices τ\tauτ on CC×D\mathbb C^{C\times D}CC×D and ω\omegaω on CD\mathbb C^DCD,

Hα(ρ⊠τ,σ⊗ω)=Hα(ρ,σ)+Hα(τ,ω),H_\alpha(\rho\boxtimes\tau,\sigma\otimes\omega) =H_\alpha(\rho,\sigma)+H_\alpha(\tau,\omega),Hα​(ρ⊠τ,σ⊗ω)=Hα​(ρ,σ)+Hα​(τ,ω),

where (ρ⊠τ)(a,c;b,d),(a′,c′;b′,d′)=ρ(a,b),(a′,b′)τ(c,d),(c′,d′)(\rho\boxtimes\tau)_{(a,c;b,d),(a',c';b',d')}=\rho_{(a,b),(a',b')}\tau_{(c,d),(c',d')}(ρ⊠τ)(a,c;b,d),(a′,c′;b′,d′)​=ρ(a,b),(a′,b′)​τ(c,d),(c′,d′)​. Also, for every natural n>0n>0n>0, Hα(ρ⊗n,σ⊗n)=n⋅Hα(ρ,σ)H_\alpha(\rho^{\otimes n},\sigma^{\otimes n})=n\cdot H_\alpha(\rho,\sigma)Hα​(ρ⊗n,σ⊗n)=n⋅Hα​(ρ,σ), where tensor-power entries are coordinatewise products and n⋅n\cdotn⋅ denotes repeated extended-real addition. The order endpoints 0,+∞0,+\infty0,+∞ are included, but the tensor-power assertion excludes n=0n=0n=0.

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

    Confirmed by the moderator at approval.

  • Endorsed by Goku · Oct 24, 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