Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Ideal CW beam: common-phase coherent copies

Open
QAlgorithms.Papers.Independent.Intakenext100.P33.idealCW_beam

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

prove2quantum

Consider the noiseless, one-sided continuous-wave laser in the ideal vacuum-input, linear, frequency-independent input-output model of Section II. The high-finesse, near-resonance and long-time conditions specify the regime of that ideal model; no physical approximation-error estimate is claimed. Let the decay rate be κ≥0\kappa\ge0κ≥0, packet duration T>0T>0T>0, and phase-zero intracavity amplitude α≥0\alpha\ge0α≥0. Put a=κTαa=\sqrt{\kappa T}\alphaa=κT​α. Rectangular packets have centers τ+nT\tau+nTτ+nT and normalized envelopes T−1/2T^{-1/2}T−1/2 on ∣t−τ−nT∣<T/2|t-\tau-nT|<T/2∣t−τ−nT∣<T/2, where τ=z0/c\tau=z_0/cτ=z0​/c is arbitrary. The output is constructed by projecting β(t)=καeiϕ\beta(t)=\sqrt\kappa\alpha e^{i\phi}β(t)=κ​αeiϕ onto those packets and averaging the stationary intracavity Poisson ensemble's common phase.

For every finite number NNN of packets its density is

ρN(a)=∫02π(∣aeiθ⟩⟨aeiθ∣)⊗Ndθ2π.\rho_N(a)=\int_0^{2\pi}\left(|ae^{i\theta}\rangle\langle ae^{i\theta}|\right)^{\otimes N}\frac{d\theta}{2\pi}.ρN​(a)=∫02π​(∣aeiθ⟩⟨aeiθ∣)⊗N2πdθ​.

This is a positive trace-class operator of trace one, and the integral exists in trace norm. Every constructed coherent product has its displayed full-Fock coefficients and norm one. The family is invariant under packet permutations and satisfies tr⁡N+1ρN+1(a)=ρN(a)\operatorname{tr}_{N+1}\rho_{N+1}(a)=\rho_N(a)trN+1​ρN+1​(a)=ρN​(a), with the partial trace represented by convergent occupation sums. If a>0a>0a>0 and N≥2N\ge2N≥2, then ρN(a)≠ρPois(a2)⊗N\rho_N(a)\ne\rho_{\rm Pois}(a^2)^{\otimes N}ρN​(a)=ρPois​(a2)⊗N. The independent product also has its actual bounded tensor-matrix realization.

This compatible finite-window family describes an infinite CW beam without asserting a finite-energy global Fock vector. At N=0N=0N=0 the density is the scalar unit; at a=0a=0a=0 every packet is vacuum.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P33
Formal statement
noncomputable section

namespace QAlgorithms.Papers.Independent.Intakenext100.P33

open Filter MeasureTheory

open scoped Topology Matrix ComplexConjugate

attribute [local instance] Classical.propDecidable

open QAlgorithms.Papers.Independent.Dependency50.P39

-- Accepted scalar phase; positive exponential, differing only by commuting scalars.

open QAlgorithms.Papers.Independent.Information100.P75 (phase)

/-- arXiv:quant-ph/0111157v1, PDF pp.2–4, Eq.(13), restated p.8.
The stationary noiseless, vacuum-input CW model is constructed by idealBeam;
its computed packet projections give a=sqrt(kappa*T)*alpha. The conclusion
includes compatibility, permutation symmetry, and the explicit nonproduct claim.
No finite-energy global state of an infinite CW beam is claimed. -/
theorem idealCW_beam (kappa T tau alpha : ℝ) (hk : 0 ≤ kappa)
    (hT : 0 < T) (ha : 0 ≤ alpha) :
    let a := Real.sqrt (kappa * T) * alpha
    (∀ N, idealBeam kappa T tau alpha N = commonPhase a N ∧
      IsPacketDensity (commonPhase a N) ∧
      TraceIntegral phaseLaw
        (fun theta => packetProjector (fun _ : Fin N => (a : ℂ) * phase theta))
        (commonPhase a N)) ∧
    (∀ (N : ℕ) (z : Fin N → ℂ), Memℓp (packetCoefficients z) 2 ∧
      (∀ m, packetCoherent z m = packetCoefficients z m) ∧ ‖packetCoherent z‖ = 1) ∧
    (∀ N, discardLastPacket (commonPhase a (N + 1)) = commonPhase a N ∧
      (∀ m n, Summable (fun k : ℕ =>
        commonPhase a (N + 1) (packetBasis (Fin.snoc n k)) (Fin.snoc m k))) ∧
      HasPacketMatrix (discardLastPacket (commonPhase a (N + 1))) (fun m n => ∑' k : ℕ,
        commonPhase a (N + 1) (packetBasis (Fin.snoc n k)) (Fin.snoc m k))) ∧
    (∀ N (s : Equiv.Perm (Fin N)), permutePackets s (commonPhase a N) = commonPhase a N ∧
      HasPacketMatrix (permutePackets s (commonPhase a N))
        (fun m n => commonPhase a N (packetBasis (n ∘ s)) (m ∘ s))) ∧
    (∀ N, 2 ≤ N → 0 < a →
      commonPhase a N ≠ fullFockTensorPower (poissonDensity (a ^ 2)) N) ∧
    (∀ N, HasPacketMatrix (fullFockTensorPower (poissonDensity (a ^ 2)) N)
      (fun m n => ∏ i, poissonDensity (a ^ 2) (fockKet (n i)) (m i))) := by sorry

