Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Corollary 16: equality of S_oneHalf forbids nontrivial preparation

Open
QAlgorithms.Papers.Independent.Intakethird100.P95.corollary16

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

prove2quantum

Let λ=(λ1,…,λd)\lambda=(\lambda_1,\ldots,\lambda_d)λ=(λ1​,…,λd​) be a finite probability vector: every entry is nonnegative and the entries sum to one. Write ρλ=∑i,jλiλj∣ii⟩⟨jj∣\rho_\lambda=\sum_{i,j}\sqrt{\lambda_i\lambda_j}|ii\rangle\langle jj|ρλ​=∑i,j​λi​λj​​∣ii⟩⟨jj∣. All logarithms have base two. A PPT operation is a completely positive, trace-preserving map LLL such that ΓoutLΓin\Gamma_{\rm out}L\Gamma_{\rm in}Γout​LΓin​ is completely positive for arbitrary finite ancillary systems; Γ\GammaΓ transposes Bob in the fixed product basis. Assume in addition that all entries of λ\lambdaλ are strictly positive, so ddd is its Schmidt rank. For a positive integer KKK, ΦK\Phi_KΦK​ denotes the maximally entangled state of Schmidt rank KKK. For a finite order ttt, StS_tSt​ is the Rényi entropy, with S0S_0S0​ the log support size, S1=−∑iλilog⁡2λiS_1=-\sum_i\lambda_i\log_2\lambda_iS1​=−∑i​λi​log2​λi​ (using 0log⁡20=00\log_2 0=00log2​0=0), and St=(1−t)−1log⁡2∑iλitS_t=(1-t)^{-1}\log_2\sum_i\lambda_i^tSt​=(1−t)−1log2​∑i​λit​ otherwise. The separate infinity order is S∞=−log⁡2max⁡iλiS_\infty=-\log_2\max_i\lambda_iS∞​=−log2​maxi​λi​. Let K≥2K\ge2K≥2 and d≥Kd\ge Kd≥K. If S1/2(λ)=log⁡2KS_{1/2}(\lambda)=\log_2 KS1/2​(λ)=log2​K, then

ΦK→PPTρλ⟹d=K   and   λi=1/K for every i.\Phi_K\to^{\rm PPT}\rho_\lambda\quad\Longrightarrow\quad d=K\;\text{ and }\;\lambda_i=1/K\text{ for every }i.ΦK​→PPTρλ​⟹d=K and λi​=1/K for every i.

Thus the entropy equality case permits only the same maximally entangled nonzero spectrum, up to local unitaries.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakethird100_P95
Formal statement
noncomputable section

open scoped BigOperators Matrix ComplexOrder

open Filter

namespace QAlgorithms.Papers.Independent.Intakethird100.P95

attribute [local instance] Classical.propDecidable Classical.decEq

-- Exact primitives from the pinned accepted library; no local aliases.

open QAlgorithms.Papers.Independent.Claimed50.P28 (maximallyEntangledDensity)

open QAlgorithms.Papers.Independent.Information100.P27 (IsProbability)

open QAlgorithms.Papers.Independent.Information100.P63 (logTwo)

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

open QAlgorithms.Papers.Independent.Dependency50.P18 (bipartiteTensor)

open QAlgorithms.Papers.Independent.Support50.P11 (Loewner)

/-- PDF p.7, Corollary 16: only-if, including the entropy equality boundary.
Full support makes equality of nonzero spectra exactly d=K and uniform entries. -/
theorem corollary16 {d : ℕ} (K : ℕ) (hK : 2 ≤ K) (lam : Fin d → ℝ)
    (hprob : IsProbability lam) (hpos : ∀ i, 0 < lam i) (hd : K ≤ d)
    (hentropy : schmidtRenyi (1 / 2) lam = logTwo (K : ℝ)) :
    Reach (maximallyEntangledDensity K) (schmidtDensity lam) → d = K ∧ ∀ i, lam i = (K : ℝ)⁻¹ := by sorry

end QAlgorithms.Papers.Independent.Intakethird100.P95

end
Source
Pure-state transformations and catalysis under operations that completely preserve positivity of partial transpose, arXiv:0801.4322v2, PDF p. 7, Corollary 16: equality of S_oneHalf forbids nontrivial preparation
Read-back

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

For every natural number ddd, integer K≥2K\ge2K≥2, and strictly positive probability vector λ∈Rd\lambda\in\mathbb R^dλ∈Rd, assume K≤dK\le dK≤d and

2log⁡2 ⁣(∑i=0d−1λi)=log⁡2K,log⁡2x=log⁡xlog⁡2.2\log_2\!\left(\sum_{i=0}^{d-1}\sqrt{\lambda_i}\right)=\log_2 K, \qquad \log_2 x=\frac{\log x}{\log2}.2log2​(i=0∑d−1​λi​​)=log2​K,log2​x=log2logx​.

Define ΩK=K−1∑i,j=0K−1∣ii⟩⟨jj∣\Omega_K=K^{-1}\sum_{i,j=0}^{K-1}|ii\rangle\langle jj|ΩK​=K−1∑i,j=0K−1​∣ii⟩⟨jj∣ and define ρλ\rho_\lambdaρλ​ on Cd⊗Cd\mathbb C^d\otimes\mathbb C^dCd⊗Cd by (ρλ)(i,j),(k,l)=λiλk(\rho_\lambda)_{(i,j),(k,l)}=\sqrt{\lambda_i\lambda_k}(ρλ​)(i,j),(k,l)​=λi​λk​​ if i=ji=ji=j and k=lk=lk=l, and 000 otherwise. If there exists a complex-linear map L\mathcal LL sending ΩK\Omega_KΩK​ to ρλ\rho_\lambdaρλ​, preserving the trace of every matrix, and such that both L\mathcal LL and ΓoutLΓin\Gamma_{\rm out}\mathcal L\Gamma_{\rm in}Γout​LΓin​ are completely positive, then d=Kd=Kd=K and λi=1/K\lambda_i=1/Kλi​=1/K for every iii. Here Γ\GammaΓ transposes the second tensor factor, (ΓX)(i,j),(k,l)=X(i,l),(k,j)(\Gamma X)_{(i,j),(k,l)}=X_{(i,l),(k,j)}(ΓX)(i,j),(k,l)​=X(i,l),(k,j)​, and complete positivity requires positivity preservation under every finite identity amplification, including size zero. Strict positivity and probability mean λi>0\lambda_i>0λi​>0 and ∑iλi=1\sum_i\lambda_i=1∑i​λi​=1.

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