Manuscript X-A-conv-ST@1 · X-A-conv-ST.tex · proposition · 8ca47088

Proposition: No cross-prescription repair

Bounded comparisons and the separate ramp prescription › The ramp is not a convolution repair · lines 1948–1969 · proof included or linked

X-A-conv-ST@1#prop:separation

Back to manuscript

The ramp plateau identity, the convolution obstruction, and scalar-only negative readout closure are compatible. Neither the ramp nor its later scalar, tree, or free BRST/BV sheets changes the frozen convolution prescription by any operation constructed here.

Proof. The convolution obstruction follows from (eq:regulator)–(eq:preflight) and (eq:energy), without a ramp premise. The ramp identity concerns a different response map and supported algebra. The orbit theorem concerns the scalar family (eq:orbit), not every already invariant scalar.

The finite instruments act on declared finite inputs. None changes , , or either classical action prescription.

Nearby in this section