Manuscript X-Enter@1 · X-Enter.tex · section · 484b71bc

Option C: bounded-segment tolerance and visibility

Option C: bounded-segment tolerance and visibility · lines 1035–1096

X-Enter@1#eq:segment, X-Enter@1#eq:scaleinterval, X-Enter@1#eq:tradeoff

Back to manuscript

Declare a new restriction

This is not the original convolution gauge algebra. Plateau support alone cannot supply such a bound: multiplying a supported gauge vector by any real number preserves its support. The ramp algebra likewise supplies no , since every real multiple of a vector supported in its remains supported there. This observation does not introduce a convolution defect into the already invariant ramp observable.

For the direct convolution amplitude trial,

This is approximate closure, not invariance.

To make the trade-off precise, prescribe a tolerance and a desired visibility for a nonzero benchmark signal of magnitude . Its flat-baseline visibility is

Both requirements hold exactly when

Indeed, monotonicity of makes the tolerance condition equivalent to the lower bound and the visibility condition equivalent to the upper bound. Thus a suitable scale exists if and only if

There is no unconditional statement that the signal must dominate the defect: the required ratio depends on the visibility target relative to the tolerated variation. At , no finite scale gives exact closure for .

Calling a physical signal requires independent provenance or a justified choice of representatives. A scalar input alone does not distinguish a physical displacement from a gauge displacement.

Displayed formulas in this passage

  • X-Enter@1#eq:segment · line 1052

  • X-Enter@1#eq:scaleinterval · line 1071

  • X-Enter@1#eq:tradeoff · line 1081

  • unlabeled · line 1039

  • unlabeled · line 1067