Research portal

Mathematical note

Measurement contracts, uncertainty, and invalidation

math/measurement-contract.md

Edition
Site v0.3.0 · continuous main snapshot
Source revision
ec2865b0eac15148675c629981a545632b3571c5
Extent
1,052 words
Public route
https://www.cordana.dev/math/measurement-contract/
Mapped records21 mapped records

Direct repository links only; no document-level evidence status is implied.

Scope

This note defines the minimum mathematics needed to turn an indication into a decision-bearing result. It connects the metrology audit, Candidate 014, and the energy model. It does not replace a domain-specific measurement procedure.

Result record

For one measured quantity, retain

M=(Y,y^,uc,U,k,Q,P,C,E,S,D,V,t0,t1),\mathcal M=(Y,\hat y,u_c,U,k,\mathcal Q,\mathcal P,\mathcal C, \mathcal E,\mathcal S,\mathcal D,\mathcal V,t_0,t_1),

where:

SymbolMeaningUnit or declaration
YYmeasurand: quantity intended to be measuredphysical unit or named reference scale
y^\hat yvalue estimate attributed to YYsame unit as YY
ucu_ccombined standard uncertaintysame unit as YY
UUexpanded uncertaintysame unit as YY
kkcoverage factor such that U=kucU=ku_cdimensionless
Q\mathcal Qobject, population, component, state, location, and conditionstyped metadata
P\mathcal Pmeasurement procedure and modelversioned identifier
C\mathcal Ccalibration chain, references, corrections, and validity scopedependency record
E\mathcal Eenvironment and influence quantitiesvalues with units
S\mathcal Ssampling, selection, missingness, and association contractprobability/model record
D\mathcal Ddecision rule, tolerance, guard band, and risk allocationversioned rule
V\mathcal Vdata, software, instrument, certificate, and transformation provenancedependency graph
t0,t1t_0,t_1start and end of the supported intervalseconds on a named time basis

The tuple is incomplete when a field that can alter the downstream decision is missing. A confidence score alone cannot represent these distinct dependencies (C-519C-524).

Measurement model and dimensional validity

Let

Y=f(X1,,Xn),Y=f(X_1,\ldots,X_n),

where input quantity XiX_i has unit [Xi][X_i] and YY has unit [Y][Y]. Every additive term produced by ff must have unit [Y][Y]. Software, coefficients, numerical precision, and preprocessing that implement ff are part of P\mathcal P. A coefficient of friction is therefore not portable without its interface pair, load/motion state, environment, procedure, support, and history (C-1497).

For estimates xix_i, first-order covariance propagation gives

uc2(y^)=i=1nj=1ncicju(xi,xj),ci=fXix1,,xn.u_c^2(\hat y)= \sum_{i=1}^{n}\sum_{j=1}^{n} c_i c_j u(x_i,x_j), \qquad c_i=\left.\frac{\partial f}{\partial X_i}\right|_{x_1,\ldots,x_n}.

cic_i has unit [Y]/[Xi][Y]/[X_i] and covariance u(xi,xj)u(x_i,x_j) has unit [Xi][Xj][X_i][X_j], so every summand has unit [Y]2[Y]^2. Removing off-diagonal terms asserts independence; it is not a harmless simplification when calibration, clock, environment, preprocessing, prior, or training data are shared (C-525, C-533). For nonlinear or discontinuous models, propagate sampled input distributions and report empirical interval coverage.

Error, correction, and coverage

Given reference value yrefy_{\mathrm{ref}},

e=y^yref,c=e^,y^corr=y^+c.e=\hat y-y_{\mathrm{ref}}, \qquad c=-\hat e, \qquad \hat y_{\mathrm{corr}}=\hat y+c.

Error ee, correction cc, and corrected estimate y^corr\hat y_{\mathrm{corr}} have unit [Y][Y]. The estimated correction remains uncertain. Expanded uncertainty is

U=kuc,U=k u_c,

where kk is dimensionless. A stated kk does not by itself establish a coverage probability; the distributional method and achieved coverage must be reported (C-524, C-526).

Repeatability and reproducibility

For replicate result ylorsy_{lors} from location ll, operator oo, run rr, and system ss, a variance-component null is

