Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Binomial-code mean occupation including the single-rail corner

Open
QAlgorithms.Papers.Independent.Intakenext100.P65.binomial_mean

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

prove2quantum

Let N,S≥0N,S\ge0N,S≥0 be integers and set M=N+1M=N+1M=N+1. Define the two full-Fock states

∣μbin⟩=2−M/2∑m=0M(−1)μm(Mm) ∣(S+1)m⟩,μ=0,1.|\mu_{\rm bin}\rangle=2^{-M/2}\sum_{m=0}^M(-1)^{\mu m}\sqrt{\binom{M}{m}}\,|(S+1)m\rangle,\qquad \mu=0,1.∣μbin​⟩=2−M/2m=0∑M​(−1)μm(mM​)​∣(S+1)m⟩,μ=0,1.

They are normalized, mutually orthogonal, and have finite first photon-number moments. For their equally weighted logical mixture,

nˉbin=12∑μ=01⟨μbin∣n^∣μbin⟩=(N+1)(S+1)2.\bar n_{\rm bin}=\frac12\sum_{\mu=0}^1\langle\mu_{\rm bin}|\hat n|\mu_{\rm bin}\rangle=\frac{(N+1)(S+1)}2.nˉbin​=21​μ=0∑1​⟨μbin​∣n^∣μbin​⟩=2(N+1)(S+1)​.

In particular N=S=0N=S=0N=S=0 is allowed and gives mean occupation 1/21/21/2.

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 p.11 (6.2): all nonnegative N,S, including the single-rail corner. -/
theorem binomial_mean (N S : ℕ) :
    (∀ mu : Fin 2, fockDomain (binomialCodeCoordinates N S mu) ∧ fockNormSq (binomialCodeCoordinates N S mu) = 1 ∧
      fockMomentDomain (binomialCodeCoordinates N S mu) 1) ∧
    fockInner (binomialCodeCoordinates N S 0) (binomialCodeCoordinates N S 1) = 0 ∧
    codeMoment (binomialCodeCoordinates N S) 1 = ((N + 1 : ℕ) : ℝ) * (S + 1) / 2 := by sorry

end QAlgorithms.Papers.Independent.Intakenext100.P65

end
Source
Performance and structure of single-mode bosonic codes, arXiv:1708.05010v3, PDF p. 11, §VI (6.2): binomial mean occupation
Read-back

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

For every pair of natural numbers N,SN,SN,S, including zero, define bμ:N→Cb_\mu:\mathbb N\to\mathbb Cbμ​:N→C, for μ∈{0,1}\mu\in\{0,1\}μ∈{0,1}, by

bμ((S+1)m)=(−1)μm(N+1m)2N+1(0≤m≤N+1),b_\mu((S+1)m)=(-1)^{\mu m}\sqrt{\frac{\binom{N+1}{m}}{2^{N+1}}} \quad(0\le m\le N+1),bμ​((S+1)m)=(−1)μm2N+1(mN+1​)​​(0≤m≤N+1),

with zero at all other coordinates. For each μ\muμ, the series ∑n≥0∣bμ(n)∣2\sum_{n\ge0}|b_\mu(n)|^2∑n≥0​∣bμ​(n)∣2 is summable and equals 111, and the series ∑n≥0n∣bμ(n)∣2\sum_{n\ge0}n|b_\mu(n)|^2∑n≥0​n∣bμ​(n)∣2 is summable. Furthermore,

∑n≥0b0(n)‾b1(n)=0,∑n≥0n∣b0(n)∣2+∑n≥0n∣b1(n)∣22=(N+1)(S+1)2.\sum_{n\ge0}\overline{b_0(n)}b_1(n)=0,\qquad \frac{\displaystyle\sum_{n\ge0}n|b_0(n)|^2+ \displaystyle\sum_{n\ge0}n|b_1(n)|^2}{2} =\frac{(N+1)(S+1)}2.n≥0∑​b0​(n)​b1​(n)=0,2n≥0∑​n∣b0​(n)∣2+n≥0∑​n∣b1​(n)∣2​=2(N+1)(S+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