Law as Phase Geometry: A Structural Theory of Lawful Systems

Law as Phase Geometry: A Structural Theory of Lawful Systems reframes “law” as phase geometry: the invariant structure that determines which state transitions are admissible without inducing incoherence, irreversible degradation, or collapse. Rather than treating law as a rule set, moral framework, or enforcement regime, the manuscript defines law as the structural space of viable transformations—with refusal (non-executability at the boundary) as the primary self-regulation mechanism. The paper provides a minimal, substrate-agnostic formal template: a measurable system state ( \Psi ), invariant constraints ( g_i(\Psi)\le 0 ) defining an admissible region ( \mathcal A ), and a refusal boundary ( \partial \mathcal A ) encountered when a proposed transition would leave ( \mathcal A ). A designed constraint becomes “law” only when refusal is operator-independent and non-overridable (i.e., invariant under interpretation and not bypassable by narrative, authority, or moral appeal). A central contribution is the strict separation of lawful refusal from punishment: punishment is actor-targeted and downstream, while refusal is transition-targeted and upstream—flattening escalation dynamics and localizing cost at boundary contact. The manuscript maps these primitives across domains (courts, AI action-space constraints, online communities, organizations, markets, interpersonal boundaries) to demonstrate cross-domain compression without analogy drift. To prevent scope inflation, the work embeds Epistemic Refusal Operators (ER-1…ER-6) that halt application when observability, cost settlement, override-detectability, or refusal/failure identifiability conditions are not met. The paper also proposes a falsifiable sandbox protocol contrasting refusal-first vs punishment-first systems, with append-only logging and explicit hypotheses, predictions, and falsification criteria. Key contributions Definition: law as admissible-transition geometry rather than rule/enforcement symbolism. Law threshold: refusal must be invariant, non-overridable, and operator-independent to qualify as law (vs policy). Core distinction: refusal vs punishment, with escalation and cost-localization consequences. Bounded applicability: endogenous Epistemic Refusal Operators that terminate over-extension. Empirical path: substrate-agnostic test protocol + minimal classifier for refusal vs failure and preregistration requirements. Suggested keywords phase geometry; admissible transitions; refusal boundary; invariants; cost settlement; irreversibility; enforcement load; punishment; governance; online moderation; AI action-space constraints; identifiability; auditability; append-only logging