Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Central square-cell probability and strict Gaussian tail bound

Open
QAlgorithms.Papers.Independent.Intakenext100.P65.gkp_cellIntegral

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

prove2quantum

Let 0<γ<10<\gamma<10<γ<1 and pγ(α)=(1−γ)(πγ)−1e−(1−γ)∣α∣2/γp_\gamma(\alpha)=(1-\gamma)(\pi\gamma)^{-1}e^{-(1-\gamma)|\alpha|^2/\gamma}pγ​(α)=(1−γ)(πγ)−1e−(1−γ)∣α∣2/γ. This density defines a probability measure on the complex plane. Put b=π/8b=\sqrt{\pi/8}b=π/8​ and Q={α:∣ℜα∣,∣ℑα∣≤b}Q=\{\alpha:|\Re\alpha|,|\Im\alpha|\le b\}Q={α:∣ℜα∣,∣ℑα∣≤b}. The central-cell success and failure probabilities obey

Psucc=∫Qpγ(α) d2α,Pfail=1−Psucc<∫∣α∣≥bpγ(α) d2α=e−π(1−γ)/(8γ).P_{\rm succ}=\int_Qp_\gamma(\alpha)\,d^2\alpha,\qquad P_{\rm fail}=1-P_{\rm succ}<\int_{|\alpha|\ge b}p_\gamma(\alpha)\,d^2\alpha=e^{-\pi(1-\gamma)/(8\gamma)}.Psucc​=∫Q​pγ​(α)d2α,Pfail​=1−Psucc​<∫∣α∣≥b​pγ​(α)d2α=e−π(1−γ)/(8γ).

The strict inequality follows from the nonzero area between the inscribed disk and the square. Identity-coset translates can also be corrected, so PfailP_{\rm fail}Pfail​ is an upper bound on logical infidelity, not its exact value.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P65
Formal statement
noncomputable section

namespace QAlgorithms.Papers.Independent.Intakenext100.P65

open MeasureTheory Filter

open QAlgorithms.Papers.Independent.Frontier18.P14 (displacementEntry)

open QAlgorithms.Papers.Independent.Dependency50.P40 (outputFirstChoi)

open scoped ComplexConjugate Matrix Topology

attribute [local instance] Classical.propDecidable

attribute [local instance] Classical.decEq

/-- PDF pp.20--21 (7.23)--(7.24): central-cell integral and strict circular-tail
bound; this failure probability is not identified with the exact logical infidelity. -/
theorem gkp_cellIntegral (g : ℝ) (hg0 : 0 < g) (hg1 : g < 1) :
    (amplifiedLossLaw g Set.univ = 1) ∧
    centralSuccess g =
      (∫ z in {z : ℂ | |z.re| ≤ Real.sqrt (Real.pi / 8) ∧ |z.im| ≤ Real.sqrt (Real.pi / 8)},
        amplifiedLossDensity g z) ∧
    centralFailure g = 1 - centralSuccess g ∧
    centralFailure g <
      (∫ z in {z : ℂ | Real.sqrt (Real.pi / 8) ≤ ‖z‖}, amplifiedLossDensity g z) ∧
    (∫ z in {z : ℂ | Real.sqrt (Real.pi / 8) ≤ ‖z‖}, amplifiedLossDensity g z) =
      Real.exp (-Real.pi * (1 - g) / (8 * g)) := by sorry

end QAlgorithms.Papers.Independent.Intakenext100.P65

end
Source
Performance and structure of single-mode bosonic codes, arXiv:1708.05010v3, PDF p. 20, §VII B (7.23)–(7.24): correctable-cell probability and Gaussian tail
Read-back

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

For every real ggg satisfying 0<g<10<g<10<g<1, put dg(z)=1−gπgexp⁡(−1−gg∣z∣2)d_g(z)=\frac{1-g}{\pi g}\exp(-\frac{1-g}{g}|z|^2)dg​(z)=πg1−g​exp(−g1−g​∣z∣2), let μg\mu_gμg​ be complex-plane volume weighted by this nonnegative density, and let S={z:∣Re⁡z∣≤π/8, ∣Im⁡z∣≤π/8}S=\{z:|\operatorname{Re}z|\le\sqrt{\pi/8},\ |\operatorname{Im}z|\le\sqrt{\pi/8}\}S={z:∣Rez∣≤π/8​, ∣Imz∣≤π/8​}. Write pinp_{\mathrm{in}}pin​ and poutp_{\mathrm{out}}pout​ for the real conversions of μg(S)\mu_g(S)μg​(S) and μg(C∖S)\mu_g(\mathbb C\setminus S)μg​(C∖S), respectively. The theorem asserts all of

μg(C)=1,pin=∫Sdg(z) dz,pout=1−pin,pout<∫{∣z∣≥π/8}dg(z) dz=exp⁡ ⁣(−π(1−g)8g).\mu_g(\mathbb C)=1,\qquad p_{\mathrm{in}}=\int_S d_g(z)\,dz,\qquad p_{\mathrm{out}}=1-p_{\mathrm{in}},\qquad p_{\mathrm{out}}< \int_{\{|z|\ge\sqrt{\pi/8}\}}d_g(z)\,dz =\exp\!\left(-\frac{\pi(1-g)}{8g}\right).μg​(C)=1,pin​=∫S​dg​(z)dz,pout​=1−pin​,pout​<∫{∣z∣≥π/8​}​dg​(z)dz=exp(−8gπ(1−g)​).

Both integrals are with respect to complex-plane volume, and the radial integration region includes its boundary.

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