Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Passive spatial splitting reduces amplitudes and prevents fixed-amplitude extension

Open
QAlgorithms.Papers.Independent.Intakenext100.P33.spatialSplitting_nonextendible

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

prove2quantum

Let BBB be a unitary two-port optical splitter. For any coherent input amplitude z∈Cz\in\mathbb Cz∈C and vacuum at the unused input,

UB(∣z⟩⊗∣0⟩)=∣B00z⟩⊗∣B10z⟩.U_B\bigl(|z\rangle\otimes|0\rangle\bigr)=|B_{00}z\rangle\otimes|B_{10}z\rangle.UB​(∣z⟩⊗∣0⟩)=∣B00​z⟩⊗∣B10​z⟩.

For every N≥1N\ge1N≥1, construct the lossless equal NNN-port splitter as the Fourier unitary with first column 1/N1/\sqrt N1/N​. Its action on an mmm-photon first-port input is the normalized occupation expansion of (∑jaj†/N)m/m!(\sum_j a_j^\dagger/\sqrt N)^m/\sqrt{m!}(∑j​aj†​/N​)m/m!​, with its full-Fock coefficient realization. The coherent number expansion is summable and its image is ∣z/N⟩⊗N|z/\sqrt N\rangle^{\otimes N}∣z/N​⟩⊗N. Thus a uniformly phase-averaged fixed input amplitude α≥0\alpha\ge0α≥0 produces a normalized spatial density

σN(α)=ρN(α/N).\sigma_N(\alpha)=\rho_N(\alpha/\sqrt N).σN​(α)=ρN​(α/N​).

For α>0\alpha>0α>0,

tr⁡N+1σN+1(α)≠σN(α).\operatorname{tr}_{N+1}\sigma_{N+1}(\alpha)\ne\sigma_N(\alpha).trN+1​σN+1​(α)=σN​(α).

Port phases are fixed by the chosen first column. Increasing the number of equally illuminated spatial modes changes the amplitudes of the original modes. This distinguishes fixed-total-energy spatial splitting from the compatible temporal family; no no-cloning conclusion is asserted.

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 p.5, Eq.(25) and §IIE.
A unitary two-port splitter gives coherent outputs, and a constructed passive
equal N-port splitter gives the fixed-total-energy spatial family. With a
nonzero input its N+1 extension changes the original N modes. N=0 is excluded;
this is energy sharing rather than a claim of cloning. -/
theorem spatialSplitting_nonextendible :
    (∀ (B : Matrix (Fin 2) (Fin 2) ℂ), B ∈ Matrix.unitaryGroup (Fin 2) ℂ →
      ∀ z : ℂ,
        QAlgorithms.Papers.Independent.Frontier18.P14.passiveApply B
          (QAlgorithms.Papers.Independent.Frontier18.P14.coherentPair z 0) =
        QAlgorithms.Papers.Independent.Frontier18.P14.coherentPair (B 0 0 * z) (B 1 0 * z)) ∧
    (∀ N : ℕ, 1 ≤ N →
      equalSplitter N ∈ Matrix.unitaryGroup (Fin N) ℂ ∧
      (∀ m, Memℓp (splitNumberCoefficients N m) 2 ∧
        (∀ q, splitNumber N m q = splitNumberCoefficients N m q) ∧ ‖splitNumber N m‖ = 1) ∧
      (∀ z : ℂ, Summable (fun m : ℕ => coherentCoefficient z m • splitNumber N m) ∧
        splitCoherent N z = packetCoherent (fun _ : Fin N => z / (Real.sqrt (N : ℝ) : ℂ))) ∧
      (∀ alpha : ℝ, 0 ≤ alpha →
        spatialBeam alpha N = commonPhase (alpha / Real.sqrt (N : ℝ)) N ∧
        IsPacketDensity (spatialBeam alpha N) ∧
        (0 < alpha → discardLastPacket (spatialBeam alpha (N + 1)) ≠ spatialBeam alpha N))) := by sorry

end QAlgorithms.Papers.Independent.Intakenext100.P33

end
Source
The Quantum State of a Propagating Laser Field, arXiv:quant-ph/0111157v1, PDF p. 5, IIE, Eq.(25)
Read-back

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

Let cz(m)=e−∣z∣2/2zm/m!c_z(m)=e^{-|z|^2/2}z^m/\sqrt{m!}cz​(m)=e−∣z∣2/2zm/m!​, let HN=ℓ2(NN;C)\mathcal H_N=\ell^2(\mathbb N^N;\mathbb C)HN​=ℓ2(NN;C), and let eqe_qeq​ denote its standard basis. For z∈CNz\in\mathbb C^Nz∈CN, define CN(z)C_N(z)CN​(z) to have coefficients ∏j<Nczj(qj)\prod_{j<N}c_{z_j}(q_j)∏j<N​czj​​(qj​) when these are square summable, and zero otherwise. For a complex 2×22\times22×2 matrix BBB, define

FB(m,n)=∑k=0m∑l=0n(mk)(nl)(k+l)! (m−k+n−l)!m! n! B00kB10m−kB01lB11n−l e(k+l,m−k+n−l).F_B(m,n)= \sum_{k=0}^{m}\sum_{l=0}^{n} \binom mk\binom nl \sqrt{\frac{(k+l)!\,(m-k+n-l)!}{m!\,n!}}\, B_{00}^{k}B_{10}^{m-k}B_{01}^{l}B_{11}^{n-l} \,e_{(k+l,m-k+n-l)}.FB​(m,n)=k=0∑m​l=0∑n​(km​)(ln​)m!n!(k+l)!(m−k+n−l)!​​B00k​B10m−k​B01l​B11n−l​e(k+l,m−k+n−l)​.

