Observable Quotients and Exact Projected Dynamics: Closure, Memory, Minimal Dynamical Completion, and Effective Field Operators
The exact projected-dynamics identity
The exact projected-dynamics identity
Assumption 6.1.
For the remainder of Sections 6–7: is a Hilbert space; is an orthogonal projection onto a closed resolved subspace ; is the orthogonal projection onto the unresolved subspace ; and generates the source evolution whose unique solution is .
This is the case of the previous section: the readout literally is the resolved component, , is closed, and . It is the setting in which the cost of failed descent can be computed in closed form. Write so that and , . Applying and to (6.1) and inserting gives the exact block system Note that measures precisely how the unresolved sector drives the resolved one, and how the resolved sector feeds back into the unresolved one.
Theorem 6.2 (Exact projected-dynamics equation).
Under Assumption 6.1, for every source initial state the resolved component satisfies, for all , Defining the unresolved-initial-state term and the memory kernel equation (6.5) reads Both and are continuous in , with the bounds and .
Proof. Equation (6.4) is an inhomogeneous linear ODE in the Banach space with bounded generator and continuous inhomogeneity (continuous because is norm-continuous and is bounded). Variation of constants gives the unique solution the integral being a Riemann (equivalently Bochner) integral of a continuous -valued integrand. Indeed, put ; then is differentiable with by (6.4), and integrating from to and multiplying by yields (6.9). Uniqueness holds because the difference of two solutions solves the homogeneous equation with zero data.
Substituting (6.9) into (6.3) and applying the bounded operator under the integral sign gives which is (6.5); (6.8) is a rewriting using (6.6) and (6.7), noting has argument throughout the integration range. The stated bounds follow from and submultiplicativity; continuity in follows from norm-continuity of . ◻
Remark 24 (What (6.5) is, and what it is not).
Equation (6.5) is an identity, valid for every source solution, obtained by nothing more than variation of constants. It is the projection-operator identity of Mori and Zwanzig [20, 10, 21] in the special case of a bounded generator and an orthogonal projection. In that literature the second term is often called the “fluctuating force” or “noise”, and the “friction kernel”. We use neither word without qualification, and we record explicitly what has not been done here:
is not stochastic. It is a deterministic, linear, continuous function of the single vector , given by the closed formula (6.6). It becomes a random process only if one additionally posits a probability measure on the unresolved initial data, an equilibrium ensemble, say, and that is an extra modelling hypothesis with its own physical content. We impose no such measure.
is not a friction coefficient. It is the exact kernel (6.7). No fluctuation–dissipation relation has been derived, because no ensemble has been introduced with respect to which one could be stated.
No Markov approximation has been made. The convolution in (6.8) is over the entire history . Replacing by -correlated kernel, or taking a timescale-separation limit, would produce a different (approximate) equation; we take no such limit.
No ensemble average or coarse-graining functional appears. is an orthogonal projection on a Hilbert space, chosen by the modeller, and nothing else.
The physical content of (6.8) is therefore modest and exact: if the resolved sector does not close, then the resolved trajectory is determined by resolved initial data plus an inhomogeneity carrying unresolved initial data plus a convolution over its own past. These are three structurally distinct dependences, and (6.8) says they are the only ones.
Theorem 6.4 (Autonomous-closure criterion).
Under Assumption 6.1, the following are equivalent.
There exists a single operator such that, for every source initial state , that is, for every and every , the resolved component satisfies the autonomous first-order equation
.
, i.e. .
When they hold, is unique, and both (for every ) and .
Proof. (2)(1) and the value of . If then (6.3) reduces immediately to for every source solution, which is (6.10) with . Moreover for all and all , and , so the last two terms of (6.8) vanish identically, consistently.
(1)(2). This is where the quantifier “for every source initial state” does the work. Fix any and any two unresolved data . The two source initial states and have the same resolved component . By hypothesis both resolved trajectories obey (6.10) with the same , so evaluating at , On the other hand (6.3) at gives the true initial velocities Equating and cancelling yields . Since range over all of , the difference ranges over all of , whence as an operator . Taking in (6.10) and (6.3) then forces for all , i.e. , which also gives uniqueness of .
(2)(3). . Now means for every , i.e. for every , i.e. . Conversely gives for , so . ◻
Remark 26 (The quantifier is not decorative).
Theorem 6.4 is a statement about all source states. Three distinct weaker phenomena must not be mistaken for autonomous closure:
Closure on a prepared state. If , see (7.2), then and the initial-state term drops out for that state. The memory kernel is unaffected: by (6.7) it is determined by and alone and does not depend on at all, so no preparation of the unresolved initial data can remove it. The resolved motion of such a state is therefore still history-dependent, and other initial states fail even the weaker condition. Vanishing of the initial-state term in one specially prepared state is not closure.
Static quotient. That is a perfectly good Hilbert space says nothing whatever about . This is (D1)/(D4) again.
Small singular values. That has small norm makes the coupling weak and may justify a perturbative approximation, with a controllable error. It does not make the projected equation autonomous, and no truncation of (6.8) is exact unless identically. This is (D3)/(D4).
Finally, observe that Theorem 6.4(3) is precisely the invariance condition (5.8) of Proposition 5.5 for the observation operator , whose kernel is . Theorems 5.2 and 6.4 therefore agree, as they must: the semigroup descends exactly when the projected equation closes.
Example 6.6 (A completely calculated block).
Take with the standard basis , let project onto and onto , and let so that with . Write for the resolved component and .
(i) Same readout, different projected velocity. Suppose . The two source states and have identical resolved component , hence identical readout at . By (6.3), No autonomous law can produce both, confirming Theorem 6.4: here .
(ii) The initial-state term and memory kernel. Since is diagonal, , and (6.6), (6.7) give in closed form so the exact projected equation (6.8) is the scalar Volterra equation Everything here is deterministic: is a sum of two exponentials with coefficients read off from ; there is no noise in sight.
(iii) and . Here , so Proposition 7.7 gives , i.e. the solutions of The observability matrix has determinant . Case A: and . Then the determinant is nonzero, so and : both unresolved directions are dynamically distinguishable and must be retained. Case B: , . Then both rows are multiples of , so and : the direction never influences the resolved trajectory through the initial-state term, and the minimal completion retains only (indeed also loses its contribution). Note that is not dynamically trivial, it evolves as , it is merely unobservable in the resolved response, which is exactly the relativization Theorem 7.4 makes precise.