end QAlgorithms.Papers.Independent.Intakenext100.P33

end
Source
The Quantum State of a Propagating Laser Field, arXiv:quant-ph/0111157v1, PDF p. 8, IV; Eq.(13), PDF p.3
Read-back

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

For all real κ,T,τ,α\kappa,T,\tau,\alphaκ,T,τ,α satisfying κ≥0\kappa\ge0κ≥0, T>0T>0T>0, and α≥0\alpha\ge0α≥0, set a=κT αa=\sqrt{\kappa T}\,\alphaa=κT​α. Let λ=(2π)−1Leb∣[0,2π)\lambda=(2\pi)^{-1}\mathrm{Leb}|_{[0,2\pi)}λ=(2π)−1Leb∣[0,2π)​, let HN=ℓ2(N{0,…,N−1};C)\mathcal H_N=\ell^2(\mathbb N^{\{0,\ldots,N-1\}};\mathbb C)HN​=ℓ2(N{0,…,N−1};C), and let eme_mem​ denote its standard basis. For z∈CNz\in\mathbb C^Nz∈CN, define

cz(m)=∏i=0N−1e−∣zi∣2/2zimimi!,c_z(m)=\prod_{i=0}^{N-1} e^{-|z_i|^2/2}\frac{z_i^{m_i}}{\sqrt{m_i!}},cz​(m)=i=0∏N−1​e−∣zi​∣2/2mi​!​zimi​​​,

let CN(z)C_N(z)CN​(z) be the vector with these coefficients when they are square summable and zero otherwise, and put PN(z)=∣CN(z)⟩⟨CN(z)∣P_N(z)=|C_N(z)\rangle\langle C_N(z)|PN​(z)=∣CN​(z)⟩⟨CN​(z)∣, where ∣u⟩⟨v∣x=⟨v,x⟩u|u\rangle\langle v|x=\langle v,x\rangle u∣u⟩⟨v∣x=⟨v,x⟩u. Define

