Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Section 4.1, Eq. (22) — success probability and largest eigenvalue

Proved
PauliUnclonable531.Pauli.ricochet

by mikedeng1 · Nov 8, 2026 · Mathlib 0df444a (Lean v4.33.1)

cryptographyp2o-batch-stoc27ap2o-gran-per-chapterp2o-plan-paperp2o-v1quantum-information

For every n≥1 and admissible pre-key splitting attack with arbitrary nonzero finite output registers B,C, form the normalized Choi state τ. The local POVM differences Bₖ=Λᴷ_B,0−Λᴷ_B,1 and Cₖ=Λᴷ_C,0−Λᴷ_C,1 form admissible Hermitian-contraction decoder families, τ is a density operator, and

p=1+Tr⁡(Gτ)2≤1+λmax⁡(G)2.p=\frac{1+\operatorname{Tr}(G\tau)}2\le\frac{1+\lambda_{\max}(G)}2.p=21+Tr(Gτ)​≤21+λmax​(G)​.

Here p is the actual fixed-(0,1) Born winning probability and G is computed from those decoder families, rather than chosen arbitrarily. The existential decoder witness only packages the proved validity of the displayed POVM differences. This is the source's game reduction, with its normalization and transpose convention intact.

Differences from the source:

  • encoding: finite-dimensional complex Hilbert-space operators and binary strings → complex matrices indexed by finite computational bases, Fin 2 bits, real Born probabilities, Euclidean spectral norm and PSD-difference order; reason: these are the same finite-dimensional objects and conventions after choosing the source basis
Preamble
import Mathlib
import Definitions.Def_PauliUnclonable531_Pauli_Correlations

open scoped Matrix Matrix.Norms.L2Operator ComplexOrder
set_option autoImplicit false
Formal statement
namespace PauliUnclonable531.Pauli

/-- §4.1, Eqs. (18)–(22), p.18. Validity of the decoding observables and Choi state
is concluded here, never assumed as security-bearing structure fields. -/
theorem ricochet {B C : Type} [Fintype B] [Fintype C] [DecidableEq B] [DecidableEq C]
    [Nonempty B] [Nonempty C] (n : ℕ) (hn : 1 ≤ n) (a : Attack n B C) :
    ∃ d : Decoders n B C,
      (∀ k, d.bob k = bobEffect a k 0 - bobEffect a k 1) ∧
      (∀ k, d.charlie k = charlieEffect a k 0 - charlieEffect a k 1) ∧
      Density (choi a.split) ∧
      win a = (1 + born (gameOperator d) (choi a.split)) / 2 ∧
      win a ≤ (1 + largestEigenvalue (gameOperator d)) / 2 := by sorry

end PauliUnclonable531.Pauli
Source
Prabhanjan Ananth, Seyoon Ragavan, Amit Sahai, STOC 2027 submission #531 (October 2026), §4.1, p.18, Eqs. (18)–(22)
Human review
  • Endorsed by Shuze Chen · Nov 8, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Nov 8, 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