Answers are grounded in this paper and cite their sources.
Two phrases recur in Six Birds Theory: that a packaged object is “robust”, and that an audit “survives” coarsening. This paper makes both precise for finite stochastic systems. Part I shows that robustness of a closure splits into separate questions with separate answers. The approximate fixed points of a single contractive kernel are controlled by its contraction coefficient. Those of two nearby kernels interleave with no contraction hypothesis, while a uniform bound on the motion of exact fixed points needs a contraction gap. Exact multiplicity of stationary laws, the number of extreme stationary laws, equals the number of closed recurrent classes. When there are several classes, an arbitrarily small perturbation can merge them into one, yet the number survives every perturbation that preserves the support graph. Part II makes survival a typed certificate that names the audits, the transformation, the coordinates held fixed and the rule that compares old and new values. Certificates compose when these data match. Under one quotient, available distinctions never increase while valid equations never decrease, and both changes can be strict at once, so no single direction of improvement exists. Provenance survives only as an append-only record. All results are finite and exact, with Lean 4 formalizations.
No takes yet. Share an insight, caveat, or question.
Ioannis Tsiokos (2026) studied this question.
Synapse has enriched 8 closely related papers on similar clinical questions. Consider them for comparative context: