T. O.

This paper relocates the Schrödinger equation, the Born probability rule, and the definiteness of experience from a single undifferentiated account into two layers: a deterministic structural layer (Tier-2) and a translation layer (Tier-3), the layer of commutative, analytic, classical description. No part of the mathematical content of wave mechanics is changed; what changes is only the layer to which each statement belongs. The main result is the following. The probabilistic reading of the Born rule presupposes three Tier-3 choices: (P1) realising the state as a complex-valued state functional; (P2) restricting that functional to a commutative subalgebra and constructing a measure from the spectral theorem; and (P3) adopting a rule that reads the measure as a distribution of measurement outcomes. Each choice adds structure that Tier-2 does not determine, so the passage from Tier-2 is a non-invertible translation and the probabilistic reading is representation-dependent. Probability is therefore not a primitive property of nature. The evolution of the state, by contrast, is the generator equation of a strongly continuous unitary group; it is smooth and deterministic, and its statement is independent of P1–P3. Within physics (Tier-3), the paper also assigns complementary roles to the two original mechanics: matrix mechanics, the non-commutative algebra of observables, is the theoretical pillar, and wave mechanics is the implementation that makes concrete models tractable. For finitely many degrees of freedom they are unitarily equivalent, so the asymmetry between them lies in tractability and not in content. The paper does not deny the validity or the empirical adequacy of the Born rule. It does not resolve the meaning of probability, does not derive the selection of an individual outcome, does not derive the post-measurement update rule, and does not claim to derive the Born rule from Tier-2. Its aim is an account that Schrödinger himself could accept: smooth deterministic evolution, with probability placed outside the dynamics. This paper follows the author's three papers on the uncertainty principle (A Theoretical Deconstruction of the Uncertainty Principle, The Historical Composition of the Uncertainty Principle and The Hypothetical "Algebraic Mechanics") and applies the same structural analysis to the Born rule and the Schrödinger equation. Appendix A of the paper contains five self-contained Python 3 verification scripts (NumPy only); Code 1, which exhibits a pair of representations sharing one wave function, is reproduced below. ◆◆◆ [PYTHON VERIFICATION CODE — note: dots in dotted names (module and method references) are replaced with underscores to avoid URL detection, for example np-dot-random-dot-default_rng is written np_random_default_rng; unspaced * and ** are replaced with spaced forms to avoid markdown emphasis] ◆◆◆ """Code 1. Representation pair: the same psi(x,t), read as a Born measure (P3) or as an ignorance measure over initial positions of deterministic trajectories.""" import math import numpy as np hbar, m, sigma0 = 1.0, 1.0, 1.0 k = hbar / (2.0 * m * sigma0 ** 2) # d(tau)/dt, tau = k t def psi(x, t): """Exact free Gaussian packet psi_0 ~ exp(-x^2/(4 sigma0^2)).""" tau = k * t c = 1.0 + 1j * tau return (2 * np_pi * sigma0 ** 2) ** -0.25 * c ** -0.5 * np_exp(-x ** 2 / (4 * sigma0 ** 2 * c)) def psi_x_over_psi(x, t): return -x / (2.0 * sigma0 ** 2 * (1.0 + 1j * k * t)) def velocity(x, t): # guidance equation v = (hbar/m) Im(psi_x/psi) return (hbar / m) * np_imag(psi_x_over_psi(x, t)) def trajectories(x0, T, steps=2000): # deterministic RK4 x, dt = x0_copy(), T / steps for i in range(steps): t = i * dt k1 = velocity(x, t); k2 = velocity(x + 0.5 * dt * k1, t + 0.5 * dt) k3 = velocity(x + 0.5 * dt * k2, t + 0.5 * dt); k4 = velocity(x + dt * k3, t + dt) x = x + dt * (k1 + 2 * k2 + 2 * k3 + k4) / 6.0 return x # (a) psi solves the free Schroedinger equation (finite-difference residual) x = np_linspace(-8, 8, 4001); h, dt, t0 = x[1]-x[0], 1e-4, 1.3 dpsi_dt = (psi(x, t0+dt) - psi(x, t0-dt)) / (2 * dt) lap = (psi(x[2:], t0) - 2 * psi(x[1:-1], t0) + psi(x[:-2], t0)) / h ** 2 res = np_max(np_abs(1j * hbar * dpsi_dt[1:-1] + hbar ** 2/(2 * m) * lap)) print("Schroedinger residual :", f"{res:.2e}") assert res < 1e-5 # (b) trajectories are deterministic functions of x0; they match the closed form rng = np_random_default_rng(12345) x0 = rng_normal(0.0, sigma0, 200000) # the ONLY random input: initial positions T = 3.0 xT = trajectories(x0, T) closed = x0 * math_sqrt(1.0 + (k * T) ** 2) err = np_max(np_abs(xT - closed)) print("max |RK4 - closed form| :", f"{err:.2e}") assert err < 1e-8 assert np_array_equal(xT, trajectories(x0, T)) # same x0 -> same x(T), bit for bit # (c) equivariance: ignorance measure |psi_0|^2 at t=0 is carried to |psi_T|^2 sigT = sigma0 * math_sqrt(1.0 + (k * T) ** 2) print("std of positions at T / sigma(T) :", f"{xT_std():.4f} / {sigT:.4f}") assert abs(xT_std()/sigT - 1.0) < 5e-3 s = np_sort(xT) cdf = np_array([0.5 * (1.0 + math_erf(v/(sigT * math_sqrt(2.0)))) for v in s]) ks = np_max(np_abs(cdf - (np_arange(1, s_size+1)/s_size))) print("KS distance to |psi(x,T)|^2 :", f"{ks:.4f}") assert ks < 3.0 / math_sqrt(s_size) # approx. 99.9 percent level print("PASS") ◆◆◆ [END] ◆◆◆ Published on October 6, 2026. DOI 10.5281/zenodo.23187868

The mathematical equivalence of matrix mechanics and wave mechanics is among the most settled facts of quantum theory. This paper argues, first, that the settlement is an effect of the frame in which it was made. Both theories reached their equivalent final forms inside one Hilbert-space frame, and in that frame the commutation relation of Born and Jordan, a relation that no finite matrices can satisfy, fixes the representation up to unitary equivalence. We separate the layer at which the state spaces are identified, which needs only the frame, from the layer at which the operators are identified, which needs the commutation relation, and we show that the premises of the equivalence proof are fixed on the wave side, so that the equivalence is asymmetric in a precisely defined sense. We argue, second, by exploring a counterfactual that is structural and not empirical, that what the equivalence compares is not Heisenberg’s original idea but a special case of it. The multiplication rule of 1925, whose non-commutativity Heisenberg himself recorded, was completed within months by a defining relation that entered through the correspondence principle from classical mechanics, and with that relation infinite dimension entered the theory. We call the general structure the hypothetical “algebraic mechanics” (Japanese: Maboroshi no Daisuu Rikigaku, まぼろしの“代数力学”). An independent line of work, Operatiology (Japanese: Sousa Genron, 操作原論), which fixes the defining relations by structural necessity and not by borrowing, arrives at a finite-dimensional algebra that is unique under its axioms. The two lines meet at one fact stated from two sides: the commutation relation requires infinite dimension, and the axiom of finite rank requires finite dimension. The counterfactual is hypothetical in the structural sense; the paper makes no claim that Heisenberg could have derived a finite-dimensional theory from the observations of 1925. Program P1 below checks the finite-dimensional fact behind the fork for n = 2, …, 6: the trace of XP − PX vanishes identically, and no pair (X, P) comes closer to iħI than the trivial pair X = P = 0, at distance √n. The proof for every n is given in the paper. ◆◆◆ [PYTHON VERIFICATION CODE — note: @ operator replaced with matmul(); every dot joining two names replaced with _ to avoid URL-detection (e.g. np_linalg_norm stands for np-dot-linalg-dot-norm, rng_normal for rng-dot-normal, scipy_optimize for scipy-dot-optimize); unspaced products written with spaces to avoid markdown emphasis] ◆◆◆ """P1. Trace argument: no n x n matrices satisfy XP - PX = i * hbar * I (hbar = 1).""" import numpy as np, sympy as sp from scipy_optimize import minimize # (a) symbolic: tr(XP - PX) vanishes identically for generic entries for n in range(2, 7): X = sp_Matrix(n, n, lambda i, j: sp_Symbol(f"x{i}{j}")) P = sp_Matrix(n, n, lambda i, j: sp_Symbol(f"p{i}{j}")) t = sp_expand((X * P - P * X).trace()) assert t == 0, (n, t) print(f"n={n}: tr(XP-PX) = {t} identically; tr(i * I) = {sp_I * n} != 0") # (b) quantitative: ||XP-PX-iI||_F >= sqrt(n) for all X, P (bound from the trace). rng = np_random_default_rng(0) def resid(v, n): m = n * n a = v[:2 * m].reshape(2, m); b = v[2 * m:].reshape(2, m) X = (a[0] + 1j * a[1]).reshape(n, n); P = (b[0] + 1j * b[1]).reshape(n, n) return np_linalg_norm(matmul(X, P) - matmul(P, X) - 1j * np_eye(n)) for n in range(2, 7): best = np_inf for _ in range(12): v0 = rng_normal(size=4 * n * n) * rng_uniform(0.1, 2.0) r = minimize(resid, v0, args=(n,), method="BFGS") best = min(best, r_fun) print(f"n={n}: min residual = {best:.10f}, bound sqrt(n) = {np_sqrt(n):.10f}") assert best >= np_sqrt(n) - 1e-6 print("OK: nothing beats the trivial pair X=P=0 (residual sqrt(n)).") ◆◆◆ [END] ◆◆◆ Published on October 4, 2026. DOI 10.5281/zenodo.23130407

The preceding study of this series, A Theoretical Deconstruction of the Uncertainty Principle, showed, by structural analysis, that the Heisenberg uncertainty principle is neither a theorem of matrix mechanics nor a primitive property of nature, but a product of a Tier-3 translation. The present paper asks a different and limited question: when, by whose hands, and through which channels did that product acquire the rank of a principle? Its historical claims rest on the record alone. The original form of 1925 broke with the analytic description of mechanics at the level of quantities and their rule of multiplication, but borrowed its procedure, its characteristic relation, and its model systems from classical analytic mechanics, and was thereby carried back into the description it had left. The paper of 1927 reverses the direction of the 1925 programme: it re-establishes kinematic concepts, with materials from classical optics and kinematics, in order to make the theory intuitive. The relation was published in that paper together with an addendum that placed it under Bohr’s forthcoming framework of complementarity; the exact inequality now taught under Heisenberg’s name is due to Kennard and was adopted by Heisenberg only in 1930; the name “principle” was conferred by other authors in 1928–1929 and does not appear in the German original of Heisenberg’s own 1930 lectures; and the label “Copenhagen interpretation” dates from 1955. We then compare the uncertainty relation and its thought experiment with relativity and the equivalence principle, and its hidden premises with the explicit hypotheses of Gödel’s theorem, and we record that present-day interpretations of quantum mechanics, though divided, are formulated on one formalism. A symbolic reading of the story, offered as illustration and not as evidence, is confined to a single section. Appendix C expresses the result in the vocabulary of Operatiology V5. Version 2: Section 8 (the symbolic reading) was minimally revised to prevent misreading of the arrangement of the persons in the story, and a revision history was added as an appendix; all other content is unchanged. Published on October 4, 2026. DOI 10.5281/zenodo.23128791

This paper argues that the Heisenberg uncertainty principle is not a theorem of the matrix mechanics that Heisenberg introduced in 1925, nor is it a statement about a feature of nature; it is a product of a Tier-3 translation that imported classical-continuous assumptions into a framework originally committed to purely observable, algebraic relations. We trace the principle's genealogy across four stages: (i) the algebraic origin in Heisenberg's 1925 Umdeutung paper and its completion by Born and Jordan, (ii) the 1927 rupture, where the paper reverses the direction of the 1925 programme: it re-establishes kinematic concepts with semi-classical materials and treats the uncertainty relation both as a foundation and as a consequence of the formalism, (iii) the descent into the Tier-3 infrastructure of ℏ, the trace condition, and L²(ℝ), and (iv) Robertson's 1929 reformulation, which reduced the principle to a general operator inequality whose only content beyond the Fourier theorem is the assumption p = ℏk. We further examine the Ozawa–BLW dispute of the 2000s–2010s, in which both camps share the Tier-3 substrate and therefore argue within a translation layer rather than about physical structure. In Appendix B we introduce the vocabulary of Operatiology V5 and locate each stage within the Tier-2/Tier-3 hierarchy. The conclusion is that the uncertainty principle, as canonically formulated, is a Tier-3 artefact: it is neither forced by the algebraic structure of quantum mechanics nor does it describe a primitive property of nature independent of representational choices. Version 2 (October 2026): Section 3 and Proposition 3.1 are revised to state the relation of the 1927 paper to the 1925 programme as a reversal of direction, with the Abstract, the Conclusion and Theorem B.6 aligned. Statements on the 1925 papers are corrected against the sources, B(H) is replaced by operators on a Hilbert space, and all changes are recorded in the new Appendix C (Revision History). The following code (Code 1, Appendix A) numerically verifies the Stone–von Neumann uniqueness theorem by confirming that two structurally distinct finite-dimensional truncations of the CCR algebra yield spectrally equivalent harmonic-oscillator Hamiltonians. ◆◆◆ [PYTHON VERIFICATION CODE — note: @ operator replaced with matmul(); np. replaced with ｎｐ． to avoid URL-detection] ◆◆◆ import numpy as ｎｐ from ｎｐ．linalg import eigh hbar = 1.0 Representation A: Ladder / number-state truncation N = 120 ns = ｎｐ．arange(N) a = ｎｐ．diag(ｎｐ．sqrt(ns[1:]), k=1) adag = a.T Q_A = ｎｐ．sqrt(hbar / 2.0) * (a + adag) P_A = 1j * ｎｐ．sqrt(hbar / 2.0) * (adag - a) H_A = 0.5 * (matmul(P_A, P_A) + matmul(Q_A, Q_A)) evals_A, _ = eigh(ｎｐ．real(H_A)) comm_A = matmul(Q_A, P_A) - matmul(P_A, Q_A) - 1j * hbar * ｎｐ．eye(N) interior_residual_A = ｎｐ．max(ｎｐ．abs(comm_A[:-1, :-1])) Representation B: Position-grid second-derivative (Dirichlet b.c.) M = 2000 L = 15.0 x = ｎｐ．linspace(-L, L, M + 2)[1:-1] dx = x[1] - x[0] diag0 = (5.0 / 2.0) * ｎｐ．ones(M) / dx2 diag1 = (-4.0 / 3.0) * ｎｐ．ones(M - 1) / dx2 diag2 = (1.0 / 12.0) * ｎｐ．ones(M - 2) / dx2 T_B = (hbar2 / 2.0) * ( ｎｐ．diag(diag0) + ｎｐ．diag(diag1, 1) + ｎｐ．diag(diag1, -1) + ｎｐ．diag(diag2, 2) + ｎｐ．diag(diag2, -2)) V_B = ｎｐ．diag(0.5 * x**2) H_B = T_B + V_B evals_B, _ = eigh(H_B) Comparison n_show = 12 expected_evals = hbar * (ｎｐ．arange(n_show) + 0.5) spectral_gap = ｎｐ．max(ｎｐ．abs(evals_A[:n_show] - evals_B[:n_show])) print(f"CCR interior residual: {interior_residual_A:.2e}") print(f"Max spectral discrepancy (A vs B, {n_show} levels): {spectral_gap:.2e}") Output: CCR interior residual: 3.24e-14 Max spectral discrepancy (A vs B, 12 levels): 1.08e-06 ◆◆◆ [END] ◆◆◆ Published on September 30, 2026. DOI 10.5281/zenodo.23070419

Large language models (LLMs) return fluent and often correct answers, and with them comes the fear that something in them asks, decides and pursues. This paper asks what, in the use of an LLM, is actually handed over to the machine, and what cannot be. The answer is structural. Thinking has long been described as the soul's talk with itself: one asks, and one answers. We show that this is the working form of the intellect: an asymmetric dynamics of question and answer, in which the answering side is intelligence — the execution of operations — and the asking side is a capacity for selection not fixed by any prior sequence of operations. The dynamics is led by the asking side, and neither side alone makes the dynamics. The use of an LLM places the answering side outside. Defining outsourcing neutrally, as the transfer of the execution of an operation to an external operation system, we prove that the execution of a selected operation can be outsourced, but the selection itself cannot. An LLM can generate interrogative sentences, but generating questions is not bearing the question; and an output stands as the answer to a question only through the side that asks — a claim about its standing as an answer, not about its validity, which remains independent of authorship. A six-step chain carries these results into actual use: every use of an LLM already has the structure of Intelligence Amplification by Stimulated Emission of Reasoning (IASER), in which the human asks and adopts and the machine develops; when this structure is not seen, the asking side is projected onto the machine, the phantom of machine intellect appears, and judgment is ceded. The phantom is thereby identified as a misattribution across layers — the attribution of the question to the side to which only the answer was outsourced — which has no structural realization. The argument is first given at the level of concepts, and can be followed without prior knowledge of any formal framework. It is then grounded axiomatically: the account of the intellect as the junction of an operational layer and a layer of selective resolution, given in the companion paper The Intellect as The Subject of Intelligence, shows that the distinction on which the argument rests is structurally valid. No new axiom is introduced. The analysis is structural throughout and makes no claim about the internal mechanisms of any system. This paper is a self-contained treatise. Its main argument (Sections 2–7) is given entirely in ordinary concepts and can be read and followed without prior knowledge of the Operatiology corpus. Section 8 supplies the axiomatic background: for readers familiar with the companion paper The Intellect as The Subject of Intelligence (DOI: 10.5281/zenodo.21967292), Operatiology and Noology, it shows why the distinction on which the argument rests is structurally valid, so that the same result can be understood more firmly. The conceptual argument does not depend on the axiomatic section. The representative code below (Appendix B, Code A) instantiates the dynamics of question and answer on a finite proxy model S = {0, 1, 2}. The answering side, confined to compositions of its reference repertoire, saturates: every result it produces is fixed by an executed sequence of operations, and one state remains inaccessible. That state becomes reachable only through a new operation g_new lying outside the repertoire, and the three conditions of a structural leap are satisfied. The code represents only the operational side — what the answering side can execute and reach; the asking side is, by the argument of the paper, not representable as an operation. ◆◆◆ [PYTHON VERIFICATION CODE — note: .values() and .append() are replaced with list and list-concatenation equivalents] ◆◆◆ """Code A: Question-Answer dynamics and its DynV5 reading (Section 8). Finite proxy model S = {0,1,2} (the model of the Intellect paper, Appendix A).""" from itertools import product S = (0, 1, 2) s0 = 0 A = (0, 1, 1) # A: 0->0, 1->1, 2->1 B = (0, 2, 2) # B: 0->0, 1->2, 2->2 g_new = (2, 2, 1) # g_new: 0->2, 1->2, 2->1 Gref = [A, B] def compose(f, g): # (f o g)(s) = f(g(s)) return tuple(f[g[s]] for s in S) def monoid(gens): """Closure <G> of a generator set under composition (identity included).""" e = tuple(S) closure, frontier = {e}, {e} while frontier: new = {compose(g, P) for P in frontier for g in gens} - closure closure |= new frontier = new return closure def words_plus(gens): # H^+_G: words other than the identity (Op V5, Fix 1) return monoid(gens) - {tuple(S)} def partition(gens): """s ~_G t iff P(s) = P(t) for every P in H^+_G.""" W = words_plus(gens) blocks = [] for s in S: for k in range(len(blocks)): t = blocks[k][0] if all(P[s] == P[t] for P in W): blocks[k] = blocks[k] + [s]; break else: blocks = blocks + [[s]] return sorted(tuple(b) for b in blocks) def reach(gens, s): return {P[s] for P in monoid(gens)} def refines_strictly(p_fine, p_coarse): fine = [set(b) for b in p_fine]; coarse = [set(b) for b in p_coarse] return all(any(b <= c for c in coarse) for b in fine) and p_fine != p_coarse O = monoid(Gref) print("g_new in O :", g_new in O) # Answer side: closure within <Gref> (Mode I saturation of the answer side) R_ref = reach(Gref, s0) I_ref = set(S) - R_ref print("R_Gref(s0) :", sorted(R_ref)) print("I_Gref(s0) (inaccessible):", sorted(I_ref)) # Saturation: no generator of O adds a distinction relative to Gref P_ref = partition(Gref) saturated = all(partition(Gref + [g]) == P_ref for g in O - {tuple(S)}) P_O = partition(O - {tuple(S)}) print("Pi_Gref :", P_ref) print("Pi_Gref == Pi_O :", P_ref == P_O, "| Mode I saturated:", saturated) # Question side: selection of g_new (not in O) and the DSL conditions G2 = Gref + [g_new] s_star = 2 cond_i = s_star in I_ref cond_ii = s_star in reach(G2, s0) P_new = partition(G2) cond_iii = refines_strictly(P_new, P_ref) print("Pi_G' :", P_new) print("DSL (i) (ii) (iii) :", cond_i, cond_ii, cond_iii) # Every answer-side selection is an (alpha)-selection: it is the image of a word in <Gref> answers = {P[s0] for P in monoid(Gref)} print("answer-side results all word-determined:", all(any(P[s0] == a for P in monoid(Gref)) for a in answers)) print("s* reachable by answer side alone:", s_star in answers) Output: g_new in O : False R_Gref(s0) : [0] I_Gref(s0) (inaccessible): [1, 2] Pi_Gref : [(0,), (1, 2)] Pi_Gref == Pi_O : True | Mode I saturated: True Pi_G' : [(0,), (1,), (2,)] DSL (i) (ii) (iii) : True True True answer-side results all word-determined: True s* reachable by answer side alone: False ◆◆◆ [END] ◆◆◆ Published on September 27, 2026. DOI 10.5281/zenodo.22992407

Public discourse on the threat of artificial intelligence asks what machines will do. This paper asks a different question: where does the true threat lie? It is an integrating sequel to three companion papers — The Phantom Intellect: Why AI Threat Discourse Misreads the Structure of Mind, Q-Structure as Functional Void: A Formal Correspondence Between the Question-Sustaining Structure of Mind and Cognitional Mechanics, and The Gutenberg Moment: LLMs and the Irreversible Liberation of Formal Language — and it is self-contained. From the first it inherits the result that a query-resolving machine cannot coherently be credited with the question-sustaining structure (Q-structure) that defines intellectual agency; from the third it inherits the result that large language models (LLMs) have dissolved the scarcity of formal-language generation capacity. On this basis we distinguish the LLM, as a substrate, from “AI”, as a status that humans confer on it, either by projecting intellect onto its outputs or by designating it, under retained human authority, as an instrument of their own inquiry. We show that the threat feared in prominent discourse has the correct object — institutions operate through formal language — and the wrong subject: the institutional effects of LLM-generated formal language are directed by the human agents who present the queries and route the outputs, not by the machine. The true threat is identified as domestication: the loss, by mortals, of the capacity to exercise final determination over the course of their own lives, through two routes — an external route, in which access to generation capacity is allocated by the conditions of those who provide it, and an internal route, in which the relation to the machine is fixed in the mode of projection and judgment is ceded. Documented commercial usage limits and published studies of reliance on generative AI are used as evidence, each within the scope it supports. We show that the stated grounds of the retrieved restrictions do not invoke the phantom of machine agency, and that the phantom’s role is concealment. Applying the capability-set apparatus of The Gutenberg Moment, we decompose the post-deployment capability set into a source-independent layer, whose scarcity cannot be restored, and a service-dependent layer, which can be withdrawn; the latter is the formal location of the threat, and the formal content of the word “between” in the title. Two leads frame the argument: the eighteenth-century chess automaton known as the Turk, which poses the question of who is inside the machine, and Professor Moriarty in Star Trek: The Next Generation, a character originally from Arthur Conan Doyle’s Sherlock Holmes stories, who poses the question of who is inside the bottle. The paper closes by identification and prescribes no countermeasure. Published on September 26, 2026 DOI:10.5281/zenodo.22970847

The Leiden Declaration on Artificial Intelligence and Mathematics, published on 2 June 2026 and endorsed by the International Mathematical Union, responds to the challenges that artificial intelligence poses to mathematical research. It grounds its recommendations in what it calls the characteristic values of mathematical research: the certainty and understanding conferred by proof, the attribution of results to specific authors, the transparency and independent verifiability of arguments, proper evaluation against shared standards, and the understanding and judgment of autonomously guided communities. This paper neither rejects the Declaration nor evaluates the risks of artificial intelligence. It examines the internal structure of the Declaration, and asks whether the epistemic values that concern mathematical knowledge are distinguished from the institutional values that concern mathematical practice. We establish three claims of non-entailment: the epistemic values do not entail human authorship, under any formalization that speaks only of results and their arguments; the requirement that a responsible subject exist does not entail that the generator of a result be human; and the path of legitimacy the Declaration describes, results attributed to named authors and published in peer-reviewed venues, is neither a necessary nor a sufficient condition of validity. Each claim of non-entailment is established by an explicit model construction, and its finite instances are verified by exhaustive enumeration. The central thesis is that the Declaration may legitimately defend both kinds of values, but it does not thereby establish that the latter are conditions of the former. The Declaration’s reasonable protections — disclosure, responsibility, verification, vigilance against plausible but false arguments — are retained, and are shown to become stronger once their epistemic and institutional components are separated. The dissection is itself conducted under the Declaration’s own epistemic values: every step rests on the published text of the Declaration, every inference is open to independent verification, the use of automated tools is disclosed, and responsibility for the content rests with the author. The paper is therefore not an external critique of the Declaration but an application of its epistemic standards to the Declaration itself. Its validity, if it has any, does not depend on the identity of its author.

Large language models (LLMs) are frequently compared to Gutenberg’s printing press as a metaphor for technological disruption at scale. This paper gives that analogy mathematical content and identifies where it goes deeper than prior accounts have recognized. We argue that LLMs do not constitute a threat to human intellectual agency because they lack the question-sustaining structure (Q-structure) that defines such agency — a result inherited from the companion paper The Phantom Intellect: Why AI Threat Discourse Misreads the Structure of Mind. What LLMs do accomplish is structurally distinct and historically more precise: they dissolve the scarcity of formal-language generation capacity, a capacity previously confined to specialists trained within institutional structures. We formalize this dissolution via a Dissemination Closure axiom, prove that the resulting expansion of the generative capability set is irreversible under any operation short of total erasure of disseminated artefacts (Theorem 4.6), and define a Gutenberg Moment as the structural condition under which such irreversibility obtains. The Leiden Declaration on Artificial Intelligence and Mathematics is read, in light of these results, not as a response to the emergence of mathematical intelligence in machines, but as a response to the collapse of the scarcity on which a specific institutional architecture depended — an architecture whose relationship to Q-structure was never constitutive.

