Jonathan Rademacher

Dirichlet-type representations of the Riemann zeta function take the form F(σ,t) = ∑_(n=1)^∞ n^(-σ) e^(-itlog⁡n), s=σ+it, 0<σ<1 where zeros correspond to exact cancellation among weighted oscillatory terms. This work develops a structural framework for analyzing such cancellation by studying the interaction between magnitude decay and phase alignment. Within this framework, the vanishing of the sum is shown to force the emergence of localized cancellation blocks, for which diffuse phase alignment is quantitatively impossible. As a consequence, cancellation necessarily concentrates into interacting configurations satisfying density, phase, and magnitude constraints. These constraints are not imposed but arise as necessary structural conditions for cancellation. Assuming the presence of a zero with σ∈(1/2,1), the vanishing of the first Fourier coefficient of the associated weighted phase distribution induces a global symmetry condition. In combination with the decay of the weights n^(-σ), this symmetry forces exponential localization of dominant contributions and constrains them to an approximately linearly spaced subsequence in log⁡n. Substitution of this structure reduces the sum to a weighted alternating exponential model with perturbations arising from integer constraints. The corresponding ideal alternating system is shown to remain strictly non-vanishing, and the perturbative contributions are bounded in such a way that they cannot produce cancellation of the required magnitude. The result is a structural obstruction: any admissible cancellation configuration within this oscillatory Dirichlet framework must satisfy a rigid system of constraints that is incompatible for σ≠1/2. At the critical line σ=1/2, the decay becomes scale-neutral, and the localization mechanism fails, removing the obstruction. This analysis demonstrates how structured constraint frameworks can force rigidity in oscillatory systems and collapse admissible cancellation configurations, providing a systematic method for studying phase–magnitude interactions in Dirichlet-type sums.

Pluralist societies lack a shared final authority, rendering accounts of legitimacy grounded in consensus, procedure, or normative agreement structurally insufficient. This paper advances a structural alternative. It argues that legitimacy is not a function of agreement among agents, but of whether the system within which they interact composes consistently under its own constraints. The analysis derives standing, capacity, and personal warrant as necessary conditions for participation, and identifies inclusion, symmetry, and directed repair as invariants required to preserve compositional consistency. It further shows that capacity and autonomy are functions of viable exit—defined as the existence of at least one path that preserves an agent’s continued participation—and that domination consists in the reduction of such viable exits. These results are then formalized within a constraint algebra (Σᴿ), developed by the author in independent work, in which admissible configurations are those that remain closed under composition. The paper demonstrates that the pluralist invariants are equivalent to the conditions for constraint closure. The central claim is that legitimacy in pluralist systems is identical with structural admissibility: only those configurations that preserve viable exit and remain consistent under composition can produce binding outcomes.

This paper addresses a persistent problem in political and social philosophy: how coordination can be legitimate in plural systems where no final authority is available, accepted, or justifiable. Existing approaches—whether grounded in optimization, aggregation, consensus, procedure, or authority—repeatedly fail under conditions of deep and durable disagreement. This failure, the paper argues, is not contingent or merely practical, but structural. The central claim is that relevance, rather than preference, value aggregation, or outcome selection, is the correct organizing concept for legitimate coordination under pluralism. Relevance is not treated as a matter of salience, moral priority, or epistemic correctness. Instead, it is developed as a structural property of constraint systems: a constraint is relevant if and only if it can bind plural agents without presupposing authority, privileging a standpoint, or collapsing coordination into outcome selection. The paper advances a non selective account of legitimacy, showing that legitimate coordination operates through constraint filtering rather than decision closure. It argues that constraints are legitimate only insofar as they preserve standing, respect symmetry, avoid escalation, and remain compatible with non selection. Any constraint that selects a unique outcome thereby reintroduces final authority and forfeits legitimacy under plural conditions. This work is strictly philosophical in method and scope. It does not present a formal system or computational model. However, it is written as part of an intentional chain of validation. The arguments developed here provide the conceptual and normative foundation for a separate formal axiomatization—Standing Algebra—which demonstrates that the structural commitments defended philosophically in this paper entail non determinacy and rule out outcome selection as a matter of formal consequence. Together with the broader monograph On Relevance: The Social Physics of Pluralism, this paper occupies an intermediate position: it neither asserts philosophical claims without structural discipline nor presents formal results without interpretive grounding. The contribution of this paper is therefore twofold. Substantively, it offers a rigorous account of relevance as the structural basis of legitimacy without resolution. Methodologically, it shows why formalization is necessary to secure such claims against equivocation, while also demonstrating why formalization alone is insufficient without philosophical interpretation. The result is a framework that explains not how plural systems should be resolved, but why legitimate coordination is possible only without resolution at all.

