Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Strict integer-scale geometric family

Open
QAlgorithms.Papers.Independent.Intakenext100.P08.strictInteger_geometricFamily

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

prove2quantum

Let ℏ>0\hbar>0ℏ>0, let v>0v>0v>0 be the Gaussian displacement variance per real coordinate, and let λ≥1\lambda\ge1λ≥1 be an integer with λ<ℏ/(ev)\lambda<\hbar/(ev)λ<ℏ/(ev). One can choose a single ε>0\varepsilon>0ε>0 with c=eλ(v+ε)/ℏ<1c=e\lambda(v+\varepsilon)/\hbar<1c=eλ(v+ε)/ℏ<1 and symplectic row matrices SNS_NSN​ for every N≥1N\ge1N≥1. Define

ΛN=L(2πℏ/λ SN),ΔN=(2πℏ/λ)N,aN=2N(v+ε).\Lambda_N=L\left(\sqrt{2\pi\hbar/\lambda}\,S_N\right),\quad \Delta_N=(2\pi\hbar/\lambda)^N,\quad a_N=\sqrt{2N(v+\varepsilon)}.ΛN​=L(2πℏ/λ​SN​),ΔN​=(2πℏ/λ)N,aN​=2N(v+ε)​.

These lattices have covolume ΔN\Delta_NΔN​ and geometric decoding failures pNp_NpN​ satisfying

pN≤Pr⁡{∥ξN∥>aN}+cN,Pr⁡{∥ξN∥>aN}⟶0,pN⟶0.p_N\le\Pr\{\|\xi_N\|>a_N\}+c^N,\qquad\Pr\{\|\xi_N\|>a_N\}\longrightarrow0,\qquad p_N\longrightarrow0.pN​≤Pr{∥ξN​∥>aN​}+cN,Pr{∥ξN​∥>aN​}⟶0,pN​⟶0.

Here ξN\xi_NξN​ has 2N2N2N independent N(0,v)N(0,v)N(0,v) coordinates. The dimensionless lattice L(λSN)L(\sqrt\lambda S_N)L(λ​SN​) has dual quotient of size λ2N\lambda^{2N}λ2N, hence algebraic multiplicity λN\lambda^NλN. No normalized physical encoder or decoder is asserted. At ℏ/(ev)=k≥2\hbar/(ev)=k\ge2ℏ/(ev)=k≥2 an integer, this result permits only λ≤k−1\lambda\le k-1λ≤k−1.

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.6–7, (64)–(68): strict integer-scale geometric family, with one epsilon
chosen before all N. The omitted tail is restored, and tends to zero. There is
no endpoint extension and no assertion about normalized physical quantum codes. -/
theorem strictInteger_geometricFamily (hbar : ℝ) (hhbar : 0 < hbar)
    (v : NNReal) (hv : 0 < v) (lambda : ℕ) (hlambda : 1 ≤ lambda)
    (hstrict : (lambda : ℝ) < hbar / (Real.exp 1 * (v : ℝ))) :
    ∃ epsilon : ℝ, 0 < epsilon ∧
      Real.exp 1 * (lambda : ℝ) * ((v : ℝ) + epsilon) / hbar < 1 ∧
      ∃ S : (N : ℕ) → Generator N,
        (∀ N, 1 ≤ N →
          IsSymplectic (S N).transpose ∧ (S N).det ≠ 0 ∧
          Nat.card (DualCosets (Real.sqrt (lambda : ℝ) • S N)) = lambda ^ (2 * N) ∧
          |(physicalNormalizer hbar lambda (S N)).det| =
            (2 * Real.pi * hbar / (lambda : ℝ)) ^ N ∧
          decodingFailure (physicalNormalizer hbar lambda (S N)) v ≤
            displacementTail N v (Real.sqrt (2 * (N : ℝ) * ((v : ℝ) + epsilon))) +
              (Real.exp 1 * (lambda : ℝ) * ((v : ℝ) + epsilon) / hbar) ^ N) ∧
        Filter.Tendsto (fun N =>
          displacementTail N v (Real.sqrt (2 * (N : ℝ) * ((v : ℝ) + epsilon))))
          Filter.atTop (nhds 0) ∧
        Filter.Tendsto (fun N => decodingFailure (physicalNormalizer hbar lambda (S N)) v)
          Filter.atTop (nhds 0) := by sorry