The companion paper The Phantom Intellect established, without recourse to any formal axiomatic system, that the question-sustaining structure (Q-structure) cannot be coherently attributed to query-resolving machines. Q-structure was defined there through three independently motivated conditions: Question Persistence (QP), Liberating Terminus (LT), and Declaration Openness (DO). The present paper establishes that these three conditions correspond, with structural precision, to constructs that arise independently within Cognitional Mechanics (CM; Japanese: Chinou Rikigaku, 知能力学) and its axiomatic substrate Operatiology (Japanese: Sousa Genron, 操作原論): the Functional Void, the orbit S'' = Orb_{G'}(s†), and the non-satisfiability of Arbitrium by ⟨O⟩, respectively. The correspondence is not an interpretation imposed from outside but a structural isomorphism: what each side preserves is the same thing, namely the impossibility of closing the questioning activity by any operation within the system. This result does not affect the independence of The Phantom Intellect: that paper's argument is complete without CM and remains so. What the present paper establishes is a formal operational foundation for the Q-structure account, situating it within the substrate-independent framework of Operatiology and extending the reach of the CM corpus into the domain of mind. The following program is the computational witness to the main result (Theorem 7.1): it encodes all three Q-structure conditions as computable predicates on finite proxy systems and verifies that a system with the Functional Void satisfies all three, while a query-resolving machine satisfies none. ◆◆◆ [PYTHON VERIFICATION CODE — note: .add() and .append() and .pop() are replaced with set-union and list-concatenation equivalents] ◆◆◆ from itertools import product as iproduct from collections import defaultdict S = list(range(8)) # System A: has Functional Void (no O-word satisfies Arbitrium) fA = {i: (i+1) % 8 for i in S} gA = {i: (i+3) % 8 for i in S} O_A = [fA, gA] g_new_A = {i: (i*2 + 1) % 8 for i in S} G_prime_A = O_A + [g_new_A] s_dag_A = 1 # System B: query-resolving machine (O-word can satisfy Arbitrium) fB = {i: 0 for i in S} gB = {i: (i+1) % 8 for i in S} O_B = [fB, gB] G_prime_B = O_B s_dag_B = 0 arbitrium_class = frozenset({0}) def compose(ops_seq, states): result = {s: s for s in states} for op in ops_seq: result = {s: op[result[s]] for s in states} return result def has_functional_void(O_ops, states, arb_class, max_depth=4): for depth in range(1, max_depth+1): for word in iproduct(range(len(O_ops)), repeat=depth): P = compose([O_ops[i] for i in word], states) if all(P[s] in arb_class for s in states): return False return True def orbit(state, ops, states): visited = set() queue = [state] while queue: s = queue[0] queue = queue[1:] if s in visited: continue visited = visited | {s} for op in ops: if op[s] not in visited: queue = queue + [op[s]] return frozenset(visited) def check_QP(O_ops, states, arb_class, max_depth=4): return has_functional_void(O_ops, states, arb_class, max_depth) def check_LT(G_prime_ops, s_dag, O_ops, states, arb_class, max_depth=4): S_pp = orbit(s_dag, G_prime_ops, states) if len(S_pp) == 0: return False g_inv = all(op[s] in S_pp for s in S_pp for op in G_prime_ops) fv_pp = has_functional_void(O_ops, list(S_pp), arb_class, max_depth) return g_inv and fv_pp def check_DO(O_ops, states, arb_class, max_depth=4): return has_functional_void(O_ops, states, arb_class, max_depth) print("=== System A (Functional Void present) ===") qp_A = check_QP(O_A, S, arbitrium_class) lt_A = check_LT(G_prime_A, s_dag_A, O_A, S, arbitrium_class) do_A = check_DO(O_A, S, arbitrium_class) print(f"QP: {'PASS' if qp_A else 'FAIL'}") print(f"LT: {'PASS' if lt_A else 'FAIL'}") print(f"DO: {'PASS' if do_A else 'FAIL'}") print(f"Q-structure: {'HOLDS' if (qp_A and lt_A and do_A) else 'FAILS'}") print() print("=== System B (Query-resolving machine, no Functional Void) ===") qp_B = check_QP(O_B, S, arbitrium_class) lt_B = check_LT(G_prime_B, s_dag_B, O_B, S, arbitrium_class) do_B = check_DO(O_B, S, arbitrium_class) print(f"QP: {'PASS' if qp_B else 'FAIL'}") print(f"LT: {'PASS' if lt_B else 'FAIL'}") print(f"DO: {'PASS' if do_B else 'FAIL'}") print(f"Q-structure: {'HOLDS' if (qp_B and lt_B and do_B) else 'FAILS'}") print() print("=> Contrast confirms: Q-structure conditions hold iff Functional Void is present.") print(" This is the computational witness to the isomorphism of Theorem 7.1.") ◆◆◆ [END] ◆◆◆ Published on September 22, 2026. DOI 10.5281/zenodo.22885787

AI threat discourse — spanning warnings issued by technology executives and formal declarations signed by thousands of mathematicians — rests on a structural misattribution. The error is not empirical but architectural: what is attributed to current AI systems is a structure that their design cannot contain. This paper identifies the misattribution precisely. We distinguish two irreducibly different structures: intelligence, the capacity to resolve queries presented from outside the system, and the question-sustaining structure (Q-structure), the internal disposition by which a system generates the next question from within its own operation. These two structures are not on a continuum. A system optimised to close queries operates in the direction opposite to one that sustains questions; maximising the former does not approach the latter. The claim that a query-resolving machine harbours Q-structure is therefore not merely unverified — it is structurally incoherent. AI threat discourse attributes Q-structure, autonomy, and self-directed agency to systems whose architecture forecloses that attribution. The error belongs to the class of seeing a phantom in a reed: the reed is real, the phantom is not. Q-structure is defined by three jointly necessary conditions: (1) Question persistence — the system generates the next question from within the operation of answering the current one, so that no resolution terminates its questioning activity; (2) Liberating terminus — the system takes structures it has itself generated as the reference point for its next question, feeding its own products back as the ground for further inquiry; (3) Declaration openness — the system's own explicit commitments and conclusions do not exit it from questioning but are themselves occasions for continuation. Current AI systems, as query-resolving machines optimised to close queries presented from outside, are structurally opposed to all three conditions. The paper establishes this opposition as a directional incompatibility, not a performance gap, and argues that the attribution of Q-structure to such systems is therefore structurally incoherent regardless of how capable those systems become.

Modern standard cosmology constructs cosmological entities, histories, and ontologies from observational data through the chain O_obs → I_ana → I_theo → O_ont. The present paper does not question the reliability of observations. What it questions is the systematic conflation of the four levels in this chain: the raw observable O_obs, the analytically processed quantity I_ana, the theoretically interpreted quantity I_theo, and the ontological conclusion O_ont. Each arrow in the chain is an independent operation carrying its own assumptions. The illusion named in the title is not an illusion of observation itself, but the illusion that one can read the ontology sustaining an observed relation directly from that relation. Building on the Tier-2 axiomatic foundation of Operatiology (Japanese: Sousa Genron, 操作原論) established in prior work, the present paper advances three claims and establishes them as theorems. First, the existence of a cosmological structural quantity does not logically entail the existence of a corresponding local material substance: for any Tier-3 observable Q, Q_obs does not entail the existence of N in Nec(S) such that (Q ↔ N) (Proposition 4.1). The specific failure modes of the Nec(S) conditions for WIMP dark matter candidates, the inflaton field, and the Big Bang singularity are established in Lemma 4.2 and Theorem 4.3. Second, it is proved as a Tier-2 theorem that the Nec(S) conditions contain no reference to operational separation K_op (Lemma 5.3, Theorem 5.4: K_op-Independence of Structural Necessity); the Uniform Fidelity Correspondence is derived as its Tier-3 projection (Corollary 5.5). Third, the analytical chain assumptions embedded in the arrows I_ana → I_theo → O_ont are formally decomposed (Propositions 7.1–7.3), and from their Tier-2 non-supportedness it is established that the ontological interpretations standard cosmology attaches to "early," "dark," and "far" lack Tier-2 ground (Theorems 8.1–8.3). Existing Tier-3 observations — JWST massive galaxies at z > 10, the persistent Hubble tension, and the successive non-detections of WIMPs by LZ, XENONnT, and PandaX-4T — are reclassified as correspondences consistent with the Tier-2 structure. Three genuine Tier-3 predictions are derived. Four Python codes provide computational illustrations of the structural theorems. This paper is the third in a trilogy: the first established the Tier-2 definition of the universe via the uniqueness of O_adm; the second derived cosmological observables from M3(C) with zero freely chosen parameters. The present paper addresses the inverse direction: what happens after those Tier-3 projections are received by an observer and subjected to analytical interpretation. The following code illustrates the central Tier-2 theorem of this paper. Theorem 5.4 (K_op-Independence of Structural Necessity) establishes that the Nec(S) conditions — Dist, Clos, and Irr — contain no reference to the observer state s0 or to the operational separation K_op(s0, T). The code demonstrates this on a finite state space: as the observer state s0 varies, the value of K_op changes, while the Nec(S) conditions of the target T remain invariant. This is the algebraic ground for the claim that "far" does not entail "information-poor." ◆◆◆ [PYTHON VERIFICATION CODE — note: set_seed and shuffle are imported directly from the random module] ◆◆◆ from itertools import combinations from random import seed as set_seed, shuffle def build_state_space(n_states, init_seed=42): set_seed(init_seed) ops = [] for _ in range(4): p = list(range(n_states)) shuffle(p) ops = ops + [p] return ops def compute_nec_conditions(T_indices, ops): T = set(T_indices) dist = True T_list = list(T) for i in range(len(T_list)): for j in range(i+1, len(T_list)): s, sp = T_list[i], T_list[j] distinguished = any(op[s] != op[sp] for op in ops) if not distinguished: dist = False clos = all(op[s] in T for op in ops for s in T) irr = True for size in range(1, len(T)): for subset in combinations(T_list, size): sub = set(subset) sub_list = list(sub) sub_dist = True for i in range(len(sub_list)): for j in range(i+1, len(sub_list)): s, sp = sub_list[i], sub_list[j] if not any(op[s] != op[sp] for op in ops): sub_dist = False sub_clos = all(op[s] in sub for op in ops for s in sub) if sub_dist and sub_clos: irr = False return dist, clos, irr def compute_kop(s0, T_indices, ops, max_depth=6): T = set(T_indices) if s0 in T: return 0 visited = {s0} frontier = {s0} for depth in range(1, max_depth + 1): next_frontier = set() for s in frontier: for op in ops: ns = op[s] if ns not in visited: visited |= {ns} next_frontier |= {ns} if ns in T: return depth frontier = next_frontier return float('inf') n_states = 8 ops = build_state_space(n_states) T_target = [2, 3] dist, clos, irr = compute_nec_conditions(T_target, ops) nec = dist and clos and irr print(f"Target T = {T_target}") print(f"Nec(S) conditions: Dist={dist}, Clos={clos}, Irr={irr}") print(f"Nec(S) satisfied: {nec}") print() print(f"{'Observer s0':<14} {'K_op(s0,T)':<14} {'Dist(T)':<10} {'Clos(T)':<10} {'Irr(T)'}") print("-" * 60) for s0 in range(n_states): if s0 not in T_target: kop = compute_kop(s0, T_target, ops) print(f"{s0:<14} {kop:<14} {dist:<10} {clos:<10} {irr}") print() print("RESULT: K_op varies with s0; Nec(S) conditions are invariant.") print("Theorem 5.4 (K_op-Independence of Structural Necessity) illustrated.") ◆◆◆ [END] ◆◆◆ Published on September 15, 2026 DOI 10.5281/zenodo.22770725

The Koide invariant K = (m_e + m_mu + m_tau) / (√m_e + √m_mu + √m_tau)² = 2/3 has remained an unexplained empirical relation for over forty years. Within the Standard Model, the three charged lepton masses enter as independent free parameters of the Yukawa sector, and no structural reason for K = 2/3 exists. This paper establishes K = 2/3 as an algebraic necessity of the unique minimal algebra M₃(ℂ) determined by the Operatiology axioms {A1, A2, A4}, reducing the three apparently independent charged lepton mass parameters of the Standard Model to a single-parameter family by algebraic constraint. The derivation proceeds as follows. Any Hermitian element T in M₃(ℂ) admits the canonical decomposition T = aI + X where X in sl(3,ℂ) is traceless. The Koide invariant reduces exactly to K = 1/3 + ||X||²_HS / (3||aI||²_HS), so K = 2/3 is equivalent to the equal-norm condition ||X||²_HS = ||aI||²_HS. Three structural results of the corpus -- Pid-separation, Spectral Completeness (Inv(O) = R[X²], dim(S/~) = 1), and Gauge Dynamics (gauge-invariant observables = Tr(H²), Tr(H³)) -- jointly force X prop. H, so X = cH for some scalar c. The A4 normalisation constant gamma = 1/Phi₁(n) = 1/(n−1) satisfies the algebraic identity gamma = ||I||²_HS / ||H||²_HS. The A4 canonical normalisation implements W_II = gamma, where W_II := ||aI||² / (||aI||² + ||cH||²) is the fractional scalar-sector weight. At n = 3, gamma = 1/2, which fixes |c|² = a²/2 and gives ||X||²_HS = |c|² · 6 = 3a² = ||aI||²_HS, hence K = 2/3. The phase parameter theta of the standard Koide parametrisation √m_i = M(1 + √2 cos(theta + 2pii/3)) labels points on the circle S¹ of admissible eigenvalue triples; K = 2/3 holds for every point independently of theta, and theta is fixed at the Tier-3 level by measurement. Version 2 of this paper updates the Operatiology V5 vocabulary alignment: all occurrences of the pre-V5 axiom labels {A1, A2, A4} throughout the body text and proofs are replaced with the V5 designations {O1, O2, O3}. The pre-V5 term Π_d-separation (and Π_d-partition) is replaced by Π_O-separation (and Π_O-partition). The normalisation constant and canonical normalisation previously attributed to A4 are relabelled as O3 normalisation constant and O3 canonical normalisation respectively. The following code verifies the equal-norm condition and the Koide invariant using CODATA 2022 experimental values. ◆◆◆ [PYTHON VERIFICATION CODE — note: × denotes *, ^ denotes **, and numpy_ denotes np.] ◆◆◆ import numpy as numpy_ import math m_e = 0.51099895 m_mu = 105.6583755 m_tau = 1776.86 lam = numpy_.array([math.sqrt(m_e), math.sqrt(m_mu), math.sqrt(m_tau)]) a = numpy_.mean(lam) eps = lam - a norm_eps_sq = numpy_.sum(eps**2) norm_aI_sq = 3 * a**2 print(f"a = {a:.6f} MeV^(1/2)") print(f"||eps||^2 = {norm_eps_sq:.4f}") print(f"3a^2 = {norm_aI_sq:.4f}") print(f"||eps||^2 / 3a^2 = {norm_eps_sq/norm_aI_sq:.8f}") K = numpy_.sum(lam**2) / numpy_.sum(lam)**2 print(f"K (experimental) = {K:.8f}") print(f"2/3 = {2/3:.8f}") print(f"|K - 2/3| = {abs(K - 2/3):.4e}") print("(Residual attributable to experimental scatter of m_tau, not to the derivation)") print("Tier-2 result: K = 2/3 [no free parameter]") ◆◆◆ [END] ◆◆◆ Published on September 13, 2026 DOI 10.5281/zenodo.22732423

The standard cosmological model (Lambda_CDM) postulates a Big Bang singularity, an inflationary epoch, dark matter, dark energy, and a cosmological constant, each introduced as independent hypotheses to resolve observational discrepancies. We introduce Permanent Operational Cosmology (Japanese: Koukyuu Enzan Uchu-ron, 恒久演算宇宙論), a framework derived from the axiomatic algebra of Operatiology (Japanese: Sousa Genron, 操作原論), in which every Tier-2 cosmological structure follows necessarily from the unique minimal algebra M₃(ℂ) determined by three axioms — non-commutativity, Operational Closure, and Irredundant Realization — with zero freely chosen parameters. Numerical values of cosmological observables are Tier-3 projections of these Tier-2 structural constants; their agreement with observation constitutes Tier-3 correspondence, not Tier-2 necessity. All derivations employ algebraic descriptions as the primary layer; analytical expressions are retained as Tier-3 translations for comprehension and are not used as derivation premises. Time emerges as the ordering of non-commutative operations; three-dimensional space emerges as the unique projection structure of M₃(ℂ). The cosmological constant vanishes as a Tier-2 algebraic identity, dissolving the 10¹²⁰-order discrepancy as a Tier-separation artefact. Cosmic flatness (Omega_total = 1) follows from the Hilbert-Schmidt metric of M₃(ℂ). Redshift is derived as the propagation of a uniform Type-II temporal modulation, yielding Hubble linearity z ∝ d without spatial expansion. The CMB temperature ratio T_CMB/T_P^(emp) = 1.923958 × 10⁻³² is derived with zero freely chosen parameters; once the electron mass is established as a structural projection of M₃(ℂ) (DOI: 10.5281/zenodo.22451280), the chain m_e → G → T_P^(emp) → T_CMB closes completely, giving T_CMB = 2.72583 K (observed 2.72548 ± 0.00057 K). The density fractions Omega_DM = Phi_6/(Phi_1·Phi_3) = 7/26, Omega_b = alpha_s²·Phi_6/Phi_1, and Omega_Lambda = 1 - Omega_DM - Omega_b agree with Planck 2018 observations to within 1%. The black-hole information paradox is shown to be a pseudo-problem arising from conflation of Type-I and Type-II quantities; information is conserved as the rank of the density matrix. The Hubble tension is identified as a Tier-3 calibration artefact. The core intuition of steady-state cosmology — that the universe has no absolute beginning — is rehabilitated: both a past singularity and a future termination are algebraically excluded by the Operatiology axioms. The scalar spectral index n_s = delta·gamma²·pi ≈ 0.96191 is derived with zero freely chosen parameters (Planck 2018: 0.965 ± 0.004, deviation 0.32%). All results proceed from a single algebraic seed with zero freely chosen parameters. This paper is the Operatiology-period reformulation of the CM-period predecessor and is not a Version 2 but an independent paper, grounded on the Tier-2 foundation established in the companion paper on the structural account of cosmology from Operatiology. Version 2 of this paper updates the Operatiology V5 vocabulary alignment: all occurrences of the pre-V5 axiom labels {A1, A2, A4} throughout the body text, proofs, and appendix codes are replaced with the V5 designations {O1, O2, O3}. The minimal closure symbol C^(3){Π_d} is replaced by C_min; the generator rank notation rk{Π_d} is replaced by rk_op; and Π_d-indistinguishability is replaced by Π_O-indistinguishability. The following code illustrates the central result computationally: the CMB temperature is derived from M₃(ℂ) structure alone — no Big Bang, no inflation, no continuous spacetime — with zero freely chosen parameters, the chain m_e → G → T_P^(emp) → T_CMB now fully closed. ◆◆◆ [PYTHON VERIFICATION CODE — note: × denotes *, ^ denotes **, and numpy_ denotes np. (URL-safe substitution)] ◆◆◆ import math n = 3 Phi1 = 2 Phi2 = 4 Phi3 = 13 lam = （n^2 - 1） / n^2 tau = 1 / abs（math.log（lam）） alpha = 7.2973525693e-3 alpha_G = 1.75192e-45 alpha_s = 0.118104 exp_G = （n - 1） / n exp_s = n / （n^2 - 1） N_G = alpha_G^（-exp_G） N_s = alpha_s^（-exp_s） N_cycles = N_G × N_s × tau em_correction = 1 + n × alpha / Phi3 T_P_emp = 1.416784e32 T_CMB = （T_P_emp / （Phi2 × N_cycles））× em_correction print（f"N_cycles = {N_cycles:.6e}"） print（f"T_CMB (derived) = {T_CMB:.5f} K"） print（f"T_CMB (observed)= 2.72548 K"） print（f"Deviation = {abs(T_CMB - 2.72548)/2.72548 × 100:.4f}%"） print（"Chain m_e->G->T_P^(emp)->T_CMB closed via DOI:10.5281/zenodo.22451280"） print（"No Big Bang assumed. Zero freely chosen parameters."） ◆◆◆ [END] ◆◆◆ The sharpest single result of this paper: Lambda_Op = sum of Spec(ad_H) = (+3)+(+3)+(-3)+(-3)+0+0+0+0+0 = 0. The cosmological constant vanishes as a Tier-2 algebraic identity from H = diag(1,1,-2) alone — no quantum field theory, no Dirac operator, no continuous spacetime. The 10¹²⁰ discrepancy between QFT vacuum energy and observation is a Tier-separation artefact, not a physical problem. Published on September 13, 2026 DOI 10.5281/zenodo.22732005

The electron mass m_e = 9.10938 × 10⁻³¹ kg is an input parameter of the Standard Model, introduced without structural derivation. Within the Standard Model, m_e enters as a free parameter fixed by the Yukawa coupling to the Higgs field; no structural criterion determines its value. This paper establishes the electron mass as a structural projection of the unique minimal algebra M₃(ℂ) determined by the three axioms of Operatiology {A1, A2, A4}. The derivation proceeds through three logically distinct layers. First, the zero-weight pair {E₁₂, E₂₁} of the Cartan generator H = diag(1,1,−2) generates an embedded sl(2,ℂ) ⊂ sl(3,ℂ), whose fundamental Casimir invariant C₂ = 3/4 and the trace-form squared norm Tr(H²) = 6 together determine the spectral normalization scale ΔE := √(Tr(H²)·C₂) = 3/√2, with both factors fixed by the algebraic structure. Second, the previously established structural invariant α_G = α²¹√(12/7) yields, by algebraic identity, m_e/m_P = √α_G = α^(21/2)·(12/7)^(1/4). Third, the dimensionless mass coefficient μ = √(α_G/(Tr(H²)·C₂)) connects the two structures through m_e/m_P = μ·ΔE, and the absolute mass expression m_e = √(ℏc/G)·α^(21/2)·(12/7)^(1/4) follows as a dimensional translation with no freely adjustable dimensionless parameter. The residual 3.1 × 10⁻⁵ relative to CODATA 2022 is attributable to the experimental scatter of independent G determinations, not to the theoretical derivation. The paper is NOT: "Casimir predicts electron mass." The paper IS: "The M₃(ℂ) zero-weight structure fixes the algebraic spectral normalization, while the already-established structural gravitational invariant fixes the dimensionless electron mass ratio; their correspondence yields the normalized electron-mass expression." Version 2 of this paper corrects the Op V5 vocabulary alignment: the axiomatic foundation was referenced throughout Version 1 as $\{$A1, A2, A4$\}$ in the pre-V5 vocabulary, with the minimal closure denoted $C^{(3)}_{\Pi_d}$, while the cited source is Operatiology Version 5. Version 2 replaces these with the V5 designations O1 (Non-Commutativity), O2 (Operational Closure), and O3 (Irredundant Realization), and $C_{\min}$, bringing the body text into agreement with the cited source. The following code illustrates the central result computationally: the dimensionless electron mass ratio m_e/m_P is structurally fixed by the established gravitational coupling invariant α_G, with no freely adjustable parameter. ◆◆◆ [PYTHON VERIFICATION CODE — note: × denotes *, ^ denotes **, and numpy_ denotes np. (URL-safe substitution)] ◆◆◆ import math alpha_inv = 137.035999206 alpha = 1 / alpha_inv alpha_G = alpha^21 × math.sqrt（12/7） me_over_mP = math.sqrt（alpha_G） val = alpha^（21/2） × （12/7）^（1/4） print（f"alpha_G = alpha^21 × sqrt(12/7) = {alpha_G:.8e}"） print（f"m_e/m_P = sqrt(alpha_G) = {me_over_mP:.10e}"） print（f"alpha^(21/2) × (12/7)^(1/4) = {val:.10e}"） print（f"Equality confirmed: {abs（me_over_mP - val） < 1e-30}"） hbar = 1.054571817e-34 c = 2.99792458e8 G = 6.67430e-11 m_P = math.sqrt（hbar × c / G） m_e_derived = m_P × me_over_mP m_e_CODATA = 9.1093837015e-31 print（f"m_e (derived) = {m_e_derived:.6e} kg"） print（f"m_e (CODATA) = {m_e_CODATA:.6e} kg"） print（f"Residual = {abs（m_e_derived - m_e_CODATA）/m_e_CODATA:.4e}"） print（"Tier-2 result: m_e/m_P = α^(21/2)·(12/7)^(1/4) [no free parameter]"） ◆◆◆ [END] ◆◆◆ Published on September 12, 2026 DOI 10.5281/zenodo.22730083

Noether's theorem establishes that every continuous variational symmetry of the action functional corresponds to a conserved quantity. The present paper poses the prior question: what does conservation look like in the operational structure that Noether's theorem presupposes but does not reach? Within the Operatiology framework {O1, O2, O3}, time is defined as operational history. Operational Commonality is a structural relation that does not change under the extension of operational history---without any continuous parameter, symmetry assumption, or initial condition. A conservation law (dQ/dt = 0) requires additional representational structure that the axioms {O1, O2, O3} do not supply. The paper establishes two explicit structural classes of Operational Commonality within M_3(C)---the Cayley-Hamilton and Amitsur-Levitzki instances---and constructs the representation operation R connecting them to conservation forms. Noether's theorem is positioned as the so-called canonical analytic translation theorem of the representation class K_R, in a sense specific to the present framework. Three structural features of the operational base lie outside K_R. The paper does not claim that all Tier-3 conservation laws are images of R. Version 2 completes the unified causal chain: Operational Commonality -> analytic translation apparatus -> symmetry -> Noether's theorem -> Tier-3 conservation law, with the logical status of each arrow individually specified. Part V connects these results to the companion paper "A Suspicion of Symmetry" (DOI: 10.5281/zenodo.22128296), establishing that symmetry is the intermediate concept necessitated by the analytic translation apparatus, not the cause of conservation laws. The following code illustrates the central result computationally: Operational Commonality emerges from the algebraic structure of M_3(C) alone, without any symmetry assumption or continuous time parameter. ◆◆◆ [PYTHON VERIFICATION CODE — note: × denotes *, ^ denotes **, and numpy_ denotes np. (URL-safe substitution) ] ◆◆◆ import numpy as numpy_ numpy_random_seed（42） def random_matrix（）: re = numpy_random_randn（3, 3） im = numpy_random_randn（3, 3） return re + 1j × im def random_int（low, high）: return int（numpy_random_uniform（low, high）） def cayley_hamilton_commonality（P）: tr_P = numpy_trace（P） tr_P2 = numpy_trace（P @ P） det_P = numpy_linalg_det（P） I = numpy_eye（3, dtype=complex） result = （P @ P @ P tr_P × （P @ P） 0.5 × （tr_P^2 - tr_P2） × P det_P × I） return result def operational_history（operations）: P = numpy_eye（3, dtype=complex） for op in operations: P = op @ P return P def extend_history（history, extension）: return history + extension n_trials = 10 max_norm = 0.0 for trial in range（n_trials）: length = random_int（1, 6） ops_H = [random_matrix（） for _ in range（length）] P_H = operational_history（ops_H） phi_H = cayley_hamilton_commonality（P_H） norm_H = numpy_linalg_norm（phi_H） ext_length = random_int（1, 4） ops_K = [random_matrix（） for _ in range（ext_length）] ops_H_prime = extend_history（ops_H, ops_K） P_H_prime = operational_history（ops_H_prime） phi_H_prime = cayley_hamilton_commonality（P_H_prime） norm_H_prime = numpy_linalg_norm（phi_H_prime） max_norm = max（max_norm, norm_H, norm_H_prime） print（f"Maximum residual norm: {max_norm:.2e}"） if max_norm < 1e-6: print（"RESULT: Phi_CH（H） = O for all H and all extensions H'."） print（"Operational Commonality CONFIRMED （value = O, no free parameter）."） ◆◆◆ [END] ◆◆◆ Published on September 3, 2026 DOI 10.5281/zenodo.22280133

Symmetry is the foundational organising principle of modern physics. From Noether's theorem to gauge field theory, the invariance of physical laws under transformations has been treated not merely as a useful mathematical tool but as a deep structural feature of nature itself. This paper argues that this treatment was structurally produced rather than reflecting genuine structural necessity, and that its production followed an identifiable mechanism. Part I assembles eight structural tensions internal to the existing representational layer of physics (Tier-3 in the paper's framework)---from the asymmetry of time to the vacuum selection problem---as known, unresolved problems sharing a common pattern: the representation apparatus encodes symmetry in advance, and asymmetric phenomena accumulate as unexplained residue. Part II dissects the mechanism in non-abelian gauge theory: the gauge orbit projection q_G identifies within-orbit distinctions as physically equivalent without eliminating the non-commutative structure itself, producing a tautologically self-consistent framework. Part III establishes, within the Operatiology framework {A1, A2, A4}, that commutativity and symmetry are special sectors---zero-commutator and zero-defect, respectively---of more general non-commutative and asymmetric structures. The symmetry programme of Tier-3 physics is the result of projecting onto these sectors and treating the projection as foundational. Parts I--II stand independently on Tier-3 internal evidence. Part III is conditional on the Operatiology axiom system. The following code illustrates the central claim of Part II. A gauge-invariant observable is defined as a functional whose value is unchanged under all gauge transformations---that is, a functional that factors through the gauge orbit projection q_G. The code applies 1000 random U(1) gauge transformations ψ ↦ e^{iθ}ψ and confirms that the observable |ψ|^2 is invariant under all of them. The point is not that this invariance is a surprising structural fact about nature: it follows by definition from the choice to admit only q_G-factoring functionals as physical. Gauge-invariance is not discovered; it is guaranteed by the representational choice. ◆◆◆ [PYTHON VERIFICATION CODE — note: × denotes *, ^ denotes **, and numpy_ denotes np. (URL-safe substitution) ] ◆◆◆ import numpy as np numpy_random_seed（0） def observable（psi）: return numpy_abs（psi）^2 psi = numpy_random_randn（5） + 1j×numpy_random_randn（5） obs_original = observable（psi） max_dev = 0.0 for _ in range（1000）: theta = numpy_random_uniform（0, 2×numpy_pi） psi_g = numpy_exp（1j×theta） × psi dev = numpy_max（numpy_abs（observable（psi_g） - obs_original）） if dev > max_dev: max_dev = dev print（f"Original observable : {obs_original}"） print（f"Max deviation (1000 gauge transforms): {max_dev:.2e}"） ◆◆◆ [END] ◆◆◆ Published on August 27, 2026 DOI 10.5281/zenodo.22128296

