Alphabeta Math
PostulateStatement: Literature-sourcedProof: Not applicablePipeline-generatedprecheck pass‡ sources checked 2026-10-22
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 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.

Depends on

Dependency tree · 2 levels

Sources