Proposition: Calibration boundaries

Let distinct numbers ${\theta }_a$ label clock codes. At one actual reading event $e$, exact event-time calibration

forces a single deterministic outcome. If no label equals $T(e)$, it is impossible for a normalized input.

A history or programme dictionary may instead associate $a$ with a different labeled event, arrival, route, or stored incidence parameter. It need not equal the actual reading time.

Proof. Distinctness allows at most one matching index and the probabilities sum to one. The dictionary interpretation makes no claim that several different labels are coordinates of the same reading event.