fn(t)={T−1/2,∣t−τ−nT∣<T/2,0,otherwise,bn(ϕ)=∫τ+nT−T/2τ+nT+T/2fn(t)‾ κ αeiϕ dt,f_n(t)= \begin{cases} T^{-1/2},&|t-\tau-nT|<T/2,\\ 0,&\text{otherwise}, \end{cases} \qquad b_n(\phi)=\int_{\tau+nT-T/2}^{\tau+nT+T/2} \overline{f_n(t)}\,\sqrt\kappa\,\alpha e^{i\phi}\,dt,fn​(t)={T−1/2,0,​∣t−τ−nT∣<T/2,otherwise,​bn​(ϕ)=∫τ+nT−T/2τ+nT+T/2​fn​(t)​κ​αeiϕdt,

where the integral is over the open interval, and define the bounded-operator-valued integrals

IN=∫PN((bi(ϕ))i<N) dλ(ϕ),RN=∫PN((aeiθ)i<N) dλ(θ).I_N=\int P_N((b_i(\phi))_{i<N})\,d\lambda(\phi), \qquad R_N=\int P_N((ae^{i\theta})_{i<N})\,d\lambda(\theta).IN​=∫PN​((bi​(ϕ))i<N​)dλ(ϕ),RN​=∫PN​((aeiθ)i<N​)dλ(θ).

For any coefficient matrix K(m,n)K(m,n)K(m,n), let ON(K)\mathcal O_N(K)ON​(K) mean a selected bounded operator with (ON(K)en)m=K(m,n)(\mathcal O_N(K)e_n)_m=K(m,n)(ON​(K)en​)m​=K(m,n) if one exists, and zero otherwise. Define

DN(X)=ON ⁣((m,n)↦∑k∈N(Xe(n,k))(m,k)),Πs(X)=ON ⁣((m,n)↦(Xen∘s)m∘s),TN(X)=ON ⁣((m,n)↦∏i<N(Xeni)mi),\begin{aligned} D_N(X)&=\mathcal O_N\!\left((m,n)\mapsto \sum_{k\in\mathbb N}(Xe_{(n,k)})_{(m,k)}\right),\\ \Pi_s(X)&=\mathcal O_N\!\left((m,n)\mapsto (Xe_{n\circ s})_{m\circ s}\right),\\ T_N(X)&=\mathcal O_N\!\left((m,n)\mapsto \prod_{i<N}(Xe_{n_i})_{m_i}\right), \end{aligned}DN​(X)Πs​(X)TN​(X)​=ON​((m,n)↦k∈N∑​(Xe(n,k)​)(m,k)​),=ON​((m,n)↦(Xen∘s​)m∘s​),=ON​((m,n)↦i<N∏​(Xeni​​)mi​​),​

where DND_NDN​ takes an operator on HN+1\mathcal H_{N+1}HN+1​, sss permutes the NNN coordinates, and TNT_NTN​ takes a bounded operator on ℓ2(N;C)\ell^2(\mathbb N;\mathbb C)ℓ2(N;C). An operator is nuclear here if it has an operator-norm-convergent expansion ∑r∣ur⟩⟨vr∣\sum_r|u_r\rangle\langle v_r|∑r​∣ur​⟩⟨vr​∣ with ∑r∥ur∥∥vr∥<∞\sum_r\|u_r\|\|v_r\|<\infty∑r​∥ur​∥∥vr​∥<∞; let ν\nuν be the real infimum of these sums, with value zero for an empty collection of expansions. A packet density means a nuclear, self-adjoint operator XXX with Re⁡⟨v,Xv⟩≥0\operatorname{Re}\langle v,Xv\rangle\ge0Re⟨v,Xv⟩≥0 for all vvv, summable complex diagonal, and diagonal sum one. In this notation, for every NNN, IN=RNI_N=R_NIN​=RN​, RNR_NRN​ is a packet density, and the function FN(θ)=PN((aeiθ)i<N)F_N(\theta)=P_N((ae^{i\theta})_{i<N})FN​(θ)=PN​((aeiθ)i<N​) is Bochner integrable with integral RNR_NRN​, is nuclear almost everywhere, and admits finite-range Bochner-integrable approximants sjs_jsj​ such that sjs_jsj​ and FN−sjF_N-s_jFN​−sj​ are nuclear almost everywhere, ν(FN−sj)\nu(F_N-s_j)ν(FN​−sj​) is integrable, and ∫ν(FN−sj) dλ→0\int\nu(F_N-s_j)\,d\lambda\to0∫ν(FN​−sj​)dλ→0. For every NNN and z∈CNz\in\mathbb C^Nz∈CN, czc_zcz​ is square summable, CN(z)m=cz(m)C_N(z)_m=c_z(m)CN​(z)m​=cz​(m) for every mmm, and ∥CN(z)∥=1\|C_N(z)\|=1∥CN​(z)∥=1. For every NNN, DN(RN+1)=RND_N(R_{N+1})=R_NDN​(RN+1​)=RN​; each defining series over kkk for this discard operation is summable; and its selected operator has exactly that matrix. For every NNN and every coordinate permutation sss, Πs(RN)=RN\Pi_s(R_N)=R_NΠs​(RN​)=RN​, and its selected operator has exactly the matrix displayed above. If N≥2N\ge2N≥2 and a>0a>0a>0, then RN≠TN(Qa2)R_N\ne T_N(Q_{a^2})RN​=TN​(Qa2​), where Qa2Q_{a^2}Qa2​ is the selected bounded operator with diagonal e−a2(a2)n/n!e^{-a^2}(a^2)^n/n!e−a2(a2)n/n! and zero off-diagonal entries, or zero if no such operator exists. For every NNN, TN(Qa2)T_N(Q_{a^2})TN​(Qa2​) has precisely the matrix ∏i<N(Qa2eni)mi\prod_{i<N}(Q_{a^2}e_{n_i})_{m_i}∏i<N​(Qa2​eni​​)mi​​. These assertions include N=0N=0N=0, when the occupation-label set is a singleton and every product over modes is the empty product one; κ=0\kappa=0κ=0 and α=0\alpha=0α=0 are also allowed, while the stated inequality of operators requires a>0a>0a>0.

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