Appendix A 9 October 2026
A distinct retained-symbolic-history calibration
A A distinct retained-symbolic-history calibration
The main record theorem extracts the earlier actual digits of a retained archive. A different question is whether a finite expanding calibration can make a writer approximately uniform while its symbolic history remains available. This appendix states the elementary dyadic result explicitly. It separates this symbolic calibration problem from the physical reader, receiver and reset requirements of the 44-cycle apparatus.
Let have an absolutely continuous probability density . After exact doubling steps retain both
Here encodes the complete ordered symbolic history. If is its actual probability, then
The same bound holds after averaging over original contexts if the conditional densities have integrable total variation; retain in both joint laws and replace the numerator by . No uniform estimate for rare contexts is required by this averaged conclusion.
Write and . The joint density in the th history fibre is , whereas its comparison density is . Therefore its contribution to twice the total variation is
The average lies between the essential lower and upper values of the BV representative on this interval. Its distance is at most . Summing the interval variations gives at most the full variation, proving (A.1). Conditional disintegration and integration give the context version. Jumps on dyadic boundaries are included in the full variation and never invalidate this upper bound.
□This is a joint statement with the actual history marginal, so any later common Markov instrument contracts its one initial discrepancy, even if its settings adapt to recorded symbols. To see this, apply that same kernel to the two complete initial measures and use TV contraction. It does not prove that an arbitrary later instrument is an ideal Born instrument: that is an additional property of the comparison experiment.
There is no conflict with fine-archive obstructions. The inverse formula retains all input information in the pair; conditioning only on the finite symbols is coarser than conditioning on an arbitrary analog record that can determine as well. Adding such a side channel can destroy (A.1)'s readiness premise, because its conditional density/variation class changes. Nor does the abstract doubling calculation implement a physical receiver, return or hold by itself.
A.1 Full inverse branches with finite overlap errors
For each original context and previous symbolic history, suppose the next actual calibration map has two increasing absolutely continuous inverse branches . Their full ordered intervals partition and their labels agree with the ideal inverses , . Uniformly in that context and history assume
For an original averaged conditional variation , the joint output distance from uniform quantile times its own actual symbolic-history and original-context marginal is at most
These are hypotheses on the complete actual endpoint map; wave covariance or a small positional displacement alone does not supply them.
For a nonnegative unnormalized BV density , of mass and variation , compare the label-retaining transfers and . The weight difference costs at most , since . For the remaining term use the variation measure: the two arguments can straddle a fixed point only if . That set has length at most . The factor and the two labels therefore give
This argument uses essential BV representatives and extends by BV approximation; endpoints carry no Lebesgue mass. The full-interval and partition assumptions make both transfers mass-preserving positive operators, hence contractions on differences.
At ideal step , sum over the unnormalized histories. Their masses sum to one, and their variations sum to at most by the explicit dyadic formulas. Telescope the true and ideal products, applying each one-step difference to the ideal intermediate densities and using the outer true contractions. Their joint output TV is at most
The ideal law is within of uniform quantile times its own history marginal. Changing that marginal to the true one costs at most another , by marginal contraction. Thus the readiness distance is at most the ideal fee plus , which is bounded by (A.2). Integrate the conditional argument against the original context law throughout.
□For example , , and give a ceiling below . This is an explicit sufficient map-error target, not an attained native 30-cycle implementation. Unlike a uniform derivative bound, the weight hypothesis permits some unbounded endpoint derivatives. Full branch coverage, correct positional labels and the complete context dependence remain essential.
The classical BV transfer-operator context goes back to Lasota–Yorke [1]; the elementary proof here does not import their full invariant-density theorem. The conditional formulation retains the original context and the full branch Jacobians. If that context includes a controller, it can be treated as a fixed parameter only when the active subsystem is closed at that context. A dynamical controller instead belongs to the complete transported configuration and requires its own original-law and current assumptions. A quantum controller marginal does not justify discarding a singular actual controller. The abstract branch theorem therefore supplies a calibration interface, rather than a physical implementation of repeated records.