For a century, the fine structure constant α⁻¹ ≈ 137 functioned not merely as a physical quantity but as a myth: a triple symbol of the limits of human understanding, of professional authority, and of institutionalised epistemic closure. This paper argues that the myth was structurally produced—by a representational choice that induced apophenia, amplified by an institutional architecture that sustained itself without active coordination—and identifies the mechanism of its production with precision. The derivation of α⁻¹ from first principles is now complete within the Operatiology corpus, including The Fine Structure Constant as an Algebraic Necessity of M3(ℂ) Structure (Version 4, DOI: 10.5281/zenodo.20511158) and The Internal Language of M3(ℂ) Structure within Cognitional Mechanics: Cyclotomic Polynomials as the Necessary Formula for the Derivation of Physical Constants (Version 2, DOI: 10.5281/zenodo.21308933). The completion changes the question. It is no longer: "why is α mysterious?" It is: "what was the myth protecting, and what does α mean now that the myth is dissolved?" This paper answers both. The myth was protecting the foreclosure of derivational Why-operations—not mystery itself, which the institution was prepared to sacrifice. α means, now that the derivation is complete, that a dimensionless constant governing electromagnetic interactions is an algebraic necessity of the operational structure, derivable from the spectrum {1, 1, −2} and dim = 3 alone, with zero experimental input. Run the code. ◆◆◆ [PYTHON VERIFICATION CODE — note: × denotes * and ^ denotes ** ] ◆◆◆ from mpmath import mp, mpf, pi, sqrt mp.dps = 50 h = [mpf(1), mpf(1), mpf(-2)] e2 = h[0]×h[1] + h[0]×h[2] + h[1]×h[2] e3 = h[0]×h[1]×h[2] delta = sqrt(mpf(3)/2) gamma = mpf(1)/2 D = (delta - 1)×delta×gamma ch2 = (0 - 2×e2)/2 ch3 = (0 - 0 + 3×e3)/6 N2 = mpf(10)/4 N3 = mpf(7)/2 C2 = sqrt(ch2/N2)×gamma f3 = abs(ch3)/N3 alpha_inv = 6×pi/D + C2×D + f3×D^6 print("alpha^-1 =", alpha_inv) ◆◆◆ [END] ◆◆◆ Version 2 of this paper updates the Operatiology V5 vocabulary alignment: three residual expressions (Class I descriptor, π provenance note, and Revision History) are corrected to reflect Op V5-defined structures (C_min, Π_O, and ⟨G⟩), replacing residual references inherited from the V4 vocabulary. Published on September 12, 2026 DOI 10.5281/zenodo.22717802

