Alphabeta Math
Physics theoremStatement: AI-adaptedProof: AI-adaptedPipeline-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.

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.

Depends on

Dependency tree · 2 levels

Sources