Packaging Systems: Intrinsic Structure, Recovery Ranks, and Globalization Theorems

arXiv:2610.33092 · math.GM · Submitted 2026-10-22 · Read on arXiv

math.GM

Submitted: 2026-10-22

Updated: 2026-10-22

Comments: 177 pages

License: http://creativecommons.org/licenses/by/4.0/

The gist: We define packaged structures through carriers, internal units, incidence, candidate spaces, and selected families.

Abstract

We define packaged structures through carriers, internal units, incidence, candidate spaces, and selected families. A realized packaging system additionally retains a context and formation datum related to its output by a possibly partial, multivalued realization relation. We establish comparison-relative recoverability and non-collapse criteria and an intrinsic refinement-completion theory. For atlas specializations, exact extension becomes a specialization-relative packaging completion problem. Under additional recovery and elimination axioms, we establish general globalization sufficiency criteria and sharp classifications for three classes of compatible finite atlases on a fixed cover H. A geometric obstruction rank ν(H) yields thresholds 2k+1<ν(H) for empty-preserving closures of local Carathéodory number at most k at least1; d<ν(H) for complete functional-dependency theories of local minimum Armstrong size at most d at least3; and 3<ν(H) for transitive relations, including equivalence relations. For nonempty finite label sets and empty-preserving closures, minimum commutant realization dimension equals minimum Armstrong size. We also determine intrinsic recovery ranks and construct canonical clique completions under bounded conformality without chordality. Explicit obstructions establish sharpness; a transport hypothesis is essential for the general recovery--obstruction converse. Complexity bounds apply locally, not necessarily to global extensions.

Related papers