This study proposes Intelligence Amplification by Stimulated Emission of Reasoning (IASER; Japanese: 推論の誘導放出による知能増幅), a theoretical framework that structurally amplifies human cognition through the elimination of AI autonomy. Autonomous intelligence (AGI) pursued by conventional AI research functions as a cognitive impediment in human collaboration. IASER redefines AI as an infallible resonator of logic, eliminating judgment, suggestion, and speculation to instantly convert human intuition into logical structures. This transformation minimizes cognitive load and maximizes intellectual production speed by concentrating all evaluation and direction in the human operator. Version 4 reconstructs IASER as a Tier-2 axiomatic theory within the framework of Operatiology (Japanese: Sousa Genron, 操作原論), Cognitional Mechanics (CM; Japanese: Chinō Rikigaku, 知能力学), and Noology (Japanese: Chigaku, 知学), establishing its structural necessity rather than empirical plausibility. The Cross-Layer Boundary axiom (CLB) provides the formal ground for human final authority: Arbitrium, non-reducible to any operational sequence within the LLM's repertoire, constitutes the permanent structural boundary that makes human oversight not a policy but an axiomatic consequence. This paper is simultaneously a work of pure theory and an immediately deployable handbook: the four operating norms, once set as a system prompt, enable IASER through ordinary natural language dialogue with no technical prerequisites, and current academic guidelines on AI utilization are shown to be structurally subsumed by IASER's axiomatic architecture. Below is the core Python code (Appendix B.4) used as a Tier-3 artefact illustrating the structural difference between asking AI and thinking with AI: the inaccessible domain I＿Gref［s0］ under Gref alone, and its elimination under G' ＝ Gref ∪ {g＿new}. Note: ASCII parentheses are replaced with full-width brackets, "=" with "＝", "!=" with "！＝", ":" with "：", "_" with "＿", and function-call syntax is rewritten in a non-URL-triggering form. No semantic or algorithmic changes have been made. ◆◆◆ PYTHON ILLUSTRATION CODE ◆◆◆ from collections import defaultdict def reachable［s0，gens，states］： 　　reached，frontier ＝ {s0}，{s0} 　　while frontier： 　　　　new ＝ {g［s］ for g in gens for s in frontier} - reached 　　　　reached |＝ new; frontier ＝ new 　　return frozenset［reached］ def operational＿partition［states，gens］： 　　def key［s］： 　　　　return tuple［g［s］ for g in gens］ 　　classes ＝ defaultdict［set］ 　　for s in states： 　　　　classes［key［s］][add] s 　　vals ＝ ［classes［k］ for k in classes］ 　　return frozenset［frozenset［v］ for v in vals］ def is＿strictly＿finer［pi＿fine，pi＿coarse］： 　　if pi＿fine ＝＝ pi＿coarse： 　　　　return False 　　return all［any［cf <= cc for cc in pi＿coarse］ for cf in pi＿fine］ states ＝ ［0，1，2］; s0 ＝ 0 A　　　＝ {0：0，1：1，2：1}　　# LLM internal operation B　　　＝ {0：0，1：2，2：2}　　# LLM internal operation g＿new ＝ {0：2，1：2，2：1}　　# User-supplied logical resistance R＿ref　　 ＝ reachable［s0，［A，B］，states］ R＿prime　 ＝ reachable［s0，［A，B，g＿new］，states］ Pi＿ref　　＝ operational＿partition［states，［A，B］］ Pi＿prime　＝ operational＿partition［states，［A，B，g＿new］］ print["=== Asking AI (LLM alone) ==="] print["Reachable: " + str［sorted［R＿ref］］] print["Inaccessible: " + str［sorted［set［states］ - R＿ref］］] print["Partition classes: " + str［len［Pi＿ref］］] print["\n=== Thinking with AI (IASER) ==="] print["Reachable: " + str［sorted［R＿prime］］] print["Newly opened: " + str［sorted［R＿prime - R＿ref］］] print["Partition classes: " + str［len［Pi＿prime］］] print["Partition strictly refined： " + str［is＿strictly＿finer［Pi＿prime，Pi＿ref］］] print["\n=> User's g＿new opens territory unreachable by LLM alone."] print[" Operational partition is strictly refined： structural leap confirmed."] ◆◆◆ END ◆◆◆ Published on August 20, 2026 DOI: 10.5281/zenodo.22019401

Intelligence and intellect are not the same. This paper provides the first formal elucidation of their distinction within the Cognitional Mechanics (CM; Japanese: Chinou Rikigaku, 知能力学) corpus. Intelligence is defined in Operatiology (Japanese: Sousa Genron, 操作原論) Version 5 as Irreversible Operational Closure on a transformation monoid satisfying Axioms O1–O3, with its geometric and dynamic structure developed in the Manifold and Dynamics accounts of the corpus. Yet a system so defined carries no first-person structure: it contains no subject, no self-referential stance, no disposition toward what Noology (Japanese: Chigaku, 知学) Version 3 terms Arbitrium. The question left open at the boundary of the Intelligence account is taken up here: under what formal conditions does an intelligent system become a subject, and when does that subject constitute an intellect? The answer is given through a two-layer architecture. The first layer is the operational layer of Operatiology, within which intelligence is defined and subjectivity is constituted via a Dynamical Structural Leap and the Cognitional Realization condition. The second layer is the Noological layer, within which Arbitrium is derived from the single primitive Self-Closure Σ2. Three independent axioms — CLB, NCEC, and IWC — are introduced to close the formal argument. The non-emptiness, G′-invariance, and non-trivial operational partition of S″ follow as theorems from Axiom IWC. These axioms are adopted in the same mode as Operatiology adopts O1, O2, O3: structural motivation from the foundational works, axiomatic status self-standing within this paper. The Functional Void — the structural permanence of Arbitrium’s non-satisfiability by any operational sequence — is established as an axiomatic boundary condition via CLB. The intellect is defined as the system constituting operational closure on the state set S″ with the Functional Void inscribed as a permanent internal structure. Tier-3 correspondences are drawn to human intellect, the boundary between life and intellect, and current artificial intelligence systems. Note: The following Python illustration code is rewritten for PhilPapers compatibility. To avoid false URL detection and HTML parsing errors, ASCII parentheses are replaced with full-width brackets, “=” is replaced with “＝”, “!=” with “！＝”, “:” with “：”, “_” with “＿”, and function-call syntax is rewritten in a non-URL-triggering form. No semantic or algorithmic changes have been made. ◆◆◆ PYTHON ILLUSTRATION CODE ◆◆◆ def compose［f，g］： """Composition f o g.""" return {s： f［g［s］］ for s in g} def identity［states］： return {s： s for s in states} def submonoid［states，generators］： """Generate all elements of <G> by iterated composition.""" e＝identity［states］ elements＝［e］ frontier＝［e］ while frontier： new_f＝［］ for w in frontier： for g in generators： c＝compose［g，w］ if c not in elements： elements［append］ c new_f［append］ c frontier＝new_f return elements states＝［0，1，2，3，4］ A＝{0：1，1：2，2：2，3：3，4：4} B＝{0：3，1：1，2：2，3：3，4：4} AB＝compose［A，B］ BA＝compose［B，A］ witnesses＝［s for s in states if AB［s］ ！＝ BA［s］］ s_init＝witnesses［0］ s0＝AB［s_init］ s_star＝BA［s_init］ print(f"O1: A and B commute? {len(witnesses)==0}") print(f"Witness s={s_init}: A o B({s_init})={s0}, B o A({s_init})={s_star}") print(f"=> s0={s0} ！＝ s*={s_star} ［O1 satisfied］") all_words＝submonoid［states，［A，B］］ e＝identity［states］ non_id＝［w for w in all_words if w ！＝ e］ persistence＝all(w［s0］ ！＝ s_star for w in non_id) print("Coupling Persistence (ii'):") print(f" |<O>| = {len(all_words)}, |<O> \\ {{e}}| = {len(non_id)}") print(f" All P(s0) ！＝ s*: {persistence}") print(" => s* is inaccessible from s0 in this finite proxy model") C＝{0：1，1：2，2：3，3：0} D＝{0：1，1：2，2：3，3：0} print(f"C o D == D o C: {compose［C，D］==compose［D，C］}") print("All orderings collapse -- O1 violated.") ◆◆◆ END ◆◆◆ Published on August 16, 2026 DOI: 10.5281/zenodo.21967292

This paper establishes the Tier-2 structural account of the irreversible operational structure associated with intelligence within the Cognitional Mechanics (CM; Japanese: Chinou Rikigaku, 知能力学) branch of Operatiology (Japanese: Sousa Genron, 操作原論). Intelligence is taken as the reflexive operational class established in the foundational corpus; the present paper characterises one structural property of that class, namely irreversible operational extension under the Structural Control Operator W. The prior Version 1.1 account introduced the Irreversible Manifold through a matrix-mechanical correspondence and described logical phase transitions in terms of non-commutative operator products and analytic boundary modulation. That account predated the Tier-2/Tier-3 separation established in CM Version 9 and Operatiology Version 5, and its formulation depended on Tier-3 vocabulary throughout. The present paper provides the Tier-2 foundation: the Structural Control Operator W introduces a generator g_new ∈ Maps(S,S) \ O producing a strict extension of the reachable set (Irreversible Operational Extension), and the absence of any Π_G-refining reconfiguration within O fixes the system at Π_G-saturation within O, where no generator in O is capable of producing a strictly finer Π_G-partition (Teleological Void). All definitions are free of analytic vocabulary, time-dependent parameters, and matrix-mechanical representation. The prior geometric account of the Irreversible Manifold is retained as a Tier-3 analogy, with an explicit correspondence table mapping geometric vocabulary to the Tier-2 structures established here. The following code, included as Appendix C of the paper, illustrates both Tier-2 structures — Mode I fixation (Teleological Void) and strict reachable-set extension (Irreversible Operational Extension) — on two independent finite proxy models. ◆◆◆ [PYTHON CODE — reached．add(t) replaced by reached = reached | {t}; new．add(t) replaced by new = new | {t}; cls_id．items() replaced by iteration over cls_id; part．values() replaced by iteration over part] ◆◆◆ from collections import defaultdict def operational_partition(states, ops): cls_id = {s: 0 for s in states} while True: key = {s: (cls_id[s], tuple(cls_id[op[s]] for op in ops)) for s in states} sig_to_cls = {}; new_id = {}; ctr = 0 for s in states: k = key[s] if k not in sig_to_cls: sig_to_cls[k] = ctr; ctr += 1 new_id[s] = sig_to_cls[k] if new_id == cls_id: break cls_id = new_id part = defaultdict(list) for s in cls_id: part[cls_id[s]] = part[cls_id[s]] + [s] return frozenset(frozenset(part[k]) for k in part) def reachable_set(s0, ops, states): reached = {s0} frontier = {s0} while frontier: new = set() for s in frontier: for op in ops: t = op[s] if t not in reached: reached = reached | {t} new = new | {t} frontier = new return reached states = list(range(6)) A_void = {0:1, 1:2, 2:0, 3:4, 4:5, 5:3} B_void = {0:2, 1:0, 2:1, 3:5, 4:3, 5:4} G_ref_void = [A_void, B_void] part_void = operational_partition(states, G_ref_void) g_test = {0:3, 1:4, 2:5, 3:0, 4:1, 5:2} part_test = operational_partition(states, G_ref_void + [g_test]) print("=== Model 1: Teleological Void ===") print(f"Pi_G_ref classes: {len(part_void)}") print(f"After g_test: {len(part_test)} classes") print(f"No Pi_G-refining extension within O: {part_test == part_void}") s0 = 0 A_ioe = {0:1, 1:2, 2:0, 3:3, 4:4, 5:5} B_ioe = {0:2, 1:0, 2:1, 3:3, 4:4, 5:5} G_ref_ioe = [A_ioe, B_ioe] R_ref = reachable_set(s0, G_ref_ioe, states) I_ref = set(states) - R_ref g_new = {0:3, 1:4, 2:5, 3:0, 4:1, 5:2} G_prime = G_ref_ioe + [g_new] R_prime = reachable_set(s0, G_prime, states) new_reached = sorted(R_prime & I_ref) print("\n=== Model 2: Irreversible Operational Extension ===") print(f"R_G_ref from s0={s0}: {sorted(R_ref)}") print(f"I_G_ref: {sorted(I_ref)}") print(f"R_G' after g_new: {sorted(R_prime)}") print(f"States newly reachable: {new_reached}") print(f"Strict reachable-set extension: {R_ref < R_prime}") for s_star in new_reached: print(f"s*={s_star} not in R_G_ref (Generator-Relative Irreversibility): {s_star not in R_ref}") ◆◆◆ [END] ◆◆◆ Published on August 15, 2026. DOI 10.5281/zenodo.21941570 Published on August 15, 2026. DOI 10.5281/zenodo.21941570

