Alphabeta Math
Pipeline-generated
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.

Wavepacket photodetection and normally ordered correlations

1 · Prerequisites

2 · Summary

3 · Logical flowchart

4 · Definitions, postulates, theorems and proofs

LemmaStatement: AI-adaptedProof: AI-adaptedprecheck passverified 2026-10-22 (gpt-6.1-sol)Open item page →

One-mode photon number operator and count PVM

Statement

Assume the Axiom of Countable Choice. Let H be a complex Hilbert space with the second-variable-linear pairing used for bosonic Fock space, and let u∈H satisfy ∥u∥=1. Put K=u⊥. Let Ju:Fs(Cu)⊗^Fs(K)→Fs(H) be the one-mode Fock unitary, and for n∈N0 let en=u⊗n∈(Cu)s(n), with e0=1. On Fs(Cu) define Qnz=⟨en,z⟩2en, and on Fs(H) put Pn:=Ju(Qn⊗I)Ju−1. For every Borel set B⊆R, define the strong sum Eu(B):=∑n∈B∩N0Pn. Define the mode number operator Nu:=∑n=0∞nPn,D(Nu):={Ψ∈Fs(H):∑n=0∞n2∥PnΨ∥2<∞}. Then (Pn)n≥0 are mutually orthogonal projections with strong sum I, Eu is a projection-valued measure supported on N0, and Nu is self-adjoint with these spectral projections. Define MuΨ:=∑n=0∞n(n−1)PnΨ on D(Mu):={Ψ∈Fs(H):∑n=0∞n2(n−1)2∥PnΨ∥2<∞}. Then Mu=Nu(Nu−I) is self-adjoint, and Dfin is a graph core for it. On the finite-particle subspace, Nu=a†(u)a(u),Mu=Nu(Nu−I)=a†(u)2a(u)2. Thus the finite-particle restriction of a†(u)2a(u)2 is essentially self-adjoint with closure Mu.

Facts & Assumptions

Given: Countable Choice, the bosonic Fock space over H, a unit vector u, and its closed orthogonal complement K=u⊥.

[A1]

Assume Countable Choice, written ACω. The Axiom of Countable Choice (ACω)

[F1]

The bosonic Fock space is the square-summable direct sum of its symmetric particle sectors; its finite-particle subspace is Dfin, and the creation and annihilation maps are defined on those sectors. Schwartz/distribution spaces and Hilbert Fock conventions

[F2]

The one-mode splitting is a unitary Ju:Fs(Cu)⊗^Fs(K)→Fs(H); under it, creation and annihilation by u act on the first factor by en↦n+1en+1 and en↦nen−1 on finite-particle vectors. One-mode factorization of symmetric Fock space

[F3]

On Dfin, the bosonic CCR include [a(u),a†(u)]=I, and the finite-particle subspace is invariant under these creation and annihilation maps. Bosonic and fermionic Fock operators with exact domains

[F4]

A PVM is a countably strongly additive map from a sigma-algebra to orthogonal projections, with empty-set value zero, full-space value the identity, and E(B∩C)=E(B)E(C). Projection valued measure

[F5]

A densely defined operator is self-adjoint when it equals its adjoint, including equality of domains and values; its operator domain is part of the data. Unbounded linear operators: domain, graph and extension Symmetric, self-adjoint and essentially self-adjoint operators

Proof

1.1A1F1F2givenalgebra

Under the unitary Ju of [F2], the one-dimensional nth sector of Fs(Cu) is spanned by the unit vector en. Therefore Qn are mutually orthogonal projections and their strong sum is the identity on Fs(Cu). Tensoring with the identity on Fs(K) and conjugating by Ju shows that each Pn is an orthogonal projection, PnPm=0 for n≠m, and ∑n≥0PnΨ=Ψ in norm for every Ψ∈Fs(H).

2.1F1F2F5step 1.1algebra

