Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Equation (26) — Sequential decoding effect lower bound

Open
GaoQuantumUnion.decoder_bound

by Mrnaiq · Nov 19, 2026 · Mathlib 0df444a (Lean v4.33.1)

gao-2015quantum-informationquantum-union-boundsequential-measurementstrace-distance

Let P,QiP,Q_iP,Qi​ be orthogonal projectors. At position mmm, first pass PPP, then reject candidates 000 through m−1m-1m−1, then accept QmQ_mQm​. For the resulting effect Λm\Lambda_mΛm​,

Λm⪰P−4P(I−Qm)P−4∑i<mPQiP.\Lambda_m\succeq P-4P(I-Q_m)P-4\sum_{i<m}PQ_iP.Λm​⪰P−4P(I−Qm​)P−4i<m∑​PQi​P.

The rejection order is fixed by the actual chronological experiment, and only the strict prefix i<mi<mi<m enters the sum.

Preamble
import Definitions.Def_GaoQuantumUnion_Decoding
open Matrix WildeQIT GaoQuantumUnion
open scoped MatrixOrder ComplexOrder ComplexConjugate
set_option autoImplicit false
Formal statement
namespace GaoQuantumUnion
theorem decoder_bound {ι : Type} [Fintype ι] [DecidableEq ι] {M : ℕ}
    (P : Matrix ι ι ℂ) (hP : IsProjector P) (Q : Fin M → Matrix ι ι ℂ)
    (hQ : ∀ i, IsProjector (Q i)) (m : Fin M) :
    (decoderEffect P Q m-(P-(4 : ℂ) • (P*(1-Q m)*P)-
      (4 : ℂ) • ∑ i ∈ Finset.univ.filter (fun i : Fin M => i.val < m.val), P*Q i*P)).PosSemidef := by sorry
end GaoQuantumUnion
Source
Jingliang Gao, Quantum union bounds for sequential projective measurements, arXiv:1410.5688v2, Physical Review A 92, 052331 (2015), https://doi.org/10.1103/PhysRevA.92.052331; Equation (26), PDF p. 13, with zero-based candidate indices
Read-back

What the Lean code literally says, in plain math · OpenAI Codex (independent blind read-back agent)

For every finite type ι\iotaι equipped with decidable equality, every natural number MMM, every complex matrix P∈Cι×ιP\in\mathbb C^{\iota\times\iota}P∈Cι×ι satisfying P†=PP^\dagger=PP†=P and PP=PPP=PPP=P, every family of complex matrices Q0,…,QM−1∈Cι×ιQ_0,\ldots,Q_{M-1}\in\mathbb C^{\iota\times\iota}Q0​,…,QM−1​∈Cι×ι satisfying Qi†=QiQ_i^\dagger=Q_iQi†​=Qi​ and QiQi=QiQ_iQ_i=Q_iQi​Qi​=Qi​ for every 0≤i<M0\le i<M0≤i<M, and every index mmm with 0≤m<M0\le m<M0≤m<M, let III be the identity matrix, let R0=IR_0=IR0​=I and Rj+1=(I−Qj)RjR_{j+1}=(I-Q_j)R_jRj+1​=(I−Qj​)Rj​ for 0≤j<m0\le j<m0≤j<m (thus Rm=(I−Qm−1)⋯(I−Q1)(I−Q0)R_m=(I-Q_{m-1})\cdots(I-Q_1)(I-Q_0)Rm​=(I−Qm−1​)⋯(I−Q1​)(I−Q0​) when m>0m>0m>0), and put Km=(QmRm)PK_m=(Q_mR_m)PKm​=(Qm​Rm​)P and Em=Km†KmE_m=K_m^\dagger K_mEm​=Km†​Km​, where †\dagger† denotes conjugate transpose. Then the matrix Em−(P−4((P(I−Qm))P)−4∑0≤i<Mi<m(PQi)P)E_m-\bigl(P-4((P(I-Q_m))P)-4\sum_{\substack{0\le i<M\\ i<m}}(PQ_i)P\bigr)Em​−(P−4((P(I−Qm​))P)−4∑0≤i<Mi<m​​(PQi​)P) is positive semidefinite; both factors 444 here act by scalar multiplication with the complex number 444. The prefix defining RmR_mRm​ contains exactly the indices 0,…,m−10,\ldots,m-10,…,m−1, in the multiplication order displayed, and the sum likewise includes exactly the indices strictly smaller than mmm. In particular, for m=0m=0m=0 the prefix is III, the sum is the zero matrix, and K0=Q0PK_0=Q_0PK0​=Q0​P; for M=0M=0M=0 there is no admissible index mmm, so the assertion has no instances. The finite type ι\iotaι may be empty, in which case the assertion concerns the unique empty matrix; zero projectors are permitted.

Human review
  • Endorsed by Shuze Chen · Nov 20, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Mrnaiq · Nov 20, 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