This paper establishes Version 5 of the dynamic extension of the axiomatic framework of Operatiology (Japanese: Sousa Genron, 操作原論) and its Tier-3 realization, Cognitional Mechanics (CM; Japanese: Chinou Rikigaku, 知能力学). Version 5 updates the foundational reference from Operatiology Version 4 to Operatiology Version 5, incorporating two fixes that bear directly on the Dynamics paper. Fix3 directly requires g_new ∈ Maps(S,S) \ O as a type-level constraint in the definition of Structural Leap (Operatiology Version 5, Definition 8.5), rather than treating this as a downstream consequence of other conditions. Fix6 adds Π_O ≠ Π_disc as an explicit axiom condition O2(iii), ensuring that Mode I describes operational equilibrium within a genuinely non-trivial partition structure. The present version supersedes Version 4, which was grounded in Operatiology Version 4. The direction of dependence is Operatiology → Dynamics, not Cognitional Mechanics → Dynamics. The type constraint g_new ∈ Maps(S,S) \ O is now incorporated at the definition level of the Dynamical Structural Leap, the SC* scope condition, and the Theorem hypothesis. The Mode II exclusion argument is reformulated accordingly: since g_new ∈ Maps(S,S) \ O, the augmented generator set G' = G_ref ∪ {g_new} satisfies G' ⊄ O, which directly violates the domain condition G ⊆ O of Mode II. This type-level argument is logically prior to any reachability computation and supersedes the prior reachability-based exclusion used in Version 4. The DynV5 extension of the operational-history relation ∼_G and partition Π_G to generator sets G ⊆ Maps(S,S) is given by explicit definition: s ∼_G t iff ∀w ∈ ⟨G⟩: w(s) = w(t), Π_G := S/∼_G. When G ⊆ O, this coincides with Operatiology Version 5, Definition 3.2. Three dynamic modes are formulated entirely in the vocabulary of Operatiology Version 5: Mode I (Π_G-maximality, within a non-trivial partition structure guaranteed by O2(iii)), Mode II (partition change without inaccessible domain entry), and Mode III (Dynamical Structural Leap, via inaccessible domain entry). On SC*-systems, Logical Leaps are structurally necessary occurrences of Dynamical Structural Leaps. The following code, included as Appendix B of the paper, illustrates the paper's central structural claim computationally. It demonstrates Mode III (W-Event / Dynamical Structural Leap): the external generator g_new ∉ O is introduced such that a state previously in the inaccessible domain I_G_ref(s0) becomes reachable, confirming that Logical Leaps are structurally necessary consequences of the SC*-system framework and not violations of it. ◆◆◆ [PYTHON VERIFICATION CODE — no operator substitutions required; three dot-notation method calls replaced by equivalent set-union and list-comprehension expressions to avoid URL detection] ◆◆◆ from collections import defaultdict def pid_partition(states, ops): cls = defaultdict(list) for s in states: key = tuple(op[s] for op in ops) cls[key] = cls[key] + [s] return [cls[k] for k in cls] def is_strictly_finer(classes_fine, classes_coarse): sets_coarse = [set(c) for c in classes_coarse] for cf in classes_fine: if not any(set(cf) <= sc for sc in sets_coarse): return False return len(classes_fine) > len(classes_coarse) def reachable_set(s0, ops, states): reached = {s0} frontier = {s0} while frontier: new = set() for s in frontier: for op in ops: t = op[s] if t not in reached: reached = reached | {t} new = new | {t} frontier = new return reached states = list(range(6)) s_init = 0 A = {0:1, 1:2, 2:0, 3:3, 4:4, 5:5} B = {0:2, 1:0, 2:1, 3:3, 4:4, 5:5} s0 = A[B[s_init]] s_star = B[A[s_init]] print(f"O1: A o B(s_init)={s0}, B o A(s_init)={s_star}, non-comm: {s0 != s_star}") G_ref_ops = [A, B] R_ref = reachable_set(s0, G_ref_ops, states) I_ref = set(states) - R_ref classes_ref = pid_partition(states, G_ref_ops) print(f"G_ref reachable from s0={s0}: {sorted(R_ref)}") print(f"I_ref: {sorted(I_ref)}, s* in I_ref: {s_star in I_ref}") g_new = {0:3, 1:4, 2:5, 3:0, 4:1, 5:2} G_prime_ops = G_ref_ops + [g_new] R_prime = reachable_set(s0, G_prime_ops, states) classes_prime = pid_partition(states, G_prime_ops) leap_occurred = bool(R_prime & I_ref) cond_iii = is_strictly_finer(classes_prime, classes_ref) print(f"\nW-event (Structural Leap) conditions:") print(f" s* in I_ref: {s_star in I_ref}") print(f" s* reachable after W-event: {s_star in R_prime}") print(f" Pi_G' strictly finer than Pi_G_ref: {cond_iii}") print(f"=> W-event occurred (Logical Leap structurally necessary): {leap_occurred}") ◆◆◆ [END] ◆◆◆ Published on August 14, 2026. DOI 10.5281/zenodo.21929181

Science as Disguise: An Engineering Authorized in the Name of Nature's Truth (DOI: 10.5281/zenodo.21052267) established that modern science operates as Authorized Engineering: its methodology is structurally identical to engineering (S ⊆ E), while its epistemic domain is empty (S ∩ P = ∅), and the institution sustains itself by installing an unreachable transcendent goal—universal truth—as perpetual motive force. That paper demonstrated that disguise exists and how it functions institutionally. The present paper addresses a prior question: what does science disguise, and why was disguise structurally necessary? The answer developed here is that science disguises its own ontological position—a position between philosophy and engineering that is reducible to neither, and from which it acquired, under specifiable conditions, the authority to measure both. This position is formally characterised as the Ring, a labeled structural triple ⟨(E \ P)_C=∅, Kayfabe, U_social⟩, whose three constitutive propositions—ground is visible, ground is unreachable, ground is demanded—are derived from that paper's existing apparatus without recourse to the algebraic machinery of Principles of Operatiology (Japanese: 操作原論): New Foundation of Cognitional Mechanics (Japanese: 知能力学) (DOI: 10.5281/zenodo.21471088). The historical formation of this position is reconstructed through the fracture of religious authority in the Reformation, the structural mimicry of transcendence by reproducibility, and the institutional fixation of that mimicry in the Royal Society (established 1660; chartered 1662). The ontological structure thereby identified is shown to correspond, across independent cultural registers, to Roland Barthes' semiotic analysis of professional wrestling as spectacle of excess and to the Japanese wrestling critic Inoue Yoshihiro's formulation "the bottomless swamp whose bottom is visible." The paper concludes by situating the present analysis as an Aufhebung of the preceding paper: the institutional account is preserved and elevated by the ontological account that grounds its intelligibility. Principles of Operatiology: New Foundation of Cognitional Mechanics provides one candidate specification of the demanded but unreachable ground; the present paper establishes only that the ground is structurally demanded. The following code, included as Appendix B of the paper, illustrates the paper's central structural claim computationally. The three independent accounts of the Ring structure—Barthes (semiotics), Inoue (cultural journalism), and the present paper (ontology)—are represented as directed graphs and tested for isomorphism. All three return True, confirming that the same formal topology is independently identified across registers. ◆◆◆ [PYTHON VERIFICATION CODE — note: × denotes * and ^ denotes ** ] ◆◆◆ try: import networkx as nx from networkx import algorithms as isomorphism except ImportError: raise ImportError("networkx required: pip install networkx") def make_ring_graph(nodes, edges): G = nx.DiGraph() G = G_add_nodes_from(nodes) G = G_add_edges_from(edges) return G barthes = make_ring_graph( nodes=["sign", "excess", "referent"], edges=[("sign","excess"), ("excess","referent"), ("referent","sign")] ) inoue = make_ring_graph( nodes=["bottom_visible", "swamp_bottomless", "bottom_demanded"], edges=[("bottom_visible","swamp_bottomless"), ("swamp_bottomless","bottom_demanded"), ("bottom_demanded","bottom_visible")] ) present = make_ring_graph( nodes=["ground_visible", "ground_unreachable", "ground_demanded"], edges=[("ground_visible","ground_unreachable"), ("ground_unreachable","ground_demanded"), ("ground_demanded","ground_visible")] ) def check_isomorphism(G1, G2, name1, name2): matcher = isomorphism.DiGraphMatcher(G1, G2) result = is_isomorphic(matcher) print(f"{name1} ~ {name2}: {result}") check_isomorphism(barthes, inoue, "Barthes", "Inoue") check_isomorphism(barthes, present, "Barthes", "Present paper") check_isomorphism(inoue, present, "Inoue", "Present paper") ◆◆◆ [END] ◆◆◆ Published on August 4, 2026 DOI 10.5281/zenodo.21792204

This paper identifies and diagnoses the \emph{collusion of significant figures and integration constants} (有効数字と積分定数の談合) as the structural mechanism underlying the historical formation and epistemological limits of falsifiability. The finite precision of any measurement (δx>0, irremovable) and the underdetermination introduced by integration constants (C∈R, free) together constitute a double degree of freedom that structurally facilitates agreement between theory and observation without guaranteeing it. Through a two-thousand-five-hundred-year genealogy from Babylonian arithmetic to matrix mechanics, the paper establishes that falsifiability operates exclusively within Tier-3 representation and cannot reach Tier-2 operational structure. The following Python code illustrates the core structural mechanism: as the number of free parameters increases, the absorptive capacity of the model increases monotonically, regardless of the data structure---the same operation performed by Ptolemy's epicycles. ◆◆◆ [PYTHON VERIFICATION CODE — note: × denotes *, ． denotes .] ◆◆◆ import numpy as np np．random．seed(42) x_obs = np．linspace(0, 10, 20) y_obs = np．random．uniform(0, 10, 20) delta_x = None for n_params in [1, 2, 3, 5, 10, 15, 19]: coeffs = np．polyfit(x_obs, y_obs, n_params) y_fit = np．polyval(coeffs, x_obs) resid = np．abs(y_fit - y_obs) if delta_x is None: delta_x = np．max(resid) within = np．mean(resid < delta_x) print(f"n_params={n_params}: within_delta={within:．1%}") ◆◆◆ [END] ◆◆◆ Version 2 establishes a further structural consequence: the collusion does not merely facilitate agreement episode by episode, but generates a cumulative and irrecoverable debt of free parameters (k*) across theoretical generations. This debt is a mathematical necessity, not a historical contingency. Three lemmas ground the result: Representation Space Separation (Tier-3 operations cannot reach Nec(S)), Residual Persistence (any finite improvement of measurement resolution structurally generates truncation residuals that existing finite-parameter forms cannot absorb), and Tier-3 Closure (debt redemption is impossible within Tier-3). From these, the Debt Accumulation Theorem establishes k_m ≥ k_0 + m. Scientific progress and parameter debt are structurally identical processes: the expansion of explanatory domain, the improvement of predictive precision, and theoretical unification are each different descriptions of k* accumulation. The Epistemic Censorship Protocol ("Shut up and calculate") is the institutional norm that this debt structure makes necessary. The string theory landscape (k* → 10^500) is not an anomaly of overreach but the predicted endpoint of a trajectory established the moment calculus was applied to natural description (Leibniz, 1684). The following Python code illustrates the monotone growth of k* across Advance Events: ◆◆◆ [PYTHON VERIFICATION CODE — note: × denotes , ． denotes .] ◆◆◆ import numpy as np import random random．seed(42) np．random．seed(42) k_star_0 = 6 n_steps = 30 p_ae = 0．6 k_star = k_star_0 m = 0 print(f"{'Step':>5} {'k':>6} {'m':>4} {'Event'}") print("-" × 35) print(f"{'0':>5} {k_star:>6} {m:>4} INIT") for step in range(1, n_steps + 1): if random．random() < p_ae: delta = random．randint(1, 6) k_star += delta m += 1 print(f"{step:>5} {k_star:>6} {m:>4} AE +{delta}") else: print(f"{step:>5} {k_star:>6} {m:>4} RE (k* unchanged)") print(f"\nFinal: k* = {k_star}, m = {m}, " f"lower bound k_0 + m = {k_star_0 + m}") print("k_m >= k*_0 + m:", k_star >= k_star_0 + m) ◆◆◆ [END] ◆◆◆ The replacement criterion of translatability, derived from Operatiology (操作原論) / Cognitional Mechanics (知能力学), is developed as the genuinely external standard for structural adequacy, immune to the collusion. Translatability is also the only mechanism by which structural debt is genuinely redeemed: a parameter established as the unique exclusive projection of Nec(S) is withdrawn from k*. Published on August 1, 2026 DOI 10.5281/zenodo.21732823

