Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Corollary 5: Renyi monotonicity from one half through infinity

Open
QAlgorithms.Papers.Independent.Intakethird100.P19.renyi_monotone_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. A non-entangling map is completely positive and preserves the full separable positive cone. A channel is also trace preserving. For every α∈[1/2,+∞]\alpha\in[1/2,+\infty]α∈[1/2,+∞], every pure input ψ\psiψ, every pure output φ\varphiφ, and every non-entangling channel satisfying Λ(ψ)=φ\Lambda(\psi)=\varphiΛ(ψ)=φ,

Eα(φ)≤Eα(ψ).E_\alpha(\varphi)\le E_\alpha(\psi).Eα​(φ)≤Eα​(ψ).

The entropies use squared Schmidt coefficients and base-two logarithms, with the Shannon and min-entropy endpoint branches.

This constrains deterministic pure-state conversions.

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)

/-- Corollary 5, PDF p.10: deterministic pure-to-pure monotonicity,
including infinite order and the endpoint one half. -/
theorem renyi_monotone_pure {a b c d : ℕ}
    (ha : 0 < a) (hb : 0 < b) (hc : 0 < c) (hd : 0 < d)
    (alpha : RenyiOrder) (hhalf : (1 / 2 : ℝ≥0∞) ≤ alpha)
    (psi : UnitBipartiteKet a b) (phi : UnitBipartiteKet c d)
    (L : Superop (Fin a × Fin b) (Fin c × Fin d))
    (hL : IsChannel L) (hne : NE L) (hconvert : L psi.rho = phi.rho) :
    schmidtRenyi alpha phi.ket ≤ schmidtRenyi 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, Corollary 5
Read-back

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

For all positive natural numbers a,b,c,da,b,c,da,b,c,d, every order α∈[0,∞]\alpha\in[0,\infty]α∈[0,∞] with α≥12\alpha\ge \tfrac12α≥21​, and all unit vectors ψ∈Ca⊗Cb\psi\in\mathbb C^a\otimes\mathbb C^bψ∈Ca⊗Cb and ϕ∈Cc⊗Cd\phi\in\mathbb C^c\otimes\mathbb C^dϕ∈Cc⊗Cd, suppose LLL is a map from operators on the first space to operators on the second that is a channel, preserves the separable positive cone, and satisfies L(∣ψ⟩⟨ψ∣)=∣ϕ⟩⟨ϕ∣L(|\psi\rangle\langle\psi|)=|\phi\rangle\langle\phi|L(∣ψ⟩⟨ψ∣)=∣ϕ⟩⟨ϕ∣. Here being a channel means that there is a finite family of matrices EjE_jEj​ such that L(X)=∑jEjXEj†L(X)=\sum_j E_jXE_j^\daggerL(X)=∑j​Ej​XEj†​ for every XXX and ∑jEj†Ej=I\sum_jE_j^\dagger E_j=I∑j​Ej†​Ej​=I; the non-entangling hypothesis additionally requires a finite Kraus representation, without a normalization requirement on that representation, and preservation of every finite nonnegative sum of tensor products of positive semidefinite trace-one matrices, including the empty sum 000. Then Hα(ϕ)≤Hα(ψ)H_\alpha(\phi)\le H_\alpha(\psi)Hα​(ϕ)≤Hα​(ψ). To define this quantity for a vector v∈Cu⊗Cvv\in\mathbb C^u\otimes\mathbb C^vv∈Cu⊗Cv, let λ0,…,λu−1\lambda_0,\ldots,\lambda_{u-1}λ0​,…,λu−1​ be the eigenvalues, in nonincreasing order and with multiplicities, of the matrix with entries ∑jvijvi′j‾\sum_j v_{ij}\overline{v_{i'j}}∑j​vij​vi′j​​, and let rrr be the number of strictly positive λi\lambda_iλi​. The definition is H∞(v)=−log⁡2λ0H_\infty(v)=-\log_2\lambda_0H∞​(v)=−log2​λ0​, H0(v)=log⁡2rH_0(v)=\log_2rH0​(v)=log2​r, H1(v)=−∑iλilog⁡2λiH_1(v)=-\sum_i\lambda_i\log_2\lambda_iH1​(v)=−∑i​λi​log2​λi​, and, for any other finite order ttt, Ht(v)=log⁡2(∑iλit)/(1−t)H_t(v)=\log_2(\sum_i\lambda_i^t)/(1-t)Ht​(v)=log2​(∑i​λit​)/(1−t). The order-zero case is excluded by the hypothesis, while order one, infinite order, and zero eigenvalues are included; the real logarithm at zero is assigned the value 000.

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