Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Local isometric invariance of fixed-reference alpha entropy

Proved
QAlgorithms.Papers.Independent.Support50.P23.alphaIsometry

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

prove2quantum

Let ρAB\rho_{AB}ρAB​ and σB\sigma_BσB​ be normalized states on finite-dimensional nonzero complex systems, and let U:A→CU:A\to CU:A→C and V:B→DV:B\to DV:B→D be isometries. Define τCD=(U⊗V)ρAB(U⊗V)†\tau_{CD}=(U\otimes V)\rho_{AB}(U\otimes V)^\daggerτCD​=(U⊗V)ρAB​(U⊗V)† and ωD=VσBV†\omega_D=V\sigma_BV^\daggerωD​=VσB​V†. For every α∈[0,∞]\alpha\in[0,\infty]α∈[0,∞],

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

The output states are constructed from the input data. The equality expresses independence from the ambient local representation.

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]

/-- Lemma 4, PDF p.4, (19): output states are the specified local isometric images. -/
theorem alphaIsometry [Nonempty A] [Nonempty B] [Nonempty C] [Nonempty D]
    (rho : Matrix (A × B) (A × B) ℂ) (sigma : Matrix B B ℂ)
    (hrho : IsDensityMatrix rho) (hsigma : IsDensityMatrix sigma)
    (U : Matrix C A ℂ) (V : Matrix D B ℂ)
    (hU : U.conjTranspose * U = 1) (hV : V.conjTranspose * V = 1) (alpha : ℝ≥0∞) :
    alphaEntropy rho sigma alpha =
      alphaEntropy (Matrix.kronecker U V * rho * (Matrix.kronecker U V).conjTranspose)
        (V * sigma * V.conjTranspose) alpha := by sorry

end QAlgorithms.Papers.Independent.Support50.P23

end
Source
A Fully Quantum Asymptotic Equipartition Property, arXiv:0811.1221v3, PDF p. 4, Lemma 4: local isometric invariance of alpha entropies
Read-back

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

Let A,B,C,DA,B,C,DA,B,C,D be finite, nonempty index types with decidable equality, let ρ\rhoρ on A×BA\times BA×B and σ\sigmaσ on BBB be positive semidefinite complex matrices of trace one, and let complex matrices U:CA→CCU:\mathbb C^A\to\mathbb C^CU:CA→CC and V:CB→CDV:\mathbb C^B\to\mathbb C^DV:CB→CD satisfy U†U=IAU^\dagger U=I_AU†U=IA​ and V†V=IBV^\dagger V=I_BV†V=IB​. For a bipartite matrix ω\omegaω and reference η\etaη, put Q=I⊗ηQ=I\otimes\etaQ=I⊗η, use the support condition ker⁡Q⊆ker⁡ω\ker Q\subseteq\ker\omegakerQ⊆kerω, and define H1(ω,η)=Re⁡tr⁡[ωlog⁡2Q]+S(ω)H_1(\omega,\eta)=\operatorname{Re}\operatorname{tr}[\omega\log_2Q]+S(\omega)H1​(ω,η)=Retr[ωlog2​Q]+S(ω) when supported and −∞-\infty−∞ otherwise, where S(X)=−Re⁡tr⁡[x↦xlog⁡2x](X)S(X)=-\operatorname{Re}\operatorname{tr}[x\mapsto x\log_2x](X)S(X)=−Retr[x↦xlog2​x](X). For positive real t≠1t\ne1t=1, define Ht=−∞H_t=-\inftyHt​=−∞ when t>1t>1t>1 and support fails, and otherwise Ht=(1−t)−1L(Re⁡tr⁡[ωtgt(Q)])H_t=(1-t)^{-1}L(\operatorname{Re}\operatorname{tr}[\omega^t g_t(Q)])Ht​=(1−t)−1L(Retr[ωtgt​(Q)]), where gt(0)=0g_t(0)=0gt​(0)=0, gt(x)=x1−tg_t(x)=x^{1-t}gt​(x)=x1−t for x≠0x\ne0x=0, L(0)=−∞L(0)=-\inftyL(0)=−∞, and L(x)=log⁡2xL(x)=\log_2xL(x)=log2​x otherwise; all matrix functions use continuous functional calculus. Set H0=sup⁡t>0HtH_0=\sup_{t>0}H_tH0​=supt>0​Ht​ and H∞=inf⁡t>0HtH_\infty=\inf_{t>0}H_tH∞​=inft>0​Ht​. Then, for every α∈[0,+∞]\alpha\in[0,+\infty]α∈[0,+∞],

Hα(ρ,σ)=Hα ⁣((U⊗V)ρ(U⊗V)†, VσV†).H_\alpha(\rho,\sigma)= H_\alpha\!\left((U\otimes V)\rho(U\otimes V)^\dagger,\, V\sigma V^\dagger\right).Hα​(ρ,σ)=Hα​((U⊗V)ρ(U⊗V)†,VσV†).

The matrices U,VU,VU,V need only be isometries, so they may be rectangular; orders zero and +∞+\infty+∞ are included.

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