Dynamic Boundary Insertion, Detector Memory, and Pre-Latch Trigger Sinks in Wave--Detector Systems
This is a reader-facing guide to the paper: what it is for, where it sits in the 70-entry parent-and-companion release,
what the manuscript abstract says, and what not to over-read from the web page.
Claim authority. The manuscript remains the authority for definitions, assumptions,
derivations, and exclusions. This guide explains the route into the paper.
Plain reading map
What to use this paper for.
Role in the series
Common propagation classes, event statistics, detector-local commit, readout, and shared-fact records.
Use this block to follow the path from propagation to accessible events, local commit, readout, records, and shared-fact criteria.
Read it for
Where propagation stops and detector-local event closure begins.
Which certificates or windows are required before a record-like claim is admissible.
How recoverability, readout, irreversibility, and objectivity are kept as distinct layers.
Keep separate
Accessible phase statistics versus durable records.
Detector-local commit versus objectivity or shared fact status.
Protocol-level diagnostics versus microscopic detector derivations.
Manuscript-based orientation
What the manuscript says this paper establishes.
Within the covariant CHC framework, a detector boundary is modeled as a dynamically inserted interface inside an already propagating wave field. On a declared detector tube, the baseline pre-latch closure uses a real insertion potential, one detector-memory field, and a positive trigger sink : the displayed equation in the manuscript The insertion potential is conservative and localized in the detector tube, the sink yields the nonnegative pre-latch trigger current the displayed equation in the manuscript and the memory source is generated by the pullback of the declared propagation density-current pair to the tube. The archived manuscript remains authoritative for exact notation, equations, assumptions, and exclusions.
Open source-excerpt note
This web guide uses a reader-safe rendering of the manuscript abstract. The manuscript PDF and
canonical archive remain authoritative for exact notation, equations, definitions, and exclusions.
Manuscript structure
Open the paper by section.
13 manuscript sections indexed.
These links jump into a source-derived web reader generated from the canonical TeX manuscript.
Use the Zenodo PDF for exact equations, figures, tables, and final citation authority.
Reader boundary. This HTML reader is generated from 06_CHC-DBC_Dynamic_Boundary_Insertion_Detector_Memory_and_Pre_Latch_Trigger_Sinks_in_Wave_Detector_Systems.tex.
It is optimized for navigation and search; the DOI archive controls over any web rendering difference.
Detector-side dynamics are now directly resolvable in several platform classes. Spatially resolved detector tomography reconstructs local response maps in single-atom detectors [citation], time-resolved single-shot parity measurements are implemented in interferometric semiconductor devices [citation], single-electron interferometers resolve time-dependent fields through phase and contrast on picosecond scales [citation], and superconducting thermal or microwave detectors make readout duration, thresholding, and internal loss channels experimentally visible [citation]. On the formal side, absorbing-boundary and detector-surface laws treat the time and place of detection as outputs of a boundary rule rather than as externally appended statistics [citation], while process-tensor tomography, hidden-model reconstruction from multiple time measurements, Lindblad-like tomography of non-Markovian dynamical maps, and multi-time tomography resolve detector-relevant memory directly on controlled hardware [citation]. Related detector-side distinctions between arrival times and detection times are analyzed in recent absorbing-boundary work [citation].
On activated detector-family windows with visible switching, scanning, or finite detector bandwidth, admissible pre-latch closure must preserve bulk propagation away from the detector tube, represent reversible near-boundary reorganization before irreversible counting, store finite short-window memory in the detector tube, produce a nonnegative trigger current, reduce correctly to instantaneous local opening when detector memory is removed, and remain causally compatible with any later durable-record stage. Within the declared first-order local pre-latch class, these constraints select the minimal admissible detector-tube closure: a real insertion potential, one detector-memory field, and a positive trigger sink on the declared pre-latch window. On a certified one-pole detector-family window, the same three-sector law admits a compressed response reading in which the conservative insertion and positive trigger sectors are the dispersive and absorptive faces of one retarded detector-boundary susceptibility, while the detector-memory coordinate is its dominant local mode [citation]. That reduced reading is admitted only after residual control against the reconstructed detector-tube response on the declared operating band. Recent detector-characterization studies and reporting standards now quantify mid-circuit measurement error rates, precision bounds for detector estimation, and family-fixed benchmarking requirements directly on hardware or declared protocol windows [citation]. Fixed-surface absorbing-boundary laws and static detector tomography enter only through the recovery limits of reference, and any later durable-record description may depend on the present layer only through Jtr\Jtr or an admitted causal coarse-graining of it. No latching, reset, or objectivity claim is made here.
Let Γ(t)\Gam(t) be the active detector interface. The detector enters the wave law through a real tube-localized insertion potential UΓ\Ug, a detector-memory field M\Mmem, and a positive pre-latch trigger sink KΓ\Kg. The real insertion term reorganizes near-boundary propagation without by itself generating counts. The memory field stores the short-lived persistence of that detector-conditioned state. The sink converts a controlled fraction of the boundary-conditioned wave structure into a nonnegative trigger current. Within the declared detector tube window, the three sectors are selected at baseline order by the simultaneous requirements of reversible reorganization, finite lag, trigger production, instantaneous-opening recovery, and later durable-record admissibility. On certified one-pole windows, the memory field is the dominant local coordinate of the detector-tube response.
The source of the detector-memory field is fixed before fitting observables. Under locality on the detector tube, phase-offset invariance, first-order truncation, and isotropic scalar reduction, the pullback of the propagation density-current pair to the moving detector tube yields a four-channel baseline source basis: incoming normal flux, gate-density, insertion-rate density, and scan-gradient coupling. This pullback closes the declared lowest-order source baseline within the declared isotropic first-order scalar class.
Three recovery limits are fixed. The static-memoryless limit yields an instantaneous local-opening law. The thin-layer limit joins the absorbing-boundary detector class. The weak-coupling null limit returns to the unperturbed propagation sector. Within the declared one-pole window, the same τM\tau_M controls feedthrough-subtracted count--drive hysteresis, short-window excess build-up, threshold lag beyond the static reference, scan-speed excess visibility, and post-switch recovery. The detector-side output of the wave/tube layer is the pre-latch trigger current; durable amplification, persistent records, entropy export, and reset require additional nonequilibrium variables.
On the declared pre-latch window, the baseline detector-tube closure is the minimal class-bound triad (UΓ,M,KΓ)(\Ug,\Mmem,\Kg) of reference. The one-pole susceptibility form and the reduced coordinate mm introduced in reference are secondary certified reductions admitted only on detector-family windows with fixed direct-feedthrough subtraction and residual control. Process-tensor, reaction-coordinate, pseudomode, and durable-record constructions enter only as characterization, reduced-window comparison, or admissible trigger-to-record coarse-graining statements; they do not supply the baseline law, a latching theory, or a reset model.
definition: Dynamic boundary insertion. Let Γ(t)\Gam(t) denote the active detector interface and let dΓ(x,t)d_{\Gam}(\mathbf{x},t) be its signed distance function. On the declared pre-latch detector-tube window, the detector is treated as a dynamic boundary insertion when its physical role in the theory is to alter the admissible near-surface organization of an already propagating field inside a thin boundary tube
rather than to be represented only as a final classical readout map. The interface may move geometrically, activate through a gate profile, or do both.
definition: Detector-memory field. A field M(x,t)\Mmem(\mathbf{x},t) supported on the detector tube is called a detector-memory field if it measures how much of a previously boundary-adapted detector-response state persists locally after the instantaneous boundary forcing has changed. It is not a second wavefunction and not a hidden classical record. On the declared one-pole working window it is the minimal local state-space coordinate of the detector-boundary susceptibility.
definition: Local commit. A local commit on the declared pre-latch measurement window is the event-local transfer of boundary-accessible propagation structure into a declared detector-side outcome channel. A local commit is therefore stronger than a reversible near-boundary distortion and weaker than a durable macroscopic record. In the baseline law it is represented by the nonnegative trigger current of reference.
definition: Trigger current. The detector-side trigger current on the declared pre-latch detector-tube window is
It is the nonnegative current of event-local commit. It is weaker than a durable-record current because it does not by itself encode latching, amplification, or reset.
definition: Detector-boundary susceptibility. Let ΠΓ(t)\PiGam(t) denote multiplication by the localization kernel χϵ(dΓ(x,t))\epsloc(d_{\Gam}(\mathbf{x},t)). A detector-boundary susceptibility on the declared pre-latch detector-tube window is a retarded kernel ΣΓR(t,t′)\SigR(t,t') supported on the detector tube such that, on the declared pre-latch window, the detector-corrected propagation law can be written as
Its dispersive part reorganizes near-boundary propagation, its dominant pole fixes detector memory, and its absorptive part fixes the trigger loss on the active detector band.
These declared objects are the fixed primitive layer for the detector-boundary balance and reduction statements below; all such statements are read only on the declared pre-latch detector-tube window and within the declared first-order local class fixed here.
remark: Four-term detector response. The closure below is written in the response form
Here the bulk term is the imported propagation law, the boundary term is the conservative insertion potential, the memory term is the detector-memory equation, and the commit term is the positive trigger sink.
Figure or table content is omitted from the web reader; use the canonical manuscript for the exact object.
Once activated, the detector inserts a localized boundary condition into the wave field. That insertion reorganizes the nearby field, the detector retains a finite memory of the reorganized state, and only then does part of the resulting structure convert into a trigger current of local commit. A common gate schedule may synchronize detector activation without thereby fixing identical pre-latch detector history, because M\Mmem and Jtr\Jtr depend on the causal boundary trajectory on the detector tube.
with continuity equation ∂tρψ+∇⋅jψ=0\partial_t\rhob+\nabla\!\cdot\!\jb=0. In other propagation sectors, ρψ\rhob and jψ\jb are replaced by the corresponding declared density-current pair.
Let χϵ(d)\epsloc(d) be a smooth nonnegative localization kernel supported in ∣d∣<ϵ|d|<\epsilon. The baseline detector-boundary closure is
Here ρ∗>0\rho_*>0 is a family-fixed low-density regularizer used only to keep the normalized incoming-flux gate finite on the declared weak-signal working window, and Λ∗\Lambda_* is the family-fixed trigger threshold on that same declared window. The constant γΓ≥0\gamma_{\Gam}\ge 0 is a family-fixed coupling rate, G(M)≥0G(\Mmem)\ge 0 a nonnegative response factor, and S(z)S(z) a smooth monotone gate with
and the tangential projector by P∥=I−nΓ⊗nΓ\Ppar=\mathbf I-\nb\otimes\nb, so that ∇∥=P∥∇\gradpar=\Ppar\nabla.
remark: Interpretation of the added terms. The potential UΓ\Ug is a conservative boundary-reorganization term. By itself it changes phases and near-boundary mode organization but does not produce counts. The field M\Mmem is a detector-memory layer that stores the short-lived persistence of the boundary-adapted state. The operator KΓ\Kg is a positive local-commit sink: it drains norm from the propagation descriptor and converts that drain into event counts. None of these terms is interpreted as a complete detector micro-Hamiltonian. On a certified one-pole causal window they may be read as the dispersive, memory, and absorptive faces of one causal detector-boundary response.
proposition: Norm--trigger balance. Within the declared detector-boundary closure class, assume H^0\hat H_0 is self-adjoint on the declared propagation sector, UΓ\Ug is real-valued, and KΓ≥0\Kg\ge0 pointwise. Then the propagation norm obeys
measures the accumulated event-local commits in the declared detector channel.
proof. Differentiate ∥ψ∥22=⟨ψ,ψ⟩\|\psib\|_2^2=\langle\psib,\psib\rangle and use reference. The contribution of H^0+UΓ\hat H_0+\Ug is purely imaginary because H^0\hat H_0 is self-adjoint and UΓ\Ug is real-valued. The non-Hermitian term contributes −⟨ψ,KΓψ⟩-\langle\psib,\Kg\psib\rangle, which is nonpositive because KΓ≥0\Kg\ge0.
theorem: Minimal pre-latch closure decomposition in the declared local class. Consider detector laws on a declared detector-tube window that (i) coincide with the imported bulk propagation law outside Uϵ(Γ)\Tube, (ii) admit reversible near-boundary reorganization, (iii) generate a nonnegative trigger current Jtr\Jtr, (iv) display finite lag or oriented count--drive hysteresis with one dominant response time, (v) reduce in the static-memoryless limit to an instantaneous local-opening law, and (vi) admit a later durable-record extension whose state variables are insensitive to reversible post-switch recovery. Then, within that declared class, any admissible lowest-order local closure is represented, up to coefficient renaming and higher-order gradient, tensor, or nonlocal corrections, by the triad (UΓ,M,KΓ)(\Ug,\Mmem,\Kg): a real insertion sector, one detector-memory coordinate, and a positive pre-latch trigger sink.
proof. The exclusions are separated. Appendix B records the corresponding baseline arguments. A purely absorptive localized correction supplies loss but no independent conservative tube-local reorganization sector. A state-free instantaneous reduced law has zero oriented loop area, in agreement with reference. Without a positive sink, reference collapses to norm conservation and no admissible nonnegative trigger input is available for any later record layer. If durable-record variables were inserted directly into the wave-side law, the post-switch separation between reversible boundary recovery and monotone trigger accumulation would fail. The only surviving minimal pre-latch sectors are therefore a real insertion term, one detector-memory coordinate, and a positive trigger sink, up to higher-order, tensor, or nonlocal corrections.
remark: Class-bound minimality. reference is a minimality statement for the declared detector-tube local class. It does not claim microscopic uniqueness across all detector architectures or across explicitly enlarged detector-side state spaces.
proposition: Certified one-pole causal reading on the declared window. Assume the activated detector tube couples locally to detector-side coordinates and residual detector degrees of freedom that begin in a declared ready state, and linearize the pre-latch dynamics on the declared working window. For any declared residual detector sector whose linearized elimination yields a retarded self-energy on the certified pre-latch working window, the three-sector closure reference--reference admits the reduced retarded reading reference on that window. On the local frequency-domain window one may write
with UΓ\Ug the dispersive boundary-response part and KΓ≥0\Kg\ge0 the absorptive boundary-response part on the active pre-latch band. Consequently UΓ\Ug and KΓ\Kg need not be treated as independently tuned detector insertions on that window; they are two projections of one causal detector-boundary susceptibility on that window.
proof. Tracing out a linearly coupled detector remainder on the certified pre-latch window produces a retarded self-energy on the localized boundary sector. Retardation gives reference, while the Hermitian and anti-Hermitian parts of the reduced self-energy yield the decomposition reference. Positivity of the pre-latch trigger channel fixes the absorptive contribution to be nonnegative on the active band. The proposition therefore states an admissible reduced reading on the certified pre-latch window, not a unique microscopic detector Hamiltonian.
remark: Dispersion--absorption consistency. Because ΣΓR\SigR is causal, the frequency dependences of UΓ\Ug and KΓ\Kg are linked on any declared smooth operating window by Hilbert-transform consistency. Detector families that require separately retuned phase-shift and trigger-loss kernels on the same certified one-pole window already lie outside the baseline closure.
Admissible source class and anti-flexibility clauses
Specificity also lies in restricting which local boundary data may source the detector-memory field. The source may not be an arbitrary regression functional of everything measurable near the detector. Within the declared isotropic first-order scalar detector class, the admissible source is fixed by locality, phase-offset invariance, first-order kinematics, and boundary geometry.
proposition: Declared isotropic first-order scalar source basis. Let (ρψ,jψ)(\rhob,\jb) be the density-current pair exported by the declared propagation law, and let (gΓ,dΓ,vΓ)(g_{\Gam},d_{\Gam},\vb) specify the moving detector tube. Assume that the detector-memory source is
- localized to the detector tube, - invariant under global phase offsets ψ↦eiϕ0ψ\psib\mapsto e^{i\phi_0}\psib, - built only from first-order pullbacks of propagation and boundary data in the declared coarse-graining window, and - reduced in the isotropic baseline to scalar couplings.
Then every admissible first-order scalar source on that declared baseline is a linear combination of
and any additional source channel belongs to an explicitly enlarged class outside the declared isotropic first-order scalar baseline. Higher derivatives, unrestricted nonlocal kernels, polarization tensors, and object-wise spectral filters lie outside the declared baseline law.
proof. Locality and tube support require a factor localized by χϵ(dΓ)\epsloc(d_{\Gam}). Phase-offset invariance excludes the absolute phase itself, so the detector tube can depend only on ρψ\rhob, currents, boundary motion, and gate variables exported by the propagation law. Appendix B classifies the first-order isotropic pullback scalars: modulo the continuity equation and higher-order curvature, tensor, or nonlocal terms, the moving tube yields four baseline scalar channels and no further independent scalar channel within the declared baseline. Within the declared baseline, the boundary-normal channel is represented by the incoming normal flux Jn+\Jnp. A static activated detector contributes the gate-density scalar gΓρψg_{\Gam}\rhob. Temporal insertion contributes g˙Γρψ\dot g_{\Gam}\rhob. Tangential motion contributes only through contraction with a tangential gradient, giving v∥⋅∇∥ρψ\vbpar\cdot\gradpar\rhob. Any additional source channel would lie outside the declared isotropic first-order scalar baseline.
remark: Baseline completeness of the source class. The source proposition is complete only relative to the declared isotropic first-order scalar pullback baseline. Anisotropy, polarization tensors, additional detector-side coordinates, and unrestricted nonlocal kernels are not excluded in general; they belong to explicitly enlarged classes.
remark: Roles of the four channels. The term χJJn+\chi_J\Jnp is the direct influx channel. The term χggΓρψ\chi_g g_{\Gam}\rhob measures detector activation in the presence of local wave density. The term χg˙τMg˙Γρψ\chi_{\dot g}\tau_M\dot g_{\Gam}\rhob is the insertion-rate channel: rapid switching modifies the detector-side state even at fixed instantaneous gate amplitude. The term χvℓΓv∥⋅∇∥ρψ\chi_v\ell_{\Gam}\,\vbpar\cdot\gradpar\rhob is the scan-gradient channel: a tangentially moving detector builds memory according to the signed local structure it traverses. These four channels close only the declared isotropic first-order scalar baseline seen by the moving detector tube; anisotropy, polarization tensors, additional detector-side coordinates, and unrestricted nonlocal kernels belong to explicitly enlarged classes.
proposition: Lowest-order conservative insertion sector. Assume the detector-side reorganization term is (i) localized to the detector tube, (ii) conservative, (iii) invariant under global phase offsets, (iv) scalar in the isotropic baseline, and (v) at most first order in instantaneous activation and detector conditioning. Then the lowest-order admissible conservative sector on that baseline is represented by reference, up to coefficient renaming and higher-order gradient, tensor, or nonlocal corrections. In particular, reversible near-boundary reorganization must enter before trigger formation through a real insertion term.
proof. Locality enforces the factor χϵ(dΓ)\epsloc(d_{\Gam}). Conservativity and phase-offset invariance require a real scalar multiplying ψ\psib. At first order the only isotropic detector-side scalars are the gate amplitude and one detector-conditioning coordinate. Their linear combination yields reference. Any additional gradient, tensor, or history dependence is higher order or belongs to the memory source rather than to the conservative insertion sector.
proposition: Baseline admissible pre-latch trigger sink. Assume the trigger sink is (i) localized to the detector tube, (ii) nonnegative, (iii) null in the weak-coupling limit, (iv) monotone in an instantaneous trigger variable, (v) causal with respect to the local detector state, and (vi) first order in the isotropic baseline. Then the lowest-order admissible sink is
with γΓ≥0\gamma_{\Gam}\ge0, G(M)≥0G(\Mmem)\ge0, and SS obeying reference. Moreover the insertion-rate and scan-asymmetry channels may enter the sink only through M\Mmem: direct dependence on g˙Γ\dot g_{\Gam} or v∥⋅∇∥ρψ\vbpar\!\cdot\!\gradpar\rho_{\psi} in ΛΓ\Lam introduces an extra detector-side state and violates the one-memory closure.
proof. Locality yields the tube factor χϵ(dΓ)\epsloc(d_{\Gam}). Nonnegativity and the null-coupling limit require an overall nonnegative prefactor γΓG(M)\gamma_{\Gam}G(\Mmem) that vanishes when detector coupling is turned off. Monotone threshold response requires a gate functional depending on a single instantaneous trigger variable ΛΓ\Lam through a monotone switch SS. Causality restricts detector-side history dependence to the present local state, which within the one-memory baseline is represented solely by M\Mmem. The dynamic channels g˙Γ\dot g_{\Gam} and v∥⋅∇∥ρψ\vbpar\!\cdot\!\gradpar\rho_{\psi} already enter the theory through reference and reference. If they are inserted directly into ΛΓ\Lam, then after linearization on a certified one-pole window they contribute frequency-odd absorptive terms proportional to iωgΓ(ω)i\omega g_{\Gam}(\omega) or to the Fourier image of the scan-gradient channel. Those terms cannot be represented on a finite operating band by a family-fixed scalar multiple of the one-pole coordinate m(ω)=χΓu(ω)/(1−iωτM)m(\omega)=\chi_{\Gamma}u(\omega)/(1-i\omega\tau_M) without either frequency-dependent retuning or an additional pole. Direct dynamic sink channels therefore lie outside the one-memory certified baseline. Thus the lowest-order admissible trigger sink is reference, equivalent to reference.
Within a declared detector family, the coefficients ug,uM,γΓ,aJ,ag,aM,χJ,χg,χg˙,χv,ℓΓ,τMu_g,u_M,\gamma_{\Gam},a_J,a_g,a_M,\chi_J,\chi_g,\chi_{\dot g},\chi_v,\ell_{\Gam},\tau_M must be fixed once the family and operating window are declared. They may not be re-fitted independently for each observable. A new detector family may carry a different parameter set, but one family may not hide object-wise retuning inside the source or sink.
Recovery limits and neighboring detector formalisms
Neighboring detector formalisms fix recovery and admissibility only; they do not alter the three-sector pre-latch detector-tube closure.
Figure or table content is omitted from the web reader; use the canonical manuscript for the exact object.
On quasistatic fixed-surface windows, reference and reference contract the closure to static local-opening or absorbing-boundary classes. When switching, scanning, or finite detector bandwidth is resolved on the same declared detector-family window, the triad (UΓ,M,KΓ)(\Ug,\Mmem,\Kg) is the minimal admissible pre-latch closure. The recovery statements below are compatibility limits. They do not append detector-side state variables to fixed-surface absorbing-boundary laws or to static detector maps. Recent boundary-quadruple results make the fixed-surface contraction-semigroup side explicit [citation]. Within that detector-boundary closure, the baseline pre-latch memory variable is the field M\Mmem; the coordinate mm appears only after the certified one-pole compression of reference.
Three recovery limits are especially important.
corollary: Static-memoryless local-opening reduction. In the static-memoryless limit of the declared detector-boundary closure, assume vΓ=0\vb=0, g˙Γ=0\dot g_{\Gam}=0, τM→0\tau_M\to0, and uMM=o(1)u_M\Mmem=o(1) in the declared working window. Then M=τMSΓ+o(τM)\Mmem=\tau_M\Sg+o(\tau_M) and the closure reduces to the instantaneous opening law
No oriented count--drive loop area, no ramp-lag shift, and no scan-memory length survive this limit.
corollary: Static open-gate limit. If the detector boundary is fixed, g˙Γ=0\dot g_{\Gam}=0, vΓ=0\vb=0, the memory field is negligible, M≈0\Mmem\approx0, and the gate is homogeneously open on the active detector area, then
Thus the baseline law recovers an operational local Born-type rate law in the static homogeneous limit.
remark: Relation to detector tomography. The static limit reference is exactly where detector tomography is most powerful. Spatially resolved detector tomography now determines nonuniform local efficiency maps in single-atom detectors [citation], and recent self-characterization and semidefinite measurement-tomography schemes constrain how detector maps may be reconstructed from count data [citation]. Once detector activation, switching, or scan history enters the same working window, a dynamic boundary term and a finite detector-memory layer are required before the count law closes.
proposition: Zero-memory immediate-trigger absorbing-boundary recovery. Assume a fixed detector surface, a negligible memory field, a vanishing memory time τM→0\tau_M\to0, and a thin-layer limit in which
with δΓ\delta_{\Gam} the surface delta distribution and with the local trigger gate effectively open on the active boundary band. Then reference reduces to the usual complex-absorbing-potential class, and boundary-layer elimination yields the absorbing-boundary rule class discussed in [citation]. Thus absorbing-boundary detection is the zero-memory immediate-trigger limit of the dynamic detector-boundary closure.
remark: Dynamic extension of absorbing boundaries. Absorbing boundaries and imaginary potentials already capture detection-time laws at idealized fixed surfaces [citation]. By themselves, they do not encode finite detector memory under switching, scanning, or bandwidth-limited activation. The baseline law adds that pre-latch layer while preserving the absorbing-boundary limit of reference.
corollary: Weak-coupling null limit. If ug,uM,γΓ,χJ,χg,χg˙,χv→0u_g,u_M,\gamma_{\Gam},\chi_J,\chi_g,\chi_{\dot g},\chi_v\to0 with fixed H^0\hat H_0, fixed detector geometry, and fixed initial data, then UΓ,KΓ,SΓ→0\Ug,\Kg,\Sg\to0 in the detector tube and the solution of reference converges to the solution of the unperturbed bulk law reference. No detector-induced asymptotic channel survives this limit.
remark: Scattering consistency. The weak-coupling null limit is not optional. A detector-boundary law must disappear smoothly when detector couplings are turned off; otherwise the detector contaminates the asymptotic propagation sector. The same requirement is consistent with absorbing-boundary recovery at fixed surfaces and with boundary-quadruple parameterizations of fixed-surface contraction semigroups [citation].
Boundary sensitivity can also be more than a mathematical convenience. Recent work on Unruh--deWitt detectors shows that detector response may depend on boundary conditions at an interface even when the detector is classically isolated from the region where those conditions are imposed [citation]. The nonrelativistic or effectively one-mode setting used here has the same structural feature: boundary data can modify detector response already at the detector layer.
Certified one-pole reduction and cross-observable consequences
Harmonic gate or flux loopsFinite-window captureRamp thresholds and onset lagScan-speed visibility and memory length
The full tube equations reference--reference are the baseline theory. For practical identification the theory must also yield a reduced law with directly testable cross-observable consequences. The reduced coordinate introduced below is admitted only on windows certified by reference; it is not part of the baseline identity of reference. On a certified one-pole window, write the linearized trigger current relative to a static or quasistatic reference as
δJtr(t)=αΓu(t)+δJtrexc(t),
TeX source
\delta\Jtr(t)=\alpha_{\Gamma}u(t)+\Jexc(t),
where αΓ\alpha_{\Gamma} is the family-fixed direct feedthrough fixed by that reference on the same family/window and δJtrexc\Jexc is the memory-conditioned excess trigger current. The memory coordinate cannot be omitted, because the loop criterion below would otherwise force zero oriented area in the feedthrough-subtracted channel.
proposition: No-memory no-loop criterion. Let a reduced detector law in a declared detector family be instantaneous in the sense that δJtrexc(t)=F(u(t))\Jexc(t)=F(u(t)) with no internal detector-side state variable. Then for any periodic drive u(t)u(t) of period TT, the oriented loop area satisfies
AR–u=∮δJtrexcdu=0.
TeX source
A_{R\text{--}u}=\oint \Jexc\,du = 0.
Consequently, any experimentally resolved nonzero count--drive loop area in the feedthrough-subtracted channel requires at least one detector-side state variable.
proof. If δJtrexc\Jexc is a single-valued function of uu, then the parametric curve (u,δJtrexc)(u,\Jexc) is traversed on the graph of FF, and the line integral around one closed period is exactly ∮F(u)du=0\oint F(u)\,du=0.
Assume therefore a declared detector family and operating window in which the detector-tube response is dominated by one pole.
proposition: One-pole detector-tube compression. Assume the linearized pre-latch detector response on the declared working window is causal and time-translation invariant to leading order, and that its detector-tube susceptibility has one dominant simple pole separated from the rest of the spectrum by a gap larger than the working frequencies. Let the raw trigger current be decomposed as in reference, with the direct feedthrough coefficient αΓ\alpha_{\Gamma} fixed from the same family/window in a static or quasistatic reference. Then every minimal local state-space realization on that certified window is equivalent, up to coefficient renaming, to one real coordinate m(t)m(t) satisfying
τMm˙+m=χΓu(t),δJtrexc(t)=βΓm(t),
TeX source
\tau_M\dot m + m = \chi_{\Gamma} u(t),
\Jexc(t) = \beta_{\Gamma} m(t),
where u(t)u(t) is the reduced boundary drive assembled from the admissible channels of reference. The coefficient χΓ\chi_{\Gamma} is family-fixed, βΓ\beta_{\Gamma} is the linear excess-trigger sensitivity at the chosen working point, and αΓ\alpha_{\Gamma} is not refit after certification on that family/window.
proof. A causal time-translation-invariant linear response law is determined by its susceptibility. If the susceptibility has one dominant simple pole and no comparable secondary pole on the declared window, the minimal local state-space realization is one first-order real coordinate. The direct feedthrough allowed by the static local-opening sector is fixed separately by the decomposition reference. The remaining memory-conditioned dynamic channel therefore obeys reference, and the linearized excess trigger response takes the form reference.
remark: One-pole susceptibility representation. Equation reference is equivalent to the causal convolution
On the declared window, mm is the lowest-order sufficient coordinate of the detector-tube process rather than an arbitrary added variable.
remark: Finite-mode support reading. On certified one-pole windows, the reduced coordinate mm can be matched to the real working-point amplitude of a corresponding finite-mode embedding, such as a reaction coordinate or pseudomode [citation]. That comparison records only a possible reduced reading of the certified window and does not define the baseline three-sector closure.
proposition: Residual-controlled one-pole admissibility. Fix before calibration a detector family, an operating band Ωwork\Omwork, a protocol norm ∥⋅∥w\normw{\cdot}, and an admissibility tolerance ε∗\epstol; these declarations are held fixed throughout certification and all cross-observable tests on that same family/window. Let TΓ\Tresp denote the reconstructed linear detector-tube response on Ωwork\Omwork, and let TΓ(1)\Tone be the one-pole realization that matches the static gain and dominant pole of reference. Define
The reduction reference--reference for the memory-conditioned excess channel is admissible only when εmem≤ε∗\epsmem\le\epstol on that declared band. If εmem>ε∗\epsmem>\epstol, then higher poles or explicit multi-time kernels belong to the baseline detector response and the one-pole closure fails on that family/window.
proof. A one-pole realization is admissible only if it approximates the reconstructed detector-tube response on the predeclared band within the predeclared protocol tolerance. If the residual exceeds that tolerance, then no single local memory coordinate with one time scale reproduces the detector-tube response on that certified window, so the pole relations and no-retuning predictions cease to be family-stable. The missing response must then be carried by additional poles or by an explicit multi-time kernel.
remark: Operational memory witness. For frequency-sweep data one may take ∥⋅∥w\normw{\cdot} to be a weighted L∞L^{\infty} or L2L^2 norm of the reconstructed boundary response on Ωwork\Omwork; for multi-time reconstruction one may use the corresponding norm of a detector-tube multi-time response reconstructed by process-tensor tomography [citation]. Changing Ωwork\Omwork, ∥⋅∥w\normw{\cdot}, or ε∗\epstol after calibration constitutes a family/window change rather than a new fit of the same closure.
Harmonic gate or flux loops Let u(t)=u1cos(Ωdt)u(t)=u_1\cos(\omegad t). Then the periodic solution of reference is
The loop area peaks at ΩdτM=1\omegad\tau_M=1. Thus harmonic data identify τM\tau_M directly.
Finite-window capture If the detector is switched on at t=0t=0 for a short capture window of duration Td\Tc while the reduced drive is approximately constant, u(t)=u0Θ(t)u(t)=u_0\Theta(t), then
m(t)=χΓu0(1−e−t/τM).
TeX source
m(t)=\chi_{\Gamma}u_0\bigl(1-e^{-t/\tau_M}\bigr).
Accordingly, any short-window linearized excess-capture observable inherits the factor
ηcap(Td)=1−e−Td/τM.
TeX source
\etacap(\Tc)=1-e^{-\Tc/\tau_M}.
Equation reference does not assert a universal efficiency law for all detectors. It states the baseline build-up factor of the detector-memory channel in the declared short-window regime. When Td≪τM\Tc\ll\tau_M, the detector is memory-limited; when Td≫τM\Tc\gg\tau_M, the dynamic boundary has fully conditioned the detector tube.
Ramp thresholds and onset lag For a ramped drive u(t)=u˙tu(t)=\dot u\,t with constant rate u˙\dot u, reference gives
In the regime t≳τMt\gtrsim \tau_M, the memory-conditioned excess response behaves as if the drive were delayed by one memory time. If u∗u_* is the static threshold extracted from the same detector family after fixing the direct feedthrough baseline, the dynamic onset of the excess channel satisfies to leading order
with a family-fixed coefficient νΓ>0\nu_{\Gamma}>0. The up--down onset split therefore scales linearly with ramp rate and memory time.
Scan-speed visibility and memory length Now let a detector scan tangentially across a one-dimensional interference pattern of pitch ℓint\ellint, so that the reduced drive is
Thus the detector samples a memory-filtered pattern extending over a distance Lmem\Lmem along the scan path.
Figure or table content is omitted from the web reader; use the canonical manuscript for the exact object.
corollary: Parameter-free pole relations on a certified one-pole detector-family window. Within the certified one-pole detector-family window, the hysteresis-peak frequency, half-build time, and half-power scan speed are
Post-switch separation and admissible causal coarse-graining to later durable-record variables
This section fixes only the admissible variable-passing contract from the pre-latch layer to later detector-architecture variables. It does not introduce a metastable cycle, hazard law, record-bearing current account, or reset dynamics.
proposition: Post-switch recovery/trigger separation. Suppose detector activation and detector motion are switched off at time t0t_0, so that gΓ=0g_{\Gam}=0, vΓ=0\vb=0, and no new incoming flux enters the tube for t>t0t>t_0. Then the detector-memory field obeys
Therefore the post-switch detector response splits into an exponentially recoverable boundary-distortion tail and a nonrecoverable trigger tail.
proof. With source and advection terms turned off, reference reduces to ∂tM=−τM−1M\partial_t\Mmem=-\tau_M^{-1}\Mmem, giving reference. Equation reference follows from reference. Since KΓ≥0\Kg\ge0, reference implies reference. As M→0\Mmem\to0 and the direct gate closes, ΛΓ\Lam falls below threshold and the trigger current vanishes. The integrated trigger count remains monotone by construction.
definition: Operational local-commit boundary. Within a declared switch-off protocol, the local-commit sector is exactly the part of the detector response that contributes to the monotone trigger accumulation Ntr(t)\Ntr(t) after switch-off. Purely reversible boundary distortion is the complementary detector response that relaxes with the post-switch factor e−(t−t0)/τMe^{-(t-t_0)/\tau_M} and produces no additional trigger count.
proposition: Admissible trigger-to-record factorization on the declared pre-latch trigger-to-record coarse-graining window. Let Q(t)Q(t) be any later durable-record variable whose dynamics is causal and insensitive to reversible detector distortions after switch-off. Then the wave/detector layer can enter the evolution law for QQ only through the trigger current Jtr\Jtr or a causal coarse-graining of it. In the linearized baseline,
defines the admissible linearized coarse-grained record-input current on the declared pre-latch window. Record-bearing latching, metastable hazard structure, entropy export, and reset are not part of this proposition. Direct dependence on UΓ\Ug or M\Mmem is inadmissible.
proof. After switch-off, M\Mmem and UΓ\Ug decay exponentially by reference--reference, whereas the accumulated trigger count Ntr(t)\Ntr(t) remains monotone by reference. A later record variable that depended directly on UΓ\Ug or M\Mmem would therefore inherit sensitivity to reversible boundary recovery. Any admissible durable-record variable must depend only on the nonnegative trigger current or a causal coarse-graining of it. In the linearized baseline, causal coarse-graining is represented by reference.
theorem: Compatibility of static reduction with declared durable-record coarse-graining. Let R0\mathcal R_0 denote the static-memoryless reduction τM→0\tau_M\to0, g˙Γ=0\dot g_{\Gam}=0, vΓ=0\vb=0, and let L\mathcal L be the causal coarse-graining map in reference with fixed kernel ℓ∈L1(R+)\ell\in L^1(\mathbb R_+). If Jtr(τM)→Jtr(0)\Jtr^{(\tau_M)}\to \Jtr^{(0)} locally in L1L^1 under R0\mathcal R_0, then
Thus reducing first to an instantaneous local-opening law and then forming durable records yields the same durable-record current as forming the pre-latch trigger current first and then taking the static-memoryless limit. Equivalently, the diagram
commutes on the declared static-memoryless window.
proof. By reference, L\mathcal L is convolution with the fixed integrable kernel ℓ\ell. Local L1L^1 convergence of Jtr(τM)\Jtr^{(\tau_M)} together with ℓ∈L1\ell\in L^1 implies convergence of the convolutions by dominated convergence. Therefore the static-memoryless limit commutes with durable-record coarse-graining.
Spatially resolved atom and matter-wave detectorsSuperconducting and microwave detectorsTime-resolved interferometric readoutDetector characterization beyond static POVMsFamily-fixed one-pole protocolCalibrated benchmark: thermal-detector qubit readout
Several experimentally active detector families expose the detector-side structure encoded by the closure: a propagating field, an activated interface, finite response time or bandwidth, and a count or readout channel. These platforms are used only to identify observables that can certify or reject the declared pre-latch closure.
Spatially resolved atom and matter-wave detectors Spatially resolved single-atom detector tomography already shows that a detector surface carries local response structure rather than a single global efficiency [citation]. Wave-packet imaging in continuous space now resolves the projected spatial distribution of a single-atom wave packet before fluorescence imaging [citation]. Those systems test two separate parts of the law: reference in the static projection limit and reference for the excess visibility channel whenever the detector is scanned, activated in time, or reconstructed from finite-duration pinning windows.
Superconducting and microwave detectors Single-shot qubit readout with a bolometer explicitly exposes a finite readout duration and a tradeoff between fidelity and measurement time [citation]. Cyclically operated microwave single-photon counters make the finite conversion window and detector duty cycle explicit [citation]. Thermal spectroscopy of superconducting circuits now offers a direct-current route to frequency-resolved detector characterization over a broad band, again emphasizing detector-side response time and conditioning rather than a single static efficiency number [citation]. These detector-side observables are summarized in τM\tau_M, reference, and reference, with static direct feedthrough fixed separately on the same family. Threshold microwave detection by underdamped Josephson junctions provides a direct threshold-type platform for the commit sink reference [citation].
Time-resolved interferometric readout Single-electron interferometry now detects time-dependent electromagnetic fields by measuring both phase and contrast of the interference pattern, with temporal resolution limited by the electronic wave-packet width [citation]. Time-resolved parity measurement in interferometric semiconductor devices likewise shows that single-shot readout can depend critically on the finite measurement window and the dynamics of the readout loop [citation]. These platforms are especially natural because reference and reference directly couple excess counts, excess visibility, and window duration.
Detector characterization beyond static POVMs Detector self-characterization and semidefinite measurement tomography remain indispensable in the static or quasistatic limit [citation]. The baseline law adds the structures that become visible once the detector is dynamically inserted into the wave field: a memory coordinate, an insertion-rate channel, and a commit sink. Process-tensor methods now characterize fixed multi-time memory in terms of experimentally accessible quantities [citation], and full multi-time quantum process tomography on superconducting qubits shows that such structure can be reconstructed in practice [citation]. Those developments make it realistic to test whether the single-time closure reference is sufficient or whether a broader kernel is required. Recent photodetector reporting standards likewise emphasize family-fixed calibration, bandwidth declaration, and protocol consistency in detector benchmarking [citation]. The present layer fixes only the pre-latch detector-boundary memory closure between local opening and later durable readout thermodynamics; it neither revises the local opening grammar nor closes the later latching/reset architecture.
Family-fixed one-pole protocol
proposition: Family-fixed no-retuning protocol. Fix before calibration a detector family, a working point, an operating band Ωwork\Omwork, a protocol norm ∥⋅∥w\normw{\cdot}, and a tolerance ε∗\epstol, fix the direct feedthrough coefficient αΓ\alpha_{\Gamma} from a static or quasistatic reference on that same family/window, and certify εmem≤ε∗\epsmem\le\epstol on the declared dynamic window. Determine τM\tau_M from one primary calibration observable on the certified one-pole window - for example phase lag, gain roll-off, weak-window build-up, a loop-area peak, or a step-on capture law - while keeping the family/window declarations fixed. Then reference, reference, reference, and reference predict the feedthrough-subtracted trigger-side observables of that same detector family/window without retuning τM\tau_M, αΓ\alpha_{\Gamma}, changing Ωwork\Omwork, changing ∥⋅∥w\normw{\cdot}, enlarging the source basis, or separating the dispersive and absorptive sectors. Any such change rejects the one-pole baseline on that family/window.
proof. Once εmem≤ε∗\epsmem\le\epstol, the reduced dynamic law is fixed by reference--reference on the declared band. The static reference fixes αΓ\alpha_{\Gamma}, and the chosen dynamic calibration observable fixes τM\tau_M together with the corresponding working-point gain combination before any cross-observable test is attempted. Equations reference, reference, reference, and reference then depend on that same τM\tau_M on the same declared family/window after the direct feedthrough subtraction is held fixed. A second τM\tau_M, a changed αΓ\alpha_{\Gamma}, a changed protocol band or norm, an enlarged source class, or an independently tuned absorptive sector therefore signals failure of the one-pole baseline.
A minimal same-family certification protocol has five steps.
- Static reference. In a fixed-boundary or quasistatic regime, determine the local response map or threshold curve, fix the direct feedthrough coefficient αΓ\alpha_{\Gamma}, and verify the static reductions of reference and reference. - Window certification. Declare Ωwork\Omwork, ∥⋅∥w\normw{\cdot}, and ε∗\epstol before fitting, reconstruct the linear detector-tube response on Ωwork\Omwork, and verify εmem≤ε∗\epsmem\le\epstol using reference. - Calibration observable. On the certified one-pole window, use one primary calibration observable only - for example phase lag, gain roll-off, weak-window build-up, loop-area spectrum, or the step-on capture law - to infer τM\tau_M and the working-point gain combination βΓχΓ\beta_{\Gamma}\chi_{\Gamma}, with αΓ\alpha_{\Gamma} already fixed by the static reference. - Cross-observable prediction without retuning. With αΓ\alpha_{\Gamma}, τM\tau_M, Ωwork\Omwork, ∥⋅∥w\normw{\cdot}, ε∗\epstol, and the family-fixed coefficients frozen, predict the remaining observables not used in the calibration step - including threshold lag reference, scan-speed excess visibility reference, finite-window excess capture reference, and post-switch recovery - from the same detector family and operating window. - Failure rule. If independent observables require different τM\tau_M values, altered direct-feedthrough subtraction, altered protocol declarations, additional source channels, residual memory above ε∗\epstol, or separately retuned dispersive and absorptive sectors before a declared family/window change, reject the one-pole baseline closure.
Figure or table content is omitted from the web reader; use the canonical manuscript for the exact object.
Calibrated benchmark: thermal-detector qubit readout Thermal-detector qubit readout already exposes a finite detector-side time constant on the same platform that carries the trigger signal [citation]. Ref. [citation] reports an effective thermal time constant τb=9.4μs\tau_b=9.4\,\mu\mathrm{s} on the calibrated ground-state branch and a reported readout pulse length tRO=13.9μst_{\mathrm{RO}}=13.9\,\mu\mathrm{s}. On that declared family/window we take τM=τb\tau_M=\tau_b as a same-family calibration ansatz rather than a universal detector identity. Taking τM=τb\tau_M=\tau_b on that declared family/window gives the same-family one-pole consequences
These are same-family cross-observable consequences of one declared τM\tau_M, not new fit parameters.
A calibrated detector-family benchmark on that platform is therefore: declare the operating point, fix the static direct feedthrough on that family, and certify εmem≤ε∗\epsmem\le\epstol on one pre-latch window; extract τM\tau_M once from a weak-modulation lag or short-window build-up observable, and then test reference--reference, reference, and reference without changing Ωwork\Omwork, ∥⋅∥w\normw{\cdot}, or ε∗\epstol. Pulse-duration sweeps probe ηcap\eta_{\mathrm{cap}}, weak periodic modulation probes fpeakf_{\mathrm{peak}}, ramped activation probes the onset shift, and post-switch relaxation probes the same τM\tau_M in the recovery tail.
Ref. [citation] also shows that the effective thermal time constant depends on probe conditions. Accordingly, changing probe power, bias, or operating point defines a new family/window declaration rather than a refit inside one certified window. If build-up, weak-modulation, threshold-lag, or post-switch observables on one fixed declaration require a distinct τM\tau_M, the one-pole detector-family reduction is rejected on that window.
The baseline law is rejected whenever any of the following occurs within a declared detector family.
- One-pole window is not certified: the reconstructed detector-tube response yields εmem>ε∗\epsmem>\epstol on the declared operating band, or certification requires changing the response norm or tolerance within one detector family. - No family-fixed memory time: with εmem≤ε∗\epsmem\le\epstol and the direct feedthrough subtraction fixed on the declared window, a single τM\tau_M extracted from one declared calibration observable does not predict threshold lag, excess-visibility roll-off, post-switch recovery, or short-window excess capture. - Pole relations fail: the measured hysteresis-peak frequency, half-build time, and half-power scan speed do not satisfy the parameter-free relations reference--reference. - Dispersion--absorption mismatch: phase or contrast shifts measured on the declared calibration window and trigger losses attributed to UΓ\Ug and KΓ\Kg cannot be fitted by one causal boundary susceptibility on the declared operating window. - Object-wise retuning is required: different observables or nominally identical devices demand different τM\tau_M or different source channels without a declared family change. - No ramp asymmetry: threshold onset fails to show the linear ∣u˙∣τM|\dot u|\tau_M split of reference in a regime where the detector is known to be dynamically bandwidth-limited. - Visibility scaling is wrong: scanned or time-swept interference data do not follow the vsτM/ℓintv_s\tau_M/\ellint scaling of reference in the excess channel even when static tomography confirms the baseline static response. - No post-switch separation: after detector deactivation the near-boundary recovery tail does not relax with the same τM\tau_M that governs loops and capture, or trigger accumulation fails to separate monotonically from the recovery tail. - Memory needs higher structure: the data require explicit multi-time kernels, polarization tensors, or several competing memory times already in the baseline operating window. - No boundary insertion sensitivity: activating, moving, or bandwidth-limiting the detector changes neither trigger counts nor contrast beyond what is already explained by static detector tomography. - Trigger sink is too strong: the model predicts trigger current while destroying propagation in a regime where the observed detector is demonstrably weakly invasive, signalling that the sink must be weakened or that the working point lies outside the baseline window. - Static/null limits are wrong: in a regime independently known to be static and memoryless, the data do not reduce to reference, or turning off detector couplings fails to recover the unperturbed propagation sector of reference. - Trigger-to-record factorization fails: after conditioning on Jtr\Jtr or its declared coarse-graining, later durable-record observables still depend directly on reversible boundary variables. - Reduction and record limits do not commute: the durable-record current obtained after static-memoryless reduction does not agree with the reduced limit of the durable-record current in the sense of reference.
The detector tube carries three pre-latch objects with distinct functions. The pair (UΓ,M)(\Ug,\Mmem) describes reversible boundary adaptation: it reorganizes phase and contrast near the detector, lags under switching or scanning, and relaxes after switch-off. The trigger current Jtr\Jtr is different: it is nonnegative and accumulates monotonically. The post-switch identities therefore separate reversible boundary distortion from event-local trigger generation without inserting any persistent record variable into the wave-side equations. Only on a certified one-pole detector-family window may UΓ\Ug, M\Mmem, and KΓ\Kg be read, in a secondary response description, as the dispersive, dominant-pole, and absorptive faces of one causal detector-boundary susceptibility.
The pullback source theorem fixes the detector-memory sector at first order. The source is not a regression over arbitrary local features; within the declared isotropic first-order scalar class it is restricted to incoming normal flux, gate-density, insertion-rate density, and scan-gradient coupling. The trigger sink is constrained in the same spirit: locality, positivity, null-coupling recovery, monotone thresholding, and one-memory causality restrict the baseline sink to reference. If the data require extra tensor channels, nonlocal kernels, independently retuned dispersive and absorptive sectors, or several comparable poles in the same operating window, the baseline closure fails rather than absorbing the discrepancy into ad hoc detector structure.
The one-pole compression is a certified reduction of that baseline law on declared detector-family windows. Within the declared detector-tube window, mm is the minimal local realization of the dominant causal susceptibility, and admissibility of that reduction is fixed by the residual witness εmem≤ε∗\epsmem\le\epstol. The resulting pole relations tie together feedthrough-subtracted hysteresis, excess capture, excess visibility, threshold lag beyond the static reference, and post-switch recovery through one family-fixed τM\tau_M, which is fixed once on the certified one-pole window and then tested on independent trigger-side observables without retuning. Success of that reduction shows that one measurable detector-memory coordinate suffices on the declared window. Failure identifies either a broader memory kernel or a later nonequilibrium amplification sector already active inside the working window.
The admissible trigger-to-record coarse-graining is fixed by post-switch separation. A later record variable may depend on the pre-latch layer only through Jtr\Jtr or a causal coarse-graining of it; the architectural readout cycle itself is not closed here. With that factorization, the static-memoryless reduction commutes with durable-record coarse-graining. The same pre-latch layer joins instantaneous local opening to later record formation without mixing reversible boundary recovery into the durable-record channel. Process-tensor, tomography, reaction-coordinate, and pseudomode descriptions therefore remain characterization tools or certified reduced-window descriptions; none replaces the three-sector detector-tube law on the declared pre-latch window.
The present dynamic detector-boundary closure closes the activated finite-bandwidth pre-latch layer between bulk propagation and later durable-record dynamics. Within the declared first-order local class, reversible near-boundary reorganization requires UΓ\Ug, one dominant pre-latch memory time requires M\Mmem, and event-local trigger generation requires KΓ\Kg. Within the declared isotropic first-order scalar baseline, the admissible memory source is fixed by the moving detector tube and the exported propagation density-current pair, while the admissible pre-latch trigger sink is fixed by locality, positivity, null-coupling recovery, monotone thresholding, and one-memory causality. Enlarged detector-coordinate sets, tensor-valued source classes, or explicitly nonlocal kernels define enlarged models rather than counterexamples within that baseline.
The same family-fixed time scale τM\tau_M governs feedthrough-subtracted count--drive hysteresis, short-window excess capture, threshold lag beyond the static reference, scan-speed excess visibility, and post-switch recovery. The one-pole reduction is secondary to the baseline closure and is admitted only on detector-family windows for which Ωwork\Omwork, ∥⋅∥w\normw{\cdot}, and ε∗\epstol are declared before calibration and the residual witness satisfies εmem≤ε∗\epsmem\le\epstol. On that certified window the same-family protocol first fixes the static direct feedthrough and then fixes τM\tau_M once before testing the remaining trigger-side observables without retuning. Only on that window may the three-sector closure be read, in a secondary response description, as the dispersive, dominant-pole, and absorptive faces of one detector-boundary susceptibility. Process-tensor, tomography, reaction-coordinate, and pseudomode descriptions remain characterization tools or certified reduced-window descriptions on that window; they do not replace the detector-tube law itself.
The trigger current Jtr\Jtr is the detector-side output of the wave/tube layer retained as an admissible causal input to any later durable-record description. The static-memoryless reduction and the durable-record coarse-graining commute, so the same pre-latch closure joins instantaneous local opening to later record formation without inserting latching or reset into the wave-side equations. The instantaneous local-opening law appears here only as a recovery limit of the present closure. In the fixed-surface thin-layer zero-memory limit the closure returns to the absorbing-boundary detector class; in the quasistatic map limit it returns to detector tomography. Within the declared first-order local pre-latch class, the triad (UΓ,M,KΓ)(\Ug,\Mmem,\Kg) is therefore the minimal detector-tube closure whenever switching, scanning, or finite detector bandwidth is already part of the observable dynamics. No durable-record criterion, amplification law, reset dynamics, or objectivity theorem is derived here. No metastable ready--activated--latched architecture, durable-record persistence criterion, or reset rule is part of the present result. If no declared detector-family window supports the same-family one-pole relations without retuning, or if later durable-record variables remain directly sensitive to reversible boundary variables rather than to Jtr\Jtr or its causal coarse-graining, the closure is rejected on that window rather than implicitly enlarged.
The reduced formulas in reference follow from the single-pole response reference. We record the short derivations.
Harmonic loops..
For u(t)=u1cos(Ωdt)u(t)=u_1\cos(\omegad t), solve reference in steady state to obtain reference. Since δJtrexc=βΓm\Jexc=\beta_{\Gamma}m, the parametric loop (u(t),δJtrexc(t))(u(t),\Jexc(t)) is an ellipse whose oriented area is exactly reference; the direct feedthrough term αΓu\alpha_{\Gamma}u contributes zero area because ∮udu=0\oint u\,du=0.
Step activation..
For u(t)=u0Θ(t)u(t)=u_0\Theta(t), the solution of reference is reference. Any linearized excess-capture observable proportional to the memory-conditioned opening factor therefore acquires the build-up law reference.
Scanning across a sinusoidal pattern..
Let the scanned signal be u(t)=u0+u1cos(kintvst)u(t)=u_0+u_1\cos(\kgate v_s t). The memory coordinate responds with the same frequency but reduced amplitude u1χΓ/1+(kintvsτM)2u_1\chi_{\Gamma}/\sqrt{1+(\kgate v_s\tau_M)^2}. The observed excess contrast therefore inherits the suppression factor in reference once the static visibility floor has been subtracted. □\square
Appendix B. Exclusion arguments for the declared baseline
The modal statements in reference, reference, and reference are restricted to the declared isotropic first-order local baseline. This appendix records the corresponding exclusions.
B.1. Pure absorption does not supply reversible tube reorganization..
Consider a localized detector correction with no real insertion sector,
Such a law supplies only tube-local norm loss. There is then no independent conservative tube-local generator that can persist as a reversible phase or contrast distortion while the trigger channel is held fixed. Pure absorption can therefore represent local loss, but not the reversible near-boundary reorganization required in reference.
B.2. Classification of first-order isotropic pullback scalars..
On the moving detector tube the basic local data are (ρψ,jψ,gΓ,dΓ,vΓ)(\rhob,\jb,g_{\Gam},d_{\Gam},\vb). Global phase invariance removes the absolute phase. At zeroth order the only scalar activation channel is gΓρψg_{\Gam}\rhob. At first order, the only isotropic scalars built from one derivative or one velocity insertion are Jn+\Jnp, g˙Γρψ\dot g_{\Gam}\rhob, and v∥⋅∇∥ρψ\vbpar\!\cdot\!\gradpar\rhob. Terms involving ∂tρψ\partial_t\rhob reduce by the continuity equation to −∇⋅jψ-\nabla\!\cdot\!\jb and hence to the normal-flux channel plus curvature or higher-order tangential corrections. Curvature tensors, polarization tensors, and unrestricted nonlocal averages therefore lie outside the declared isotropic first-order scalar baseline. This yields reference.
B.3. Direct dynamic sink channels do not fit one certified pole..
Linearize the trigger variable on a certified one-pole window and suppose, contrary to reference, that
where m(ω)=χΓu(ω)/(1−iωτM)m(\omega)=\chi_{\Gamma}u(\omega)/(1-i\omega\tau_M) is the certified one-pole coordinate and qvq_v is the Fourier image of the scan-gradient channel. The factor iωi\omega is frequency odd and cannot equal a family-fixed scalar multiple of m(ω)m(\omega) on a finite band Ωwork\Omwork: equality would require
cg˙iω=cM1−iωτMχΓfor all ω∈Ωwork,
TeX source
c_{\dot g}\,i\omega
=
c_M\frac{\chi_{\Gamma}}{1-i\omega\tau_M}
\qquad
\text{for all }\omega\in\Omwork,
which is impossible unless the band collapses to a point or coefficients are retuned frequency by frequency. The scan-gradient term is analogous. Direct absorptive dependence on g˙Γ\dot g_{\Gam} or scan asymmetry therefore requires either an additional local detector state or an independently retuned absorptive kernel. Both lie outside the one-memory certified baseline, so those channels must enter through M\Mmem alone.
B.4. Durable-record variables do not belong to the wave-side baseline..
If a durable-record variable were inserted directly into the pre-latch wave-side law, then after switch-off the same variable would respond both to reversible tube recovery and to monotone trigger accumulation. That contradicts the separation of reference and reference. Durable-record coordinates therefore belong only to the later coarse-grained sector.
Funding and competing interests..
No external funding was received for this work. The author declares no competing interests.