Skip to content
Shadow Theory

Section 26 4 October 2026

Outward arithmetic and the complete event sum

Reading position 29 of 37

26 Outward arithmetic and the complete event sum

The preceding arguments identify each error as an event or a nonnegative current functional under the same initial coupling. The preparation, old-wave, new-prefix and copy/hold appendices specify their coefficient formulae and evaluation bounds. No numerical certificate is used in place of an analytic inequality.

For reproducible square-root enclosures, given a nonnegative rational xx and n=1060n=10^{60}, choose the least integer kk with k2≥n2xk^2\ge n^2x; then k/nk/n is an upper bound. Polynomial integrations are exact rational operations, and positive Taylor remainders or explicit derivative bounds control the nonpolynomial terms as detailed in the appendices. The following current ceilings have been rounded outward before combining:

Iold<6.655453611235769×10−16,ΔIS<4.547786946512146880×10−16,IZ<2.574814383253091344×10−15. \begin{aligned} I_{\rm old}&<6.655453611235769\times10^{-16},\\ \Delta I_S&<4.547786946512146880\times10^{-16},\\ I_Z&<2.574814383253091344\times10^{-15}. \end{aligned}

The rank row below is evaluated as 2C2N(Iold+ΔIS+IZ)2C\sqrt{2N(I_{\rm old}+\Delta I_S+I_Z)}, with C=270000/67499C=270000/67499 and N=256001N=256001. Every displayed table entry is itself a rational upper bound; unlike a shortened diagnostic display, these entries may be added directly. The harmless rounding of the pointer-inner event is deliberately included in the sum.

Event or contributionOutward upper bound
Conditional reference endpoint0.0025885322365120500.002588532236512050
Preparation rank0.0000030849495928610.000003084949592861
Initial exact CDF0.0000615780135255960.000061578013525596
Conditional age union0.0002634323272097780.000263432327209778
Conditional exterior union0.0000000154766695810.000000015476669581
Terminal exact CDF0.0000621452143034090.000062145214303409
Aggregate own-rank history0.0003479746500323310.000347974650032331
Copy baseline0.0005370329623955820.000537032962395582
Finite-clock copy correction0.0000109155892150990.000010915589215099
Positive pointer-inner event0.0000000000000000010.000000000000000001
Holding current0.0000000032715698440.000000003271569844
Shared clock core0.0000043788600281740.000004378860028174
Shared whole-interval clock deviation0.0000000000001066900.000000000000106690
Shared actual radial exit0.0000000912721766290.000000091272176629

The first seven rows belong to earlier-label transfer, the next four to copying and retention, and the last three to both arguments. In both proofs the last three are the same clock-core, entire-clock-deviation and actual-radial-exit events of the new wave. Their sum is therefore charged once in the union. Direct addition of the displayed rational ceilings gives

plabel≤0.003331233000157099<.003331233001,pcopy/hold≤0.000552421955492019<.000552421956,punion≤0.003879184823337625,punion+.002207585289≤0.006086770112337625<.006086770113. \begin{aligned} p_{\rm label}&\le 0.003331233000157099<.003331233001,\\ p_{\rm copy/hold}&\le 0.000552421955492019<.000552421956,\\ p_{\rm union}&\le 0.003879184823337625,\\ p_{\rm union}+.002207585289&\le 0.006086770112337625<.006086770113. \end{aligned}

The reference-label ceiling .002207585289.002207585289 already includes both original 10−410^{-4} allowances. Applying Lemma 2.1 proves the advertised joint-record bound without counting either allowance again. The explicit outward sums also show that the last displayed headline digits do not depend on substituting rounded intermediate values into an unreported computation.