Definitions for The Quantum State of a Propagating Laser Field
DefinitionQAlgorithms_Papers_Independent_Intakenext100_P33The objects the formalized statements of The Quantum State of a Propagating Laser Field (arXiv:quant-ph/0111157) are stated in. Each was checked against the paper by a blind read-back and a moderator.
phaseLaw: PDF p.1, Eq.(2): normalized uniform phase law on one period.TraceIntegral: A trace-norm Bochner integral specified without imposing the operator norm on trace class. Finite-range integrable approximants converge in L¹ nuclear norm. Together with the bounded-operator integral identity this is the genuine trace-class integral, rather than an entrywise or merely weak integral. All nuclear norms are guarded by trace-class membership. PDF pp.1,3,5.PacketSpace: PDF p.3: N distinguishable temporal packets, each with unbounded occupation.PacketOperator: Bounded operators on the full N-packet space.packetBasis: PDF p.3: the tensor occupation basis, including the scalar register N=0.HasPacketMatrix: Exact matrix realization on the total orthonormal occupation basis.packetOperator: Many-packet bounded realization. Theorems assert realization, so the zero fallback outside the bounded regime cannot furnish any physical conclusion.IsPacketDensity: Positive, normalized trace-class N-packet density. PDF p.3, Eq.(13).packetCoefficients: PDF p.3, Eqs.(10)–(12): product coherent coefficients in selected modes.packetCoherent: Constructed full-Fock coherent product. Square summability and normalization are conclusions below, never assumptions on these constructed vectors.packetProjector: PDF p.3: projector of the constructed coherent product.fullFockTensorPower: PDF pp.3–5: full-Fock bounded realization of the accepted matrix tensor power. Information100.P63.tensorPower works for arbitrary index types, so it supplies the occupation coefficients at I=Nat. packetOperator additionally realizes them on l²; the theorems conclude realization for density inputs.commonPhase: PDF p.3, Eq.(13): shared-phase finite-window family.discardLastPacket: PDF pp.3–4: full-Fock partial trace discarding the last packet. Unlike Gap48.P33.discardLast, whose discarded register has a Fintype instance, this sums all natural occupations without a cutoff. Summability and bounded realization are explicit conclusions in the beam theorem.permutePackets: PDF p.4: permutation of packet factors, in occupation coordinates.packetFunction: PDF p.3, Eq.(11), with tau=z0/c. Open endpoints have no L² effect.cwAmplitude: PDF pp.2–3: beta=sqrt(kappa)alphaexp(i phi), the ideal linear, frequency-independent vacuum-input boundary condition, without phase noise, amplitude noise or dissipation. The high-finesse, near-resonance and long-time approximations specify this model; no quantitative physical error is asserted.cwPacketAmplitude: PDF p.3, Eq.(10): actual mode projection, before simplifying the rectangle.idealBeam: PDF pp.2–3: constructed ideal vacuum-input CW output from the stationary intracavity Poisson law, using its uniform phase ensemble and the computed output projections. Each finite observed window is constructed separately.TemporalSpace: Single-packet rectangular modes in L²(R), restricted to a finite observation window by the finite family used. No constant function on all R is a vector.temporalPacket: Eq.(11) as an L² vector. Membership and the representative identity are concluded below, excluding the total-function fallback.temporalField: The finite-window coherent field's one-particle displacement, Eqs.(6),(10). It is constant beta on the observed packet intervals and zero outside them.modeAmplitude: Eq.(10): projection onto any normalized discrete temporal mode.finiteModeVector: Eq.(6) in a finite set of orthonormal modes: its coherent factor is constructed from the one-particle projections, not from asserted output states.FockLocalInstrument: PDF p.5, Eqs.(22)–(23): an actual local finite-outcome quantum measurement, allowing countably many Kraus operators per outcome. Completeness is strong summation on the full Hilbert space, not an assumed posterior law. Gap20.P09.LocalMeasurement instead requires a finite-dimensional input and stores only POVM effects; it cannot describe this full-Fock Kraus instrument.localEffect: The selected outcome's computed effect, summing the internal Kraus index and the output occupation. The theorem asserts bounded realization.packetLikelihood: Product Born likelihood for the observed string of individual-packet measurements; no classical phase-readout instrument is presumed.packetEvidence: The unconditional probability calculated from the input ensemble.eventKraus: Tensor Kraus operator for the first K packets, identity on the further M. The construction includes the actual local actions and does not touch the unmeasured packets. Realization is asserted below, excluding the fallback.eventTerm: One internal branch of the observed string's actual instrument.eventOutput: Unnormalized quantum state after the selected outcome, before discarding measured packets. Trace-norm summability is a theorem conclusion.discardPrefix: Partial trace of the first K packets, leaving the last M.packetResidual: Unnormalized residual computed from the instrument, not a Bayesian identity assumed as input. PDF p.5.posteriorPhaseLaw: Bayesian phase law with RN derivative L/Z. Only positive-evidence use is asserted below; division at Z=0 cannot supply a posterior density.equalSplitter: PDF p.5: lossless equal N-port splitter; the Fourier unitary's first column is real positive, fixing the compensable output port phases. N>=1 is required by the theorem; the N=0 division fallback is never used.splitNumberCoefficients: First-input-column second quantization of the constructed equal splitter: expand (sum_j a_j†/sqrt(N))^m/sqrt(m!). No photon cutoff. PDF p.5, Eq.(25).splitNumber: The finite-photon input is sent to its explicitly expanded output vector.splitCoherent: Equal splitting of a coherent input is constructed by linearity on its number expansion, rather than defined to be the desired coherent product.spatialBeam: Phase-averaged fixed-total-energy spatial beam. PDF p.5, §IIE.DownCore: PDF p.7, Eq.(32): finite occupation core for the pump and signal.weightedNumber: The conserved weighted number on the common finite-occupation core.downHamiltonian: Exact cubic Hamiltonian on the core. Both lowering boundaries are guarded; this is not a bounded annihilation operator on the full Fock space.downBlock: The invariant weighted-number-w block, indexed by pump occupation j and signal occupation w-2j. PDF p.7, following Eq.(32).downBlockEvolution: Exact Schroedinger evolution in each finite invariant block, hbar=1.downCoefficients: Direct-sum evolution coefficients, a finite sum at every output occupation. This constructs dynamics on arbitrary full two-mode vectors.downEvolution: Full-space evolution. Its coefficient realization and unitary extension are conclusions, so square summability is never assumed as output data.evolvedPumpNumber: Evolved |m,0>, with vacuum in the signal input.signalMatrix: Computed signal matrix after tracing out the pump, for an arbitrary initial pump probability law p. The theorem guards p's normalization and all series.signalOutput: Reduced signal operator built from the dynamics and the partial trace.
import Mathlib
import Definitions.Def_QAlgorithms_Defs_RealLabelRegisters
import Definitions.Def_QAlgorithms_Papers_Independent_Dependency50_P39
import Definitions.Def_QAlgorithms_Papers_Independent_Frontier18_P14
import Definitions.Def_QAlgorithms_Papers_Independent_Information100_P63
import Definitions.Def_QAlgorithms_Papers_Independent_Information100_P75
/-!
Exact ideal-model statements from arXiv:quant-ph/0111157v1.
All oscillator registers are full l² spaces. A continuous CW beam is a family
of finite-window states; no constant-amplitude vector on the whole real line is
postulated. Source-ambiguous operational claims are listed in the unit's
HARD.md and GAPS.json. The finite-data measurement instrument is constructed here.
-/
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)
/-- PDF p.1, Eq.(2): normalized uniform phase law on one period. -/
def phaseLaw : Measure ℝ :=
ENNReal.ofReal ((2 * Real.pi)⁻¹) • volume.restrict (Set.Ico 0 (2 * Real.pi))
/-- A trace-norm Bochner integral specified without imposing the operator norm
on trace class. Finite-range integrable approximants converge in L¹ nuclear
norm. Together with the bounded-operator integral identity this is the genuine
trace-class integral, rather than an entrywise or merely weak integral.
All nuclear norms are guarded by trace-class membership. PDF pp.1,3,5. -/
def TraceIntegral {A H : Type*} [MeasurableSpace A]
[NormedAddCommGroup H] [InnerProductSpace ℂ H] [CompleteSpace H]
(mu : Measure A) (f : A → (H →L[ℂ] H)) (X : H →L[ℂ] H) : Prop :=
Integrable f mu ∧ (∫ x, f x ∂mu) = X ∧ IsTraceClass X ∧
(∀ᵐ x ∂mu, IsTraceClass (f x)) ∧
∃ s : ℕ → A → (H →L[ℂ] H),
(∀ n, (Set.range (s n)).Finite ∧ Integrable (s n) mu ∧
(∀ᵐ x ∂mu, IsTraceClass (s n x) ∧ IsTraceClass (f x - s n x)) ∧
Integrable (fun x => nuclearTraceNorm (f x - s n x)) mu) ∧
Tendsto (fun n => ∫ x, nuclearTraceNorm (f x - s n x) ∂mu) atTop (nhds 0)
/-- PDF p.3: N distinguishable temporal packets, each with unbounded occupation. -/
abbrev PacketSpace (N : ℕ) := QAlgorithms.RealRegisters.Hilbert (Fin N → ℕ)
/-- Bounded operators on the full N-packet space. -/
abbrev PacketOperator (N : ℕ) := PacketSpace N →L[ℂ] PacketSpace N
/-- PDF p.3: the tensor occupation basis, including the scalar register N=0. -/
def packetBasis {N : ℕ} (m : Fin N → ℕ) : PacketSpace N := lp.single 2 m 1
/-- Exact matrix realization on the total orthonormal occupation basis. -/
def HasPacketMatrix {N : ℕ} (X : PacketOperator N)
(c : (Fin N → ℕ) → (Fin N → ℕ) → ℂ) : Prop :=
∀ m n, X (packetBasis n) m = c m n
/-- Many-packet bounded realization. Theorems assert realization, so the zero
fallback outside the bounded regime cannot furnish any physical conclusion. -/
def packetOperator {N : ℕ}
(c : (Fin N → ℕ) → (Fin N → ℕ) → ℂ) : PacketOperator N :=
if h : ∃ X : PacketOperator N, HasPacketMatrix X c then Classical.choose h else 0
/-- Positive, normalized trace-class N-packet density. PDF p.3, Eq.(13). -/
def IsPacketDensity {N : ℕ} (X : PacketOperator N) : Prop :=
IsTraceClass X ∧ ContinuousLinearMap.adjoint X = X ∧
(∀ v, 0 ≤ (inner (𝕜 := ℂ) v (X v)).re) ∧
Summable (fun n => X (packetBasis n) n) ∧ (∑' n, X (packetBasis n) n) = 1
/-- PDF p.3, Eqs.(10)–(12): product coherent coefficients in selected modes. -/
def packetCoefficients {N : ℕ} (z : Fin N → ℂ) (m : Fin N → ℕ) : ℂ :=
∏ i, coherentCoefficient (z i) (m i)
/-- Constructed full-Fock coherent product. Square summability and normalization
are conclusions below, never assumptions on these constructed vectors. -/
def packetCoherent {N : ℕ} (z : Fin N → ℂ) : PacketSpace N :=
if h : Memℓp (packetCoefficients z) 2 then ⟨packetCoefficients z, h⟩ else 0
/-- PDF p.3: projector of the constructed coherent product. -/
def packetProjector {N : ℕ} (z : Fin N → ℂ) : PacketOperator N :=
InnerProductSpace.rankOne ℂ (packetCoherent z) (packetCoherent z)
/-- PDF pp.3–5: full-Fock bounded realization of the accepted matrix tensor
power. Information100.P63.tensorPower works for arbitrary index types, so it
supplies the occupation coefficients at I=Nat. packetOperator additionally
realizes them on l²; the theorems conclude realization for density inputs. -/
def fullFockTensorPower (X : FockOperator) (N : ℕ) : PacketOperator N :=
packetOperator (QAlgorithms.Papers.Independent.Information100.P63.tensorPower N
(fun m n : ℕ => X (fockKet n) m))
/-- PDF p.3, Eq.(13): shared-phase finite-window family. -/
def commonPhase (a : ℝ) (N : ℕ) : PacketOperator N :=
∫ theta, packetProjector (fun _ : Fin N => (a : ℂ) * phase theta) ∂phaseLaw
/-- PDF pp.3–4: full-Fock partial trace discarding the last packet.
Unlike Gap48.P33.discardLast, whose discarded register has a Fintype instance,
this sums all natural occupations without a cutoff. Summability and bounded
realization are explicit conclusions in the beam theorem. -/
def discardLastPacket {N : ℕ} (X : PacketOperator (N + 1)) : PacketOperator N :=
packetOperator (fun m n => ∑' k : ℕ,
X (packetBasis (Fin.snoc n k)) (Fin.snoc m k))
/-- PDF p.4: permutation of packet factors, in occupation coordinates. -/
def permutePackets {N : ℕ} (s : Equiv.Perm (Fin N)) (X : PacketOperator N) :
PacketOperator N :=
packetOperator (fun m n => X (packetBasis (n ∘ s)) (m ∘ s))
/-- PDF p.3, Eq.(11), with tau=z0/c. Open endpoints have no L² effect. -/
def packetFunction (T tau : ℝ) (n : ℕ) (t : ℝ) : ℂ :=
if |t - tau - (n : ℝ) * T| < T / 2 then ((Real.sqrt T)⁻¹ : ℝ) else 0
/-- PDF pp.2–3: beta=sqrt(kappa)*alpha*exp(i phi), the ideal linear,
frequency-independent vacuum-input boundary condition, without phase noise,
amplitude noise or dissipation. The high-finesse, near-resonance and long-time
approximations specify this model; no quantitative physical error is asserted. -/
def cwAmplitude (kappa : ℝ) (alpha : ℂ) (phi : ℝ) : ℂ :=
(Real.sqrt kappa : ℂ) * alpha * phase phi
/-- PDF p.3, Eq.(10): actual mode projection, before simplifying the rectangle. -/
def cwPacketAmplitude (kappa T tau : ℝ) (alpha : ℂ) (phi : ℝ) (n : ℕ) : ℂ :=
∫ t in Set.Ioo (tau + (n : ℝ) * T - T / 2) (tau + (n : ℝ) * T + T / 2),
star (packetFunction T tau n t) * cwAmplitude kappa alpha phi
/-- PDF pp.2–3: constructed ideal vacuum-input CW output from the stationary
intracavity Poisson law, using its uniform phase ensemble and the computed
output projections. Each finite observed window is constructed separately. -/
def idealBeam (kappa T tau alpha : ℝ) (N : ℕ) : PacketOperator N :=
∫ phi, packetProjector (fun i : Fin N =>
cwPacketAmplitude kappa T tau (alpha : ℂ) phi i.val) ∂phaseLaw
/-- Single-packet rectangular modes in L²(R), restricted to a finite observation
window by the finite family used. No constant function on all R is a vector. -/
abbrev TemporalSpace := Lp ℂ 2 (volume : Measure ℝ)
/-- Eq.(11) as an L² vector. Membership and the representative identity are
concluded below, excluding the total-function fallback. -/
def temporalPacket (T tau : ℝ) (n : ℕ) : TemporalSpace :=
if h : MemLp (packetFunction T tau n) 2 volume then h.toLp _ else 0
/-- The finite-window coherent field's one-particle displacement, Eqs.(6),(10).
It is constant beta on the observed packet intervals and zero outside them. -/
def temporalField (kappa T tau : ℝ) (alpha : ℂ) (phi : ℝ) (N : ℕ) : TemporalSpace :=
∑ i : Fin N, ((Real.sqrt T : ℂ) * cwAmplitude kappa alpha phi) •
temporalPacket T tau i.val
/-- Eq.(10): projection onto any normalized discrete temporal mode. -/
def modeAmplitude (f g : TemporalSpace) : ℂ := inner (𝕜 := ℂ) f g
/-- Eq.(6) in a finite set of orthonormal modes: its coherent factor is
constructed from the one-particle projections, not from asserted output states. -/
def finiteModeVector {D : ℕ} (f : TemporalSpace) (modes : Fin D → TemporalSpace) :
PacketSpace D := packetCoherent (fun i => modeAmplitude (modes i) f)
/-- PDF p.5, Eqs.(22)–(23): an actual local finite-outcome quantum
measurement, allowing countably many Kraus operators per outcome. Completeness
is strong summation on the full Hilbert space, not an assumed posterior law.
Gap20.P09.LocalMeasurement instead requires a finite-dimensional input and
stores only POVM effects; it cannot describe this full-Fock Kraus instrument. -/
structure FockLocalInstrument (O : ℕ) where
kraus : Fin O → ℕ → FockOperator
complete : ∀ v : Fock, HasSum (fun j : Fin O × ℕ =>
(ContinuousLinearMap.adjoint (kraus j.1 j.2)) (kraus j.1 j.2 v)) v
/-- The selected outcome's computed effect, summing the internal Kraus index
and the output occupation. The theorem asserts bounded realization. -/
def localEffect {O : ℕ} (A : FockLocalInstrument O) (d : Fin O) : FockOperator :=
operatorOfMatrix (fun m n => ∑' k : ℕ × ℕ,
star (A.kraus d k.1 (fockKet m) k.2) * A.kraus d k.1 (fockKet n) k.2)
/-- Product Born likelihood for the observed string of individual-packet
measurements; no classical phase-readout instrument is presumed. -/
def packetLikelihood {K O : ℕ} (A : Fin K → FockLocalInstrument O)
(d : Fin K → Fin O) (a theta : ℝ) : ℝ :=
∏ i, (inner (𝕜 := ℂ) (coherentKet ((a : ℂ) * phase theta))
(localEffect (A i) (d i) (coherentKet ((a : ℂ) * phase theta)))).re
/-- The unconditional probability calculated from the input ensemble. -/
def packetEvidence {K O : ℕ} (A : Fin K → FockLocalInstrument O)
(d : Fin K → Fin O) (a : ℝ) : ℝ :=
∫ theta, packetLikelihood A d a theta ∂phaseLaw
/-- Tensor Kraus operator for the first K packets, identity on the further M.
The construction includes the actual local actions and does not touch the
unmeasured packets. Realization is asserted below, excluding the fallback. -/
def eventKraus {K O : ℕ} (M : ℕ) (A : Fin K → FockLocalInstrument O)
(d : Fin K → Fin O) (r : Fin K → ℕ) : PacketOperator (K + M) :=
packetOperator (fun m n =>
if (m ∘ Fin.natAdd K) = (n ∘ Fin.natAdd K) then
∏ i : Fin K, (A i).kraus (d i) (r i)
(fockKet (n (Fin.castAdd M i))) (m (Fin.castAdd M i)) else 0)
/-- One internal branch of the observed string's actual instrument. -/
def eventTerm {K O : ℕ} (M : ℕ) (A : Fin K → FockLocalInstrument O)
(d : Fin K → Fin O) (a : ℝ) (r : Fin K → ℕ) : PacketOperator (K + M) :=
((eventKraus M A d r).comp (commonPhase a (K + M))).comp
(ContinuousLinearMap.adjoint (eventKraus M A d r))
/-- Unnormalized quantum state after the selected outcome, before discarding
measured packets. Trace-norm summability is a theorem conclusion. -/
def eventOutput {K O : ℕ} (M : ℕ) (A : Fin K → FockLocalInstrument O)
(d : Fin K → Fin O) (a : ℝ) : PacketOperator (K + M) :=
∑' r : Fin K → ℕ, eventTerm M A d a r
/-- Partial trace of the first K packets, leaving the last M. -/
def discardPrefix (K M : ℕ) (X : PacketOperator (K + M)) : PacketOperator M :=
packetOperator (fun m n => ∑' q : Fin K → ℕ,
X (packetBasis (Fin.append q n)) (Fin.append q m))
/-- Unnormalized residual computed from the instrument, not a Bayesian
identity assumed as input. PDF p.5. -/
def packetResidual {K O : ℕ} (M : ℕ) (A : Fin K → FockLocalInstrument O)
(d : Fin K → Fin O) (a : ℝ) : PacketOperator M :=
discardPrefix K M (eventOutput M A d a)
/-- Bayesian phase law with RN derivative L/Z. Only positive-evidence use is
asserted below; division at Z=0 cannot supply a posterior density. -/
def posteriorPhaseLaw {K O : ℕ} (A : Fin K → FockLocalInstrument O)
(d : Fin K → Fin O) (a : ℝ) : Measure ℝ :=
phaseLaw.withDensity (fun theta =>
ENNReal.ofReal (packetLikelihood A d a theta / packetEvidence A d a))
/-- PDF p.5: lossless equal N-port splitter; the Fourier unitary's first column
is real positive, fixing the compensable output port phases. N>=1 is required
by the theorem; the N=0 division fallback is never used. -/
def equalSplitter (N : ℕ) : Matrix (Fin N) (Fin N) ℂ :=
fun j k => ((Real.sqrt (N : ℝ))⁻¹ : ℝ) *
phase (2 * Real.pi * (j.val : ℝ) * (k.val : ℝ) / (N : ℝ))
/-- First-input-column second quantization of the constructed equal splitter:
expand (sum_j a_j†/sqrt(N))^m/sqrt(m!). No photon cutoff. PDF p.5, Eq.(25). -/
def splitNumberCoefficients (N m : ℕ) (q : Fin N → ℕ) : ℂ :=
if ∑ j, q j = m then
(Real.sqrt (Nat.factorial m : ℝ) /
(Real.sqrt (∏ j, (Nat.factorial (q j) : ℝ)) * Real.sqrt (N : ℝ) ^ m) : ℝ)
else 0
/-- The finite-photon input is sent to its explicitly expanded output vector. -/
def splitNumber (N m : ℕ) : PacketSpace N :=
if h : Memℓp (splitNumberCoefficients N m) 2 then ⟨splitNumberCoefficients N m, h⟩ else 0
/-- Equal splitting of a coherent input is constructed by linearity on its
number expansion, rather than defined to be the desired coherent product. -/
def splitCoherent (N : ℕ) (alpha : ℂ) : PacketSpace N :=
∑' m : ℕ, coherentCoefficient alpha m • splitNumber N m
/-- Phase-averaged fixed-total-energy spatial beam. PDF p.5, §IIE. -/
def spatialBeam (alpha : ℝ) (N : ℕ) : PacketOperator N :=
∫ theta, InnerProductSpace.rankOne ℂ
(splitCoherent N ((alpha : ℂ) * phase theta))
(splitCoherent N ((alpha : ℂ) * phase theta)) ∂phaseLaw
/-- PDF p.7, Eq.(32): finite occupation core for the pump and signal. -/
abbrev DownCore := (ℕ × ℕ) →₀ ℂ
/-- The conserved weighted number on the common finite-occupation core. -/
def weightedNumber (v : DownCore) : DownCore :=
v.sum (fun q c => Finsupp.single q (((2 * q.1 + q.2 : ℕ) : ℂ) * c))
/-- Exact cubic Hamiltonian on the core. Both lowering boundaries are guarded;
this is not a bounded annihilation operator on the full Fock space. -/
def downHamiltonian (chi : ℝ) (v : DownCore) : DownCore :=
v.sum (fun q c =>
(if 2 ≤ q.2 then Finsupp.single (q.1 + 1, q.2 - 2)
(c * (chi : ℂ) * (Real.sqrt
(((q.1 + 1) : ℝ) * (q.2 : ℝ) * ((q.2 - 1 : ℕ) : ℝ)) : ℂ)) else 0) +
(if 1 ≤ q.1 then Finsupp.single (q.1 - 1, q.2 + 2)
(c * (chi : ℂ) * (Real.sqrt
((q.1 : ℝ) * ((q.2 + 1) : ℝ) * ((q.2 + 2) : ℝ)) : ℂ)) else 0))
/-- The invariant weighted-number-w block, indexed by pump occupation j and
signal occupation w-2j. PDF p.7, following Eq.(32). -/
def downBlock (chi : ℝ) (w : ℕ) : Matrix (Fin (w / 2 + 1)) (Fin (w / 2 + 1)) ℂ :=
fun i j =>
if i.val = j.val + 1 then
((chi * Real.sqrt (((j.val + 1 : ℕ) : ℝ) * ((w - 2 * j.val : ℕ) : ℝ) *
((w - 2 * j.val - 1 : ℕ) : ℝ))) : ℝ)
else if j.val = i.val + 1 then
((chi * Real.sqrt (((i.val + 1 : ℕ) : ℝ) * ((w - 2 * i.val : ℕ) : ℝ) *
((w - 2 * i.val - 1 : ℕ) : ℝ))) : ℝ)
else 0
/-- Exact Schroedinger evolution in each finite invariant block, hbar=1. -/
def downBlockEvolution (chi t : ℝ) (w : ℕ) :=
NormedSpace.exp ((-Complex.I * (t : ℂ)) • downBlock chi w)
/-- Direct-sum evolution coefficients, a finite sum at every output occupation.
This constructs dynamics on arbitrary full two-mode vectors. -/
def downCoefficients (chi t : ℝ) (v : BipartiteFock) (q : ℕ × ℕ) : ℂ :=
let w := 2 * q.1 + q.2
∑ j : Fin (w / 2 + 1),
downBlockEvolution chi t w ⟨q.1, by dsimp [w]; omega⟩ j *
v (j.val, w - 2 * j.val)
/-- Full-space evolution. Its coefficient realization and unitary extension
are conclusions, so square summability is never assumed as output data. -/
def downEvolution (chi t : ℝ) (v : BipartiteFock) : BipartiteFock :=
if h : Memℓp (downCoefficients chi t v) 2 then ⟨downCoefficients chi t v, h⟩ else 0
/-- Evolved |m,0>, with vacuum in the signal input. -/
def evolvedPumpNumber (chi t : ℝ) (m : ℕ) : BipartiteFock :=
downEvolution chi t (bipartiteKet (m, 0))
/-- Computed signal matrix after tracing out the pump, for an arbitrary initial
pump probability law p. The theorem guards p's normalization and all series. -/
def signalMatrix (p : ℕ → ℝ) (chi t : ℝ) (n l : ℕ) : ℂ :=
∑' k : ℕ × ℕ, (p k.1 : ℂ) * evolvedPumpNumber chi t k.1 (k.2, n) *
star (evolvedPumpNumber chi t k.1 (k.2, l))
/-- Reduced signal operator built from the dynamics and the partial trace. -/
def signalOutput (p : ℕ → ℝ) (chi t : ℝ) : FockOperator :=
operatorOfMatrix (signalMatrix p chi t)
/-! Sanity checks of local constructions; none is an admitted normalization proof. -/
example : phase 0 = 1 := by simp [phase]
-- Zero packets have the same scalar tensor power for every one-mode input.
example (X Y : FockOperator) : fullFockTensorPower X 0 = fullFockTensorPower Y 0 := by
unfold fullFockTensorPower
apply congrArg (packetOperator (N := 0))
funext m n
simp [QAlgorithms.Papers.Independent.Information100.P63.tensorPower]
example (m : Fin 0 → ℕ) : packetCoefficients (fun _ : Fin 0 => (0 : ℂ)) m = 1 := by
simp [packetCoefficients]
example (T tau : ℝ) (hT : 0 < T) (n : ℕ) :
packetFunction T tau n (tau + (n : ℝ) * T) = ((Real.sqrt T)⁻¹ : ℝ) := by
simp [packetFunction, show (0 : ℝ) < T / 2 by linarith]
example (kappa T tau : ℝ) (alpha : ℂ) (phi : ℝ) :
temporalField kappa T tau alpha phi 0 = 0 := by simp [temporalField]
example : splitNumberCoefficients 1 0 (fun _ => 0) = 1 := by
simp [splitNumberCoefficients]
example {O : ℕ} (A : Fin 0 → FockLocalInstrument O) (d : Fin 0 → Fin O)
(a theta : ℝ) : packetLikelihood A d a theta = 1 := by
simp [packetLikelihood]
example : weightedNumber 0 = 0 := by simp [weightedNumber]
example (chi : ℝ) : downHamiltonian chi 0 = 0 := by simp [downHamiltonian]
example (chi : ℝ) : downBlock chi 0 = 0 := by
ext i j
have hi : i.val = 0 := by
have := i.isLt
omega
have hj : j.val = 0 := by
have := j.isLt
omega
simp [downBlock, hi, hj]
end QAlgorithms.Papers.Independent.Intakenext100.P33
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
QAlgorithms.Papers.Independent.Intakenext100.P33.DownCore
This is an abbreviation for the complex vector space of finitely supported functions : each such function is zero outside a finite set of pairs of natural numbers, including pairs with either or both coordinates zero.
QAlgorithms.Papers.Independent.Intakenext100.P33.FockLocalInstrument
For a natural number , a local instrument consists of bounded complex-linear operators on , indexed by and , together with the requirement that, for every ,
Here the sum means convergence in the norm of of the net of finite partial sums, and is the Hilbert-space adjoint. This requirement is on vectors; it does not state convergence of the operator sum in operator norm. The parameter is allowed syntactically to be zero, but then the sum is empty and the requirement would say for every , so no such instrument exists.
QAlgorithms.Papers.Independent.Intakenext100.P33.HasPacketMatrix
For every natural number , bounded complex-linear operator on , and function , the predicate means that
where has coordinate at and elsewhere. Thus the first argument of is the output coordinate and the second is the input basis index. For , this is a single scalar equality.
QAlgorithms.Papers.Independent.Intakenext100.P33.IsPacketDensity
For every natural number and bounded complex-linear operator on , means that there exist sequences with and in operator norm, that , that for every vector , and that the complex diagonal family is summable with sum :
where is the coordinate vector supported at . The summability requirement is explicit, and the displayed equality is an equality in . The zero operator does not satisfy the sum requirement. The case is included, when this sum has one term and requires the single matrix entry to be .
QAlgorithms.Papers.Independent.Intakenext100.P33.PacketOperator
For every natural number , is the space of continuous complex-linear maps from to itself, equivalently bounded complex-linear operators on that Hilbert space. No positivity, normalization, or trace-class condition is part of this abbreviation. When , the underlying Hilbert space has one coordinate, indexed by the empty tuple.
QAlgorithms.Papers.Independent.Intakenext100.P33.PacketSpace
For every natural number , is the complex Hilbert space : its vectors are functions , more conventionally written , satisfying , with the usual norm. The case is included: there is exactly one empty occupation tuple, so this space has one complex coordinate.
QAlgorithms.Papers.Independent.Intakenext100.P33.TemporalSpace
This abbreviation denotes , the space of equivalence classes, modulo equality Lebesgue-almost everywhere, of almost-everywhere strongly measurable complex-valued functions whose squared absolute values have finite Lebesgue integral. Its norm is ; no restriction on the support of its elements is imposed.
QAlgorithms.Papers.Independent.Intakenext100.P33.TraceIntegral
Let be any measurable space, let be a complete normed additive commutative group with a compatible complex inner product, let be a measure on , let assign to each a bounded complex-linear operator on , and let be such an operator. The predicate means that is Bochner integrable in operator norm, , is trace class in the following specified sense, is trace class for -almost every , and there exists a sequence , indexed by all including , such that each has finite range and is Bochner integrable, both and are trace class for almost every , the real function is integrable, and
Here an operator is called trace class precisely when there exist sequences with and , where this operator series converges in operator norm; is the real infimum of all values from such expansions. This definition of is total, with value when the set of expansions is empty. No finiteness or probability assumption is imposed on , and finite range for is required separately from its integrability.
QAlgorithms.Papers.Independent.Intakenext100.P33.commonPhase
For every real and natural number , including , this defines an operator on by
Here means the functions from to , and is the vector with coefficients
if this coefficient function belongs to , and is the zero vector otherwise. The rank-one operator sends to , and the integral is the Bochner integral in the space of bounded complex-linear operators on . There is no sign restriction on ; for , the coefficient product is the empty product .
QAlgorithms.Papers.Independent.Intakenext100.P33.cwAmplitude
For every real , complex , and real , this defines the complex number
There are no positivity or normalization assumptions. The square root is the real square root embedded in , so the value is zero whenever .
QAlgorithms.Papers.Independent.Intakenext100.P33.cwPacketAmplitude
For arbitrary real numbers , every complex , and every natural number , this defines
where the integral is with respect to Lebesgue measure restricted to the open interval between the displayed endpoints, and equals when , and zero otherwise. No positivity assumptions are imposed on or . If , that open interval is empty and the value is zero; if , the amplitude factor is zero. For , the value is , independent of and .
QAlgorithms.Papers.Independent.Intakenext100.P33.discardLastPacket
For every natural number , including , and every bounded complex-linear operator on , this defines a bounded complex-linear operator on by the following selection rule: if there exists such an operator satisfying, for every ,
one such is chosen; if no such bounded operator exists, the result is zero. Here is the coordinate vector equal to at and zero elsewhere, and appends as the last coordinate. No positivity, density, trace-class, or summability hypothesis is imposed on ; the displayed infinite sum is the total complex-valued sum, which is defined as zero when the summand family is not summable.
QAlgorithms.Papers.Independent.Intakenext100.P33.discardPrefix
For arbitrary natural numbers and an arbitrary bounded complex-linear operator on , form the matrix indexed by ,
where means concatenation and is the coordinate basis vector. Discarding the prefix returns a classically selected bounded operator on satisfying for every , if one exists, and the zero operator otherwise. Each complex sum is assigned zero when its family is not summable; no trace-class, positivity, or summability condition on is assumed. When , the sum has one term and the returned operator is . When , the target is the one-dimensional space indexed by the unique empty tuple, and its single prescribed entry is , with the same total-sum convention.
QAlgorithms.Papers.Independent.Intakenext100.P33.downBlock
For every real number and natural number , this defines a complex matrix with rows and columns indexed by , whose entries are
Each subtraction inside a square root is performed in the natural numbers and is truncated at zero before conversion to ; the resulting real coefficient is then included in . The parameter is unrestricted. For or , the matrix is a zero matrix.
QAlgorithms.Papers.Independent.Intakenext100.P33.downBlockEvolution
For arbitrary real numbers and natural number , this defines the complex matrix
where is the matrix exponential, has equal entries
and all other entries are zero. The subtractions in these coefficients are natural-number subtractions truncated at zero before conversion to real numbers. Neither nor has a sign restriction; and give the identity matrix.
QAlgorithms.Papers.Independent.Intakenext100.P33.downCoefficients
For every pair of real numbers , every square-summable function , and every pair , this defines a complex number by setting and taking
Here is indexed by , has adjacent entries
and has all other entries zero. Every subtraction involving natural numbers is truncated at zero; the index bounds ensure , and . No normalization of or sign restriction on is assumed, and is included.
QAlgorithms.Papers.Independent.Intakenext100.P33.downEvolution
For arbitrary real numbers and , define a coordinate function by
where is indexed by , its adjacent entries are
and all its other entries are zero. This definition returns the vector with coordinates if is square summable, and returns the zero vector otherwise. All natural-number subtractions are truncated at zero before conversion where needed. The input need not be normalized, may be any real numbers, and zero occupations are included.
QAlgorithms.Papers.Independent.Intakenext100.P33.downHamiltonian
For every real number and finitely supported function , this defines the finitely supported function
where is the function equal to one at and zero elsewhere, and the real coefficients are included in . The subtractions are natural-number subtractions, truncated at zero, although the guards ensure that the subtractions in the included terms do not underflow. There is no restriction on the sign of ; , , and all boundary occupations are included.
QAlgorithms.Papers.Independent.Intakenext100.P33.equalSplitter
For every natural number , the equal splitter is the complex matrix whose row and column indices are and whose entries are
The square root and divisions in this formula are real operations before the indicated values are regarded as complex numbers. No positivity assumption on or unitarity assertion is included. For , this is the empty matrix and there are no entries; real inversion and division by zero are nevertheless defined to return zero in the underlying formula.
QAlgorithms.Papers.Independent.Intakenext100.P33.eventKraus
Let . For each , let be bounded operators on satisfying in norm over finite partial sums for every , and choose and . On , with coordinate basis vectors , prescribe the matrix
for all , where is the coordinate basis vector of . The event operator is a classically selected bounded complex-linear operator satisfying for every pair of indices, if one exists, and zero otherwise. When , the condition on the last coordinates is vacuous. When , the product is one and the prescribed matrix is the identity matrix, so the event operator is the identity on . No positive lower bound on , , or is assumed, though permits none of the required data.
QAlgorithms.Papers.Independent.Intakenext100.P33.eventOutput
Let , , and let , for , be bounded operators on satisfying in norm over finite partial sums for every and ; choose outcomes . Put . For each , let be a classically selected bounded operator on with matrix entries when agree in their last coordinates, and zero otherwise, using the zero operator if no such operator exists. Let be the vector with coordinates when this function is square-summable, and zero otherwise, and set , with the integral assigned zero if not Bochner-integrable. The event output is
where the sum is taken in the operator-norm topology and is assigned the zero operator if the family is not summable. No summability, trace, or normalization conclusion is part of this definition. For , the index set contains one empty tuple and is the identity, so the output is ; is also allowed.
QAlgorithms.Papers.Independent.Intakenext100.P33.eventTerm
Let , , and let , for , be bounded operators on satisfying in norm over finite partial sums for every and ; choose and . Put , and let be the classically selected bounded operator on whose -entry is when for all , and zero otherwise; if no such bounded operator exists, set . For every real , let have coordinates
if this coordinate function is square-summable, and let otherwise. Define
where sends to , and the integral is the bounded-operator-valued Bochner integral, assigned zero if not integrable. The event term is exactly . The definition imposes no positivity, normalization, or integrability hypotheses beyond the instrument completeness condition; is unrestricted, empty products are one, and all the natural-number parameters may be zero when the required data exist.
QAlgorithms.Papers.Independent.Intakenext100.P33.evolvedPumpNumber
For every real and natural number , this defines a vector in by applying the following construction to the coordinate vector that is one at and zero elsewhere: form
and return the vector with these coordinates if they are square summable, or the zero vector otherwise. Here has indices , adjacent entries
and all other entries zero; natural-number subtractions are truncated at zero. The definition includes and arbitrary signs or zero values of .
QAlgorithms.Papers.Independent.Intakenext100.P33.finiteModeVector
For every natural number , every , and every indexed family in that space, set
This defines a vector in whose coefficient at is
if this coefficient function belongs to , and defines the zero vector otherwise. No normalization, orthogonality, or linear independence is assumed for or the family . The case is included, with an empty coefficient product equal to .
QAlgorithms.Papers.Independent.Intakenext100.P33.fullFockTensorPower
For every bounded complex-linear operator on and every natural number , is obtained from the matrix
where has coordinate at and elsewhere: if a bounded complex-linear operator on exists with for every , the definition selects such an operator by classical choice, and otherwise it returns the zero operator. No trace-class, positivity, or normalization hypothesis is imposed on . For , the product is empty and equals , so the construction gives the identity on the one-coordinate space indexed by the empty tuple.
QAlgorithms.Papers.Independent.Intakenext100.P33.idealBeam
For arbitrary real numbers and every natural number , including , this defines a bounded complex-linear operator on by
For each , set
Then has coefficient at , provided this coefficient function is square-summable, and is zero otherwise. The operator sends to , and the outer integral is the operator-valued Bochner integral. In particular, all are zero if or ; for , the coefficient product is . The parameter is real here, with no sign restriction.
QAlgorithms.Papers.Independent.Intakenext100.P33.localEffect
Let , let be a family of bounded complex-linear operators on satisfying in norm over finite partial sums for every , and choose . Writing for the sequence equal to one at and zero elsewhere, form the complex matrix
The local effect is a classically selected bounded complex-linear operator on satisfying for every , if such an operator exists; otherwise it is the zero operator. Each displayed infinite sum is the total topological sum in , which is zero if its summand family is not summable. The definition itself supplies no summability or matrix-realization assertion. Choosing excludes .
QAlgorithms.Papers.Independent.Intakenext100.P33.modeAmplitude
For arbitrary , this defines their complex inner product, conjugate-linear in the first argument:
The formula is independent of the representatives of the almost-everywhere equivalence classes. Neither function is required to have norm one or to be nonzero.
QAlgorithms.Papers.Independent.Intakenext100.P33.packetBasis
For every natural number and every occupation tuple , is the vector whose coordinate at is and whose coordinates at every other tuple are . For , is the unique empty tuple and this is the sole coordinate basis vector.
QAlgorithms.Papers.Independent.Intakenext100.P33.packetCoefficients
For every natural number , complex tuple , and occupation tuple , the coefficient is
with real exponential and square-root values regarded as complex numbers. All nonnegative occupations are included; in particular and zeroth powers have value , including . For , the empty product is .
QAlgorithms.Papers.Independent.Intakenext100.P33.packetCoherent
For every natural number and complex tuple , define
The vector is the vector with coordinates if that coordinate function is square summable; otherwise it is the zero vector. This definition makes no separate assertion of unit norm. Zeroth powers, including , equal ; for , the coefficient function has one coordinate equal to the empty product , so the square-summable branch gives that one-coordinate vector.
QAlgorithms.Papers.Independent.Intakenext100.P33.packetEvidence
Let , let , and for each let be bounded operators on satisfying in norm over finite partial sums for every ; choose outcomes . For , let be a classically selected vector in with coordinates , if one exists, and zero otherwise. Let be the classically selected bounded operator with entries , if such an operator exists, and zero otherwise; the complex sums are assigned zero when nonsummable. The packet evidence is
This is the total real Bochner integral, assigned zero if the integrand is not integrable; the definition asserts neither integrability nor positive evidence. The real parameter may be zero or negative. For , the integrand and evidence are both one, and no instruments or outcomes are needed.
QAlgorithms.Papers.Independent.Intakenext100.P33.packetFunction
For arbitrary real numbers and every natural number , including , this defines the complex-valued function
where the first value is a real number embedded in . The support condition is strict, so both endpoints are assigned zero. No assumption is made: when , the condition is impossible and the function is identically zero. Real square root and reciprocal are total operations, with square root zero for nonpositive inputs and reciprocal of zero equal to zero.
QAlgorithms.Papers.Independent.Intakenext100.P33.packetLikelihood
Let . For every , let be bounded complex-linear operators on satisfying in norm over finite partial sums for every , and let . For arbitrary real , set . Define to be a classically selected vector with coordinates
if a vector with all these coordinates exists in , and zero otherwise. For each , let be a classically selected bounded operator with matrix entries
if such an operator exists, and zero otherwise, where is the coordinate basis vector and a nonsummable complex sum is assigned zero. The packet likelihood is the real number
No restriction on or , nor any positivity or normalization assertion for this product, is included in the definition. When , the product is one; when and , the required instruments and outcome function cannot be supplied.
QAlgorithms.Papers.Independent.Intakenext100.P33.packetOperator
For every natural number and function , is defined by a conditional choice: if there exists a bounded complex-linear operator on satisfying for every pair of occupation tuples , it selects such an operator by classical choice; if no such operator exists, it returns the zero operator. Here is the vector supported at with value . Consequently the definition does not itself assume that an arbitrary supplied matrix is realizable by a bounded operator. For , there is one empty tuple, and the construction selects the scalar operator with the specified single matrix entry.
QAlgorithms.Papers.Independent.Intakenext100.P33.packetProjector
For every natural number and complex tuple , is the bounded complex-linear operator
where has coordinates if this coordinate function is square summable, and is the zero vector otherwise. The definition is this outer-product construction and does not separately require to have norm ; if its defining fallback gives zero, the resulting operator is zero. For , the empty-product vector has its sole coordinate equal to , and the resulting operator is the identity on the one-coordinate space.
QAlgorithms.Papers.Independent.Intakenext100.P33.packetResidual
Let , , and let , for , be bounded operators on satisfying in norm over finite partial sums for every ; choose . Put . On , for each , let be a classically selected bounded operator with entries when agree in their last coordinates, and zero otherwise, taking if the prescribed matrix has no bounded realization. Let have coordinates if square-summable, and be zero otherwise; let , taking if this Bochner integral is not integrable, and let , taking if this family is not summable in operator norm. The packet residual is a classically selected bounded operator on with entries
if such an operator exists, and zero otherwise; nonsummable complex sums are assigned zero. Here and are coordinate basis vectors and concatenation joins the first and last coordinates. This definition includes no division by evidence and no normalization assertion. Empty tuples and products are included, so returns as defined by the same integral, and gives an operator on a one-dimensional space.
QAlgorithms.Papers.Independent.Intakenext100.P33.permutePackets
For every natural number , every permutation of , and every bounded complex-linear operator on , this defines an operator by choosing a bounded complex-linear operator on satisfying
if such an operator exists, and returning zero otherwise. Here is the coordinate vector at , and , with the same convention for . No condition on beyond bounded complex-linearity is required. The definition includes , when there is only the empty coordinate tuple and its unique permutation.
QAlgorithms.Papers.Independent.Intakenext100.P33.phaseLaw
The measure on is Lebesgue measure restricted to the half-open interval , multiplied by . Thus, for a measurable set , its measure is ; the endpoint is included in the restriction and is excluded.
QAlgorithms.Papers.Independent.Intakenext100.P33.posteriorPhaseLaw
Let , , and for each let be bounded operators on satisfying in norm over finite partial sums for every ; choose . Let be a classically selected vector with coordinates if one exists in , and zero otherwise. Let be a classically selected bounded operator with entries , or zero if no bounded realization exists, assigning zero to nonsummable complex sums. Write
where the real integral is assigned zero if not integrable. With , the posterior phase law is the measure obtained by giving the nonnegative extended-real density
There is no hypothesis that , that this density is measurable, or that the resulting measure is a probability measure. Real division is total: if , every ratio is zero and the resulting measure is zero. If , then and the resulting measure is .
QAlgorithms.Papers.Independent.Intakenext100.P33.signalMatrix
For every function , arbitrary real numbers , and natural numbers , this defines the complex matrix entry
For each , the vector is obtained from
by taking if is square summable and otherwise; is indexed by , has adjacent entries
and has all other entries zero, with natural-number subtractions truncated at zero. The outer sum is the complex sum over finite subsets of , assigned zero if that family is not summable. There is no assumption that is nonnegative, normalized, or summable, and the indices may all be zero.
QAlgorithms.Papers.Independent.Intakenext100.P33.signalOutput
For arbitrary functions and arbitrary real numbers , this defines a bounded complex linear operator on . Let denote the standard basis of , and let denote the standard basis of . For each , define the matrix , indexed by , by
where subtraction inside these natural-number factors is truncated at zero, and put . For , form
Let be the vector with these coefficients if this coefficient function is square summable, and let it be zero otherwise; set . The operator being defined is a selected bounded operator satisfying
if such an operator exists, and is the zero operator otherwise. The infinite sum is the totalized complex sum, which is zero when the family is not summable. No nonnegativity, summability, or normalization assumption is imposed on , and neither existence of an operator with the displayed matrix nor any density property is asserted by this definition.
QAlgorithms.Papers.Independent.Intakenext100.P33.spatialBeam
For every real number and natural number , this defines a bounded complex-linear operator on by
using Lebesgue measure restricted to the indicated half-open interval. Here
with replaced by zero if its coordinate function is not square summable, and with the sum defining assigned zero if it is not summable in Hilbert-space norm over finite subsets. The integral is the Bochner integral in the space of bounded operators and is assigned zero if its integrand is not integrable. Both and are included, as are negative ; empty sums and products have values zero and one, , and division by zero has value zero.
QAlgorithms.Papers.Independent.Intakenext100.P33.splitCoherent
For every natural number and complex number , this defines a vector in by
where, separately for each , is replaced by the zero vector if the displayed coordinate function is not square summable. The outer sum is the Hilbert-space sum obtained as the norm limit over finite subsets of , and its value is defined to be zero if that family is not summable. The definition includes and ; empty sums and products have values zero and one respectively, , and division by zero has value zero.
QAlgorithms.Papers.Independent.Intakenext100.P33.splitNumber
For arbitrary natural numbers , this defines a vector in , where an occupation label is a function . Define
The defined vector has coordinates if these coordinates are square summable, and is the zero vector otherwise. All square roots and divisions in this formula are taken in , followed by inclusion in ; division by zero has value zero. The definition includes and , with empty sums equal to zero, empty products equal to one, and . In particular, for the occupation-label set is a singleton, and the sole coordinate is one when and zero when .
QAlgorithms.Papers.Independent.Intakenext100.P33.splitNumberCoefficients
For arbitrary natural numbers and a tuple , the split-number coefficient is the complex number obtained from the real expression
No square-summability or normalization claim accompanies this definition. Empty sums are zero, empty products are one, and zeroth powers, including , are one. Consequently, for the unique empty tuple has coefficient one when and zero when ; for any , when , the zero tuple has coefficient one and every other tuple has coefficient zero.
QAlgorithms.Papers.Independent.Intakenext100.P33.temporalField
For arbitrary real , every complex , and every natural number , this defines the element
Here means the class of if it satisfies the membership condition, and zero otherwise, exactly as in the defining selection rule. No positivity or normalization hypotheses are imposed. The sum is zero for , for , or for .
QAlgorithms.Papers.Independent.Intakenext100.P33.temporalPacket
For arbitrary real and every natural number , this defines an element of as follows: form
If satisfies the membership condition—almost-everywhere strong measurability and finite seminorm—the result is its equivalence class modulo almost-everywhere equality; otherwise the result is the zero element. No assumption is required. When , the strict support condition is impossible, so the result is the zero class; endpoint values are also zero.
QAlgorithms.Papers.Independent.Intakenext100.P33.weightedNumber
For every finitely supported function , this defines another finitely supported function by multiplying each coordinate by its natural-number weight:
where is included in . Equivalently, it sums over the finite support of , where is one at and zero elsewhere. This includes the zero function and the coordinate , whose multiplier is zero.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.