ylors=μ+Ll+Oo+Rr(lo)+Ss+ϵlors.y_{lors}=\mu+L_l+O_o+R_{r(lo)}+S_s+\epsilon_{lors}.

μ\mu and every random effect have unit [Y][Y]; their variances have unit [Y]2[Y]^2. The design declares which factors are fixed or random and which are confounded. A short run with one system estimates repeatability, not broad reproducibility (C-527, C-528).

Decision rules and guard bands

Let specification require YTY\le T, where TT has unit [Y][Y]. A simple guarded acceptance rule is

accept if y^+gUT,\text{accept if }\hat y+gU\le T,

where guard multiplier g0g\ge0 is dimensionless. Increasing gg generally reduces false acceptance while increasing false rejection. Choose gg from a declared loss or risk allocation; do not hide that choice inside “confidence.” The rule version, tolerance version, uncertainty method, and cost owner are dependencies of the decision (C-531).

Drift and recalibration

Represent indication drift relative to the last accepted calibration as

d(t)=ycheck(t)yref(t),d(t)=y_{\mathrm{check}}(t)-y_{\mathrm{ref}}(t),

where dd, check-standard result ychecky_{\mathrm{check}}, and reference value yrefy_{\mathrm{ref}} share unit [Y][Y]. The review policy is a function

πcal=π(ht,rt,ut,ct,et),\pi_{\mathrm{cal}}= \pi(h_t,r_t,u_t,c_t,e_t),

where hth_t is calibration/check history, rtr_t is decision risk, utu_t is current uncertainty, ctc_t is calibration cost, and ete_t is equipment and environment state. Inputs keep their native units; π\pi returns a categorical action such as continue, check, restrict, recalibrate, or quarantine. A calendar interval alone is not evidence of stability (C-532).

Dependency invalidation

Let a directed acyclic graph G=(V,E)G=(V,E) contain calibration, raw-data, software, model, transformation, result, and decision versions. Edge (a,b)E(a,b)\in E means that node bb depends on node aa. If dependency aa changes or fails review, its invalidation cone is

I(a)={vV:av},\mathcal I(a)=\{v\in V: a\leadsto v\},

where ava\leadsto v denotes a directed path and I(a)\mathcal I(a) is a set of version identifiers. Each affected node is re-evaluated, superseded, restricted, or withdrawn; provenance alone does not decide which action is correct (C-534, C-535).

Energy-measurement instantiation

For sampled power PmP_m at time tmt_m with interval Δtm\Delta t_m,

E^=m=1MPmΔtm,\hat E=\sum_{m=1}^{M}P_m\Delta t_m,

where PmP_m is W, Δtm\Delta t_m is s, and E^\hat E is J. The model must name the electrical boundary, voltage/current/phase calibration, bandwidth, anti-aliasing, clock alignment, integration rule, missing-sample policy, warm-up, idle allocation, retries, useful outputs, and facility attribution. Uncertainty propagates through the integration model with shared meter, coefficient, and clock covariance retained.

Compare candidate CC and baseline BB only after both satisfy the same quality, risk, latency, and workload envelope. For paired run rr,

Δer=EC,rNq,C,rEB,rNq,B,r,\Delta e_r= \frac{E_{C,r}}{N_{q,C,r}}- \frac{E_{B,r}}{N_{q,B,r}},

where energies are J, NqN_q is a qualified-event count, and Δer\Delta e_r is J/qualified event. Report absolute values, paired effect, coverage, and all failed or rejected runs. A software counter or narrow device boundary may rank systems differently from calibrated end-to-end measurement; the direction is an empirical question (C-536).

Falsification conditions

Reject the cross-layer composition as a distinct systems contribution if:

  1. a complete conventional metrology, statistics, and content-addressed provenance stack matches its coverage and stale-decision frontier;
  2. it improves results only by receiving extra sensors, calibration runs, compute, storage, or analyst time;
  3. dependencies are recorded but do not trigger correct downstream action;
  4. uncertainty intervals become narrower while empirical coverage worsens;
  5. shared dependencies are counted as independent evidence; or
  6. the metadata and review burden costs more than the errors or work it avoids.