Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Exact cat photon-number imbalance

Open
QAlgorithms.Papers.Independent.Intakenext100.P65.cat_photonImbalance

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

prove2quantum

Let a>0a>0a>0 be real and S≥0S\ge0S≥0 an integer. For the normalized projected-coherent cat states ∣μa⟩|\mu_a\rangle∣μa​⟩, define Nar=⟨a∣Πr∣a⟩N_a^r=\langle a|\Pi_r|a\rangleNar​=⟨a∣Πr​∣a⟩ with residue rrr taken modulo 2(S+1)2(S+1)2(S+1). Their first photon-number moments are finite, and their half-difference is

δnˉ=⟨0a∣n^∣0a⟩−⟨1a∣n^∣1a⟩2=a22(Na−1Na0−NaSNaS+1).\delta\bar n=\frac{\langle0_a|\hat n|0_a\rangle-\langle1_a|\hat n|1_a\rangle}{2}=\frac{a^2}{2}\left(\frac{N_a^{-1}}{N_a^0}-\frac{N_a^S}{N_a^{S+1}}\right).δnˉ=2⟨0a​∣n^∣0a​⟩−⟨1a​∣n^∣1a​⟩​=2a2​(Na0​Na−1​​−NaS+1​NaS​​).

This is an exact identity. Interpreting no loss as the dominant event requires a separate small-γnˉ\gamma\bar nγnˉ regime and is not a hypothesis of this formula.

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 (5.14): exact photon-number imbalance, without a small-loss hypothesis. -/
theorem cat_photonImbalance (a : ℝ) (ha : 0 < a) (S : ℕ) :
    (∀ mu : Fin 2, fockMomentDomain (catCodeCoordinates a S mu) 1) ∧
    (numberMoment (catCodeCoordinates a S 0) 1 - numberMoment (catCodeCoordinates a S 1) 1) / 2 =
      a ^ 2 / 2 * (catNorm a S (-1) / catNorm a S 0 -
        catNorm a S S / catNorm a S (S + 1)) := by sorry

end QAlgorithms.Papers.Independent.Intakenext100.P65

end
Source
Performance and structure of single-mode bosonic codes, arXiv:1708.05010v3, PDF p. 11, §V B (5.14): cat photon-number imbalance
Read-back

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

For every real a>0a>0a>0 and natural number SSS, including S=0S=0S=0, put D=2(S+1)D=2(S+1)D=2(S+1) and define

Cr(a)=∑n≥0n≡r(modD)∣e−a2/2ann!∣2,vμ(n)={e−a2/2ann!C(S+1)μ(a),n≡(S+1)μ(modD),0,otherwise,C_r(a)=\sum_{\substack{n\ge0\\ n\equiv r\pmod D}} \left|\frac{e^{-a^2/2}a^n}{\sqrt{n!}}\right|^2,\qquad v_\mu(n)= \begin{cases} \dfrac{e^{-a^2/2}a^n}{\sqrt{n!}\sqrt{C_{(S+1)\mu}(a)}}, &n\equiv(S+1)\mu\pmod D,\\ 0,&\text{otherwise}, \end{cases}Cr​(a)=n≥0n≡r(modD)​∑​​n!​e−a2/2an​​2,vμ​(n)=⎩⎨⎧​n!​C(S+1)μ​(a)​e−a2/2an​,0,​n≡(S+1)μ(modD),otherwise,​

where μ∈{0,1}\mu\in\{0,1\}μ∈{0,1} and residue labels rrr are integers. For both values of μ\muμ, the series ∑n≥0n∣vμ(n)∣2\sum_{n\ge0}n|v_\mu(n)|^2∑n≥0​n∣vμ​(n)∣2 is summable, and

∑n≥0n∣v0(n)∣2−∑n≥0n∣v1(n)∣22=a22(C−1(a)C0(a)−CS(a)CS+1(a)).\frac{\displaystyle\sum_{n\ge0}n|v_0(n)|^2-\displaystyle\sum_{n\ge0}n|v_1(n)|^2}{2} =\frac{a^2}{2}\left(\frac{C_{-1}(a)}{C_0(a)} -\frac{C_S(a)}{C_{S+1}(a)}\right).2n≥0∑​n∣v0​(n)∣2−n≥0∑​n∣v1​(n)∣2​=2a2​(C0​(a)C−1​(a)​−CS+1​(a)CS​(a)​).
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