Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Unique quantum behavior at maximal Hardy success

Open
QAlgorithms.Papers.Independent.Intakethird100.P47.hardy_maximal_distribution_unique

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

prove2quantum

Consider binary settings A,BA,BA,B and outcomes a,ba,ba,b. A finite quantum realization consists of arbitrary finite local dimensions dA,dBd_A,d_BdA​,dB​, one positive semidefinite density matrix ρ\rhoρ of trace one on CdA⊗CdB\mathbb C^{d_A}\otimes\mathbb C^{d_B}CdA​⊗CdB​, and binary POVMs {MA,a}a\{M_{A,a}\}_a{MA,a​}a​, {NB,b}b\{N_{B,b}\}_b{NB,b​}b​ for each local input. Its entire behavior is p(a,b∣A,B)=Re⁡Tr⁡[(MA,a⊗NB,b)ρ]p(a,b\mid A,B)=\operatorname{Re}\operatorname{Tr}[(M_{A,a}\otimes N_{B,b})\rho]p(a,b∣A,B)=ReTr[(MA,a​⊗NB,b​)ρ]. There exists exactly one such behavior satisfying p(00∣00)>0p(00\mid00)>0p(00∣00)>0, p(00∣10)=p(00∣01)=p(11∣11)=0p(00\mid10)=p(00\mid01)=p(11\mid11)=0p(00∣10)=p(00∣01)=p(11∣11)=0, and p(00∣00)=(55−11)/2p(00\mid00)=(5\sqrt5-11)/2p(00∣00)=(55​−11)/2. Uniqueness is equality of all sixteen conditional probabilities across all finite realizations.

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

open scoped ComplexConjugate

open scoped BigOperators

/-- II B, PDF p.3, citing [22]: the ideal Hardy constraints at maximal success
specify a unique full quantum probability distribution. Realizations range over all finite
local dimensions, density matrices and binary POVMs, as in IV A; existence is part of the
conclusion. The claim is about the distribution and does not assert a local-isometry or
sequential-security conclusion. -/
theorem hardy_maximal_distribution_unique :
    ∃! p : Behavior, HasFiniteQuantumRealization p ∧ HardyConditions p ∧
      p false false false false = (5 * Real.sqrt 5 - 11) / 2 := 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 B: maximal-Hardy uniqueness [22]
Read-back

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

There exists exactly one real-valued function p(A,B,a,b)p(A,B,a,b)p(A,B,a,b) of four Boolean arguments, with false represented by 000 and true by 111, satisfying all the following requirements: there exist natural numbers dA,dBd_A,d_BdA​,dB​, a positive semidefinite complex matrix ρ\rhoρ on their product index set with trace 111, and positive semidefinite complex matrices MA,aM_{A,a}MA,a​ and NB,bN_{B,b}NB,b​ of sizes dA×dAd_A\times d_AdA​×dA​ and dB×dBd_B\times d_BdB​×dB​, such that ∑aMA,a=IdA\sum_a M_{A,a}=I_{d_A}∑a​MA,a​=IdA​​ for each AAA, ∑bNB,b=IdB\sum_b N_{B,b}=I_{d_B}∑b​NB,b​=IdB​​ for each BBB, and p(A,B,a,b)=Re⁡tr⁡((MA,a⊗NB,b)ρ)p(A,B,a,b)=\operatorname{Re}\operatorname{tr}((M_{A,a}\otimes N_{B,b})\rho)p(A,B,a,b)=Retr((MA,a​⊗NB,b​)ρ) for every A,B,a,bA,B,a,bA,B,a,b; moreover,

p(0,0,0,0)>0,p(1,0,0,0)=0,p(0,1,0,0)=0,p(1,1,1,1)=0,p(0,0,0,0)=55−112.p(0,0,0,0)>0,\qquad p(1,0,0,0)=0,\qquad p(0,1,0,0)=0,\qquad p(1,1,1,1)=0,\qquad p(0,0,0,0)=\frac{5\sqrt5-11}{2}.p(0,0,0,0)>0,p(1,0,0,0)=0,p(0,1,0,0)=0,p(1,1,1,1)=0,p(0,0,0,0)=255​−11​.

Zero dimensions are included in the existential quantifiers but cannot satisfy the trace-one requirement. Uniqueness concerns the entire function ppp: any two functions satisfying these requirements agree at every quadruple of Boolean arguments.

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