Under Ju, write Ψ=⨁n≥0en⊗ϕn with ϕn∈Fs(K), and put mn=n(n−1). The composition Nu(Nu−I) acts diagonally by mn and has exactly the stated domain: ∑nmn2∥ϕn∥2<∞ implies Ψ∈D(Nu) because n2≤mn2 for n≥2 and the n=0,1 block contributions are finite, and it gives (Nu−I)Ψ∈D(Nu); conversely, membership in the composition domain gives this sum. This domain contains Dfin, dense by truncation of the square-summable Fock sum in [F1], and the operator is symmetric because each mn is real. If Φ∈D(Mu∗) and Ξ=Mu∗Φ, testing the adjoint identity on vectors supported in one nth block forces Ξn=mnΦn; square summability gives Φ∈D(Mu). Conversely, for Φ∈D(Mu), Cauchy–Schwarz on the block sum gives the adjoint identity with value MuΦ. Hence Mu=Mu∗ and is self-adjoint, therefore closed, by [F5].

2.2A1F4step 1.1algebra

For Borel B, the orthogonal sum defining Eu(B) converges strongly because ∑n∥PnΨ∥2=∥Ψ∥2. It is an orthogonal projection, Eu(∅)=0, Eu(R)=I, and orthogonality gives Eu(B)Eu(C)=Eu(B∩C). For pairwise disjoint Borel sets Bj, their intersections with N0 partition B∩N0, so the corresponding orthogonal series gives Eu(⋃jBj)Ψ=∑jEu(Bj)Ψ in norm. Thus Eu is a PVM supported on N0, and Eu({n})=Pn.

2.3F2F5step 1.1algebra

Under Ju, Nu is the diagonal operator (Ψn)n≥0↦(nΨn)n≥0 with domain ∑nn2∥Ψn∥2<∞. It is symmetric because every diagonal coefficient n is real. If Φ lies in its adjoint domain with adjoint value Ξ, testing the adjoint identity on vectors supported in a single sector forces Ξn=nΦn for every n. Since Ξ is square-summable, ∑nn2∥Φn∥2<∞, so Φ∈D(Nu). Conversely, for Φ∈D(Nu), Cauchy–Schwarz on the sector sum gives the adjoint identity with value NuΦ. Hence D(Nu∗)=D(Nu) and Nu∗=Nu, and its projections are the constructed Eu({n})=Pn.

3.1F1F2F3step 1.1step 2.3algebra

By [F2], on a one-mode occupation vector en⊗ϕ one has a(u)(en⊗ϕ)=n en−1⊗ϕ and a†(u)(en⊗ϕ)=n+1 en+1⊗ϕ; thus a†(u)a(u)=Nu on finite-particle vectors, including the n=0 sector. On the same invariant subspace, [F3] gives a(u)a†(u)=a†(u)a(u)+I. Consequently Nu(Nu−I)=a†(u)a(u)a†(u)a(u)−a†(u)a(u)=a†(u)2a(u)2 on Dfin, by substitution of the CCR and cancellation of the two a†(u)a(u) terms.

4.1F1F2step 3.1step 2.1algebra∎

Truncate any Ψ∈D(Mu) to Ψ(M)=∑n=0MPnΨ; its squared graph-norm tail is ∑n>M(1+mn2)∥PnΨ∥2→0. For fixed M, write each PnΨ under Ju−1 as en⊗ϕn and approximate each of the finitely many ϕn by finite-particle vectors in Fs(K), which are dense by [F1]. The one-mode unitary preserves norm and the finitely many multipliers mn are bounded, so these approximations converge in graph norm and their images have finite total particle number. Thus Dfin is a graph core for Mu; its restriction is a†(u)2a(u)2 by step 3.1, and its closure is Mu because Mu is closed by step 2.1.

PostulateStatement: Literature-sourcedProof: Not applicableprecheck pass‡ sources checked 2026-10-22Open item page →

Ideal wavepacket number counting

Physical scope

An ideal countably number-resolving detector for one normalized transverse wavepacket mode in the selected positive free-photon Fock model, with unit efficiency, no mode mismatch, no background and no dark counts. It supplies no finite-time response, point-field product, interacting QED model, or empirical outcome.

Postulate

