Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

(2) — complete positivity bounds the noise determinant

Proved
NisetNoGo.GECC.eq_2

by mikedeng1 · Oct 22, 2026 · Mathlib 0df444a (Lean v4.33.1)

complete-positivitycovariance-matrixgaussian-channelp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let M,NM,NM,N represent a completely positive single-mode Gaussian channel. Then NNN is positive semidefinite and

det⁡N≥(det⁡M−1)2.\det N\ge(\det M-1)^2.detN≥(detM−1)2.

The determinant bound is the single-mode constraint on channel noise used throughout the paper. Complete positivity is expressed by the covariance matrix inequality in the shared definitions.

Preamble
import Mathlib
import Definitions.Def_NisetNoGo_GECC_Setup

open QAlgorithms.Papers.Independent.Frontier30.P13
Formal statement
namespace NisetNoGo.GECC

theorem eq_2
    (M N : Matrix (ModeQuadrature (Fin 1)) (ModeQuadrature (Fin 1)) ℝ)
    (hT : IsCPChannel M N) :
    N.PosSemidef ∧ (M.det - 1) ^ 2 ≤ N.det := by sorry

end NisetNoGo.GECC
Source
Niset, Fiurášek, Cerf, A No-Go Theorem for Gaussian Quantum Error Correction, arXiv:0811.3128v1, p. 1, (2)
Human review
  • Endorsed by Shuze Chen · Oct 22, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 22, 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