Equation (26) — Sequential decoding effect lower bound
OpenGaoQuantumUnion.decoder_boundLet be orthogonal projectors. At position , first pass , then reject candidates through , then accept . For the resulting effect ,
The rejection order is fixed by the actual chronological experiment, and only the strict prefix enters the sum.
import Definitions.Def_GaoQuantumUnion_Decoding open Matrix WildeQIT GaoQuantumUnion open scoped MatrixOrder ComplexOrder ComplexConjugate set_option autoImplicit false
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
Read-back
What the Lean code literally says, in plain math · OpenAI Codex (independent blind read-back agent)
For every finite type equipped with decidable equality, every natural number , every complex matrix satisfying and , every family of complex matrices satisfying and for every , and every index with , let be the identity matrix, let and for (thus when ), and put and , where denotes conjugate transpose. Then the matrix is positive semidefinite; both factors here act by scalar multiplication with the complex number . The prefix defining contains exactly the indices , in the multiplication order displayed, and the sum likewise includes exactly the indices strictly smaller than . In particular, for the prefix is , the sum is the zero matrix, and ; for there is no admissible index , so the assertion has no instances. The finite type may be empty, in which case the assertion concerns the unique empty matrix; zero projectors are permitted.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.