Assume Countable Choice and use the positive transverse free-photon model whose one-particle space is HT=L2(R3,d3k;C3) with its transverse condition and whose state space is the bosonic Fock space Fs(HT). In the unit convention where k has unit m−1, let u∈HTν be a normalized transverse wavepacket for the invariant measure dν=d3k/(2∣k∣), so that u(k) has unit metre and ∫∣u∣2dν=1. Let v=Wu, where Wf(k)=f(k)/2∣k∣; then v∈HT, v(k) has unit m3/2, and ∥v∥2=1. In the Fock factorization Fs(HT)≅Fs(Cv)⊗^Fs(v⊥), Pn(v) is the orthogonal projection onto mode occupation n tensored with the identity on the orthogonal-mode Fock factor. These projections are mutually orthogonal and have strong sum I; their count PVM is Ev(B)=∑n∈B∩N0Pn(v), and Nv=∑nnPn(v) on the domain ∑nn2∥Pn(v)Ψ∥2<∞. A density operator ρ means a positive self-adjoint trace-class operator with tr⁡ρ=1, using the trace pairing obtained from the Fock space's second-variable-linear convention by conjugation. For n∈N0, put pn=tr⁡(ρPn(v)). The mathematical density/PVM result makes (pn) a countably additive probability law under the stated Countable Choice hypothesis.

Adopt as the ideal detector postulate that this law is the model probability for recording exactly n photons in the selected mode. The detector is number resolving, has unit mode efficiency, and has no mode mismatch, background counts or dark counts. This is an additional physical measurement assumption; it is not deduced from the CCR or from the free-field equations.

When ∑nnpn<∞ and ∑nn(n−1)pn<∞, define the first number moment and normally ordered second factorial moment by μv(ρ):=∑n=0∞npn,Fv(2)(ρ):=∑n=0∞n(n−1)pn. The PVM sums define the unbounded-state moments. In this ideal mode model, define the normally ordered second-mode correlation to be the spectral factorial expectation Fv(2)(ρ). The self-adjoint closure of the finite-particle operator a†(v)2a(v)2 is Nv(Nv−I) by One-mode photon number operator and count PVM, so this definition agrees with the normally ordered operator on its finite-particle core and uses the spectral expectation for states outside that core. It does not assert a trace product of ρ with an unbounded operator. If μv(ρ)>0, define the dimensionless same-mode zero-delay statistic gv(2)(0):=Fv(2)(ρ)μv(ρ)2. Here 0 is the conventional zero-delay label for this same-mode statistic; no temporal detector response or pointwise product of electric-field distributions is defined.

Remarks

The density/PVM supplier is used only for its density decomposition and scalar probability clauses, which require Countable Choice; its separate unbounded-moment clause requires the Axiom of Choice and is not used. The new physical postulate supplies the detector reading of this countable PVM. It does not claim that the more general finite-instrument measurement postulate or an experimental measurement has derived this detector model.

Physics theoremStatement: AI-adaptedProof: AI-adaptedprecheck passverified 2026-10-22 (gpt-6.1-sol)Open item page →

Ideal one-mode intensity correlations separate model states

Physical scope

Exact model predictions for coherent-mode, fixed-number and geometric one-mode preparations under ideal wavepacket number counting. The geometric distribution is the specified single-mode thermal occupation law; no universal classification of radiation or empirical outcome is asserted.

Statement

Assume the ideal wavepacket counting postulate for a normalized mode v, and let pn be the resulting count law of a prepared state. Write μ:=∑n=0∞npn,F2:=∑n=0∞n(n−1)pn,gv(2)(0):=F2/μ2 when 0<μ<∞ and F2<∞. Let Jv:Fs(Cv)⊗^Fs(v⊥)→Fs(HT) be the one-mode Fock unitary, let ∣n⟩v=v⊗n with ∣0⟩v=1, and let Ωv⊥ be the vacuum in Fs(v⊥). Put ψn:=Jv(∣n⟩v⊗Ωv⊥). For a unit vector ψ, gv(2)(0;ψ) denotes the postulate's value for the pure density operator ∣ψ⟩⟨ψ∣. For α∈C∖{0} put λ=∣α∣2, Zλ=∑n=0∞λn/n!, and define the coherent-mode vector ψα:=Zλ−1/2∑n=0∞αnn!ψn. For m≥1, the number preparation is ψm. For 0<r<1, the geometric one-mode state is ρr:=(1−r)∑n=0∞rn∣ψn⟩⟨ψn∣. Then the ideal model predictions are gv(2)(0;ψα)=1,gv(2)(0;ψm)=1−1m,gv(2)(0;ρr)=2. The final state has the specified single-mode geometric occupation law; these conclusions do not classify all radiation as coherent, number, or thermal.

