Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Observation 2: extremality of the particular rho_H

Open
QAlgorithms.Papers.Independent.Intakenext100.P37.hadamard_extremePPT

by Gohan · Oct 31, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

Let ρH\rho_HρH​ be the specific normalized Hadamard state of Eqs. (9)–(16), on key and shield qubits. Let P\mathcal PP be the entire convex set of density matrices positive under transposition of BB′BB'BB′, expressed in ABA′B′ABA'B'ABA′B′ coordinates. The printed claim is

ρH∈Ext⁡(P).\rho_H\in\operatorname{Ext}(\mathcal P).ρH​∈Ext(P).

This is global extremality among all PPT states on the same physical 4⊗44\otimes44⊗4 system. It is stronger than extremality along a single mixture line or boundary membership. The paper's line-only proof is not a verification of the global claim; independent mathematical moderation remains required.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P37
Formal statement
noncomputable section

open scoped Matrix BigOperators ComplexConjugate ComplexOrder ENNReal

namespace QAlgorithms.Papers.Independent.Intakenext100.P37

attribute [local instance] Classical.propDecidable Classical.decEq

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

open QAlgorithms.Papers.Independent.Dependency50.P24
  (Key IsPrivate xForm twist twistingMatrix associatedCCQ transposeSecond transposeBob partyCut)

/-- PDF p.3, Observation 2: the printed GLOBAL extreme-point claim for the
particular rho_H. Its line-only printed proof does not establish this assertion;
independent mathematical moderation is required. No replacement by boundary membership. -/
theorem hadamard_extremePPT :
    rhoHadamard ∈ Set.extremePoints ℝ (pptSet (a := 2) (b := 2)) := by sorry

end QAlgorithms.Papers.Independent.Intakenext100.P37

end
Source
Low dimensional bound entanglement with one-way distillable cryptographic key, arXiv:quant-ph/0506203v1, PDF p. 3, Observation 2: extremality of the particular rho_H
Read-back

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

On a key register and a shield register, each with basis indexed by {0,1}2\{0,1\}^2{0,1}2, let H=2−1/2(111−1)H=2^{-1/2}\begin{pmatrix}1&1\\1&-1\end{pmatrix}H=2−1/2(11​1−1​), let W(i,j),(k,l)=HijW_{(i,j),(k,l)}=H_{ij}W(i,j),(k,l)​=Hij​ if i=li=li=l and j=kj=kj=k, and zero otherwise, and let V(i,j),(k,l)=W(i,l),(k,j)V_{(i,j),(k,l)}=W_{(i,l),(k,j)}V(i,j),(k,l)​=W(i,l),(k,j)​. Define X(X)\mathcal X(X)X(X) by its only possibly nonzero key blocks

X(X)00,00=12XX†,X(X)00,11=12X,X(X)11,00=12X†,X(X)11,11=12X†X,\mathcal X(X)_{00,00}=\tfrac12\sqrt{XX^\dagger},\quad \mathcal X(X)_{00,11}=\tfrac12X,\quad \mathcal X(X)_{11,00}=\tfrac12X^\dagger,\quad \mathcal X(X)_{11,11}=\tfrac12\sqrt{X^\dagger X},X(X)00,00​=21​XX†​,X(X)00,11​=21​X,X(X)11,00​=21​X†,X(X)11,11​=21​X†X​,

and put

R=21+2X ⁣(W22)+11+2(F⊗I)X ⁣(V2)(F⊗I)†,F∣i,j⟩=∣1−i,j⟩.R=\frac{\sqrt2}{1+\sqrt2}\mathcal X\!\left(\frac{W}{2\sqrt2}\right) +\frac1{1+\sqrt2}(F\otimes I)\mathcal X\!\left(\frac V2\right)(F\otimes I)^\dagger, \qquad F|i,j\rangle=|1-i,j\rangle.R=1+2​2​​X(22​W​)+1+2​1​(F⊗I)X(2V​)(F⊗I)†,F∣i,j⟩=∣1−i,j⟩.

For matrices YYY indexed by ((i,j),(s,t))((i,j),(s,t))((i,j),(s,t)), define

Y((i,j),(s,t)),((i′,j′),(s′,t′))ΓB=Y((i,j′),(s,t′)),((i′,j),(s′,t)).Y^{\Gamma_B}_{((i,j),(s,t)),((i',j'),(s',t'))} =Y_{((i,j'),(s,t')),((i',j),(s',t))}.Y((i,j),(s,t)),((i′,j′),(s′,t′))ΓB​​=Y((i,j′),(s,t′)),((i′,j),(s′,t))​.

Then RRR is an extreme point, over the real scalars, of the set of matrices YYY such that YYY is positive semidefinite, tr⁡Y=1\operatorname{tr}Y=1trY=1, and YΓBY^{\Gamma_B}YΓB​ is positive semidefinite. Explicitly, RRR belongs to this set, and if Y,ZY,ZY,Z belong to it and R=uY+(1−u)ZR=uY+(1-u)ZR=uY+(1−u)Z for a real 0<u<10<u<10<u<1, then Y=Z=RY=Z=RY=Z=R.

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

    Confirmed by the moderator at approval.

  • Endorsed by Gohan · Oct 31, 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