Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Integer rescaling and dual quotient

Open
QAlgorithms.Papers.Independent.Intakenext100.P08.integerRescaling_lattice

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

prove2quantum

Let N≥1N\ge1N≥1, let SSS be a real symplectic 2N×2N2N\times2N2N×2N matrix, and let λ≥1\lambda\ge1λ≥1 be an integer. Set M=λSM=\sqrt\lambda SM=λ​S and let L(M)L(M)L(M) be the integer span of its rows. Then

MΩMT=λΩ,∣det⁡M∣=λN,∣L(M)⊥/L(M)∣=λ2N,log⁡2(λN)N=log⁡2λ.M\Omega M^T=\lambda\Omega,\quad |\det M|=\lambda^N,\quad |L(M)^\perp/L(M)|=\lambda^{2N},\quad \frac{\log_2(\lambda^N)}{N}=\log_2\lambda.MΩMT=λΩ,∣detM∣=λN,∣L(M)⊥/L(M)∣=λ2N,Nlog2​(λN)​=log2​λ.

In particular the lattice is symplectically integral and its dual quotient is finite. The number λN\lambda^NλN here is the algebraic multiplicity; this result does not construct a normalized physical code space.

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 pp.4–5, (44)–(46), algebraic content only: integral rescaling, determinant,
and actual finite dual quotient. The quotient is not asserted to be a physical code space. -/
theorem integerRescaling_lattice (N : ℕ) (hN : 1 ≤ N) (S : Generator N)
    (hS : IsSymplectic S.transpose) (hdet : S.det ≠ 0) (lambda : ℕ) (hlambda : 1 ≤ lambda) :
    let M : Generator N := Real.sqrt (lambda : ℝ) • S
    SymplecticallyIntegral M ∧
    alternatingGram M = (lambda : ℝ) • sigma N ∧
    |M.det| = (lambda : ℝ) ^ N ∧
    Finite (DualCosets M) ∧ Nat.card (DualCosets M) = lambda ^ (2 * N) ∧
    Real.log ((lambda : ℝ) ^ N) / Real.log 2 / (N : ℝ) =
      Real.log (lambda : ℝ) / Real.log 2 := by sorry

end QAlgorithms.Papers.Independent.Intakenext100.P08
Source
Achievable rates for the Gaussian quantum channel, arXiv:quant-ph/0105058v1, PDF p. 4, §III, (44)–(46): integral rescaling of a self-dual row lattice
Read-back

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

For every natural number N≥1N\ge1N≥1, every real 2N×2N2N\times2N2N×2N matrix SSS satisfying SΩNST=ΩNS\Omega_NS^{\mathsf T}=\Omega_NSΩN​ST=ΩN​ and det⁡S≠0\det S\ne0detS=0, where ΩN=(0IN−IN0)\Omega_N=\begin{pmatrix}0&I_N\\-I_N&0\end{pmatrix}ΩN​=(0−IN​​IN​0​), and every natural number λ≥1\lambda\ge1λ≥1, set M=λ SM=\sqrt{\lambda}\,SM=λ​S. Let LM⊆R2NL_M\subseteq\mathbb R^{2N}LM​⊆R2N be the set of all integer linear combinations of the rows of MMM. For coordinates x=(xq,xp)x=(x_q,x_p)x=(xq​,xp​), define ω(y,x)=∑j=0N−1(yp,jxq,j−yq,jxp,j)\omega(y,x)=\sum_{j=0}^{N-1}(y_{p,j}x_{q,j}-y_{q,j}x_{p,j})ω(y,x)=∑j=0N−1​(yp,j​xq,j​−yq,j​xp,j​), and let LMω={x:ω(y,x)∈Z for every y∈LM}L_M^\omega=\{x:\omega(y,x)\in\mathbb Z\text{ for every }y\in L_M\}LMω​={x:ω(y,x)∈Z for every y∈LM​}. Then every entry of MΩNMTM\Omega_NM^{\mathsf T}MΩN​MT is an integer,

MΩNMT=λΩN,∣det⁡M∣=λN.M\Omega_NM^{\mathsf T}=\lambda\Omega_N,\qquad |\det M|=\lambda^N.MΩN​MT=λΩN​,∣detM∣=λN.

Moreover, the collection of cosets in the additive quotient R2N/LM\mathbb R^{2N}/L_MR2N/LM​ that have a representative in LMωL_M^\omegaLMω​ is finite and has exactly λ2N\lambda^{2N}λ2N elements, and

log⁡(λN)log⁡2 1N=log⁡λlog⁡2.\frac{\log(\lambda^N)}{\log2}\,\frac1N =\frac{\log\lambda}{\log2}.log2log(λN)​N1​=log2logλ​.
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