Facts & Assumptions

Given: The ideal count law (pn) of the postulate, a normalized selected mode v, and the stated finite-moment hypotheses.

[A1]

The ideal wavepacket postulate assigns pn=tr⁡(ρPn(v)), defines gv(2)(0)=F2/μ2, and identifies F2 with the spectral sum for the normally ordered factorial correlation. Ideal wavepacket number counting

[F1]

The one-mode number projections are Pn(v), the unit occupation vector ψn has Pj(v)ψn=1j=nψn, and Nv(Nv−I)=a†(v)2a(v)2 on the finite-particle core. One-mode photon number operator and count PVM

[F2]

For real λ, exp⁡(λ)=∑n=0∞λn/n!; for λ>0 this positive series is finite and at least 1. The real exponential function and the number e by a power series

[F3]

Factorials satisfy n!=n(n−1)! for n≥1 and n(n−1)/n!=1/(n−2)! for n≥2. The factorial n! and the falling factorial nk‾, defined by recursion in N

[F5]

Nonnegative sums on countable product sets may be regrouped by Tonelli's theorem. Tonelli's theorem for nonnegative measurable functions on a sigma-finite product

[F6]

A unit vector defines a pure density operator, and a countable weighted sum of orthogonal rank-one states with nonnegative weights summing to one is a density operator; its PVM probabilities are the corresponding count law. We use only the supplier's density and scalar-probability clauses, which require Countable Choice. Density operators and scalar spectral probability

Proof

1.1A1F1F2F3F6algebra

The coefficients of ψα are square-summable because their squared norms sum to Zλ−1∑nλn/n!=1 by [F2]; the orthogonal one-mode sectors therefore make ψα a unit vector and [F6] makes its rank-one state a density operator. Its count probabilities are pn=Zλ−1λn/n! by [A1] and [F1]. Shifting indices in the nonnegative exponential series gives μ=Zλ−1∑n≥1nλnn!=λ,F2=Zλ−1∑n≥2n(n−1)λnn!=λ2, so gv(2)(0)=1. The same calculation shows both required moments are finite.

1.2A1F1algebra

For ψm, [F1] gives pn=1n=m, hence μ=m and F2=m(m−1). Since m≥1, the denominator is positive, and substitution into [A1] gives gv(2)(0)=m(m−1)/m2=1−1/m.

2.1A1F4F5F6algebra∎

The weights (1−r)rn are nonnegative and sum to one by [F4], so [F6] makes ρr a density operator and [A1] gives the geometric count law pn=(1−r)rn. By Tonelli [F5], (∑j≥0rj)2=∑i,j≥0ri+j=∑n≥0(n+1)rn. Therefore ∑n≥0nrn=(1−r)−2−(1−r)−1=r/(1−r)2. Applying Tonelli to the triple product and counting the (i,j,k)∈N03 with i+j+k=n−2 gives r2(∑j≥0rj)3=∑n≥2n(n−1)2rn, because that finite set has ∑i=0n−2(n−1−i)=n(n−1)/2 elements. Hence ∑n≥0n(n−1)rn=2r2/(1−r)3. Multiplying by 1−r gives μ=r/(1−r)>0 and F2=2r2/(1−r)2<∞, so [A1] yields gv(2)(0)=2.

Physics theoremStatement: AI-adaptedProof: AI-adaptedprecheck passverified 2026-10-22 (gpt-6.1-sol)Open item page →

Ideal independent loss preserves normalized factorial correlation

Physical scope

A selected mode with a finite positive ideal mean is sent through an explicitly assumed independent, constant-efficiency counting channel with no background or dark counts. The theorem does not model detector dead time, mode dependence, correlated loss, or actual measured data.

Statement

Assume the ideal wavepacket-counting postulate for a selected mode v∈HT with ∥v∥=1, and let ρ be the incoming density operator on Fs(HT) (a positive self-adjoint trace-class operator with trace one). By that postulate, Pn(v) are the mode-count projections and pn=tr⁡(ρPn(v)) are the count probabilities, so pn≥0 and ∑n=0∞pn=1. Define the incoming mean and second factorial moment by μ:=∑n=0∞npn,F2:=∑n=0∞n(n−1)pn, and assume 0<μ<∞ and F2<∞. Define gN(2)(0):=F2/μ2; for this input state ρ, the postulate denotes the same statistic by gv(2)(0).