For ψ∈H2\psi\in\mathcal H_2ψ∈H2​, let UBψ\mathscr U_B\psiUB​ψ have coefficients

(UBψ)(p,q)=∑m=0p+qψ(m,p+q−m)(FB(m,p+q−m))(p,q)(\mathscr U_B\psi)_{(p,q)} = \sum_{m=0}^{p+q} \psi_{(m,p+q-m)} \bigl(F_B(m,p+q-m)\bigr)_{(p,q)}(UB​ψ)(p,q)​=m=0∑p+q​ψ(m,p+q−m)​(FB​(m,p+q−m))(p,q)​

when this coefficient function is square summable, and zero otherwise. Then, for every unitary complex 2×22\times22×2 matrix BBB and every z∈Cz\in\mathbb Cz∈C,

UBC2(z,0)=C2(B00z,B10z).\mathscr U_B C_2(z,0)=C_2(B_{00}z,B_{10}z).UB​C2​(z,0)=C2​(B00​z,B10​z).

Also, for every integer N≥1N\ge1N≥1, the matrix with entries N−1/2e2πijk/NN^{-1/2}e^{2\pi ijk/N}N−1/2e2πijk/N, 0≤j,k<N0\le j,k<N0≤j,k<N, is unitary. For every m∈Nm\in\mathbb Nm∈N, the coefficient function

sN,m(q)={m!∏j<Nqj! (N)m,∑j<Nqj=m,0,otherwises_{N,m}(q)= \begin{cases} \displaystyle\frac{\sqrt{m!}} {\sqrt{\prod_{j<N}q_j!}\,(\sqrt N)^m}, &\sum_{j<N}q_j=m,\\ 0,&\text{otherwise} \end{cases}sN,m​(q)=⎩⎨⎧​∏j<N​qj​!​(N​)mm!​​,0,​∑j<N​qj​=m,otherwise​

is square summable; the vector vN,mv_{N,m}vN,m​, defined to have these coefficients when square summable and to be zero otherwise, has exactly these coefficients and norm one. For every z∈Cz\in\mathbb Cz∈C, the vector family cz(m)vN,mc_z(m)v_{N,m}cz​(m)vN,m​ is summable and

∑m∈Ncz(m)vN,m=CN(z/N,…,z/N).\sum_{m\in\mathbb N}c_z(m)v_{N,m} = C_N(z/\sqrt N,\ldots,z/\sqrt N).m∈N∑​cz​(m)vN,m​=CN​(z/N​,…,z/N​).

Let λ=(2π)−1Leb∣[0,2π)\lambda=(2\pi)^{-1}\mathrm{Leb}|_{[0,2\pi)}λ=(2π)−1Leb∣[0,2π)​, write ∣u⟩⟨v∣x=⟨v,x⟩u|u\rangle\langle v|x=\langle v,x\rangle u∣u⟩⟨v∣x=⟨v,x⟩u, and define

SN(α)=∫∣∑mcαeiθ(m)vN,m⟩⟨∑mcαeiθ(m)vN,m∣ dλ(θ),RN(b)=∫∣CN(beiθ,…,beiθ)⟩⟨CN(beiθ,…,beiθ)∣ dλ(θ).S_N(\alpha)= \int\left|\sum_m c_{\alpha e^{i\theta}}(m)v_{N,m}\right\rangle \left\langle\sum_m c_{\alpha e^{i\theta}}(m)v_{N,m}\right| \,d\lambda(\theta), \qquad R_N(b)=\int|C_N(be^{i\theta},\ldots,be^{i\theta})\rangle \langle C_N(be^{i\theta},\ldots,be^{i\theta})|\,d\lambda(\theta).SN​(α)=∫​m∑​cαeiθ​(m)vN,m​⟩⟨m∑​cαeiθ​(m)vN,m​​dλ(θ),RN​(b)=∫∣CN​(beiθ,…,beiθ)⟩⟨CN​(beiθ,…,beiθ)∣dλ(θ).

For every real α≥0\alpha\ge0α≥0, SN(α)=RN(α/N)S_N(\alpha)=R_N(\alpha/\sqrt N)SN​(α)=RN​(α/N​), and SN(α)S_N(\alpha)SN​(α) is a packet density: 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​∥<∞, is self-adjoint, satisfies Re⁡⟨v,SN(α)v⟩≥0\operatorname{Re}\langle v,S_N(\alpha)v\rangle\ge0Re⟨v,SN​(α)v⟩≥0 for every vvv, and has summable complex diagonal with sum one. If α>0\alpha>0α>0, then

DN(SN+1(α))≠SN(α),D_N(S_{N+1}(\alpha))\ne S_N(\alpha),DN​(SN+1​(α))=SN​(α),

where DN(X)D_N(X)DN​(X) is a selected bounded operator with matrix (DN(X)en)m=∑k∈N(Xe(n,k))(m,k)(D_N(X)e_n)_m=\sum_{k\in\mathbb N}(Xe_{(n,k)})_{(m,k)}(DN​(X)en​)m​=∑k∈N​(Xe(n,k)​)(m,k)​ if one exists, and zero otherwise. The assertions about NNN include N=1N=1N=1, and those about mmm include m=0m=0m=0; the final inequality requires α>0\alpha>0α>0, whereas the density and equality assertions allow α=0\alpha=0α=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