Remark 1 — Success bound for a subnormalized positive input
OpenGaoQuantumUnion.subnormalizedFor a positive operator with and a sequence of orthogonal projectors,
The zero operator and empty sequence are included. No division by the input trace or the branch probability appears.
import Definitions.Def_GaoQuantumUnion_Model open Matrix WildeQIT GaoQuantumUnion open scoped MatrixOrder ComplexOrder ComplexConjugate set_option autoImplicit false
namespace GaoQuantumUnion
theorem subnormalized {ι : Type} [Fintype ι] [DecidableEq ι] {N : ℕ}
(ρ : Matrix ι ι ℂ) (hρ : ρ.PosSemidef) (htr : ρ.trace.re ≤ 1)
(P : Fin N → Matrix ι ι ℂ) (hP : ∀ i, IsProjector (P i)) :
ρ.trace.re-4*failureSum P ρ ≤ successProb P ρ := by sorry
end GaoQuantumUnion
Read-back
What the Lean code literally says, in plain math · OpenAI Codex (independent blind read-back agent)
For every finite type equipped with a finite enumeration and decidable equality, every natural number , every complex matrix that is positive semidefinite and satisfies , and every family of complex matrices in such that and for each , let , with the product defined by starting with the identity matrix and successively multiplying on the left by ; then , where is conjugate transpose, is the identity matrix, and the trace is the sum of diagonal entries. The quantifiers include , in which case , the sum is zero, the projector conditions are vacuous, and the inequality becomes equality; they also include the empty type , in which case all traces are zero, and the zero matrix .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.