Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 1(b) — Joint success probability and its equality condition

Open
GaoQuantumUnion.probability

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

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

For a density operator and an ordered sequence of orthogonal projectors,

q≥1−4E,q=1−4E  ⟺  ∀i, εi=0,q\ge1-4E,\qquad q=1-4E\iff\forall i,\ \varepsilon_i=0,q≥1−4E,q=1−4E⟺∀i, εi​=0,

where εi=Tr⁡((I−Pi)ρ)\varepsilon_i=\operatorname{Tr}((I-P_i)\rho)εi​=Tr((I−Pi​)ρ) and EEE is their sum. This is unconditional in qqq: a zero-probability branch remains an instance. The equality clause belongs to the probability estimate.

Preamble
import Definitions.Def_GaoQuantumUnion_Model
open Matrix WildeQIT GaoQuantumUnion
open scoped MatrixOrder ComplexOrder ComplexConjugate
set_option autoImplicit false
Formal statement
namespace GaoQuantumUnion
theorem probability {ι : Type} [Fintype ι] [DecidableEq ι] {N : ℕ}
    (ρ : Matrix ι ι ℂ) (hρ : IsDensityOperator ρ)
    (P : Fin N → Matrix ι ι ℂ) (hP : ∀ i, IsProjector (P i)) :
    1-4*failureSum P ρ ≤ successProb P ρ ∧
    (successProb P ρ=1-4*failureSum P ρ ↔ ∀ i, failureTerm (P i) ρ=0) := 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; Theorem 1(1-b), PDF pp. 3–4; proof on pp. 8–10
Read-back

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

For every finite index type ι\iotaι equipped with a finite-type structure and decidable equality, every natural number N≥0N\ge 0N≥0, every complex matrix ρ\rhoρ with rows and columns indexed by ι\iotaι such that ρ\rhoρ is positive semidefinite and tr⁡(ρ)=1\operatorname{tr}(\rho)=1tr(ρ)=1 as a complex number, and every family (Pi)i∈{0,…,N−1}(P_i)_{i\in\{0,\ldots,N-1\}}(Pi​)i∈{0,…,N−1}​ of complex matrices on the same index type such that each PiP_iPi​ is Hermitian and satisfies Pi2=PiP_i^2=P_iPi2​=Pi​, let III be the identity matrix, let K=PN−1⋯P1P0K=P_{N-1}\cdots P_1P_0K=PN−1​⋯P1​P0​ when N>0N>0N>0 and K=IK=IK=I when N=0N=0N=0, and set fi=Re⁡tr⁡((I−Pi)ρ)f_i=\operatorname{Re}\operatorname{tr}((I-P_i)\rho)fi​=Retr((I−Pi​)ρ), F=∑i=0N−1fiF=\sum_{i=0}^{N-1}f_iF=∑i=0N−1​fi​, and s=Re⁡tr⁡(KρK∗)s=\operatorname{Re}\operatorname{tr}(K\rho K^*)s=Retr(KρK∗), where K∗K^*K∗ is the conjugate transpose. Then 1−4F≤s1-4F\le s1−4F≤s, and s=1−4Fs=1-4Fs=1−4F if and only if fi=0f_i=0fi​=0 for every i∈{0,…,N−1}i\in\{0,\ldots,N-1\}i∈{0,…,N−1}. The case N=0N=0N=0 is included: the sum is zero, the condition on every fif_ifi​ is vacuous, and s=1s=1s=1, so the assertions are 1≤11\le11≤1 and an equivalence between true statements. The index type ι\iotaι may be empty, but in that case every matrix has trace zero, so no ρ\rhoρ satisfies the trace-one hypothesis.

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