Published August 6, 2026 | Version v1

Informational Composition of PAOs

Description

PAO-Foundation defines informational closure – persistent state, transient computation, write-back – for a single organism, and PAO-Generic proves that any sufficiently regular realization of that invariant induces a Fisher information metric on the organism’s own state space. Both results are stated for one persistent state occupying one manifold. This paper removes that restriction. Given 𝑁 constituent PAOs coupled by fast horizontalsignalling and embedded in a slower vertical organization, we ask when a collective variable 𝑞 = Φ(𝑥1, … , 𝑥𝑁 ) itself satisfies the PAO invariant. We show this reduces to a classical, checkable condition on Φ: it must be a regular, information-preserving coarse-graining of the joint microscopic dynamics, in the precise sense of strong or weak lumpability (Kemeny and Snell) combined with predictive sufficiency in the sense of computational mechanics’ causal states (Shalizi and Crutchfield). Under these conditions the induced collective process is a bona fide PAO in its own right, which we call a quasi-PAO – the qualifier marks a distributed physical realization, not a weaker organizational status. Because a quasi-PAO is itself a PAO, it can serve as a constituent of a still higher composition: closure survives composition, and the resulting hierarchy of real and quasi-PAOs is a corollary of one proposition, not a separately postulated structure. Where the induced collective kernel is additionally regular in PAO-Generic’s sense, its existence theorem applies directly and produces a Fisher information geometry on the collective state space – generally irreducible to any combination of the constituents’ own geometries, a fact we prove rather than assume. We use “informational closure” throughout in the specific three-clause sense fixed by PAO-Foundation, distinct from earlier, differently defined uses of the same term in systems theory and consciousness research, which we cite and distinguish explicitly rather than silently overload. Biological candidates for quasi-PAOs – recurrent memory circuits, central pattern generators – are discussed as illustrative, not verified, instances. The paper closes with a single, explicitly labeled conjecture, not a theorem: that the transition from Proto-Subject to Subject, left open by Proto-Subject’s own Hypothesis, may be realized through successive levels of informational composition culminating in a highest-level quasi-PAO integrating an organism’s adaptive individuality. This paper does not address consciousness, and states plainly where its mathematics stops and its conjecture begins.

Series information

Part 1 of Information-Composition Trilogy

Files

pao-many-body.pdf

Files (91.2 kB)

Name Size
md5:ebdddc96975c8dda2b15be3df4efaea6
91.2 kB Preview Download

Additional details

Additional titles

Subtitle
Quasi-PAOs and the Bridge from Proto-Subject to Subject