Non-Source Projection and Internal Identifiability
The projected-law dichotomy
The projected-law dichotomy
Descent of dynamics
Definition 5.1 (Source evolution and autonomy).
Let , (with or ), be a deterministic source evolution, i.e. and . The readout dynamics are autonomous if there exist maps with
(16) is the exact formalization of the statement “the present readout determines the future readout”. We stress that it is a deterministic and instantaneous demand: takes as input the readout state at one time, and nothing else , no history, no auxiliary variable, no distribution.
Theorem 5.2 (Projected-law dichotomy).
Exactly one of the following holds.
Case I (fiber-preserving). For all and all , Then there exist unique maps satisfying (16), and they form a semigroup: , . The readout law is autonomous.
Case II (fiber-breaking). There exist and with Then no family of maps satisfies (16); no deterministic law on the instantaneous readout state reproduces every source trajectory.
Proof. The two cases are the negation of one another, hence exhaustive and mutually exclusive.
Case I. Condition (17) says precisely that, for each fixed , the map is constant on the fibers of . Since is surjective, Lemma 3.2 supplies a unique with , namely , well defined exactly by (17). For the semigroup law, evaluate on an arbitrary (surjectivity again): and .
Case II. Suppose some satisfied (16), and let be as in (18). Then where the middle equality uses and the fact that is a function of the readout state. This contradicts (18). Hence no such exists. ◻
Corollary 5.3 (Coherence does not imply source completeness).
Case I is compatible with noninjective. Autonomous, deterministic, internally coherent readout laws establish that the dynamics preserves the readout equivalence classes; they do not establish that those classes are singletons.
Proof. It suffices to exhibit an instance, which Example 5.5 does. Formally: (17) constrains to map -classes into -classes; it places no constraint whatsoever on the cardinality of those classes. ◻
Corollary 5.3 is the single most important negative result of this paper, and the one most easily lost. An observer inside in Case I sees a world with exact deterministic laws, perfectly closed, admitting no anomaly and no residue. That observer’s evidence is entirely consistent with being the whole of physical reality, and entirely consistent with being a proper quotient of a strictly larger source. Dynamical closure is evidence of fiber preservation, not of fiber triviality.
What failed descent actually requires
In Case II the instantaneous readout state is insufficient, and one must say for what. The three targets below are routinely conflated; they are not the same, and only the first is an exact reconstruction.
Exact trajectory prediction. To recover for the individual realized , one needs strictly more than : either additional state information (a completion variable, i.e. a refinement sufficient for the target “future readout”, in the sense of Definition 4.3), or an equivalent history-dependent description that encodes the same information in the past of the trajectory. Which of the two one uses is a matter of representation; the information content required is fixed by the fiber structure.
Statistical prediction. One may instead supply a probability distribution over the unresolved states within the fiber . This yields a distribution over future readouts. But note carefully: this is a prediction only after an additional probabilistic model is supplied , namely the within-fiber distribution, which is not determined by the deterministic data . It is an addition to the model, not a consequence of it. And what it delivers is a law over futures, not an exact reconstruction of the individual source trajectory.
Memory representation. One may retain a functional of the past readout. This is exact only when the past readout in fact determines the relevant fiber coordinate; in general it does not, and then memory too is only a partial substitute.
We do not assert that any of these is always available. Case II asserts a negative , that the instantaneous readout state does not suffice , and nothing more.
The Hilbert-space instance
Specialize to Example 2.9: , bounded with closed, and let the source evolution be a strongly continuous group with generator . The dichotomy takes an operator form.
Proposition 5.4 (Invariance criterion).
The evolution is fiber-preserving in the sense of (17) if and only if
Proof. Fibers of are the cosets . Condition (17) reads: . Writing , the hypothesis is and the conclusion is , i.e. . Quantifying over all and all gives exactly (19). (Linearity of and is used in both directions.) ◻
Now let be the orthogonal projection of onto the closed subspace , the “resolved” subspace, and the projection onto , the “unresolved” subspace. (We write rather than to avoid collision with the target and with the generator of §9; in the Mori–Zwanzig literature this operator is universally called .) For a bounded generator , invariance (19) is equivalent to the infinitesimal condition i.e. the generator does not map unresolved directions into resolved ones. Failure of (20) is Case II. Irrespective of whether (20) holds, the standard Nakajima–Zwanzig–Mori projection [13, 15, 12] yields an exact identity for the resolved component, which for bounded we derive here by variation of constants, so that the manuscript remains self-contained.
Write , so that , and split it by the two projections: (The letter here denotes the resolved component of the state, following the standard notation of the projection literature; it is not the readout map of §2, and no confusion should arise, as the readout does not appear in this derivation.) Since and are constant projections with , applying each to gives the coupled pair Now read (22) as an inhomogeneous linear equation for , with generator and inhomogeneity regarded as a given source term. Because is bounded, so is , and is a norm-continuous semigroup; variation of constants (equivalently, differentiating and integrating from to ) gives the unique solution Substituting (23) into the term of (21), and using together with , yields the exact identity
Four points must be made about (24), because it is the most frequently over-read equation in this circle of ideas.
First: is a source-side coordinate, not the declared readout. The projection formalism evolves , the component of the source state in . The declared readout of our architecture, by contrast, is . These are different objects living in different spaces, and the identification of the two requires an argument. Under the closed-range hypothesis it is available: the restriction is a bounded linear bijection between Banach spaces (injective because ; surjective onto by the orthogonal decomposition and ), and is closed, hence complete; so the bounded inverse theorem supplies a bounded inverse. Thus is a topological isomorphism, and the two observable-state descriptions are equivalent: convergence, boundedness, and continuity statements transfer between them. Without closed range this stability fails , the inverse need not be bounded , and although the set-theoretic quotient (4) still holds, one may no longer freely trade for in any topological or approximation-theoretic claim.
Second: (24) is exact and deterministic. No stochasticity, no coarse-graining approximation, and no thermodynamic limit has been invoked. The second and third terms are not noise; they are definite functionals of the initial unresolved data and of the resolved history respectively.
Third: the exact relation between and the vanishing of the two anomalous terms. This must be stated with care, and the naive reading , that the two terms vanish or fail to vanish together , is false. The correct statement is:
is equivalent to autonomous closure for every source state (Proposition 5.4 together with (20));
when , both the unresolved-initial-state term and the memory kernel vanish identically, since each carries as a left factor , recovering . This is Theorem 5.2 in operator dress;
conversely, if , then the initial-state response is nonzero for some unresolved initial state , choose with and evaluate at ;
but the memory kernel may nevertheless vanish separately. It carries the additional right factor , so it vanishes identically whenever , the case where the generator feeds unresolved directions into resolved ones but not conversely , and it may also vanish through cancellation in the intervening propagator .
We therefore do not claim that memory must be nonzero whenever closure fails. Failure of closure guarantees a nonzero initial-state response for some unresolved datum; it guarantees nothing about the memory term.
Fourth: what the unresolved-initial-state term signifies. It depends on , which is exactly the fiber coordinate , the information the readout discards. Its presence is the analytic signature of the non-source projection: the projected law is not merely inconvenient but genuinely underdetermined by alone. Calling the term “noise” is an additional modelling decision (cf. §5.2(2)), not a theorem; and so, equally, is any replacement of it by a memory kernel.
Examples
Example 5.5 (Noninjective but fiber-preserving: coherent laws without source completeness).
Let with , all four states physically inequivalent. Let the readout forget the second coordinate: Fibers are , doubletons, so is not injective. Let the discrete-time source evolution be Then depends only on , so (17) holds and the readout law is autonomous: An observer confined to sees a perfectly deterministic period-2 world, exactly predicted by an autonomous law, with no residue and no anomaly whatever. Yet is noninjective, and the hidden coordinate evolves nontrivially the entire time. This is Corollary 5.3 in miniature: the readout is closed and the source is strictly larger. If, moreover, some target depends on , say , then (13) holds for , , and by Theorem 4.5 the autonomous, coherent readout is a non-source projection relative to . Autonomy buys no protection against this.
Example 5.6 (Fiber-breaking: failure of autonomous projected evolution).
Keep and , but now let so that the hidden coordinate drives the visible one. Take One step gives and , whence which is (18). By Theorem 5.2, no map can satisfy (16): it would have to send the single readout value to both and . The readout observer sees the state sometimes remain and sometimes become , with nothing in the readout to explain the difference.
What repairs it is instructive and matches §5.2 exactly. (i) Completion: adjoin , take with , and the dynamics is deterministic and closed on . Indeed the minimal sufficient extension for the target “next readout” is with , which one computes to be , i.e. all four pairs , a four-element set properly refining the two-element , and in this instance recovering . (ii) Statistics: posit a within-fiber distribution, say independent of , sampled once at the initial time. It is essential to describe the resulting readout process correctly, and it is not a symmetric random walk with independent increments. Because leaves fixed, the same sampled controls every subsequent step: with drawn once and thereafter constant. Hence:
the first transition stays () or flips () with probability each, which coincides with what a symmetric random walk would predict;
all subsequent increments are perfectly correlated with the first, since the increment is the same at every step , the walk either never moves or alternates forever;
consequently the observed history already reveals exactly, namely , and every later step is thereafter deterministic;
the projected process is therefore a mixture of two deterministic trajectories , the constant one and the period-two alternating one, each with weight , and not an i.i.d. random walk.
The randomness is entirely in the initial draw of the fiber coordinate, not in the transitions. This is precisely the distinction the section is for: a within-fiber distribution is not a Markov law on the instantaneous readout. A genuine symmetric random walk on would resample an independent increment at every step and would have a well-defined Markov generator on ; the present process has neither, and indeed by Theorem 5.2 it cannot, since is fiber-breaking. Note also that the Bernoulli law is an extra assumption: the deterministic data does not supply it, and a different within-fiber law gives a different projected process. (iii) Memory: here is conserved and, as just computed, is exposed by the readout’s own first transition, so a one-step memory suffices to restore prediction. This is a special feature of this example , happens to be both conserved and immediately visible in the readout increment , and not a general remedy; in general the past readout need not determine the fiber coordinate at all.