Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Corollary 1 — Operator quantum union bound

Open
GaoQuantumUnion.operator_bound

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

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

For arbitrary finite orthogonal projectors and K=PN−1⋯P0K=P_{N-1}\cdots P_0K=PN−1​⋯P0​,

K†K⪰I−4∑i(I−Pi).K^\dagger K\succeq I-4\sum_i(I-P_i).K†K⪰I−4i∑​(I−Pi​).

The order is Loewner order, encoded by positivity of the difference. There is no state hypothesis or commutativity hypothesis.

Preamble
import Definitions.Def_GaoQuantumUnion_Model
open Matrix WildeQIT GaoQuantumUnion
open scoped MatrixOrder ComplexOrder ComplexConjugate
set_option autoImplicit false
Formal statement
namespace GaoQuantumUnion
theorem operator_bound {ι : Type} [Fintype ι] [DecidableEq ι] {N : ℕ}
    (P : Fin N → Matrix ι ι ℂ) (hP : ∀ i, IsProjector (P i)) :
    ((seqOp P)ᴴ*seqOp P-(1-(4 : ℂ) • ∑ i, (1-P i))).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; Corollary 1, PDF p. 4
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 a finite enumeration and decidable equality, every natural number N≥0N\ge 0N≥0, and every family (Pi)0≤i<N(P_i)_{0\le i<N}(Pi​)0≤i<N​ of complex matrices with rows and columns indexed by ι\iotaι such that Pi∗=PiP_i^*=P_iPi∗​=Pi​ and PiPi=PiP_iP_i=P_iPi​Pi​=Pi​ for every iii, let III denote the identity matrix, let K0=IK_0=IK0​=I, and define Ki+1=PiKiK_{i+1}=P_iK_iKi+1​=Pi​Ki​ for 0≤i<N0\le i<N0≤i<N, so that KN=PN−1⋯P0K_N=P_{N-1}\cdots P_0KN​=PN−1​⋯P0​ when N>0N>0N>0; here A∗A^*A∗ is the conjugate transpose of AAA. Then the matrix M=KN∗KN−(I−4∑i=0N−1(I−Pi))M=K_N^*K_N-\bigl(I-4\sum_{i=0}^{N-1}(I-P_i)\bigr)M=KN∗​KN​−(I−4∑i=0N−1​(I−Pi​)) is positive semidefinite: explicitly, M∗=MM^*=MM∗=M and, for every vector x:ι→Cx:\iota\to\mathbb Cx:ι→C, the scalar ∑a∈ι∑b∈ιxa‾Mabxb\sum_{a\in\iota}\sum_{b\in\iota}\overline{x_a}M_{ab}x_b∑a∈ι​∑b∈ι​xa​​Mab​xb​ is real and nonnegative. The quantifiers include N=0N=0N=0, when the family and sum are empty, K0=IK_0=IK0​=I, and M=0M=0M=0, and include an empty index type ι\iotaι, when all the matrices have no entries and every quadratic-form sum is zero.

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