end QAlgorithms.Papers.Independent.Intakenext100.P08
Source
Achievable rates for the Gaussian quantum channel, arXiv:quant-ph/0105058v1, PDF p. 6, §V, (64)–(68): strict integer-scale geometric asymptotic family
Read-back

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

For every positive real number ℏ\hbarℏ, every strictly positive nonnegative real number vvv, and every natural number λ≥1\lambda\ge1λ≥1 satisfying λ<ℏ/(ev)\lambda<\hbar/(ev)λ<ℏ/(ev), there exists a real number ϵ>0\epsilon>0ϵ>0 such that c=eλ(v+ϵ)/ℏ<1c=e\lambda(v+\epsilon)/\hbar<1c=eλ(v+ϵ)/ℏ<1, and there exists a family of real 2N×2N2N\times2N2N×2N matrices SNS_NSN​, defined for every natural number NNN, with the following properties. Write ΩN=(0IN−IN0)\Omega_N=\begin{pmatrix}0&I_N\\-I_N&0\end{pmatrix}ΩN​=(0−IN​​IN​0​), TN=λ SNT_N=\sqrt{\lambda}\,S_NTN​=λ​SN​, and PN=2πℏ/λ SNP_N=\sqrt{2\pi\hbar/\lambda}\,S_NPN​=2πℏ/λ​SN​. For any such matrix AAA, let LAL_ALA​ be the set of integer linear combinations of its rows, let VA={x:∥x∥≤∥x−y∥ for every y∈LA}V_A=\{x:\|x\|\le\|x-y\|\text{ for every }y\in L_A\}VA​={x:∥x∥≤∥x−y∥ for every y∈LA​}, and let CA\mathcal C_ACA​ be the collection of additive cosets modulo LAL_ALA​ having a representative xxx such that ∑j=0N−1(yp,jxq,j−yq,jxp,j)∈Z\sum_{j=0}^{N-1}(y_{p,j}x_{q,j}-y_{q,j}x_{p,j})\in\mathbb Z∑j=0N−1​(yp,j​xq,j​−yq,j​xp,j​)∈Z for every y∈LAy\in L_Ay∈LA​. Let γN,v\gamma_{N,v}γN,v​ be the law on Euclidean R2N\mathbb R^{2N}R2N of independent mean-zero Gaussian coordinates of variance vvv. For every N≥1N\ge1N≥1,

SNΩNSNT=ΩN,det⁡SN≠0,Nat.card⁡(CTN)=λ2N,∣det⁡PN∣=(2πℏλ)N,S_N\Omega_NS_N^{\mathsf T}=\Omega_N,\qquad \det S_N\ne0,\qquad \operatorname{Nat.card}(\mathcal C_{T_N})=\lambda^{2N},\qquad |\det P_N|=\left(\frac{2\pi\hbar}{\lambda}\right)^N,SN​ΩN​SNT​=ΩN​,detSN​=0,Nat.card(CTN​​)=λ2N,∣detPN​∣=(λ2πℏ​)N,

and

γN,v(R2N∖VPN)≤γN,v ⁣{x:2N(v+ϵ)<∥x∥}+cN.\gamma_{N,v}(\mathbb R^{2N}\setminus V_{P_N}) \le \gamma_{N,v}\!\left\{x:\sqrt{2N(v+\epsilon)}<\|x\|\right\}+c^N.γN,v​(R2N∖VPN​​)≤γN,v​{x:2N(v+ϵ)​<∥x∥}+cN.

Here Nat.card⁡\operatorname{Nat.card}Nat.card is the number of elements for a finite collection and is 000 for an infinite collection. Both

γN,v ⁣{x:2N(v+ϵ)<∥x∥}⟶0andγN,v(R2N∖VPN)⟶0\gamma_{N,v}\!\left\{x:\sqrt{2N(v+\epsilon)}<\|x\|\right\} \longrightarrow0 \quad\text{and}\quad \gamma_{N,v}(\mathbb R^{2N}\setminus V_{P_N})\longrightarrow0γN,v​{x:2N(v+ϵ)​<∥x∥}⟶0andγN,v​(R2N∖VPN​​)⟶0

as N→∞N\to\inftyN→∞ through the natural numbers. The family includes a 0×00\times00×0 matrix S0S_0S0​, but the displayed matrix, cardinality, determinant, and error-bound requirements are imposed only for N≥1N\ge1N≥1.

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