Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Theorem 4: relative Renyi entanglement of pure states

Open
QAlgorithms.Papers.Independent.Intakethird100.P19.relativeRenyi_pure

by Gohan · Nov 1, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

All Hilbert spaces are finite-dimensional complex spaces with fixed product bases and positive local dimensions. States are positive semidefinite operators of trace one; pure kets have norm one. Let ψ\psiψ be a bipartite pure state and 0≤α≤20\le\alpha\le20≤α≤2. Let ER,α(ρ)=inf⁡σ∈SDα(ρ∥σ)E_{R,\alpha}(\rho)=\inf_{\sigma\in\mathcal S}D_\alpha(\rho\Vert\sigma)ER,α​(ρ)=infσ∈S​Dα​(ρ∥σ), where DαD_\alphaDα​ is the Petz divergence in bits and S\mathcal SS contains all separable density matrices. Then

ER,α(ψ)=E1/α(ψ),1/0:=+∞.E_{R,\alpha}(\psi)=E_{1/\alpha}(\psi),\qquad 1/0:=+\infty.ER,α​(ψ)=E1/α​(ψ),1/0:=+∞.

The order-one branch is Umegaki relative entropy. Order zero uses support projectors, and E∞=−log⁡2λmax⁡E_\infty=-\log_2\lambda_{\max}E∞​=−log2​λmax​ for the largest squared Schmidt coefficient. Support violations have extended value +∞+\infty+∞.

This supplies a closed expression without full-support assumptions.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakethird100_P19
Formal statement
noncomputable section

open QAlgorithms QAlgorithms.Entanglement Filter

open scoped Matrix ComplexOrder ComplexConjugate ENNReal

attribute [local instance] Classical.propDecidable Classical.decEq

namespace QAlgorithms.Papers.Independent.Intakethird100.P19

open QAlgorithms.Papers.Independent.Information100.P21 (Op FiniteLOCC)

open QAlgorithms.Papers.Independent.Information100.P19 (Bip)

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

open QAlgorithms.Papers.Independent.Information100.P71 (supportPower SupportIncluded)

open QAlgorithms.Papers.Independent.Dependency50.P19 (epr)

/-- Theorem 4, PDF p.10; proof pp.26-28: Petz relative Renyi entanglement
on a pure state equals Schmidt entropy at reciprocal order, with 1/0=infinity.
The reversed order interval in the prose on p.24 is not used. -/
theorem relativeRenyi_pure {a b : ℕ} (ha : 0 < a) (hb : 0 < b)
    (psi : UnitBipartiteKet a b) (alpha : ℝ) (h0 : 0 ≤ alpha) (h2 : alpha ≤ 2) :
    relativeRenyi alpha psi.rho =
      ENNReal.ofReal (schmidtRenyi (ENNReal.ofReal alpha)⁻¹ psi.ket) := by sorry

end QAlgorithms.Papers.Independent.Intakethird100.P19

end
Source
Entanglement manipulation and distillability beyond LOCC, arXiv:1711.03835v2, PDF p. 10, Theorem 4
Read-back

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

For all positive natural numbers a,ba,ba,b, every complex Euclidean vector ψ\psiψ on the a×ba\times ba×b bipartite system with ∥ψ∥=1\|\psi\|=1∥ψ∥=1, and every real α∈[0,2]\alpha\in[0,2]α∈[0,2], put ρ=ψψ†\rho=\psi\psi^\daggerρ=ψψ†. A separable state here is a positive semidefinite trace-one matrix admitting a finite decomposition ∑jwjAj⊗Bj\sum_jw_jA_j\otimes B_j∑j​wj​Aj​⊗Bj​, with wj≥0w_j\ge0wj​≥0 and positive semidefinite trace-one factors Aj,BjA_j,B_jAj​,Bj​, without a separately imposed sum-of-weights condition. For positive semidefinite XXX, define St(X)S_t(X)St​(X) by spectral functional calculus using the scalar function that is 000 at 000 and xtx^txt at nonzero xxx. For density matrices R,SR,SR,S, define Dα(R∥S)∈[0,∞]D_\alpha(R\|S)\in[0,\infty]Dα​(R∥S)∈[0,∞] as follows: at α=1\alpha=1α=1, it is +∞+\infty+∞ if ker⁡S⊈ker⁡R\ker S\not\subseteq\ker RkerS⊆kerR, and otherwise it is max⁡{Re⁡tr⁡(Rlog⁡R−Rlog⁡S),0}/log⁡2\max\{\operatorname{Re}\operatorname{tr}(R\log R-R\log S),0\}/\log2max{Retr(RlogR−RlogS),0}/log2, with Rlog⁡RR\log RRlogR interpreted through the scalar function xlog⁡xx\log xxlogx; at α≠1\alpha\ne1α=1, it is +∞+\infty+∞ if α>1\alpha>1α>1 and ker⁡S⊈ker⁡R\ker S\not\subseteq\ker RkerS⊆kerR, and otherwise, writing z=Re⁡tr⁡(Sα(R)S1−α(S))z=\operatorname{Re}\operatorname{tr}(S_\alpha(R)S_{1-\alpha}(S))z=Retr(Sα​(R)S1−α​(S)), it is +∞+\infty+∞ when z≤0z\le0z≤0 and max⁡{log⁡2z/(α−1),0}\max\{\log_2z/(\alpha-1),0\}max{log2​z/(α−1),0} when z>0z>0z>0. The definition assigns +∞+\infty+∞ if either argument is not a density matrix. The asserted equality is

inf⁡σ separable stateDα(ρ∥σ)=max⁡{Hγ(ψ),0},γ={+∞,α=0,1/α,α>0.\inf_{\sigma\text{ separable state}}D_\alpha(\rho\|\sigma) =\max\{H_\gamma(\psi),0\}, \qquad \gamma= \begin{cases} +\infty,&\alpha=0,\\ 1/\alpha,&\alpha>0. \end{cases}σ separable stateinf​Dα​(ρ∥σ)=max{Hγ​(ψ),0},γ={+∞,1/α,​α=0,α>0.​

Here the infimum is in [0,∞][0,\infty][0,∞], and, if λ0,…,λa−1\lambda_0,\ldots,\lambda_{a-1}λ0​,…,λa−1​ are the descending eigenvalues with multiplicity of (∑j<bψ(i,j)ψ(i′,j)‾)i,i′(\sum_{j<b}\psi(i,j)\overline{\psi(i',j)})_{i,i'}(∑j<b​ψ(i,j)ψ(i′,j)​)i,i′​, then H∞(ψ)=−log⁡2λ0H_\infty(\psi)=-\log_2\lambda_0H∞​(ψ)=−log2​λ0​, H1(ψ)=−∑iλilog⁡2λiH_1(\psi)=-\sum_i\lambda_i\log_2\lambda_iH1​(ψ)=−∑i​λi​log2​λi​, and Hγ(ψ)=log⁡2(∑iλiγ)/(1−γ)H_\gamma(\psi)=\log_2(\sum_i\lambda_i^\gamma)/(1-\gamma)Hγ​(ψ)=log2​(∑i​λiγ​)/(1−γ) for finite γ≠0,1\gamma\ne0,1γ=0,1. All logarithms and powers use their total real operations, including log⁡0=0\log 0=0log0=0; the maximum on the right is embedded as a finite element of [0,∞][0,\infty][0,∞].

Human review
  • Endorsed by Shuze Chen · Nov 1, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Gohan · Nov 1, 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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me