This article presents Standing Algebra (Σᴿ), a many‑sorted first‑order logical framework that formalizes standing, autonomy, recognition, and structural legitimacy in multi‑agent systems. Σᴿ provides a rigorous axiomatic basis for analyzing how agents gain, preserve, or distort standing under pluralistic constraints. Tier‑1 axioms define a successor‑based, non‑dilutive standing algebra and partition entities into null, prime (autonomy singularities), and composite classes. Tier‑2 axioms encode structural legitimacy: capacity‑indexed autonomy (CIA), the autonomy‑limiting reflex (ALRP), the non‑reciprocity prevention principle (NRPP), standing preservation (STC‑5), rerunnability, bounded drift, and directed repair. Together these yield a formal method to characterize—and prohibit—domination, recognition failure, and coercive coupling. The full axiomatic system of Σᴿ has been formally encoded and verified in Lean, Coq, and SMT-LIB (Z3), demonstrating that the theory is both mathematically consistent and computationally valid. The GitHub Repository affiliated with this has structural validations via Lean and Coq as well as an extended Z3 core, regimes, and both first and second order compositions – including a Z3 run showing that at least one AI policy layer exists which satisfies all of the constraints of this framework as SAT. In an additional GitHub repository, development is ongoing regarding applications of the mathematics to computer language. This introduces into the public sphere the first published policy kernel that enforces non domination and autonomy preservation through recursive constraint ratcheting rather than selection or optimization. To the author’s knowledge, Σᴿ is the first formally specified, machine checked system in which non domination is enforced structurally—without optimization objectives, outcome selection, or internal authority—using an off the shelf verification solver purely as a validator. Taken together, these axioms define what I call the Pluralist Non Domination Substrate: a domain agnostic structural layer in which autonomy preservation, symmetry, and bounded intervention emerge as necessary conditions for legitimate plural coordination. Σᴿ allows an AI system to integrate asynchronous, plural-source autonomy reports, filter them structurally, and maintain a longitudinal autonomy state that cannot be manipulated by any individual’s narrative — without ever judging intent or truthfulness. The Standing Algebra (Σᴿ) framework is formulated as a system of structural constraints rather than as a mechanism for optimization, selection, or preference aggregation. As such, its core commitments are not limited to normative, institutional, or decision theoretic contexts. In particular, any domain whose governing equations operate by restricting admissible states without selecting among them admits interpretation within the Standing Algebra framework without modification of its axioms. This observation is relevant to a wide class of physical theories whose fundamental equations impose symmetric, conservative, and non optimizing constraints. A familiar example arises in classical field theories, such as magnetostatics. Governing equations in this domain constrain admissible field configurations through local and global consistency conditions (e.g., divergence free constraints), but do not select a unique configuration absent external boundary conditions. The distinction between admissibility and realization in such systems mirrors the separation enforced by Standing Algebra between structural legitimacy and outcome selection. This analogy is not intended to import physical content into the Standing Algebra framework, nor to claim derivation of physical laws. Rather, it serves to illustrate that non dominating constraint systems are already well understood in domains outside ethics or governance. In such systems, constraints prohibit certain states while remaining agnostic among those that satisfy them. The relevance of this analogy is interpretive rather than empirical. It underscores that Standing Algebra operates at the level of constraint architecture, not domain specific dynamics. The framework classifies admissible structures and prohibits domination by construction, while leaving realization to external context. By situating Standing Algebra alongside established non selective constraint systems, this clarifies that the framework’s refusal to optimize, rank, or select is neither arbitrary nor domain specific, but instead reflects a general structural pattern that recurs across mathematical and physical theories. What emerges is not a “universal theory” of any sort but a proposed method for cross communication among domains which itself yields new formulations and capacities build and predicated upon the foundational works of each domain. This framework allows that, where such discoveries of one domain are not limited strictly to that domain, the portability of such discoveries can be taken to any other domain by virtue of adhering to these mathematical principles in order to avoid distortion while porting. Humanity has repeatedly learned how to reason without domination. We are now finally in a position to let those lessons talk to one another. This work will take one test case to demonstrate how Σᴿ constrains AI systems so that no admissible operation reduces human standing, prevents slow‑creep misalignment via drift budgets, enforces idempotent (rerunnable) policies, and subordinates AI standing to human capacity. The theory is applicable to AI alignment and safety, governance design, distributed systems, organizational analysis, and any domain requiring an autonomy preserving, structural account of coordination. Σᴿ also includes an optional multigranularity modifier for pluralist systems that preserves harm detection at coarse scales and supports prime discovery (autonomy root identification) across any domain.

Contemporary pluralistic societies face a distinctive problem: without a universally accepted final authority—whether divine, moral, or epistemic—on what basis can we justify the exercise of power or the resolution of fundamental disagreements? This paper proposes a structural approach to legitimacy in pluralist societies, grounded not in moral consensus but in the inherent requirements for stable, non-dominating coordination. Building on the concept of standing—the capacity of an agent or institution to have its directives bind others—we introduce two foundational axioms for pluralist legitimacy. The Axiom of Pluralistic Inclusion formalizes the principle that no agent can wield authority without first being included in the community of mutual recognition: every individual must have a pathway from having no standing (“nullity”) to having some standing in collective decision-making. The Axiom of Symmetry holds that social coordination is structurally stable only when all agents enjoy an equal standing in shared decision-making; any persistent asymmetry in standing generates systemic fragility—heightened resistance, feedback failures, and tendencies toward breakdown. We articulate these axioms in dialogue with classical and contemporary ideas of consent, equality, and non-domination (from social contract theory to Pettit’s republicanism), while moving beyond moral and procedural approaches to legitimacy. Instead, we outline a “social physics” of legitimacy: a set of invariant structural conditions that any pluralistic social order must satisfy to remain stable and avoid domination. These structural conditions (universal inclusion and symmetry of standing) are argued to be necessary conditions for a claim to political or moral authority to be considered legitimate in a deeply diverse society. We conclude by showing how this framework reframes enduring debates about authority, rights, and justice, ensuring that power cannot be decoupled from accountability even in the absence of shared final ends.