Alphabeta Math
Physics theoremStatement: AI-adaptedProof: AI-generatedPipeline-generatedprecheck passverified 2026-10-22 (gpt-6.1-sol)
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

Passive beam-splitter photon statistics

Physical scope

An exact two-mode passive-unitary model calculation in the infinite-dimensional finite-mode bosonic Fock space, with ideal number-resolving outcomes. It gives conditional count distributions for specified number and coherent inputs. The result is not an experiment or a claim that an actual optical device realizes the assigned unitary.

Statement

Assume the finite-mode assignment with two modes and its ideal number PVM, with AC and ACω as required by the implementer and completed Fock/tensor suppliers. Write F(2)=Fs(C2) in the ordered mode basis (1,0),(0,1) and F=Fs(C). The mode-factorization map is the unitary J:F(2)→F⊗^F determined by J∣m,n⟩=∣m⟩⊗∣n⟩. Here ⊗^ is the completed Hilbert tensor product, and the one-mode occupation vectors and their products use the same vacuum and mode order. Its unitary extension is proved below. Let t,r∈C be dimensionless amplitudes with ∣t∣2+∣r∣2=1, and fix the complete unitary mode matrix C=(t−r‾rt‾). Use the state-action convention that the passive unitary UC satisfies UCΩ=Ω, UCa1∗UC∗=ta1∗+ra2∗, and UCa2∗UC∗=−r‾ a1∗+t‾ a2∗ on the finite-particle core. Put η:=∣t∣2. For n∈N0 and 0≤k≤n, write (nk):=n!/(k!(n−k)!). For input ∣n,0⟩ and 0<η<1, the joint output count law is P(k,ℓ)={(nk)ηk(1−η)n−k,ℓ=n−k, 0≤k≤n,0,otherwise. At η=0 and η=1 the joint laws are respectively point masses at (0,n) and (n,0). Thus the first output count is binomial with parameters (n,η). For a dimensionless coherent input ∣α,0⟩ with ∣α⟩=e−∣α∣2/2∑n≥0αn∣n⟩/n!, define ∣α,0⟩=J∗(∣α⟩⊗∣0⟩), equivalently e−∣α∣2/2∑n≥0αn∣n,0⟩/n!. The output state under this fixed mode factorization is JUC∣α,0⟩=∣tα⟩⊗∣rα⟩; on F(2) it is J∗(∣tα⟩⊗∣rα⟩).

Facts & Assumptions

Given: Two finite oscillator modes with Fock occupation basis ∣n⟩, vacuum Ω, a passive unitary mode matrix C with first column (t,r)T, ideal number PVMs on both output modes, and dimensionless coherent amplitude α∈C.

[A1]

The postulate assigns two finite oscillator modes and their ideal photon-counting PVM, but it asserts no actual beam-splitter device or count record (Finite-mode dipole and detector assignment).

[A2]

Assume both AC and ACω. AC is used for the finite-mode Bogoliubov implementer; ACω is used for the countable Fock basis and coherent-state series. These are mathematical assumptions, not physical inputs (The Axiom of Choice, The Axiom of Countable Choice (ACω)).

[F1]

The two-mode occupation vectors ∣n1,n2⟩ form a complete orthonormal basis and a1∣n1,n2⟩=n1∣n1−1,n2⟩,a2∣n1,n2⟩=n2∣n1,n2−1⟩, a1∗∣n1,n2⟩=n1+1∣n1+1,n2⟩,a2∗∣n1,n2⟩=n2+1∣n1,n2+1⟩, with annihilation zero when its corresponding occupation is zero. The creators commute and the annihilators kill Ω (Finite-mode Fock to Schrödinger identification). The current Step 1 record for this batch-52 Fock–Schrödinger supplier is ready and hash-current; it is an authoring-readiness record, not independent proof approval.

[F2]

The finite-mode Bogoliubov statement assumes AC and, for unitary mode matrix S with V=0, supplies an implementer M satisfying M∗aM=Sa and ∑j∥ajMΩ∥2=0 (Finite Bogoliubov implementability). Its current Step 1 record is ready and hash-current; it is an authoring-readiness record, not independent proof approval.

[F3]

The one-mode coherent vector has the normalized expansion ∣α⟩=e−∣α∣2/2∑nαn∣n⟩/n!, and the occupation vectors are orthonormal (Fixed-mode number law).

[F4]

The ideal outcome law for a declared PVM P(B) is P(B)=tr⁡(ρP(B)); no apparatus realization follows (Declared ideal measurements and instruments of the framework).

[F5]

Under ACω, the completed Hilbert tensor product of two complex Hilbert spaces exists, elementary tensors have norm ∥u⊗v∥=∥u∥∥v∥, and products of complete orthonormal families form a complete orthonormal family. Hilbert tensor construction: inner product, completion and product bases

Proof

1.1givenA2F2constructalgebra

The matrix C is unitary because C∗C=I2 follows from ∣t∣2+∣r∣2=1. Set S=C, so U=S,V=0 satisfy UU∗−VV∗=I2 and UVT=VUT. By [F2] the finite-mode Bogoliubov statement supplies an implementer M with M∗aM=Sa. Multiplying by M and M∗ gives MaM∗=S−1a; taking adjoints gives Ma∗M∗=S‾−1a∗=STa∗=CTa∗ because S=C is unitary. Thus the first creator transforms to ta1∗+ra2∗ and the second to −r‾ a1∗+t‾ a2∗. These identities hold on the invariant transported Schwartz space supplied by the implementer.

2.1F1F2step 1.1algebra

The transformed vacuum has ∑j=12∥ajMΩ∥2=0 by [F2], so a1MΩ=a2MΩ=0. Expanding MΩ in the complete occupation basis [F1], the equation a1ψ=0 forces every coefficient with first occupation n1>0 to vanish by the ladder formula; a2ψ=0 then forces every coefficient with n2>0 to vanish. Hence MΩ=eiϕΩ for some real ϕ. Replacing M by UC=e−iϕM preserves the conjugation identities and gives UCΩ=Ω. Every occupation vector is a polynomial in the creators applied to Ω, so these identities show that UC maps the finite-particle span into itself. The inverse creator identities give the same inclusion for UC∗; hence this span is invariant in both directions and the conjugation identities hold there.

3.1F1step 1.1step 2.1constructalgebra

For ∣n,0⟩=(a1∗)nΩ/n!, repeated use of the creation identity in [F1], the conjugation identity from step 1.1, and UCΩ=Ω from step 2.1 give UC∣n,0⟩=(ta1∗+ra2∗)nΩ/n!=∑k=0n(nk)tkrn−k∣k,n−k⟩. The coefficient follows by choosing which k of the n commuting creation factors contribute a1∗ and using ∣k,n−k⟩=(a1∗)k(a2∗)n−kΩ/k!(n−k)!.

4.1A1F4step 3.1algebra

Orthogonality of the output occupation basis makes the joint ideal number-count probability the squared modulus of the coefficient in step 3.1. Since ∣t∣2=η and ∣r∣2=1−η, for 0<η<1 this is the displayed binomial law; at the endpoints the expansion has a single surviving basis vector. The declared number PVM and its Born rule [A1, F4] assign these probabilities.

5.1A2F1F3F5step 3.1algebra∎

By [F1, F3, F5], the families ∣m,n⟩ and ∣m⟩⊗∣n⟩ are complete orthonormal families in F(2) and F⊗^F, respectively. On finite sums define J0∑cmn∣m,n⟩=∑cmn∣m⟩⊗∣n⟩; orthonormality makes its squared norm ∑∣cmn∣2, so it is well defined and inner-product preserving. For ψ∈F(2), approximate by finite sums ψj and define Jψ=lim⁡jJ0ψj. The norm identity makes the images Cauchy in the complete product and the limit independent of the approximating sequence; it preserves linearity, norm and inner product. Its range is closed: if Jψj converges, the same norm identity makes ψj Cauchy in the complete Fock space, so its limit maps to that range limit. The range contains the complete product family and hence is dense, so it is the whole product. This proves that J is unitary, uniquely fixed by the occupation map, with JΩ=∣0⟩⊗∣0⟩. The coherent input series converges by [F3] and this unitary identification. Apply the bounded unitary UC to its norm-convergent partial sums. Each output occupation coefficient has only one contributing input total n=k+ℓ; step 3.1 gives it as e−∣α∣2/2αk+ℓtkrℓ/k!ℓ!. The product of the two norm-convergent coherent series exists in the completed product by [F5]; approximating each factor by finite partial sums is legitimate since ∥u⊗v−u′⊗v′∥≤∥u−u′∥∥v∥+∥u′∥∥v−v′∥. Its product-basis coefficients are the same, because ∣tα∣2+∣rα∣2=∣α∣2. Completeness of that basis therefore proves JUC∣α,0⟩=∣tα⟩⊗∣rα⟩, retaining the exact vacuum phase and port convention.

Remarks

The state-action convention fixes which amplitude is called t and which output is called the first port. The literature often displays the inverse Heisenberg transformation; step 1.1 distinguishes the annihilator matrix C from the state-action creator matrix CT. In the diagram, each line denotes a bosonic mode, and the box denotes the declared two-mode unitary. The number labels are Fock occupations, not photon positions.

jni1j0i2UCmode1mode2

The two input labels are the separate mode states whose product is ∣n,0⟩; the outgoing lines label the two modes after the joint unitary. The diagram does not depict a detector, its efficiency, or a physical laboratory layout; the count distribution follows from the proof and the assigned number PVM.

Depends on

Dependency tree · 2 levels

Sources