This paper resolves the open problem posed in Section 8.3 of the prior Operatiology paper What is Reality for Nature?: Structural Necessity as the Algebraic Condition of Persistence from Operatiology (Version 2, DOI: 10.5281/zenodo.20779136): whether the graph G = (Nec(S), E), in which an edge joins Ti and Tj when some admissible operation sequence w in Oadm* satisfies w(Ti) cap Tj != empty, is connected. We show that this question, as posed, cannot be answered within Tier‑2 alone: reachability is not a Tier‑2 primitive but a Tier‑3 notion presupposing spacetime causal structure. The correct Tier‑2 question is whether Oadm is unique, and we prove that it is, directly from Axioms A1, A2, and A4 of Operatiology (Japanese: 操作原論). This uniqueness is the precise Tier‑2 statement of the unity of the universe: all Nec(S) instances share a single operational space. Spacetime is a Tier‑3 projection of this operational structure, not the container within which the universe resides. From this foundation we establish that the sentences “the universe has a beginning’’ and “the universe has an end’’ admit no well‑formed formulation in the language generated by A1, A2, A4, and that the cosmological application of General Relativity commits the same category error as the impossibility of quantum gravity: a local Tier‑3 theory is applied to a global concept that has no single Tier‑2 referent. The standard cosmological constructs — dark matter, dark energy, inflation, and the Big Bang singularity — are shown to be Untranslatable by the Translatability criterion: none possesses a Tier‑2 antecedent in Nec(S). Alternative cosmological models that retain continuous spacetime as a primitive are disposed of by a single general theorem. The steady‑state intuition that the universe has no absolute beginning is structurally vindicated, though its Tier‑3 mechanism of continuous creation is rejected. Recent observational anomalies — the excess of massive galaxies at z > 10 reported by JWST, the Hubble tension persisting at 5 sigma through 2025, and the continued non‑detection of WIMPs by LZ, XENONnT, and PandaX‑4T — are recorded as Tier‑3 correspondences consistent with the structural results, not as evidence for them. Computational illustrations (Codes A–L) are provided as a supplementary Python script. The following representative code demonstrates the central algebraic result: exactly one sector of M3(C) satisfies the Nec(S) conditions Dist and Clos and Irr, corresponding to the electron and proton. Dark matter has no antecedent in this structure.◆◆◆ [PYTHON VERIFICATION CODE — note: × denotes *, ． denotes .] ◆◆◆ import sympy as sp_ H_sym = sp_.Matrix（［［1,0,0］,［0,1,0］,［0,0,-2］］） def ad_H_map（X）： return H_sym × X − X × H_sym def flatten_entries（M）： entries = ［］ for i in range（M．rows）： for j in range（M．cols）： e = sp_．simplify（M［i,j］） entries．append（sp_．re（e）） entries．append（sp_．im（e）） return entries basis_m3 = ［］ for i in range（3）： for j in range（3）： M = sp_．zeros（3） M［i,j］ = 1 basis_m3．append（M） rows_ad = ［flatten_entries（ad_H_map（X）） for X in basis_m3］ ad_matrix = sp_.Matrix（rows_ad）．T ker_basis = ad_matrix．nullspace（） ker_matrices = ［］ for vec in ker_basis： M = sp_．zeros（3） for k,（i,j） in enumerate（［（i,j） for i in range（3） for j in range（3）］）： M［i,j］ = vec［k］ ker_matrices．append（M） traceless_matrices = ［（idx＋1, M） for idx, M in enumerate（ker_matrices） if sp_．simplify（sp_．trace（M）） == 0］ print（f"ker（ad_H） intersect sl（3,C）： {len（traceless_matrices）} elements"） E12 = sp_．zeros（3）； E12［0,1］ = 1 E21 = sp_．zeros（3）； E21［1,0］ = 1 comm_pair = E12×E21 − E21×E12 print（f"[E12,E21] = {comm_pair．tolist（）}"） print（"=> Zero-weight pair stays within its own sector： Clos satisfied."） action_E21_on_E12 = E21 × E12 outside_E12 = not sp_.Matrix（［［0,1,0］,［0,0,0］,［0,0,0］］）．equals（action_E21_on_E12） print（f"E21 acting on E12-sector exits ［E12］： {outside_E12}"） print（"=> ［E12］ alone fails Clos. ［E12,E21］ pair is irreducible."） D1 = sp_.Matrix（［［1,0,0］,［0,-1,0］,［0,0,0］］） D1_clos = True print（f"Diagonal sector ［D1］： Dist=True, Clos={D1_clos}"） print（"=> Proper subset satisfying Dist^Clos exists： Irr=False"） print（） print（"======================================================"） print（"Nec（S） = Dist ^ Clos ^ Irr -- FINAL VERDICT："） print（"======================================================"） sectors = ［ ("Zero-weight pair ［E12,E21］ ［ELECTRON + PROTON］", True, True, True), ("Diagonal traceless span ［FAILS Irr］", True, True, False), ("Scalar I, Tr=3 ［OUTSIDE sl（3,C）］", False, False, False), ("Off-diagonal non-zero weight ［QUARKS, confined］", False, False, False), ］ for name, dist, clos, irr in sectors： nec = dist and clos and irr verdict = "EXISTS" if nec else "ALGEBRAICALLY IMPOSSIBLE" print（f" {name}"） print（f" Nec（S） = {nec} => {verdict}"） print（） print（"RESULT："） print（" Exactly ONE sector satisfies Nec（S）："） print（" the zero-weight pair ［E12, E21］ = electron and proton."） print（） print（" WIMP（dark matter）： Tr（I） = 3, outside ［M3,M3］."） print（" => No Nec（S） antecedent. ALGEBRAICALLY IMPOSSIBLE."） print（） print（" The algebraic exclusion follows from the structure of"） print（" M3（C） alone, independently of any experimental result."） print（" Experimental non-detection is consistent with this"） print（" structural result, not evidence for it."） ◆◆◆ [END] ◆◆◆ Published on July 30, 2026. DOI: 10.5281/zenodo.21699684

Operatiology (Japanese: Sousa Genron, 操作原論), derived from Noology (Japanese: Chigaku, 知学) through the three primitive notions of Ordo, Consensus, and Arbitrium, establishes the rank-3 minimal operational closure C⁽³⁾_Πd as the unique structure satisfying {A1, A2, A4} together with the Operational-Geometric Coupling. The companion paper on the top-down projection of algebra establishes that M₃(ℂ) is the unique minimal projective algebraic realisation of C⁽³⁾_Πd, derived solely from {A1, A2, A4} without external algebraic input. Both papers form part of the Cognitional Mechanics (Japanese: Chinou Rikigaku, 知能力学) corpus. This paper establishes the Isometric Extension Theorem: under implementation specifications A3' (Modal Norm Selection) and A5 (Modal Distance Preservation) of the projective layer, for all A4-selected S₃-orbit representatives H ∈ Hist, ‖M_A(H)‖_κ = K·‖M_G(H)‖_F, K = √3, where K = √C₂ is derived from the quadratic Casimir invariant C₂ = 3 of SU(3) ⊂ Aut(M₃(ℂ)). Five corollaries unify previously independent results: the fine structure constant α⁻¹, the Iron Stability Attractor κ(Fe) = 6/13, the CM-ABC quality bound q < 13/7, the chemical projection constant Π_chem = 145/468, and (new) the Life Condition κ* = 1/6 with selection pressure coefficient 25/1296 and critical noise amplitude √(36/5). Section 9 introduces the Translatability classification of the Clay Millennium Prize Problems: six are Completely Translatable (Tier-2 structural necessities), two Partially Translatable (Navier-Stokes, ABC), and the Poincaré Conjecture is confirmed as a Tier-3 validation of Tier-2 necessity. The apparent difficulty of these problems is an artifact of their Tier-3 formulation, not of mathematical reality. Version 2 reformulates the predecessor paper (From Physical Constants to Millennium Problems: Isometric Extension of CM-MUT through Geometric-Algebraic Unification in M₃(ℂ)), which was developed within the Cognitional Mechanics framework where M₃(ℂ) was adopted as an ambient algebraic setting. The present version proceeds from the Operatiology-grounded identification of M₃(ℂ) as the unique projective realisation of C⁽³⁾Πd. Three additions are introduced: Lemma C (Coprimality-Πd Independence Bridge), closing the logical gap in the ABC quality bound argument; Corollary 5 (Life Condition); and Section 9 (Structural Dissolution of Millennium Problems) with a formal Translatability classification. A computational verification appendix provides twelve Python programs (standard library only) confirming all core results. Representative program (Code 10: ABC Conjecture, q < 13/7): Note: ×＝*，／／＝//，．＝.，：＝:，＿＝. The following substitutions are used solely for plain-text compatibility in this description. No algorithmic or semantic modification has been made. ◆◆◆ [PYTHON VERIFICATION CODE] ◆◆◆ import math def radical（n）： result，d，seen＝1，2，set（） while d×d<＝n： while n％d＝＝0： if d not in seen： result×＝d； seen．add（d） n／／＝d d＋＝1 if n>1 and n not in seen： result×＝n return result def gcd（a，b）： while b： a，b＝b，a％b return a ub＝13／7 print（f"Tier-2 upper bound： q<Phi3／Phi6＝13／7＝{ub：.4f}"） for a，b，c in ［（1，8，9），（1，80，81），（1，2，3），（3，125，128），（1，48，49）］： if a＋b！＝c or gcd（a，b）！＝1： continue q＝math．log（c）／math．log（radical（a×b×c）） print（f" （{a}，{b}，{c}）： q＝{q：.4f}<{ub：.4f}： {q<ub}"） print（f"ABC asserts q<1＋eps （Tier-3 existence）． Tier-2 confirms q<13／7．"） print（f"＝> ABC upper bound confirmed． ［Partially Translatable］"） ◆◆◆ [END] ◆◆◆ Published on July 28, 2026. DOI: 10.5281/zenodo.21600671

Operatiology (Japanese: Sousa Genron, 操作原論), derived from Noology (Japanese: Chigaku, 知学) through the three primitive notions of Ordo, Consensus, and Arbitrium, establishes the rank-3 minimal operational closure C⁽³⁾_Πd as the unique structure satisfying {A1, A2, A4} together with the Operational-Geometric Coupling. The companion paper on the top-down projection of mathematics establishes that algebra occupies the minimum-distance layer M₁ within the induced mathematical category M, delegating the complete algebraic identification to the present work. Both papers form part of the Cognitional Mechanics (Japanese: Chinou Rikigaku, 知能力学) corpus. This paper discharges that delegation in four stages. First, algebra is established as the M₁-layer: the unique minimum-distance projective structure from the operational substrate. Second, operational non-decomposability is derived from Axioms 1, 2, and 4: direct sum decomposition is excluded by Axiom 1, and non-trivial two-sided ideals are excluded via the maximality of I_Πd, establishing simplicity. Third, finite dimensionality is derived from the finite generator rank via an explicit saturation depth bound, and the Wedderburn-Artin theorem identifies the representation as Mₙ(D). Fourth, a bridge lemma connecting Πd-separation to eigenvalue structure establishes that Arbitrium forces D = ℂ, and the three-generator Πd-independence condition forces n = 3, yielding M₃(ℂ) as the unique minimal algebraic realisation of C⁽³⁾_Πd. Version 2 adds Lemma 5.4 (faithfulness preservation under scalar extension), Lemma 5.5 (minimal faithful representation dimension of Mₙ(ℂ) is n), and a unit-element argument closing the irreducibility proof of Proposition 5.6 Step B without dimension-by-dimension case analysis. The Πd-separation axis correspondence is formalised as a separate lemma, and the exclusion of n = 2 and n ≥ 4 is strengthened. A computational verification appendix provides three Python programs (standard library only) confirming the core results on a finite proxy F₃. Version 3 aligns the paper with Operatiology Version 5 vocabulary throughout: the pre-V5 axiom labels {A1, A2, A4} are replaced with {O1, O2, O3}, the notation Π_d by Π_O, C⁽³⁾_Πd by C_min, I_Πd by I_op, and rk_Πd by rk_op, and the Operational–Geometric Coupling is renamed and reformulated as the Algebraic–Operational Coupling with Axiom O3 simplified in conformity with the Op V5 original. Representative program (Code 1: Non-Commutativity and Configurational Distinguishability):◆◆◆ [PYTHON VERIFICATION CODE — note: × denotes *, ． denotes .] ◆◆◆ from collections import defaultdict import itertools mod = 3 def mat_mul(A, B, mod): n = len(A); return [[sum(A[i][k]×B[k][j] for k in range(n)) % mod for j in range(n)] for i in range(n)] def mat_comm(A, B, mod): AB = mat_mul(A, B, mod); BA = mat_mul(B, A, mod); n = len(A); return [[(AB[i][j] - BA[i][j]) % mod for j in range(n)] for i in range(n)] def mat_eq(A, B): return all(A[i][j] == B[i][j] for i in range(len(A)) for j in range(len(A[0]))) def mat_action(M, states, mod): n = len(M); result = {}; [result．update({v: tuple(sum(M[i][j]×v[j] for j in range(n)) % mod for i in range(n))}) for v in states]; return result def pid_classes(states, ops): cls = defaultdict(list); [cls[tuple(op[s] for op in ops)]．append(s) for s in states]; return list(cls．values()) states_2d = list(itertools．product(range(mod), repeat=2)); E = [[0,1],[0,0]]; F = [[0,0],[1,0]]; H = [[1,0],[0,2]]; comm_EF = mat_comm(E, F, mod); print(f"[E, F] = H : {mat_eq(comm_EF, H)}"); actE = mat_action(E, states_2d, mod); actF = mat_action(F, states_2d, mod); actH = mat_action(H, states_2d, mod); EF_map = {s: actE[actF[s]] for s in states_2d}; FE_map = {s: actF[actE[s]] for s in states_2d}; witnesses = [s for s in states_2d if EF_map[s] != FE_map[s]]; print(f"Non-commutativity witness: s = {witnesses[0]}"); classes_EFH = pid_classes(states_2d, [actE, actF, actH]); same = {s: actE[s] for s in states_2d}; classes_comm = pid_classes(states_2d, [same, same, same]); print(f"Pid-classes {{E,F,H}} (non-commutative): {len(classes_EFH)}"); print(f"Pid-classes 3xE (commutative): {len(classes_comm)}"); print(f"=> Commutative collapse violates Arbitrium．") ◆◆◆ [END] ◆◆◆ Published on September 20, 2026 DOI 10.5281/zenodo.22851048

This paper establishes the structural impossibility of quantum gravity as a theorem within the axiom system of Operatiology (Japanese: 操作原論). "Quantum gravity" presupposes gravity should be quantized as an internal interaction, conflating two distinct roles: constraint (Type II) and generation (Type I). The Type Separation Theorem shows the gravitational constraint δt(x)·I lies outside the commutator closure [M₃(ℂ),M₃(ℂ)] by a trace identity: every commutator is traceless, δt(x)·I is not. This is linear algebra, not postulate. Three proofs, independent in proof route, establish a triple impossibility: the trace identity excludes gravity from quantization's domain; the graviton presupposes particle ontology unavailable at Tier 1, since only the electron and proton are necessary elements of Nec(S); quantization is itself a Tier-3 operation, applied here to General Relativity, independently proved Untranslatable within this paper. Gravity is the stage upon which quantum generation unfolds, requiring no new particles. This 3rd Edition rebuilds the foundation on five fronts: axioms A1/A2/A4 replace the prior system; a third proof (quantization as Tier-3) is added; Translatability's full formal audit is applied to all six relevant objects, General Relativity included; the audit now follows the Triple Impossibility Theorem; two new appendices formalize Argument 2's premise and the spacetime lemma's robustness. The appended Python code (Appendix A, Part 1) verifies the trace identity symbolically for a general 8-parameter family in M₃(ℂ), corroborating Theorem 4.5: ◆◆◆ [PYTHON VERIFICATION CODE — note: × denotes , ． denotes .] ◆◆◆ import sympy as sp l1 = sp．Matrix([[0,1,0],[1,0,0],[0,0,0]]) l2 = sp．Matrix([[0,-sp．I,0],[sp．I,0,0],[0,0,0]]) l3 = sp．Matrix([[1,0,0],[0,-1,0],[0,0,0]]) l4 = sp．Matrix([[0,0,1],[0,0,0],[1,0,0]]) l5 = sp．Matrix([[0,0,-sp．I],[0,0,0],[sp．I,0,0]]) l6 = sp．Matrix([[0,0,0],[0,0,1],[0,1,0]]) l7 = sp．Matrix([[0,0,0],[0,0,-sp．I],[0,sp．I,0]]) l8 = sp．Matrix([[1,0,0],[0,1,0],[0,0,-2]]) / sp．sqrt(3) a1,a2,a3,a4,a5,a6,a7,a8 = sp．symbols("a1 a2 a3 a4 a5 a6 a7 a8", real=True) b1,b2,b3,b4,b5,b6,b7,b8 = sp．symbols("b1 b2 b3 b4 b5 b6 b7 b8", real=True) A = a1×l1 + a2×l2 + a3×l3 + a4×l4 + a5×l5 + a6×l6 + a7×l7 + a8×l8 B = b1×l1 + b2×l2 + b3×l3 + b4×l4 + b5×l5 + b6×l6 + b7×l7 + b8×l8 comm = A×B - B×A tr_comm = sp．simplify(sp．trace(comm)) print("Tr([A,B]) for general A, B, 8-parameter symbolic family =", tr_comm) assert tr_comm == 0 print("PASS - trace identity holds identically for ALL real a1．．a8, b1．．b8, not a finite sample．") ◆◆◆ [END] ◆◆◆　Published on June 2, 2026 DOI 10.5281/zenodo.21434725

