AUTHOR: Evan T. Kotler
Universality in physics is often associated with numerical constants, scaling laws, or symmetry principles. This paper demonstrates that universality can arise in a more primitive and explicitly conditional sense. Building on a framework in which probability emerges structurally from non-collapse in finite relational systems, we show that, absent further assumptions, cross-regime comparison is ill-typed: admissibility thresholds possess only internal meaning. We then introduce a single, clearly labeled strengthening—protocol comparability—which licenses comparison within a restricted equivalence class without introducing scale, dynamics, or probability measures. Under this assumption, admissible coarse-graining induces a discrete self-map on dimensionless threshold ratios. We prove that this map admits a unique invariant element, yielding a universal structural ratio independent of numerical value, physical realization, or representational choice. Universality thus appears as a fixed-point property of admissible structure rather than as a postulated constant or law.
Universality occupies a central place in modern physics. Dimensionless constants, scaling exponents, and renormalization-group fixed points are often taken to reveal deep structure transcending microscopic details. Yet such notions typically presuppose substantial background machinery: metrics, scales, probability measures, or dynamical flows.
This paper asks a prior question:
When is it even meaningful to speak of universality?
Working within a framework of finite relational systems subject to admissible extension, we show that universality is not available by default. In the absence of additional assumptions, comparisons across distinct admissibility regimes are ill-typed. The fact that a system admits a structurally meaningful threshold does not, by itself, license comparison with thresholds arising elsewhere.
The central contribution of this paper is to demonstrate that a minimal and explicitly stated strengthening suffices to recover a robust form of universality—one that is structural rather than numerical and conditional rather than absolute.
Within any finite relational system satisfying stability under admissible extension, forced compression induces a separation between:
distinctions eliminated as unstable, and
distinctions preserved as structurally relevant.
An admissibility threshold is the implicit structural cutoff separating sub-threshold distinctions removed by compression from super-threshold distinctions preserved as survivors.
No numerical value is assigned to this threshold. It is defined only internally to a given system.
Consider two admissible systems (\mathcal S_1) and (\mathcal S_2) with thresholds (\tau_1) and (\tau_2).
A natural question—“is (\tau_1 > \tau_2)?”—is tempting but illegitimate.
In the absence of additional assumptions, no admissible procedure exists for comparing admissibility thresholds belonging to distinct systems.
Any comparison procedure must be invariant under admissible renaming and extension. Without a shared normalization, embedding, or scale, any proposed comparison introduces extra structure not preserved under admissible extension. Such structure is therefore inadmissible. ∎
This result is protective: it prevents spurious universality claims from being introduced implicitly.
To make universality a well-typed question, an explicit strengthening is required.
Let (\mathcal S_1) and (\mathcal S_2) be finite relational systems such that:
their survivor structures are isomorphic up to admissible renaming and compression, and
their admissibility constraints are stable under extension, with no back-reaction from emergent structure.
Then there exists a canonical normalization under which their admissibility thresholds may be compared up to a dimensionless ratio.
This axiom does not assert universality.
It does not introduce numerical values.
It applies only within a restricted equivalence class.
Rejecting it leaves all prior results intact.
Under protocol comparability, absolute thresholds remain undefined, but ratios become meaningful.
Fix an equivalence class of mutually comparable systems. The ratio space (\mathcal R) consists of all admissible dimensionless ratios (\rho = \tau_i / \tau_j) between thresholds in the class.
Admissible extension often induces further compression.
An admissible coarse-graining is an admissible extension that merges survivors without creating new ones.
coarse-graining ∈ 𝔈
Such operations preserve admissibility but reduce distinguishability.
The ratio space (\mathcal R) is finite.
Each admissible system admits only finitely many survivor structures. Under protocol comparability, only finitely many distinct equivalence classes of thresholds exist, yielding a finite ratio space. ∎
Each admissible coarse-graining induces a map [ \Phi : \mathcal R \to \mathcal R ] on threshold ratios.
A ratio (\rho^*\in\mathcal R) is a structural fixed point if it is invariant under all admissible coarse-graining maps.
There exists at least one structural fixed point in (\mathcal R).
(\mathcal R) is finite (Lemma 4.3). Any self-map on a finite set admits a fixed point. ∎
The structural fixed point is unique.
If two distinct fixed points existed, admissible extension would permit multiple inequivalent, equally stable regimes, contradicting robustness and stability under extension. ∎
The unique fixed point established above is:
dimensionless,
non-numerical,
independent of physical realization,
conditional on explicit comparability.
It is not a physical constant, law, or prediction. It is a statement about structural organization under admissibility.
This paper:
derives universality without constants,
introduces no probability measures,
introduces no representational structures.
It does not:
assign numerical values,
claim empirical universality,
or derive physical laws.
Those questions lie beyond its scope.
Universality need not be postulated as a law or constant. When comparison is explicitly licensed, it emerges as a fixed-point property of admissible structure under coarse-graining. This result clarifies the logical preconditions of universality and prepares the ground for subsequent analysis of representation, where numerical structure may enter without conceptual circularity.
