Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Fixed-observable uniqueness of the constructed Hardy state

Open
QAlgorithms.Papers.Independent.Intakethird100.P47.hardy_fixed_observable_unique

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

prove2quantum

For each party P∈{A,B}P\in\{A,B\}P∈{A,B}, let αP,βP∈C\alpha_P,\beta_P\in\mathbb CαP​,βP​∈C satisfy ∣αP∣2+∣βP∣2=1|\alpha_P|^2+|\beta_P|^2=1∣αP​∣2+∣βP​∣2=1 and 0<∣αP∣<10<|\alpha_P|<10<∣αP​∣<1. The unprimed measurement basis is ∣0⟩,∣1⟩|0\rangle,|1\rangle∣0⟩,∣1⟩, and the primed basis is ∣0′⟩P=αP∣0⟩+βP∣1⟩|0'\rangle_P=\alpha_P|0\rangle+\beta_P|1\rangle∣0′⟩P​=αP​∣0⟩+βP​∣1⟩, ∣1′⟩P=βP‾∣0⟩−αP‾∣1⟩|1'\rangle_P=\overline{\beta_P}|0\rangle-\overline{\alpha_P}|1\rangle∣1′⟩P​=βP​​∣0⟩−αP​​∣1⟩. Write ∣ψH⟩|\psi_H\rangle∣ψH​⟩ for the last vector obtained by the ordered Gram–Schmidt construction (2)–(4), and pH(a,b∣A,B)p_H(a,b\mid A,B)pH​(a,b∣A,B) for its Born probabilities.

Let S0S_0S0​ be the complex span of ∣1′1′⟩|1'1'\rangle∣1′1′⟩, ∣00′⟩|00'\rangle∣00′⟩, and ∣0′0⟩|0'0\rangle∣0′0⟩. All four constructed Gram–Schmidt vectors have norm one, and the three squared normalization denominators are strictly positive. Moreover,

