Memory-Weighted Load, Hidden State, and Recoverability in Coherence Systems

This paper studies how accumulated load, hidden memory, and recoverability interact in dynamical systems with one-sided memory kernels.

We define a memory-weighted load functional that combines a system’s previous external load with a nonnegative memory kernel. When the external load is non-decreasing, the remembered load is proven to be non-decreasing. This produces a declining modeled recoverability-budget proxy, representing the amount of remaining recovery capacity after accumulated remembered load is subtracted from an initial budget.

The paper also demonstrates that the visible present is not always a sufficient description of a system. An explicit exponential-memory construction produces two admissible states with the same visible value but different hidden memory values. Because the hidden memory differs, the systems have different immediate rates of change and consequently different short-term futures.

For a stable linear memory subclass, the paper constructs an exact positive quadratic Lyapunov storage functional. In the isolated case, this storage quantity decreases monotonically. Under additive external forcing, it satisfies an exact supply inequality relative to a constructed storage-conjugate output.

The paper includes analytical proofs, computational certification, negative controls, empirical falsification criteria, and clearly stated limitations. The numerical certification tests include randomized nonnegative kernels, monotone and nonmonotone load profiles, explicit hidden-state constructions, independent Lyapunov-equation solutions, and pointwise verification of the storage identity.

The results are deliberately limited. The paper does not claim to derive temporal order, fundamental non-invertibility, a universal thermodynamic second law, or a general spectral-collapse theorem. It establishes a narrower mathematical core for studying how remembered load can accumulate, how hidden history can affect future behavior, and how storage and dissipation operate in a tractable linear memory system.

The deposited supporting Python file contains the computational certification tests used to check the analytical results.