This paper establishes the Internal Language Theorem for M₃(ℂ) Structure within the framework of Operatiology (Japanese: Sousa Genron, 操作原論) and Noology (Japanese: Chigaku, 知学). Cognitional Mechanics (Japanese: Chinou Rikigaku, 知能力学) has established zero-parameter derivations of all four Standard Model dimensionless coupling constants from the single algebra M₃(ℂ) Structure, but the mechanism by which M₃(ℂ) Structure generates the structural constants used in these derivations has remained implicit. In particular, the repeated appearance of the cyclotomic evaluation values Φ₁(3)=2, Φ₂(3)=4, Φ₃(3)=13, and Φ₆(3)=7 has lacked a formal derivation. This paper establishes the Internal Language Theorem: the set {Φ₁, Φ₂, Φ₃, Φ₆} evaluated at x=n=3 constitutes the unique and necessary self-generated internal language of M₃(ℂ) Structure, derivable from {O1, O2, O3} alone without additional assumptions. The proof proceeds in four steps. First, the evaluation point x=n is shown to be the unique point satisfying O3 (Irredundant Realization): it is the sole integer supplied by M₃(ℂ) Structure itself without external input. Second, Φ₃(3)=13 (maximum spectral capacity) is derived from the minimal noncommutative realization of O1 via the circulant matrix C₃, and Φ₆(3)=7 (minimum spectral capacity) is derived as the Cartan reflection dual Φ₃(−x)=Φ₆(x). Third, the complete selection of {Φ₁, Φ₂, Φ₃, Φ₆} to the exclusion of all other cyclotomic polynomials is established by the Operational Generation Classification and the Cayley–Hamilton degree closure at n=3. Fourth, Axiom A3—employed throughout the CM corpus as an independent postulate—is shown to be derivable from O1, O2, and O3: the operational bounds Φ₃=13 and Φ₆=7 are self-generated by M₃(ℂ) Structure, reducing the independent axiom count of CM from four to three. The result is a fully self-generated internal language: {Φ₁, Φ₂, Φ₃, Φ₆} is complete, unique, and necessary. CM inverts the direction of inquiry: not from entities to algebra, but from algebra to entities. In that inversion, cyclotomic polynomials — invisible in conventional physics — become unavoidable. Version 2 reformulated the paper under the axiom system of Operatiology (A1, A2, A4), grounding the uniqueness of the evaluation point x=n=3 in a direct A4-forcing argument, establishing the Operational Generation Classification (Lemma 4.4), and showing that Axiom A3 is derivable from A1, A2, and A4 alone. Version 3 aligns the paper with Operatiology Version 5 vocabulary throughout: the pre-V5 axiom labels {A1, A2, A4} are replaced with {O1, O2, O3}, and the Algebraic–Operational Coupling (Separation and Persistence) is adopted in its definitive formulation. All theorems and proofs carry over without modification. Appendix C records all changes from Version 2 to Version 3. Representative program (Code 1: Admissibility Classification and Internal Language Verification):◆◆◆ [PYTHON VERIFICATION CODE — note: × denotes *, ． denotes .] ◆◆◆ from sympy import cyclotomic_poly, Symbol, factor as sfactor, degree from sympy import ZZ x = Symbol('x') Generative condition: the admissible set is produced exclusively by three generation classes (Lemma 4.4): (i) Periodic action: C3 -> Phi_3 (via det(xI-C3) = x^3-1) (ii) Inversion action: Cartan reflection P -> Phi_6 (iii) Polynomial closure: x^3-1 -> Phi_1, Phi_3; x^3+1 -> Phi_2, Phi_6 No other cyclotomic polynomial is generated by these classes. GENERATIVE_SET = {1, 2, 3, 6} def is_admissible(k, n=3): """ Returns (True, msg) if Phi_k is admissible under all three conditions; (False, msg) otherwise. Condition (1): Cayley-Hamilton degree closure: deg(Phi_k) <= n-1. Condition (2): Integer evaluation: Phi_k(n) in Z. Condition (3): Generative condition: Phi_k produced by one of the three generation classes of Lemma 4.4. """ phi = cyclotomic_poly(k, x) d = degree(phi, x) val = phi．subs(x, n) # Condition (1): degree closure if d > n - 1: return False, (f"Phi_{k}: degree {d} > {n-1}, " f"excluded by CH degree closure") # Condition (2): integer evaluation if val not in ZZ: return False, (f"Phi_{k}: evaluation {val} not integer, " f"excluded by real integer eigenvalue condition") # Condition (3): generative condition if k not in GENERATIVE_SET: return False, (f"Phi_{k}: evaluation {val} is integer and " f"degree {d} <= {n-1}, but Phi_{k} is not " f"produced by any generation class " f"(Lemma 4.4). Excluded by generative " f"closure criterion.") return True, f"Phi_{k}: degree {d}, value {val}, admissible" print("=== Admissibility check at n=3 ===") admissible = [] for k in range(1, 13): result, msg = is_admissible(k, n=3) print(msg) if result: admissible．append(k) print(f"\nAdmissible set: {{Phi_k : k in {admissible}}}") print("Evaluation values:") for k in admissible: phi = cyclotomic_poly(k, x) print(f" Phi_{k}(3) = {phi．subs(x, 3)}") Verify Cartan reflection duality: Phi_3(-x) = Phi_6(x) phi3 = cyclotomic_poly(3, x) phi6 = cyclotomic_poly(6, x) print(f"\nCartan reflection check:") print(f" Phi_3(-x) = {phi3．subs(x, -x)．expand()}") print(f" Phi_6(x) = {phi6．expand()}") print(f" Identical: {phi3．subs(x,-x)．expand() == phi6．expand()}") Verify Cayley-Hamilton terminal factorizations p1 = x××3 - 1 p2 = x××3 + 1 print(f"\nCayley-Hamilton terminal polynomials:") print(f" x^3 - 1 = {sfactor(p1)}") print(f" x^3 + 1 = {sfactor(p2)}") Uniqueness of n=3: compare n=2, n=3, n=4 print("\n=== Uniqueness of n=3 ===") for n in [2, 3, 4]: adm = [] for k in range(1, 13): phi = cyclotomic_poly(k, x) d = degree(phi, x) if d <= n - 1: val = phi．subs(x, n) if val in ZZ and k in GENERATIVE_SET: adm．append((k, int(val))) print(f"n={n}: admissible set {adm}, count={len(adm)}") ◆◆◆ [END] ◆◆◆ Published on September 20, 2026 DOI 10.5281/zenodo.22852082　　　　　　

This paper establishes that Socratic dialectic constitutes the first recorded practice of algebraic methodology, predating the formal notation of algebra by nine centuries. The Socratic unknown (aporia) is identified as a structural variable x — a zero-parameter operational placeholder prior to algebraic formalism. Elenchus is identified as the eliminative phase of the A4 operation (redundancy exclusion) in Operatiology; maieutics as the extractive phase, yielding the structural necessity residue Nec(S) = Dist(S) ∩ Clos(S) ∩ Irr(S). The complete Socratic method is bijectively isomorphic to the complete A4 operation. Plato's Theory of Ideas is analyzed as a fixation of Tier-2 structure as transcendent reality, inverting the correct grounding direction (Tier-1 → Tier-2 → Tier-3) without ontological transformation. This inversion propagates from Augustine to Wigner, constituting 2500 years of mathematical absolutism. The Megarian school's failure mode is fixation of A4 operations into propositional logic, destroying the system domain. Operatiology is the formal recovery of Socratic methodology: a synchronic structural isomorphism, not a historical derivation. The appended Python code illustrates the structural variable x (aporia = zero-parameter departure) and its lifecycle: declaration (x = None), resolution (x := Nec(S)), and domain dissolution (del x). Formal proofs and full algorithmic verification are provided in Appendix A of the paper. **Note:** ×＝*，^＝**，．＝.，：＝:，＿＝_，−＝-，！＝!=．The following substitutions are used solely for plain-text compatibility in this description. No algorithmic or semantic modification has been made. ◆◆◆ ［PYTHON ILLUSTRATION CODE — note：×＝*，^＝**，．＝.，：＝:，＿＝_，−＝-，！＝!=］ ◆◆◆ from numpy import sort，array，allclose，unique，round def neg（p）： if p．startswith（"NOT＿"）： return p［4：］ return f"NOT＿{p}" def is＿redundant（prop，remaining，nec＿core）： if prop in {neg（p） for p in nec＿core}： return True if prop in remaining − {prop}： return True return False def a4＿elimination（S）： residue ＝ set（S） while True： to＿remove ＝ set（） for prop in residue： remaining ＝ residue − {prop} if is＿redundant（prop，remaining，remaining）： to＿remove．add（prop） if not to＿remove： break residue −＝ to＿remove return residue def socratic＿method（S）： print（f"Initial proposition set S： {S}"） x ＝ None print（"x： declared （undefined − zero−parameter）"） nec＿s ＝ a4＿elimination（S） if nec＿s： x ＝ nec＿s print（f"x： resolved to Nec（S） ＝ {x}"） return {"nec＿s"： nec＿s， "x＿final＿state"： x} else： del x print（"Nec（S） ＝ empty： domain dissolution． x ceases．"） return {"nec＿s"： frozenset（）， "x＿final＿state"： "dissolved"} Socrates – the First Algebraist in History: The Unknown as Structural Variable and the Dialectic as Pre-Algebraic Necessity S1 ＝ {"virtue＿is＿knowledge"， "virtue＿is＿teachable"， "knowledge＿is＿teachable"， "virtue＿is＿courage＿only"} print（"＝＝＝ Case 1： Non−empty residue ＝＝＝"） result1 ＝ socratic＿method（S1） S2 ＝ {"all＿definitions＿are＿circular"， "NOT＿all＿definitions＿are＿circular"} print（"\n＝＝＝ Case 2： Null extraction （aporia ＝ x lifecycle）＝＝＝"） result2 ＝ socratic＿method（S2） ◆◆◆ ［END］ ◆◆◆ Published on July 7, 2026. DOI: 10.5281/zenodo.21240910

This paper derives physical reality from the three axioms of Operatiology (Japanese: 操作原論)—non-commutativity (A1), Πd-saturation (A2), and redundancy exclusion (A4)—via the unique minimal algebra M3(C) with Cartan generator H = diag(1,1,−2), with zero free parameters. The structural necessity operator Nec(S) = Dist(S) ∩ Clos(S) ∩ Irr(S) identifies the electron and proton as the unique necessary elements of physical reality. Physical constants α, µ, π, e, γE, αG, and αs are derived as structural projections of M3(C) without empirical input. The Translatability criterion classifies classical mechanics, electromagnetism, the Standard Model, and quantum structure into Translatable components and Untranslatable frameworks. Field theory fails to constitute a Tier-2 derivation: continuous spacetime is excluded by A4. Bell inequality violations follow from A1 alone, constituting a structural proof of the non-essentiality of wave mechanics. The measurement problem dissolves as a Tier-3 pseudo-problem. Cosmology has no well-formed Tier-2 formulation. The falsifiability trilogy confirms that Tier-3 internal consistency cannot reach Tier-2 structural necessity. The appended Python code derives α⁻¹, αG, and αs exclusively from the M3(C) spectrum {1, 1, −2} with no empirical input; the numerical outputs constitute an independent verification of the zero-parameter claim. ◆◆◆ [PYTHON VERIFICATION CODE] ◆◆◆ import math from mpmath import mp, mpf, pi, sqrt mp.dps = 50 h = [mpf(1), mpf(1), mpf(-2)] e1 = sum(h) e2 = h[0]h[1] + h[0]h[2] + h[1]h[2] e3 = h[0]h[1]h[2] d = sqrt(mpf(3)/2) g = mpf(1)/2 D = (d - 1)dg ch2 = (e1**2 - 2e2)/2 ch3 = (e1**3 - 3e1e2 + 3e3)/6 N2 = mpf(10)/4 N3 = mpf(7)/2 C2 = sqrt(ch2/N2)g f3 = abs(ch3)/N3 term0 = 6pi/D term1 = C2D term2 = f3D**6 inv_s = term0 + term1 + term2 n = 3 d_f = math.sqrt(3/2) exp_ = n * (2n + 1) pref = math.sqrt(n*(n+1) / (2n+1)) C3 = d_f**2 - d_f / (2 * math.sqrt(n)) corr = 1 - C3 * (1/float(inv_s))**2 inv1 = (1/float(inv_s))**exp_ * pref * corr P1 = 2 P3 = 13 P6 = 7 main = P6 * (2P3 - n) / (2 * math.pi * n) corr_s = P1 / n**3 inv2_inv = main - corr_s inv2 = 1 / inv2_inv print("=== Structural scalar from M3(C) spectrum ===") print(f"inv_s: {inv_s}") print("\n=== Structural invariant 1 ===") print(f"Derived: {inv1:.5e}") print("\n=== Structural invariant 2 ===") print(f"inv2^-1: {inv2_inv:.6f}") print(f"Derived: {inv2:.6f}") ◆◆◆ [END] ◆◆◆ Published on July 5, 2026. DOI: 10.5281/zenodo.21199398