Measured Rendition Theory: A Structural Theory of Information

Abstract

Information theory provides a precise calculus for transmission, compression, and coding, yet it does not by itself define the structured entity whose information is transmitted, compressed, or measured. This paper introduces Measured Rendition Theory (MRT), a constructive axiomatics for multi-scale informational structure.The theory begins with a single base axiom: a finite probability space with full support. Given domain-supplied requirement families, it constructs distinction as a generating operation, the rendition as a central output, and the crystal as an emergent object. Distinction is represented extensionally by a partition; a rendition is the quotient map that converts measured possibility into addressable blocks; and a crystal is the coherent diagram of renditions selected across multiple levels of resolution. The formal development establishes six principal results. First, assigning quotient renditions to partitions and canonical reductions to refinement relations defines a functor from the opposite partition lattice to the category of measured quotients of the source, and this functor is an equivalence of categories. Second, logical entropy admits an exact fiberwise decomposition under refinement, and the same decomposition telescopes with recursive form-invariance along every refinement chain. Third, domain requirements generate least admissible partitions through a Galois insertion whose closure is exactly an FCA intent closure and whose generated partition is exactly the Pawlak indiscernibility partition of the corresponding Boolean predicates; binary cuts serve both as the atoms of the partition lattice and as carriers of elementary distinction weight. Fourth, the crystal induces a total address map whose realized image is canonically isomorphic to the quotient by the common refinement; this quotient is the unique coarsest exact rendition from which every selected level address can be recovered. The remaining formal addresses constitute the defect set, an exact realizability obstruction that vanishes whenever the selected level system contains its join. Fifth, every block has a dual status as both a rendered unit and a conditional measured subspace. Sixth, the interval above a partition decomposes as a product of the partition lattices of its blocks. Along a chain, the construction canonically determines a filtration of finite sigma-algebras. Over a general finite poset, it organizes a domain-selected family of quotient observables without imposing a temporal interpretation. Applications to sentence production, database indexing, urban structure, and compilation show how the same architecture supports constructive, exact, and deconstructive readings. Provenance-enriched compilation realizes the theory’s refinement asymmetry exactly, while the ordinary compiler tower supplies its strongest engineering convergence. The complete construction is called informational crystallization: the admissibility-guided formation of a coherent, measured lineage of renditions.