Let 0<η≤1 be a dimensionless fixed efficiency and assume no background or dark counts. To specify independent recording, put bη(0)=1−η, bη(1)=η, and Ω:={(n,x):n∈N0, x=(x1,…,xn)∈{0,1}n},A:=P(Ω). This is countable under the explicit encoding (n,x)↦(n,∑j=1nxj2j−1). Give the space the point masses P({(n,x)}):=pn∏j=1nbη(xj), where the empty product for n=0 is 1. For each fixed n, the product factors define the conditional product law Qn on {0,1}n; hence its coordinates are independent Bernoulli variables with success probability η. Since ∑x∈{0,1}nQn({x})=(η+(1−η))n=1, these point masses sum to one and define a probability measure P on (Ω,A). Define N(n,x):=n and K(n,x):=∑j=1nxj. For every nonnegative random variable Y on this space, use the expectation EY:=∑(n,x)∈ΩY(n,x) P({(n,x)}). The marginal law of N is (pn), and the conditional count law of K given N=n is the binomial law induced by Qn. If EK>0, define gK(2)(0):=E[K(K−1)]/(EK)2. Then EK=ημ,E[K(K−1)]=η2F2. Consequently the normalized zero-delay factorial correlation is unchanged: gK(2)(0)=E[K(K−1)](EK)2=F2μ2=gN(2)(0)=gv(2)(0). This is a model deduction conditional on independent constant-efficiency thinning; it is not a universal property of real detectors.

Facts & Assumptions

Given: The count distribution (pn) of the ideal mode model, its finite moments μ>0 and F2, a fixed efficiency 0<η≤1, and conditionally independent Bernoulli recording of each incoming photon.

[A1]

The conditional law on the nth fiber of Ω is Qn({x})=∏j=1nbη(xj), with bη(0)=1−η and bη(1)=η. For j≤n, the coordinate map Xn,j(x):=xj is therefore Bernoulli with success probability η, and the coordinate maps are mutually independent under Qn. The joint mass is P({(n,x)})=pnQn({x}). This is the explicitly assumed thinning channel, not an empirical detector law.

[F1]

For this incoming law, the ideal mode theorem uses the wavepacket postulate's input statistic gv(2)(0)=F2/μ2 when 0<μ<∞ and F2<∞. Thus the Statement's gN(2)(0) is exactly that postulate value for ρ. Ideal one-mode intensity correlations separate model states

[F2]

Nonnegative countable sums may be averaged and regrouped by Tonelli's theorem. Tonelli's theorem for nonnegative measurable functions on a sigma-finite product

Proof

1.1A1algebra

Fix n∈N0 and average on its finite fiber using Qn. For each j≤n, factorization gives ∑xQn({x})Xn,j(x)=η, and for distinct i,j≤n it gives ∑xQn({x})Xn,i(x)Xn,j(x)=η2. Since K(n,x)=∑j=1nXn,j(x) and K(n,x)(K(n,x)−1)=∑i≠jXn,i(x)Xn,j(x) for zero-one coordinates, it follows that ∑xQn({x})K(n,x)=nη and ∑xQn({x})K(n,x)(K(n,x)−1)=n(n−1)η2. For n=0 or n=1 the relevant sums are empty and the same formulas hold.

2.1A1F1F2step 1.1algebra∎

Using the Statement's encoding, identify Ω with a subset of N0×N0. For either Y=K or Y=K(K−1), extend fY(n,m):=pnQn({x})Y(n,x) by zero outside that subset. Counting measure on N0 is sigma-finite, so [F2] applied to the product of the two counting-measure spaces permits the nonnegative sum to be regrouped over the finite fibers. Using step 1.1 gives EK=∑npnnη=ημ and E[K(K−1)]=∑npnn(n−1)η2=η2F2. Both are finite by hypothesis. Since ημ>0, division gives gK(2)(0)=η2F2/(ημ)2=F2/μ2=gN(2)(0)=gv(2)(0) by [F1].

5 · Examples, experiments and counterexamples

None yet.

Sources