dim⁡CS0⊥=1,ρH=∣ψH⟩⟨ψH∣ is a density matrix satisfying Hardy’s four conditions,\dim_{\mathbb C}S_0^\perp=1,\qquad \rho_H=|\psi_H\rangle\langle\psi_H|\text{ is a density matrix satisfying Hardy's four conditions},dimC​S0⊥​=1,ρH​=∣ψH​⟩⟨ψH​∣ is a density matrix satisfying Hardy’s four conditions,

and ∣ψH⟩|\psi_H\rangle∣ψH​⟩ cannot be a product of two local vectors. Every positive semidefinite trace-one two-qubit matrix ρ\rhoρ satisfying pρ(00∣00)>0p_\rho(00\mid00)>0pρ​(00∣00)>0, pρ(00∣10)=pρ(00∣01)=pρ(11∣11)=0p_\rho(00\mid10)=p_\rho(00\mid01)=p_\rho(11\mid11)=0pρ​(00∣10)=pρ​(00∣01)=pρ​(11∣11)=0 for these same measurements obeys ρ=ρH\rho=\rho_Hρ=ρH​.

This identifies the state for fixed observables; comparison of density matrices removes the irrelevant global phase.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakethird100_P47
Formal statement
namespace QAlgorithms.Papers.Independent.Intakethird100.P47

open scoped ComplexConjugate

open scoped BigOperators

/-- II A, PDF pp.2–3: for fixed observables (3), the constructed Hardy state spans S-perp,
is a normalized entangled state satisfying (1), and is the unique density satisfying (1).
Density equality removes global phase; this does not identify states with different parameters. -/
theorem hardy_fixed_observable_unique (d : HardyParameters) :
    Module.finrank ℂ ((hardySpan d)ᗮ) = 1 ∧
    (∀ i : Fin 4, IsState (hardyGS d i)) ∧
    (∀ i : Fin 3, 0 < gsDenominatorSq
      ((List.ofFn (hardyGS d)).take (i.val + 1)) (hardyPhi d i.succ)) ∧
    IsDensityMatrix (pureDensity (psiH d)) ∧
    HardyConditions (hardyBehavior d (pureDensity (psiH d))) ∧
    (¬ ∃ u v : EuclideanSpace ℂ Bool, psiH d = tensorVec u v) ∧
    (∀ rho : Matrix (Bool × Bool) (Bool × Bool) ℂ,
      IsDensityMatrix rho → HardyConditions (hardyBehavior d rho) →
        rho = pureDensity (psiH d)) := by sorry

end QAlgorithms.Papers.Independent.Intakethird100.P47
Source
Device-independent quantum key distribution based on measurement inputs, arXiv:1308.6447v3, PDF p. 3, II A: unique constructed state for fixed observables
Read-back

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

For every parameter record ddd consisting of functions α,β:{0,1}→C\alpha,\beta:\{0,1\}\to\mathbb Cα,β:{0,1}→C satisfying ∣αP∣2+∣βP∣2=1|\alpha_P|^2+|\beta_P|^2=1∣αP​∣2+∣βP​∣2=1 and 0<∣αP∣<10<|\alpha_P|<10<∣αP​∣<1 for each P∈{0,1}P\in\{0,1\}P∈{0,1}, the following conjunction holds. Here 000 means false and 111 true; let e0,e1e_0,e_1e0​,e1​ be the standard basis of C2\mathbb C^2C2, put aP=αPe0+βPe1a_P=\alpha_Pe_0+\beta_Pe_1aP​=αP​e0​+βP​e1​ and bP=βP‾e0−αP‾e1b_P=\overline{\beta_P}e_0-\overline{\alpha_P}e_1bP​=βP​​e0​−αP​​e1​, and define

ϕ0=b0⊗b1,ϕ1=e0⊗a1,ϕ2=a0⊗e0,ϕ3=e0⊗e0.\phi_0=b_0\otimes b_1,\quad \phi_1=e_0\otimes a_1,\quad \phi_2=a_0\otimes e_0,\quad \phi_3=e_0\otimes e_0.ϕ0​=b0​⊗b1​,ϕ1​=e0​⊗a1​,ϕ2​=a0​⊗e0​,ϕ3​=e0​⊗e0​.

Tensor products have coordinates (u⊗v)(a,b)=u(a)v(b)(u\otimes v)(a,b)=u(a)v(b)(u⊗v)(a,b)=u(a)v(b). Define v0=ϕ0v_0=\phi_0v0​=ϕ0​ and, for r=1,2,3r=1,2,3r=1,2,3, recursively define

Dr=1−∑s=0r−1∣⟨vs,ϕr⟩∣2,vr=(Dr)−1(ϕr−∑s=0r−1⟨vs,ϕr⟩vs),D_r=1-\sum_{s=0}^{r-1}|\langle v_s,\phi_r\rangle|^2,\qquad v_r=(\sqrt{D_r})^{-1} \left(\phi_r-\sum_{s=0}^{r-1}\langle v_s,\phi_r\rangle v_s\right),Dr​=1−s=0∑r−1​∣⟨vs​,ϕr​⟩∣2,vr​=(Dr​​)−1(ϕr​−s=0∑r−1​⟨vs​,ϕr​⟩vs​),

and set ψ=v3\psi=v_3ψ=v3​. For settings XXX and outcomes aaa, define ℓP,0,a=ea\ell_{P,0,a}=e_aℓP,0,a​=ea​, ℓP,1,0=aP\ell_{P,1,0}=a_PℓP,1,0​=aP​, and ℓP,1,1=bP\ell_{P,1,1}=b_PℓP,1,1​=bP​. For a vector uuu, write Ru(x,y)=u(x)u(y)‾R_u(x,y)=u(x)\overline{u(y)}Ru​(x,y)=u(x)u(y)​, and for any matrix ρ\rhoρ on C{0,1}2\mathbb C^{\{0,1\}^2}C{0,1}2 define pρ(A,B,a,b)=Re⁡tr⁡(Rℓ0,A,a⊗ℓ1,B,bρ)p_\rho(A,B,a,b)=\operatorname{Re}\operatorname{tr}(R_{\ell_{0,A,a}\otimes\ell_{1,B,b}}\rho)pρ​(A,B,a,b)=Retr(Rℓ0,A,a​⊗ℓ1,B,b​​ρ). Then the orthogonal complement of the complex span of ϕ0,ϕ1,ϕ2\phi_0,\phi_1,\phi_2ϕ0​,ϕ1​,ϕ2​ has complex dimension 111; every viv_ivi​, 0≤i<40\le i<40≤i<4, has norm 111; every DrD_rDr​, 1≤r≤31\le r\le31≤r≤3, is strictly positive; RψR_\psiRψ​ is positive semidefinite and has trace 111; its values satisfy

pRψ(0,0,0,0)>0,pRψ(1,0,0,0)=pRψ(0,1,0,0)=pRψ(1,1,1,1)=0;p_{R_\psi}(0,0,0,0)>0,\qquad p_{R_\psi}(1,0,0,0)=p_{R_\psi}(0,1,0,0)=p_{R_\psi}(1,1,1,1)=0;pRψ​​(0,0,0,0)>0,pRψ​​(1,0,0,0)=pRψ​​(0,1,0,0)=pRψ​​(1,1,1,1)=0;

there are no vectors u,v∈C2u,v\in\mathbb C^2u,v∈C2, whether normalized or not, with ψ=u⊗v\psi=u\otimes vψ=u⊗v; and every positive semidefinite matrix ρ\rhoρ of trace 111 satisfying these same four conditions on pρp_\rhopρ​ equals RψR_\psiRψ​.

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