The Paton System provides a structural framework for evaluating admissibility and viability across domains prior to the application of domain-specific dynamics or optimisation. While the framework is typically presented through a sequence of tiers describing reference conditions, boundary formation, relational interaction, admissibility filtering, and recursive generative dynamics, the architecture can be compressed into a minimal symbolic representation. This note introduces the Paton Structural Compression Symbol as a compact expression of the Tier-0 → Tier-5 architecture of the Paton System. The symbol ∞ ● ● ∞ represents the minimal structural configuration required for systems capable of distinction, relational interaction, and continuation. An extended form ∞ ● A ◉ ⟳ ● ∞ incorporates admissibility filtering, datum legibility, and recursive generative dynamics. The purpose of this note is not to introduce new mathematical formalism but to provide a minimal diagrammatic compression of the architecture already established within the Paton System. The symbol functions as a conceptual shorthand for expressing the structural conditions required for system identity, interaction, and persistence across domains.
Andrew John Paton (Wed,) studied this question.