So Below: Empirical Exploration of the Universal Imscriptive Grammar

Abstract

We introduce the Universal Imscriptive Grammar (Universal Imscriptive Grammar): a twelve-primitive grammar assigning any system a coordinate in a discrete space of 17,280,000 types — the Crystal of Types. Induced from the scientific literature as the minimal shared properties of recognition events, the twelve primitives are independently confirmed by a companion categorical derivation (As Above). The derivations are Frobenius duals (𝜇 ∘ 𝛿 = id): this paper is the 𝜇 half. A central theorem, mechanised and universally quantified, establishes Frobenius non-synthesizability: a single sub-Frobenius component suffices to deny 𐑹 to a composition of any size, so no accumulation strategy reaches it. The grammar encodes itself at address 6,734,591 in the 𝑂∞ tier of the Crystal it derives. Validated across over 5,000 imscribed systems: the inflationary epoch and high-dose 5-MeO-DMT dissolution imscribe to identical tuples (𝑑 = 0.000); the Riemann Hypothesis is a completeness question about 𐑹 on the critical line; a two-gate consciousness score predicts 𝐶 = 0.677 for magnetars, 𝐶 = 0 for black holes and white dwarfs; the Liar paradox requires 𝑃 = 𐑹 — dialetheia is structurally necessary. The grammar identified the SIC-POVM obstruction as a <-gap that no accumulation of pairwise checks can close, and named descent from the arithmetic object as the only route past it; that prediction has since been executed, and existence at 𝑑 = 12 is a machine-checked theorem obtained by exactly that route. The full catalog is released as open-source software.