Ideal CW beam: common-phase coherent copies
OpenQAlgorithms.Papers.Independent.Intakenext100.P33.idealCW_beamConsider the noiseless, one-sided continuous-wave laser in the ideal vacuum-input, linear, frequency-independent input-output model of Section II. The high-finesse, near-resonance and long-time conditions specify the regime of that ideal model; no physical approximation-error estimate is claimed. Let the decay rate be , packet duration , and phase-zero intracavity amplitude . Put . Rectangular packets have centers and normalized envelopes on , where is arbitrary. The output is constructed by projecting onto those packets and averaging the stationary intracavity Poisson ensemble's common phase.
For every finite number of packets its density is
This is a positive trace-class operator of trace one, and the integral exists in trace norm. Every constructed coherent product has its displayed full-Fock coefficients and norm one. The family is invariant under packet permutations and satisfies , with the partial trace represented by convergent occupation sums. If and , then . The independent product also has its actual bounded tensor-matrix realization.
This compatible finite-window family describes an infinite CW beam without asserting a finite-energy global Fock vector. At the density is the scalar unit; at every packet is vacuum.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P33
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 pp.2–4, Eq.(13), restated p.8.
The stationary noiseless, vacuum-input CW model is constructed by idealBeam;
its computed packet projections give a=sqrt(kappa*T)*alpha. The conclusion
includes compatibility, permutation symmetry, and the explicit nonproduct claim.
No finite-energy global state of an infinite CW beam is claimed. -/
theorem idealCW_beam (kappa T tau alpha : ℝ) (hk : 0 ≤ kappa)
(hT : 0 < T) (ha : 0 ≤ alpha) :
let a := Real.sqrt (kappa * T) * alpha
(∀ N, idealBeam kappa T tau alpha N = commonPhase a N ∧
IsPacketDensity (commonPhase a N) ∧
TraceIntegral phaseLaw
(fun theta => packetProjector (fun _ : Fin N => (a : ℂ) * phase theta))
(commonPhase a N)) ∧
(∀ (N : ℕ) (z : Fin N → ℂ), Memℓp (packetCoefficients z) 2 ∧
(∀ m, packetCoherent z m = packetCoefficients z m) ∧ ‖packetCoherent z‖ = 1) ∧
(∀ N, discardLastPacket (commonPhase a (N + 1)) = commonPhase a N ∧
(∀ m n, Summable (fun k : ℕ =>
commonPhase a (N + 1) (packetBasis (Fin.snoc n k)) (Fin.snoc m k))) ∧
HasPacketMatrix (discardLastPacket (commonPhase a (N + 1))) (fun m n => ∑' k : ℕ,
commonPhase a (N + 1) (packetBasis (Fin.snoc n k)) (Fin.snoc m k))) ∧
(∀ N (s : Equiv.Perm (Fin N)), permutePackets s (commonPhase a N) = commonPhase a N ∧
HasPacketMatrix (permutePackets s (commonPhase a N))
(fun m n => commonPhase a N (packetBasis (n ∘ s)) (m ∘ s))) ∧
(∀ N, 2 ≤ N → 0 < a →
commonPhase a N ≠ fullFockTensorPower (poissonDensity (a ^ 2)) N) ∧
(∀ N, HasPacketMatrix (fullFockTensorPower (poissonDensity (a ^ 2)) N)
(fun m n => ∏ i, poissonDensity (a ^ 2) (fockKet (n i)) (m i))) := by sorry
end QAlgorithms.Papers.Independent.Intakenext100.P33
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For all real satisfying , , and , set . Let , let , and let denote its standard basis. For , define
let be the vector with these coefficients when they are square summable and zero otherwise, and put , where . Define
where the integral is over the open interval, and define the bounded-operator-valued integrals
For any coefficient matrix , let mean a selected bounded operator with if one exists, and zero otherwise. Define
where takes an operator on , permutes the coordinates, and takes a bounded operator on . An operator is nuclear here if it has an operator-norm-convergent expansion with ; let be the real infimum of these sums, with value zero for an empty collection of expansions. A packet density means a nuclear, self-adjoint operator with for all , summable complex diagonal, and diagonal sum one. In this notation, for every , , is a packet density, and the function is Bochner integrable with integral , is nuclear almost everywhere, and admits finite-range Bochner-integrable approximants such that and are nuclear almost everywhere, is integrable, and . For every and , is square summable, for every , and . For every , ; each defining series over for this discard operation is summable; and its selected operator has exactly that matrix. For every and every coordinate permutation , , and its selected operator has exactly the matrix displayed above. If and , then , where is the selected bounded operator with diagonal and zero off-diagonal entries, or zero if no such operator exists. For every , has precisely the matrix . These assertions include , when the occupation-label set is a singleton and every product over modes is the empty product one; and are also allowed, while the stated inequality of operators requires .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.