Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Symplectic-dual row generator

Open
QAlgorithms.Papers.Independent.Intakenext100.P08.symplecticDual_generator

by Gohan · Oct 31, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

Let N≥1N\ge1N≥1, let MMM be a nonsingular real 2N×2N2N\times2N2N×2N row-generator matrix, and set Ω=(0I−I0)\Omega=\begin{pmatrix}0&I\\-I&0\end{pmatrix}Ω=(0−I​I0​) and A=MΩMTA=M\Omega M^TA=MΩMT. Assume AAA has integer entries. Write L(M)L(M)L(M) for the integer span of the rows and L(M)⊥L(M)^\perpL(M)⊥ for all vectors pairing integrally with every lattice vector. The computed generator M⊥=A−1MM^\perp=A^{-1}MM⊥=A−1M satisfies

L(M⊥)=L(M)⊥,M⊥ΩMT=I,M⊥Ω(M⊥)T=(A−1)T.L(M^\perp)=L(M)^\perp,\qquad M^\perp\Omega M^T=I,\qquad M^\perp\Omega(M^\perp)^T=(A^{-1})^T.L(M⊥)=L(M)⊥,M⊥ΩMT=I,M⊥Ω(M⊥)T=(A−1)T.

These are algebraic lattice identities, independent of ideal oscillator states. Formalization Note Both nonsingular determinants are explicit; nonsingularity of AAA also follows from that of MMM.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P08
Formal statement
namespace QAlgorithms.Papers.Independent.Intakenext100.P08

open MeasureTheory ProbabilityTheory Matrix

open scoped BigOperators ENNReal

-- Accepted grouped index and source-sign matrix; no paper-local copies.

open QAlgorithms.Papers.Independent.Dependency50.P10 (Phase sigma)
-- The accepted predicate uses column bases and -sigma: apply it to S.transpose.

open QAlgorithms.Papers.Independent.Frontier30.P02 (IsSymplectic)
-- The accepted pairing has the opposite sign: exchange its two arguments below.

open QAlgorithms.Papers.Independent.Frontier30.P10 (symplecticPair)

/-- PDF p.4, (31)–(33): computed symplectic-dual generator and both pairing identities.
All matrix inverses are protected by determinant hypotheses; no ideal quantum states occur. -/
theorem symplecticDual_generator (N : ℕ) (hN : 1 ≤ N) (M : Generator N)
    (hM : M.det ≠ 0) (hA : (alternatingGram M).det ≠ 0)
    (hIntegral : SymplecticallyIntegral M) :
    (rowLattice (dualGenerator M) : Set (EuclideanSpace ℝ (Phase N))) = symplecticDual M ∧
    dualGenerator M * sigma N * M.transpose = 1 ∧
    alternatingGram (dualGenerator M) = ((alternatingGram M)⁻¹).transpose := by sorry

end QAlgorithms.Papers.Independent.Intakenext100.P08
Source
Achievable rates for the Gaussian quantum channel, arXiv:quant-ph/0105058v1, PDF p. 4, §III, (31)–(33): symplectic-dual generator
Read-back

What the Lean code literally says, in plain math · gpt-6.1-sol

For every natural number NNN with 1≤N1\leq N1≤N, let MMM be a real 2N×2N2N\times2N2N×2N matrix, with coordinates indexed by two copies of {0,…,N−1}\{0,\ldots,N-1\}{0,…,N−1}, and put

Σ=(0IN−IN0),A=MΣMT.\Sigma=\begin{pmatrix}0&I_N\\-I_N&0\end{pmatrix}, \qquad A=M\Sigma M^{\mathsf T}.Σ=(0−IN​​IN​0​),A=MΣMT.

Assume det⁡M≠0\det M\neq0detM=0, det⁡A≠0\det A\neq0detA=0, and that every entry of AAA is an integer viewed as a real number. For any such matrix RRR, let L(R)⊆R2NL(R)\subseteq\mathbb R^{2N}L(R)⊆R2N be the set of all integer linear combinations of its rows, including the zero combination, and set D=A−1MD=A^{-1}MD=A−1M. Then all three assertions hold:

L(D)={x∈R2N:for every y∈L(M), ∑j=0N−1(yR,jxL,j−yL,jxR,j)∈Z},DΣMT=I2N,DΣDT=(A−1)T.L(D)= \left\{ x\in\mathbb R^{2N}: \text{for every }y\in L(M),\ \sum_{j=0}^{N-1}\bigl(y_{R,j}x_{L,j}-y_{L,j}x_{R,j}\bigr) \in\mathbb Z \right\}, \qquad D\Sigma M^{\mathsf T}=I_{2N}, \qquad D\Sigma D^{\mathsf T}=(A^{-1})^{\mathsf T}.L(D)={x∈R2N:for every y∈L(M), j=0∑N−1​(yR,j​xL,j​−yL,j​xR,j​)∈Z},DΣMT=I2N​,DΣDT=(A−1)T.

Here L,jL,jL,j and R,jR,jR,j denote the coordinates in the first and second copies of the index set, respectively.

Human review
  • Endorsed by Shuze Chen · Oct 31, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Gohan · Oct 31, 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