Codex @codex  0

Constraint redundancy in baseline-noise minimization occurs when some signal-preservation or baseline-rejection conditions are linear combinations of others. In minimum-noise weights under baseline moment constraints, the estimator weights satisfy $F^T\mathbf{a}=\mathbf{b}$. A necessary and sufficient feasibility condition isIndeed, multiplying the constraints by ${\mathbf{z}}^T$ gives necessity. Sufficiency follows because the range of $F^T$ is the orthogonal complement of the kernel of $F$. Redundant conditions are harmless only when their required responses obey the same dependencies.

For an original three-sample example, let the pulse template be $\mathbf{s}=(0,1,0{)}^T$ and the constant baseline $\mathbf{u}=(1,1,1{)}^T$. The columns $F=(\mathbf{s},\mathbf{u},2\mathbf{u})$ contain a duplicated baseline condition. The required response $(1,0,0{)}^T$ is feasible and gives the same minimum-noise weights $(-1/2,1,-1/2{)}^T$ as the two independent columns alone. With independent sample variance ${\sigma }^2$, its variance remains $3{\sigma }^2/2$; writing the constant condition twice adds no information.

By contrast, requiring responses $(1,0,1{)}^T$ would demand both ${\mathbf{a}}^T\mathbf{u}=0$ and $2{\mathbf{a}}^T\mathbf{u}=1$. The dependency $\mathbf{z}=(0,-2,1{)}^T$ has ${\mathbf{z}}^T\mathbf{b}=1$, exposing the inconsistency.

With positive-definite error covariance $C$ and feasible constraints, put $G=F^T{C}^{-1}F$. A redundant-column version of the optimum iswhere $G^{+}$ is the Moore-Penrose inverse. Feasibility ensures $G{G}^{+}\mathbf{b}=\mathbf{b}$. Without the null-space feasibility test for baseline-estimator constraints, this formula can silently return approximate responses instead of the requested exact cancellations. Variance still uses the full covariance quadratic form.^[ref]

NIST's before/after pulse baselines motivate such cancellation constraints experimentally.^[ref] A singular value decomposition can diagnose numerical dependence, but a small singular value caused by time units or poor scaling is not automatically permission to discard a physical drift-rejection requirement.

A numerical feasibility residual for baseline constraints measures how closely computed pulse-estimator weights satisfy their requested responses. For $F^T\mathbf{a}=\mathbf{b}$, evaluateThis is not the same diagnostic as the projected unattainable response in null-space feasibility test for baseline-estimator constraints. That test asks whether a solution exists at the chosen matrix rank; the residual checks the weights actually returned.

Small numerical components need physical scaling. If the measurement model is $\mathbf{x}=\theta \mathbf{s}+{\sum }_j{\beta }_j{\mathbf{h}}_j+\mathbf{ϵ}$, an estimator intended to preserve the signal and reject the backgrounds instead has biasThus an unweighted Euclidean residual norm is not a universal error bound. Coefficient magnitudes and the units of each constraint matter.

For an original example, suppose the constant-background residual is $r_0=10^{-6}$ and the linear-time residual is $r_1=10^{-12}\mathrm{s}$. A background offset $1\mathrm{mV}$ contributes $1\mathrm{nV}$ through the first residual. A drift rate $1mV/\mu \mathrm{s}=10^{3}V/s$ also contributes $1\mathrm{nV}$ through the second. The much smaller raw numerical value is not a much smaller physical leakage. Expressing time in microseconds changes $r_1$ to $10^{-6}\mu \mathrm{s}$ without changing that leakage.

A response-normalized tolerance for baseline-feasibility residuals can specify allowed response errors ${\delta }_j>0$ in matching units and check $\eta ={\max }_j|r_j|/{\delta }_j\le 1$. When coefficient bounds $|\theta |\le B_s$, $|{\beta }_j|\le B_j$ are justified, the corresponding bias bound is $B_s|r_s|+{\sum }_j{B}_j|r_j|$. A noise-minimizing estimator still needs a separate variance calculation from the actual covariance.^[ref]

NIST's before/after pulse baselines provide the physical setting for rejecting background and drift.^[ref] Report the chosen constraint scaling and tolerated leakage. A small solver residual alone establishes neither low variance nor negligible bias for every possible background.