We develop a self-contained geometry of averaging shared by changes of resolution and the evolution of history. On a finite weighted carrier, preservation of the mass of every block uniquely determines conditional averaging; the resulting operator is a positive orthogonal projection. Nested resolutions split fields into orthogonal detail bands and yield exact Pythagorean identities, including the full Hermitian Gram matrices of complex-valued families. A single binary readout transported along a reversible finite history generates an increasing cascade of memory windows. Successive projection increments are orthogonal, step entropy decreases with window length and telescopes to the information added by the complete history, while directed transition counts separate into a self-adjoint component and an anti-Hermitian component carrying orientation. Counts, compressions, and their Dirichlet forms aggregate exactly between adjacent windows, making refinement and coarse-graining two directions of the same orthogonal geometry. We then study dynamics and imperfect transport. Projection memory, Schur complementation, and moving resolutions arise from the same visible–hidden decomposition. Local compatibility defects telescope to the error of the complete transported history. Sharp margin estimates separate the irreducible loss caused by the initially hidden sector from the additional cost accumulated by sequential coarse transport. Under summable defects and transverse mixing, the transported history converges in operator norm. Under defects summable in Hilbert–Schmidt norm and isometric transport, it admits an exact defect-free shadow with an explicit correction cost and control of every finite full Gram. The resulting calculus connects distinguishability, multiscale averaging, memory, and stable history transport within one verifiable construction.
We develop a self-contained geometry of averaging shared by changes of resolution and the evolution of history. On a finite weighted carrier, preservation of the mass of every block uniquely determines conditional averaging; the resulting operator is a positive orthogonal projection. Nested resolutions split fields into orthogonal detail bands and yield exact Pythagorean identities, including the full Hermitian Gram matrices of complex-valued families. A single binary readout transported along a reversible finite history generates an increasing cascade of memory windows. Successive projection increments are orthogonal, step entropy decreases with window length and telescopes to the information added by the complete history, while directed transition counts separate into a self-adjoint component and an anti-Hermitian component carrying orientation. Counts, compressions, and their Dirichlet forms aggregate exactly between adjacent windows, making refinement and coarse-graining two directions of the same orthogonal geometry. We then study dynamics and imperfect transport. Projection memory, Schur complementation, and moving resolutions arise from the same visible–hidden decomposition. Local compatibility defects telescope to the error of the complete transported history. Sharp margin estimates separate the irreducible loss caused by the initially hidden sector from the additional cost accumulated by sequential coarse transport. Under summable defects and transverse mixing, the transported history converges in operator norm. Under defects summable in Hilbert–Schmidt norm and isometric transport, it admits an exact defect-free shadow with an explicit correction cost and control of every finite full Gram. The resulting calculus connects distinguishability, multiscale averaging, memory, and stable history transport within one verifiable construction.
Effective descriptions are usually constructed after separating a system into observable and hidden sectors. When this decomposition itself varies with time or with an external parameter, ordinary differentiation mixes changes of the full operator with changes caused purely by the motion of the underlying subspaces. This work develops a covariant theory of response reduction for moving subspaces of a Hilbert space. Geometric transport is combined with operator reduction so that intrinsic variation of the system can be distinguished from variation induced by the moving visible–hidden splitting. The reduced response is then followed beyond a single instant, retaining information carried by its accumulated history. The analysis separates endpoint response, path-dependent correlations, and geometric memory. These objects need not determine one another. Singular transitions in the effective carrier and regulated families approaching such transitions are also incorporated into the same framework. The central conclusion is that an instantaneous reduced operator contains less information than the process by which it was obtained. Correlations between different stages of the evolution and geometric memory of the moving subspace remain invisible to purely local or scalar descriptions.
For compact spaces of compatible histories endowed with an execution law, we determine when viability at every finite horizon produces a positive mass of infinite histories and what cost accumulates at successive losses of margin. A single profile separates three thresholds: geometric possibility, accessibility from the initial law and positive execution mass. The full mass profile satisfies an exact factorization into initial survival and conditional hazards. Summability of these hazards preserves a positive mass of full histories whenever survival has positive mass at each finite horizon. The step-loss moment and the mass of the threshold layer yield a sharp interpolation law with an optimal constant. For a prescribed hazard, we determine the exact infimum of the corresponding moment cost and quantify the excess cost of an actual loss. A uniform tail transports the entire mass profile and its quantiles through limits of approximating families. Entropic tilting gives the minimal information cost of enforcing a prescribed persistence probability and the exact unresolved cost remaining after a finite prefix has been observed. In the Feshbach–Schur realization, the two positive components of the full Hermitian Gram matrix produce a quadratic hazard on the active fibers, while the graph lift accounts for preparation mass before conditioning. A telescope of overlapping frames gives the strong limit of the Gram matrix, an exact noncollapse criterion and a dark tail governing norm convergence; a separate criterion closes the phase. For signed pairs of legs, the minimal cover operator determines the full signature and a global norm trichotomy. Common domination of fresh layers extends to the complete tail, and in one dimension the tail coefficient is the exact weighted average of the layer coefficients.
Papers 1-2 of this series derived Born weights conditionally from the block’s Riemannian geometry: the canonical volume determines the Hilbert structure, the induced projective geometry determines the ray measure, and Gleason noncontextuality fixes the trace assignment. What remained was the confirmation problem: in a block ontology every compatible history and every compatible observer-instance exists, so probability must be a measure over realised record-relative viewpoints, not a chance of becoming actual. This paper builds the record-theoretic and statistical structure that closes that gap, up to two explicitly priced commitments. The central claim, calibrated. In a non-splitting block ontology, perfect record cells inherit the Born measure and its exact conditional calculus. Under a persistent-prefix distinguishability condition (Assumption PF, stated prominently), interference remains uniformly controlled through arbitrarily deep finite record refinements. The resulting static record filtration obeys martingale concentration without independence assumptions, and — conditional on the explicitly priced viewpoint-typicality principle (Commitment TY) — Born conditional probabilities are exponentially confirmed against persistently different rival policies, including adaptive history-dependent rivals. The supporting structure: an exact perfect-record projector calculus; a closed sequential interference bound whose index is refinement depth, not flowing time; an explicit block-compatible recorder family (translated Gaussian fragments, and intrinsically, normalised heat-kernel packets on the block’s own S3) for which the record-overlap exponents and minimum redundancy thresholds are derived in closed form — the recorder family itself is not yet derived from block dynamics; and a canonical Gram-polar construction that associates to any imperfect record family, at each fixed depth, an exact Boolean hierarchy of projectors within explicitly bounded distance of the raw records — a finite-depth canonical Booleanisation, with cross-depth projective consistency an open problem. The coherent event weight Q is used only comparatively: it is not an additive probability measure for imperfect records, and the paper states the resulting trade-off explicitly. Two commitments carry the non-mathematical load and are priced, not hidden. Commitment OL: observer continuity is represented by record-functional equivalence across compatible continuations. Commitment TY: rational expectation over the record-equivalent continuations follows the canonical conditional measure. Given TY, the block-derived Born measure is internally self-confirming on record-typical viewpoints; without it, the mathematics fixes the measure but not its first-person authority. No collapse, branch creation, privileged actuality, pointer-basis selection, or theory of consciousness is used. Finite-resolution results on the block’s S3 truncation ladder (exact spectral-leakage identities, a conditional Sobolev rate, the Gleason dimension threshold) are collected in Appendix B.
We solve cyclic finite-dimensional quantum histories for arbitrary time-dependent unitary steps, without assuming that one step has finite order. The propagation Hamiltonian is a unitary connection Laplacian on a cycle; its complete gauge invariant is the monodromy M=UL−1⋯U0. Its spectrum is λa,k=1−cos((2πk−θa)/L), where eiθa∈spec(M). Thus the exact history sector is isomorphic to Fix(M), while frustration, the gap above a nonempty zero-energy sector, the determinant, and the finite-temperature trace are obtained in closed form. Ordinary spectral data recover the multiset of monodromy phase cosines but not phase orientation; low energy certifies proximity to an exact relational history. We then define the predictive quotient of a sharp finite clock relative to an accessible operator system as the unique coarsest event alphabet preserving all conditional statistics on a history sector. A finite-error theorem shows that threshold clustering recovers this quotient when the minimum diamond separation of inequivalent event channels exceeds four times the estimation error, and proves an optimal record-count bound. With full matrix access and homogeneous step U, the minimal number of clock events is the projective order of U. We distinguish the normalizer of the clock algebra from transformations preserving the coherent history code and classify oriented exact sharp clock changes by U(r)×ZL on a rank-r history sector; without orientation the cyclic factor becomes dihedral. Reversible changes of full-information clock fibers are necessarily unitary, so irreversible coarse-graining is not exact clock covariance. Minimal realizations of a complete history Gram kernel are uniquely unitarily equivalent, with a finite-data Procrustes bound. Independent finite-matrix code verifies the main results.
Complex multiplication, coherent addition, and quadratic readout are related ingredients of quantum calculation, but they answer different reconstruction questions. We separate them on a supplied reciprocal carrier. The centralizer of a complex structure on a real two-plane is the complex algebra; its invertible transports are nevertheless not closed under the addition needed for destructive interference at a selected output. A one-outcome dephaser and a reversible phase kick show that certainty of a public outcome does not imply nondisturbance. Within an explicitly assumed positive quadratic response class, calibrated zero-leakage comparisons on a connected tree select the all-ones Gram kernel. We prove quantitative stability estimates and retain the distinction between unconditional record-local operations, selective conditioning, and a controlled inverse interaction. A local normalized-weight ansatz, arbitrary anchored orthogonal refinement, and additive coarse-graining of recorded outcomes force weights proportional to quadratic size. Equal binary refinement alone does not: a positive continuous increasing log-periodic function supplies a counterexample, while binary and ternary refinement at every size, with continuity, recover linearity in size. Real rotations implement the requisite refinements and controlled tagging without full complex control. Fixed-complement preservation and reciprocal reversal admit different generator sectors; independently switchable real mixers on a connected graph plus one addressable local phase generate the unitary Lie algebra. A common scalar phase does not. Supplementary finite action–phase and history examples expose the remaining calibration assumptions. The contribution is an assumption-controlled synthesis of conditional selectors and obstructions, not the introduction of the standard component constructions. The carrier, comparison response, control resources, tensor interpretation, and empirical probability interface are not derived from primitive complementarity.
The consistent histories formulation of quantum mechanics assigns classical probabilities to sequences of coarse-grained events when the corresponding interference terms vanish. In finite models these terms generically need not vanish exactly, and their smallness alone supplies no asymptotic geometry on the space of histories. We construct such a geometry for histories that accumulate quantum records. When the normalized Dowker - Halliwell interference between two histories factorizes as the cumulative fidelity of their records, its decay is controlled by the accumulated squared Bures distance. In the infinite registration limit, the Kakutani - von Neumann dichotomy gives a sharp sector alternative: summable Bures defect yields weakly equivalent record sequences, whereas nonsummable defect produces orthogonal superselection sectors and vanishing normalized interference. The convergence exponent of the Bures defect defines a pseudo-ultrametric on histories. After quotienting its zero distance degeneracy, it becomes a complete ultrametric, requiring neither compactness of the outcome space nor continuity of the record family, and coincides with the gauge invariant sector metric d~ introduced in \cite{LesTP}. Its value, the \emph{consistency rate}, has three equivalent interpretations: it is the sector separation metric, the polynomial growth exponent of the negative logarithm of normalized interference, and, by the Helstrom formula, the corresponding exponent of the negative logarithm of the minimum error probability for discriminating the cumulative records. Classical separation profiles determine the rate: positive long time mean defect gives the maximal value δ=1, while the borderline profile dm2≍m−1 produces distinct superselection sectors at zero polynomial rate, δ=0.