Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Translatability: A New Criterion for Deciphering Reality, or The Standard of Structural Adequacy for Natural Laws and Mathematical Structures

T.O.

Published Jun 28, 2026• 5 citations
Publisher

Abstract

This paper introduces translatability as a criterion of structural adequacy for natural laws and mathematical structures. The Operatiology framework establishes a three-tier architecture: Tier-1 (Noology) is the regulative layer; Tier-2 is the operational structure established by axioms A1 (Non-Commutativity), A2 (Πd-Saturation), and A4 (Redundancy Exclusion), realised uniquely as M₃(ℂ) with Cartan generator H = diag(1,1,−2); Tier-3 is the layer of mathematical and physical representations. A Tier-3 object is translatable if and only if there exists a unique, exclusive operational projection from Nec(S) = Dist(S) ∩ Clos(S) ∩ Irr(S) to the object, preserving spectrum, commutation relations, operational closure, and irreducibility in absolute priority order. Eleven objects are established as Translatable: electron, proton (CM fundamental), α, μ, π, e, γE, quantum entanglement, Bell inequality violations, no-cloning, and Operational Redundancy Exclusion. All remaining objects examined are Untranslatable, organised across five groups for physical theories and four for mathematical structures. The Standard Model is dissected as a mixture: Translatable components encased within an Untranslatable framework of gauge groups, Higgs sector, and quark sector. The relation between translatability and falsifiability is one of Aufhebung: preservation within Tier-3, negation as a warrant for structural claims, and elevation to the criterion that formally reaches Tier-2. Two appendices accompany the paper. Appendix A verifies the algebraic structures of the deductive chain, including an exhaustive search confirming that H = diag(1,1,−2) uniquely minimises Tr(H²) = 6 among traceless integer triples. Appendix B implements the verdict procedure as an executable Translatability Auditor. Beyond binary verdicts, the Auditor identifies where the structural gap lies: which free parameter lacks derivation from {A1, A2, A4}, or which Tier-3 primitive constitutes the obstruction. It functions as a structural compass within Tier-3 research. python import numpy as np H_SPECTRUM = np.sort(np.array([-2.0, 1.0, 1.0])) H_DEGENERACY = {1.0: 2, -2.0: 1} def check_condition_1(spectrum): if not spectrum: return False, "No spectral structure; condition (1) fails." s = np.sort(np.array(spectrum, dtype=float)) if len(s) != len(H_SPECTRUM): return False, f"Dimension mismatch: {len(s)} vs {len(H_SPECTRUM)}." if not np.allclose(s, H_SPECTRUM, atol=1e-8, rtol=1e-6): return False, f"Spectrum {list(np.round(s,4))} != H-spectrum." unique, counts = np.unique(np.round(s, 8), return_counts=True) ev_dict = dict(zip(unique, counts)) for ev, mult in H_DEGENERACY.items(): if ev_dict.get(ev, 0) != mult: return False, f"Degeneracy mismatch for eigenvalue {ev}." return True, "Condition (1) satisfied." def audit_conditions(spectrum, commutator_closed, closure_stable, irreducible, label, verbose=False): ok1, msg1 = check_condition_1(spectrum) if not ok1: return "Untranslatable", "Refutation(S)" if not commutator_closed: return "Untranslatable", "Refutation(C)" if not closure_stable: return "Untranslatable", "Refutation(Cl)" if not irreducible: return "Untranslatable", "Refutation(I)" return "Translatable", "Route(i) or (ii)" # Examples from Part II (Appendix A, Listing 4) for label, args in [ ("Electron", ([-2,1,1], True, True, True)), ("Chern number", ([1], True, True, True)), ("QC Layer 2", ([-0.5,0.5], True, True, True)), ("Abelian phase", ([-2,1,1], False, True, True)), ]: v, r = audit_conditions(*args, label=label) print(f"{label}: {v} via {r}")

DOI
10.5281/zenodo.20981981

Related papers

Operatiology as a Structural Projection for Physical Grand Reconstruction: Physics in the Zero-Parameter Paradigm

T.O.

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. import mathfrom mpmath import mp, mpf, pi, sqrt mp.dps = 50 # === M3(C) spectrum {1, 1, -2} ===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)/2D = (d - 1)*d*gch2 = (e1**2 - 2*e2)/2ch3 = (e1**3 - 3*e1*e2 + 3*e3)/6N2 = mpf(10)/4N3 = mpf(7)/2C2 = sqrt(ch2/N2)*gf3 = abs(ch3)/N3term0 = 6*pi/Dterm1 = C2*Dterm2 = f3*D**6inv_s = term0 + term1 + term2 # === Structural invariant 1: exponent n=3 ===n = 3d_f = math.sqrt(3/2)exp_ = n * (2*n + 1)pref = math.sqrt(n*(n+1) / (2*n+1))C3 = d_f**2 - d_f / (2 * math.sqrt(n))corr = 1 - C3 * (1/float(inv_s))**2inv1 = (1/float(inv_s))**exp_ * pref * corr # === Structural invariant 2: cyclotomic {P1, P3, P6} ===P1 = 2P3 = 13P6 = 7main = P6 * (2*P3 - n) / (2 * math.pi * n)corr_s = P1 / n**3inv2_inv = main - corr_sinv2 = 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}")

•Jul 5, 2026•3 citations

A Theoretical Deconstruction of the Uncertainty Principle: A Structural Analysis of Its Algebraic Origin, Its Hidden Premises, and the Ozawa–BLW Dispute

T.O.

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. import numpy as np from numpy.linalg import eigh hbar = 1.0 # Representation A: Ladder / number-state truncation N = 120 ns = np.arange(N) a = np.diag(np.sqrt(ns[1:]), k=1) adag = a.T Q_A = np.sqrt(hbar / 2.0) * (a + adag) P_A = 1j * np.sqrt(hbar / 2.0) * (adag - a) H_A = 0.5 * (P_A @ P_A + Q_A @ Q_A) evals_A, _ = eigh(np.real(H_A)) comm_A = Q_A @ P_A - P_A @ Q_A - 1j * hbar * np.eye(N) interior_residual_A = np.max(np.abs(comm_A[:-1, :-1])) # Representation B: Position-grid second-derivative (Dirichlet b.c.) M = 2000 L = 15.0 x = np.linspace(-L, L, M + 2)[1:-1] dx = x[1] - x[0] diag0 = (5.0 / 2.0) * np.ones(M) / dx**2 diag1 = (-4.0 / 3.0) * np.ones(M - 1) / dx**2 diag2 = (1.0 / 12.0) * np.ones(M - 2) / dx**2 T_B = (hbar**2 / 2.0) * ( np.diag(diag0) + np.diag(diag1, 1) + np.diag(diag1, -1) + np.diag(diag2, 2) + np.diag(diag2, -2)) V_B = np.diag(0.5 * x**2) H_B = T_B + V_B evals_B, _ = eigh(H_B) # Comparison n_show = 12 expected_evals = hbar * (np.arange(n_show) + 0.5) spectral_gap = np.max(np.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

•Jan 1, 2026•0 citations

Cognitional Mechanics and Quantum Mechanics: Structural Divergence Through Tier Architecture (Third Edition)

T.O.

Cognitional Mechanics (CM) establishes an axiomatic framework that formalizes the structural mechanisms of intelligence as a self-contained operational system. Unlike approaches grounded in physical dynamics or engineering implementations, CM abstracts intelligence through non-commutative operations, convergence of semantic states, and structurally inaccessible domains, without invoking physical observables or psychological primitives. The first edition (DOI: https://doi.org/10.5281/zenodo.17994360) established the structural correspondence between CM and QM; the second edition (DOI: https://doi.org/10.5281/zenodo.18062274) strengthened the distinction while preserving the correspondence. This third edition extends the analysis through two additions: the explicit Tier architecture locating QM within Tier-3 as a projection of Tier-2 CM structure, and a structural account of the non-commutativity--discreteness coupling in QM. While CM exhibits a clear structural correspondence with Quantum Mechanics (QM)---most notably in its reliance on non-commutative operator structures and bounded transitions---it departs fundamentally in its treatment of difference and discreteness. Within the standard Hilbert-space formalism, non-commutativity and spectral discreteness are mathematically independent properties, as established in non-commutative geometry: position and momentum operators, for instance, are non-commuting yet possess continuous spectra. In QM, however, the physical framework couples non-commutativity to fixed empirical constants and measurement postulates, producing discreteness as a structural feature of the theory. CM identifies this coupling as a Tier-3 projection condition rather than a Tier-1 structural necessity, and demonstrates at Tier-2 that non-commutativity is sustainable without discretization. Within this framework, intelligence is mathematically tractable and substrate-independent, analyzable without external observation or measurement. The operational limit constant c does not function as a physical quantum but as a logical boundary condition governing convergence and phase transition. This distinguishes c from Planck's constant ℏ: the former regulates internal operability and accessibility, while the latter fixes physical quantization through empirical calibration. The three-tier architecture formally positions CM as follows. Tier-1 (Noology) constitutes the regulative source, specifying the conditions under which a structure qualifies as real. Tier-2 (CM) constitutes the executive operational domain, in which M₃(ℂ) is the unique minimal non-commutative substrate. Tier-3 (MUT/GUT) constitutes the projective display layer, in which physical theories including QM appear as projections of Tier-2 dynamics. CM and QM share a common Tier-1 origin without being in direct correspondence; their shared non-commutativity descends from Tier-1, while QM's discreteness is introduced at Tier-3 by projection conditions absent from Tier-2. By defining a metric space of semantic states with distance functions satisfying non-negativity, symmetry, and the triangle inequality, CM ensures formal rigor and internal closure. The variability of semantic differences allows CM to reconcile non-commutative structure with classical continuity, thereby avoiding probabilistic collapse or observer-dependence. Inaccessibility and convergence are determined entirely by internal operational constraints. CM thus clarifies that its resemblance to QM is structural rather than physical, and locates that resemblance within a broader Tier architecture from which the projection origin of QM's characteristic features is examinable. The framework generalizes non-commutative formalisms into a domain where intelligence is modeled as a geometric-operational process, not a quantum phenomenon, while maintaining a strict distinction from physical quantum theory.

•Jan 1, 2025•0 citations

The Relational Closure Framework: Toward an Axiomatization of Physics

Mingdong He

A finitist, relational axiomatization of physics: quantum theory and a relativity sector derived from four axioms about group-valued relations and closure. Contributions to the foundations of quantum mechanics (Born rule derivation, quantum reconstruction, local tomography, complex field selection), the emergence of time and causal structure in discrete networks, discrete Noether theorems, lattice gauge structure, and the Schrödinger equation derived by two independent routes. Every claim is graded in a Claim Ledger; every numerical claim is machine-verified with archived scripts; negative results are reported at full strength. What this paper does The universe is taken to be constituted by relations rather than objects. Stable relations form closures (self-consistent cycles) whose holonomies carry the physical content. Four axioms — primacy of relations (group-valued, edge-borne), closure stability, chirality from order, and observation as bidirectional group exchange — yield, at explicitly graded and conditional levels: Quantum sector Exchange-completeness theorems for finite label groups: abelian at all cycle ranks; non-abelian on the single cycle (Wilson readouts plus class-sum convolutions generate the full matrix algebra); the multi-cycle non-abelian case on the operational-equivalence quotient, with the obstruction completely characterized via class-preserving outer automorphisms — and the quotient's necessity now stratified by the source of word blindness (see New in Version 24.0). The Born rule, proved for finite abelian networks from a strictly weaker relational readout premise (statistics of realizable effects depend only on relational content); non-contextuality has this single source; additivity is basis-relative and declared as such. The Schrödinger equation by two routes of unequal premise grade, maintained side by side: a spectral route — the action operator is a weighted Cayley-graph Laplacian in the Pontryagin dual basis, the derived Gibbs state's unique canonical (modular) flow yields the Schrödinger equation with Hamiltonian equal to the action operator, no continuum limit, zero conjectures consumed, the single non-theorem step one flagged identification; and a Madelung route — physical and mechanism-rich (probability density derived from constraint gaps), valid exactly on the domain of the pseudo-continuity conjecture, with its full premise bill stated (continuity equation, Wallstrom circulation condition, m, V). A dedicated comparison subsection gives the line-by-line premise accounting and the machine-measured agreement region. Complex field selection: ℂ selected over ℝ and ℍ within the GPT comparison class in the covered sectors, with a second independent route from chirality (Frobenius–Schur dichotomy, quaternionic double exclusion); "uniquely selected" expressly not claimed. Positivity as pairing: all five in-text positive-semidefiniteness theorems traced to one mechanism (M = B†B with native factor); the Kraus form and complete positivity derived rather than assumed. The Noether sector on Noether's two theorems exactly: Noether I recovered on the holonomy action (compact Lie realization); Noether II identified as present (Bianchi as horn-filling, Schläfli as its Regge form); selection rules recovered for finite groups; the GNS bridge proved non-vacuously on the full exchange algebra; the sole potential extension — conservation as the kernel of exchange — isolated as a registered conjecture, consumed nowhere. A local–global representation theorem: six generative quantities (closure invariant, flux quantization, Weyl phase, non-abelian Stokes, orientation visibility, terminal normalization) are evaluations of cohomology classes against closed chains — one syntax, six exact machine probes. The gatekeeper no-go theorems registered and discharged: Kochen–Specker (the framework posits no global valuation — outcomes are resolutions of constraint gaps, and basis-relative additivity blocks state-independent variants), Pusey–Barrett–Rudolph (the statistical envelope is over resolutions yet to happen, not values already held; machine witness: identical configuration ensembles with opposite relative phase have opposite statistics), Wallstrom (registered as an explicit input, structurally discharged in the finite-abelian sector), Hegerfeldt (the Lieb–Robinson exponential tail identified as the only claimable front form for the continuum limit), Frauchiger–Renner (cross-agent certainty transfer presupposes kernel-free record transport, exactly what exchange-incompleteness excludes), and no-cloning (inherited in the covered sectors); Conway–Kochen and Colbeck–Renner noted as concordant. Relativity sector Time from finite capacity plus genuine randomness: the staging theorem (Θ(d) dependency depth, unbounded chains via the Moore bound; the quantitative failure law conditionalized on measure-level independence with exact minimal witnesses); the temporal quantum defined combinatorially, no Hamiltonian input. The speed of light grounded in an exact discrete dependency cone (combinatorial, no quantum input), the Lieb–Robinson bound consumed at cross-check grade only; a boost no-go theorem reducing Lorentz invariance to named statistical conditions, with the Collins fine-tuning objection recorded as a gate. The trace-descent theorem group: the growth-history measure forced onto the Mazurkiewicz trace quotient; chain reflection positivity at every depth with completely explicit spectrum. An equation sector of nine verification families (Schrödinger, Dirac, Maxwell/U(1), canonical commutator, Yang–Mills SU(2), Regge calculus, Klein–Gordon, Noether loop, Cartan curvature), where every machine-precision claim is the shadow of a proved backbone lemma — including the factor ½ of H = ½L + V, identified as the Wilson Fourier coefficient fixed by the action theorem. Four experimentally testable predictions, including a discriminating flat-versus-sigmoid visibility protocol. The Standard Model gauge group, ħ, and G remain open, with attack routes registered. How to read Three entry paths are marked in the document. Path A (derivational core): axioms → group structure → Noether sector → least action → Born rule → positivity. Path B (physical mechanisms): constraint propagation → time as determination → wave function as gap envelope → fields. Path C (scope and limits): the Claim Ledger, then Discussion and Open Problems — for the reader who wants to know what is claimed and what is not before reading anything else. The Claim Ledger is the single authoritative register of claim status; wherever body text sounds stronger, the Ledger governs. New in Version 24.0 (Version 23.0 is the immediately preceding public release; this version supersedes the internal V12–V15 and V17–V19 series, whose numbers are not used externally.) Version 24.0 resolves the structure of the multi-cycle non-abelian obstruction — the sector's longest-standing open front — following an external research exchange with three rounds of independent re-verification (fourteen core figures, three commutant instruments implemented independently, exact integer arithmetic on the obstruction side) and two rounds of counter-review that corrected one quantifier on each side: A dichotomy of the multi-cycle obstruction (new remark). Word blindness on multi-cycle networks has two identified sources, jointly covering every tested case, with opposite behaviour as cycle rank grows. Type I (global; graded): a class-preserving outer automorphism yields a commutant element by an argument free of cycle-rank reference; its non-triviality holds at theorem grade for b₁ ≥ d(G) via generating tuples, is monotone in b₁, and the threshold is measured at b_σ = 2 on the tested Wall group (at b₁ = 1 the permutation is the identity — no universal claim is made, and the existence of groups with threshold above 2 is registered open). Type II (local; measured): Out_c trivial but fusion fails on a proper subgroup, the blind pairs sitting in non-generating sectors — the same mechanism that defeats Wilson generation; this blindness heals: on every verified group (A₄, SL(2,3), A₄×ℤ₂) the full commutant collapses to trivial at b₁ = 3 by exact computation on two independently implemented instruments, although word readouts remain blind — the shift primitives separate, above a threshold, and the natural explanation (tuples becoming generating) is refuted by the persistence of blind blocks. Three boundaries at full strength: no exhaustiveness proof (a third source is not excluded); no general healing theorem (the verified groups all heal at 3, cause unidentified); the verified Type II sample is narrow. The quotient proposition restated in stratified form. The operational-equivalence quotient's necessity is now part of the proposition's own statement, in three strata: necessary where Out_c ≠ 1 at every b₁ ≥ b_σ(G), with b_σ ≤ d(G) at theorem grade; one-dimensional at b₁ = 2 on the fusion-type groups (verified cases); trivial at b₁ ≥ 3 on every verified fusion-type group and at every tested b₁ for word-separation-complete groups (a fourteen-group scan of orders ≤ 31 found no third source). Pre-registered validation preceded the restatement: a stratification-exhaustiveness scan (pass), a new-witness search (no new witness in range, downgrade clause applied as pre-registered), and a zero-conflict audit of the three strata against all archived data. The residual open problem is now precisely located. What remains of multi-cycle completeness: the rare Out_c ≠ 1 groups (54 in the exhaustive range through order 96) above their measured thresholds, the low-b₁ fusion stratum, a general healing theorem, and whether a threshold above 2 occurs. The multiplicity-freeness conjecture's mechanism sentence is corrected with the two regimes stated separately (at b₁ = 2 the shifts do not separate — the blind-pair transposition commutes with every primitive, integer-exact — and reduce the commutant to

•Jul 29, 2026•0 citations

"Stop Telling God What to Do, You Too": Niels Bohr's Complementarity as a Relation between Mathematical Descriptions instead of Aspects of Nature, 1924–1935

T.O.

Niels Bohr stands at the head of the interpretation of quantum mechanics, as its philosophical pillar and its organizer, although the formalism of the new mechanics was made by others. This paper asks what Bohr was, and shows that the question comes down to one question about the doctrine of complementarity. The frame is that of Operatiology (Japanese: Sousa Genron, 操作原論), the executive layer of Cognitional Mechanics (Japanese: Chinou Rikigaku, 知能力学), which stands under the regulative layer of Noology (Japanese: 知学). The frame separates a Tier-2 layer, made of states, operations, words of operations and classes of states, which is deterministic, from a Tier-3 layer of description, which is commutative, analytic and classical, and in which Hilbert space, measure and probability are found. In this frame a pair of descriptions that cannot be held together arises when operations whose results depend on their order are written in a language of description that does not depend on order. Bohr saw correctly that the exclusion is a relation between descriptions; he then stated its cause as exclusive aspects of nature. The statistical character of the theory is likewise a feature of the measure in Tier-3, and Bohr read it as a trait of nature. The two senses in which the theory has been called complete concern two different maps and do not contradict each other. The formalisms fit complementarity because they share one source, which is not evidence that the aspects belong to the object. Bohr was the person who found the problem correctly and assigned its cause to the wrong place. The break is confined to the layer of interpretive premises; the empirical content of the formalism is untouched. A finite model and numerical checks of every arithmetic statement used are given in Appendix A. The Python program below is Appendix A of the paper. It uses Python 3 with numpy and the standard library only, and checks finite arithmetic statements and only those. In the four-state model it checks the two operations, their composition orders and the classes of states they generate. It counts the composition-preserving maps of the three-element structure into the maps of finite sets and examines which of them preserve the difference of the two operations. It checks the Kennard inequality for the spreads of a position distribution and a momentum distribution, the way the classes of states refine when an operation is added to the family, the two maps behind the two senses of "complete" on one model, the push of a measure on states to classes and a readout that the operations cannot see, and the realizations of one noncommutative structure by maps and by matrices. The program checks nothing about nature, about history or about any person. Run it as python3 -I a1.py. # Appendix A. Verification code for the Bohr paper (Python 3, numpy only). # Every check prints one line; an assertion stops the run if a check fails. # The code checks finite arithmetic facts only. It does not check any # statement about nature, about history, or about a person. import itertools import random from fractions import Fraction import numpy as np # ---------------------------------------------------------------------- # Section 0. Tools: maps on a finite set, composition, closure, classes # ---------------------------------------------------------------------- NAMES = ('p', 'q', 'r', 'r2') # the four states of the model N = len(NAMES) def amap(d, names=NAMES): """A map given as a dict of names; stored as a tuple of indices.""" idx = {s: i for i, s in enumerate(names)} return tuple(idx[d[s]] for s in names) def comp(f, g): """(f o g)(s) = f(g(s)); a map is the tuple of its values.""" return tuple(f[g[i]] for i in range(len(g))) def closure(gens, n): """All finite compositions of the generators, including the empty one.""" ident = tuple(range(n)) seen = {ident} frontier = [ident] while frontier: nxt = [] for f in frontier: for g in gens: h = comp(g, f) if h not in seen: seen.add(h) nxt.append(h) frontier = nxt return seen def partition(monoid, n): """Operational partition (Definition 2.2 of the Math V5 paper): s1 ~ s2 iff w(s1) = w(s2) for every non-identity map w of the monoid.""" ident = tuple(range(n)) hist = sorted(w for w in monoid if w != ident) cls = {} for s in range(n): cls.setdefault(tuple(w[s] for w in hist), []).append(s) return sorted(cls.values()) def refines(fine, coarse): return all(any(set(c) <= set(d) for d in coarse) for c in fine) def label(part, names): return '{' + ', '.join('{' + ','.join(names[i] for i in c) + '}' for c in part) + '}' def class_of(part, n): out = [None] * n for k, c in enumerate(part): for s in c: out[s] = k return out def induced(w, part, n): """The action of the map w on classes; checks that it is well defined.""" cof = class_of(part, n) res = [] for c in part: targets = {cof[w[s]] for s in c} assert len(targets) == 1, 'not well defined on classes' res.append(targets.pop()) return tuple(res) # ---------------------------------------------------------------------- # Section 1. The four-state model (Example 2.9 of the Math V5 paper) # ---------------------------------------------------------------------- print('== 1. The four-state model ==') E = tuple(range(N)) A = amap({'p': 'p', 'q': 'q', 'r': 'p', 'r2': 'p'}) B = amap({'p': 'p', 'q': 'q', 'r': 'q', 'r2': 'q'}) O = closure([A, B], N) TAG = {E: 'e', A: 'A', B: 'B'} assert O == {E, A, B} assert comp(A, B) == B and comp(B, A) == A assert comp(A, A) == A and comp(B, B) == B print('closure of {A,B} has', len(O), 'elements: e, A, B') print('A o B = B, B o A = A, A o A = A, B o B = B : verified') r = NAMES.index('r') print('witness state r: (A o B)(r) =', NAMES[comp(A, B)[r]], ', (B o A)(r) =', NAMES[comp(B, A)[r]]) assert comp(A, B)[r] != comp(B, A)[r] PI_O = partition(O, N) print('partition PiO =', label(PI_O, NAMES)) assert PI_O == [[0], [1], [2, 3]] subs = [{E}, {E, A}, {E, B}, {E, A, B}] equal_to_PiO = [] for sub in subs: assert all(comp(f, g) in sub for f in sub for g in sub) part = partition(sub, N) print(' submonoid', sorted(TAG[f] for f in sub), '->', label(part, NAMES)) if part == PI_O: equal_to_PiO.append(sub) assert equal_to_PiO == [{E, A, B}] print('only the whole monoid reaches PiO: Cmin = O') # ---------------------------------------------------------------------- # Section 2. Exclusion: no commutative target carries both A and B # ---------------------------------------------------------------------- print() print('== 2. Composition-preserving maps of {e,A,B} into T(n) ==') def exclusion_count(n): ident = tuple(range(n)) T = list(itertools.product(range(n), repeat=n)) idem = [t for t in T if comp(t, t) == t] homs = [(a, b) for a in idem for b in idem if comp(a, b) == b and comp(b, a) == a] faithful = [(a, b) for a, b in homs if len({ident, a, b}) == 3] commuting = [(a, b) for a, b in homs if comp(a, b) == comp(b, a)] comm_faithful = [(a, b) for a, b in commuting if len({ident, a, b}) == 3] assert all(a == b for a, b in commuting) return len(T), len(homs), len(faithful), len(commuting), \ len(comm_faithful), faithful def orbits(pairs, n): perms = list(itertools.permutations(range(n))) def conj(p, f): inv = [0] * n for i, x in enumerate(p): inv[x] = i return tuple(p[f[inv[i]]] for i in range(n)) seen, count = set(), 0 for pr in pairs: if pr in seen: continue count += 1 for p in perms: seen.add((conj(p, pr[0]), conj(p, pr[1]))) return count print(' n |T(n)| homs faithful commuting commuting&faithful') faithful3 = None for n in (2, 3, 4): t, h, f, c, cf, fl = exclusion_count(n) print('%2d %7d %5d %9d %10d %19d' % (n, t, h, f, c, cf)) assert cf == 0 if n == 2: assert f == 0 if n == 3: faithful3 = fl assert f > 0 print('no commuting image is faithful: psi(A) = psi(B) whenever the image commutes') print('faithful images need n >= 3 points; on n = 3 the number of orbits under') print('relabelling is', orbits(faithful3, 3)) assert orbits(faithful3, 3) == 1 # the two submonoids {e,A} and {e,B} are each faithful in a commutative target mult = {(x, y): x * y for x in (0, 1) for y in (0, 1)} for name, g in (('A', A), ('B', B)): psi = {E: 1, g: 0} assert all(psi[comp(f, h)] == mult[(psi[f], psi[h])] for f in psi for h in psi) assert len(set(psi.values())) == 2 print('submonoid {e,%s} -> ({0,1}, x): composition-preserving and injective' % name) joint = [] for a in (0, 1): for b in (0, 1): psi = {E: 1, A: a, B: b} if all(psi[comp(f, h)] == mult[(psi[f], psi[h])] for f in psi for h in psi): joint.append((a, b)) print('joint maps of {e,A,B} into ({0,1}, x):', joint, '-> psi(A) = psi(B) in each') assert all(a == b for a, b in joint) # ---------------------------------------------------------------------- # Section 3. The Kennard inequality as a relation between two distributions # ---------------------------------------------------------------------- print() print('== 3. Spreads of position and momentum distributions (hbar = 1) ==') NG = 2 ** 15 X = np.linspace(-60.0, 60.0, NG, endpoint=False) DX = X[1] - X[0] K = np.fft.fftshift(2 * np.pi * np.fft.fftfreq(NG, d=DX)) DK = K[1] - K[0] def spreads(psi): px = np.abs(psi) ** 2 px = px / (px.sum() * DX) mx = (X * px).sum() * DX sx = np.sqrt((((X - mx) ** 2) * px).sum() * DX) pk = np.abs(np.fft.fftshift(np.fft.fft(psi))) ** 2 pk = pk / (pk.su

•Jan 1, 2026•0 citations

The Admissibility of Natural Physics Part 1

Christoforos Panagis

The Admissibility of Natural Physics, Part I begins where an admissibility-first reconstruction of single-system quantum mechanics ends. Its central question is not whether the familiar tensor-product formalism can be assumed, but whether any physical composition law can be derived without importing composite systems, global state spaces, entanglement, locality, or signalling as primitives. The book develops a disciplined reconstruction of binary quantum composition from operational and structural requirements. It first records the exact content and limitations of the inherited single-system closure, establishes dependency and non-circularity statutes, and introduces the possible object of natural physics only as a provisional target ledger rather than as an assumed ontology. It then examines joint preparation, product states and effects, marginal consistency, operational no-signalling, minimal and maximal probabilistic composites, local tomography, and the classification of admissible tensor-product representations. Particular attention is given to the distinction between a mathematical representation theorem and the uniqueness of a physical composition rule. Real, complex, quaternionic, Jordan-algebraic, minimal, maximal, restricted, and non-tomographic alternatives are compared under explicitly declared admissibility conditions. The complex Hilbert-space tensor product is recovered only on branches satisfying the required factorization, coherence, scalar, and operational closure conditions. Where several inequivalent composites survive, the result is a classified family rather than a falsely asserted uniqueness theorem. Entanglement is introduced only after composition has been commissioned. It is defined as the failure of an admitted joint state to belong to the convex closure of admitted product preparations. The analysis proves, within the resulting predictive grammar, that entanglement is a property of composite-state geometry, not an additional force, substance, interaction mechanism, or signalling channel. Throughout, the argument enforces quotient primacy, refinement stability, finite diagnostic closure, regeneration stability, explicit dependency receipts, local termination, and the possibility of Undefined as a legitimate scientific outcome. Part I therefore supplies neither a speculative ontology nor a presupposed many-world formalism. It provides a conditional classification theorem for binary physical composition and identifies precisely what remains to be established before interaction, repeated composition, particle identity, locality, fields, symmetries, and particle content may be addressed.

•Jun 23, 2026•0 citations
This paper introduces translatability as a criterion of structural adequacy for natural laws and mathematical structures. The Operatiology framework establishes a three-tier architecture: Tier-1 (Noology) is the regulative layer; Tier-2 is the operational structure established by axioms A1 (Non-Commutativity), A2 (Πd-Saturation), and A4 (Redundancy Exclusion), realised uniquely as M₃(ℂ) with Cartan generator H = diag(1,1,−2); Tier-3 is the layer of mathematical and physical representations. A Tier-3 object is translatable if and only if there exists a unique, exclusive operational projection from Nec(S) = Dist(S) ∩ Clos(S) ∩ Irr(S) to the object, preserving spectrum, commutation relations, operational closure, and irreducibility in absolute priority order. Eleven objects are established as Translatable: electron, proton (CM fundamental), α, μ, π, e, γE, quantum entanglement, Bell inequality violations, no-cloning, and Operational Redundancy Exclusion. All remaining objects examined are Untranslatable, organised across five groups for physical theories and four for mathematical structures. The Standard Model is dissected as a mixture: Translatable components encased within an Untranslatable framework of gauge groups, Higgs sector, and quark sector. The relation between translatability and falsifiability is one of Aufhebung: preservation within Tier-3, negation as a warrant for structural claims, and elevation to the criterion that formally reaches Tier-2. Two appendices accompany the paper. Appendix A verifies the algebraic structures of the deductive chain, including an exhaustive search confirming that H = diag(1,1,−2) uniquely minimises Tr(H²) = 6 among traceless integer triples. Appendix B implements the verdict procedure as an executable Translatability Auditor. Beyond binary verdicts, the Auditor identifies where the structural gap lies: which free parameter lacks derivation from {A1, A2, A4}, or which Tier-3 primitive constitutes the obstruction. It functions as a structural compass within Tier-3 research. python import numpy as np H_SPECTRUM = np.sort(np.array([-2.0, 1.0, 1.0])) H_DEGENERACY = {1.0: 2, -2.0: 1} def check_condition_1(spectrum): if not spectrum: return False, "No spectral structure; condition (1) fails." s = np.sort(np.array(spectrum, dtype=float)) if len(s) != len(H_SPECTRUM): return False, f"Dimension mismatch: {len(s)} vs {len(H_SPECTRUM)}." if not np.allclose(s, H_SPECTRUM, atol=1e-8, rtol=1e-6): return False, f"Spectrum {list(np.round(s,4))} != H-spectrum." unique, counts = np.unique(np.round(s, 8), return_counts=True) ev_dict = dict(zip(unique, counts)) for ev, mult in H_DEGENERACY.items(): if ev_dict.get(ev, 0) != mult: return False, f"Degeneracy mismatch for eigenvalue {ev}." return True, "Condition (1) satisfied." def audit_conditions(spectrum, commutator_closed, closure_stable, irreducible, label, verbose=False): ok1, msg1 = check_condition_1(spectrum) if not ok1: return "Untranslatable", "Refutation(S)" if not commutator_closed: return "Untranslatable", "Refutation(C)" if not closure_stable: return "Untranslatable", "Refutation(Cl)" if not irreducible: return "Untranslatable", "Refutation(I)" return "Translatable", "Route(i) or (ii)" # Examples from Part II (Appendix A, Listing 4) for label, args in [ ("Electron", ([-2,1,1], True, True, True)), ("Chern number", ([1], True, True, True)), ("QC Layer 2", ([-0.5,0.5], True, True, True)), ("Abelian phase", ([-2,1,1], False, True, True)), ]: v, r = audit_conditions(*args, label=label) print(f"{label}: {v} via {r}")
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. import mathfrom mpmath import mp, mpf, pi, sqrt mp.dps = 50 # === M3(C) spectrum {1, 1, -2} ===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)/2D = (d - 1)*d*gch2 = (e1**2 - 2*e2)/2ch3 = (e1**3 - 3*e1*e2 + 3*e3)/6N2 = mpf(10)/4N3 = mpf(7)/2C2 = sqrt(ch2/N2)*gf3 = abs(ch3)/N3term0 = 6*pi/Dterm1 = C2*Dterm2 = f3*D**6inv_s = term0 + term1 + term2 # === Structural invariant 1: exponent n=3 ===n = 3d_f = math.sqrt(3/2)exp_ = n * (2*n + 1)pref = math.sqrt(n*(n+1) / (2*n+1))C3 = d_f**2 - d_f / (2 * math.sqrt(n))corr = 1 - C3 * (1/float(inv_s))**2inv1 = (1/float(inv_s))**exp_ * pref * corr # === Structural invariant 2: cyclotomic {P1, P3, P6} ===P1 = 2P3 = 13P6 = 7main = P6 * (2*P3 - n) / (2 * math.pi * n)corr_s = P1 / n**3inv2_inv = main - corr_sinv2 = 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}")
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. import numpy as np from numpy.linalg import eigh hbar = 1.0 # Representation A: Ladder / number-state truncation N = 120 ns = np.arange(N) a = np.diag(np.sqrt(ns[1:]), k=1) adag = a.T Q_A = np.sqrt(hbar / 2.0) * (a + adag) P_A = 1j * np.sqrt(hbar / 2.0) * (adag - a) H_A = 0.5 * (P_A @ P_A + Q_A @ Q_A) evals_A, _ = eigh(np.real(H_A)) comm_A = Q_A @ P_A - P_A @ Q_A - 1j * hbar * np.eye(N) interior_residual_A = np.max(np.abs(comm_A[:-1, :-1])) # Representation B: Position-grid second-derivative (Dirichlet b.c.) M = 2000 L = 15.0 x = np.linspace(-L, L, M + 2)[1:-1] dx = x[1] - x[0] diag0 = (5.0 / 2.0) * np.ones(M) / dx**2 diag1 = (-4.0 / 3.0) * np.ones(M - 1) / dx**2 diag2 = (1.0 / 12.0) * np.ones(M - 2) / dx**2 T_B = (hbar**2 / 2.0) * ( np.diag(diag0) + np.diag(diag1, 1) + np.diag(diag1, -1) + np.diag(diag2, 2) + np.diag(diag2, -2)) V_B = np.diag(0.5 * x**2) H_B = T_B + V_B evals_B, _ = eigh(H_B) # Comparison n_show = 12 expected_evals = hbar * (np.arange(n_show) + 0.5) spectral_gap = np.max(np.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
Cognitional Mechanics (CM) establishes an axiomatic framework that formalizes the structural mechanisms of intelligence as a self-contained operational system. Unlike approaches grounded in physical dynamics or engineering implementations, CM abstracts intelligence through non-commutative operations, convergence of semantic states, and structurally inaccessible domains, without invoking physical observables or psychological primitives. The first edition (DOI: https://doi.org/10.5281/zenodo.17994360) established the structural correspondence between CM and QM; the second edition (DOI: https://doi.org/10.5281/zenodo.18062274) strengthened the distinction while preserving the correspondence. This third edition extends the analysis through two additions: the explicit Tier architecture locating QM within Tier-3 as a projection of Tier-2 CM structure, and a structural account of the non-commutativity--discreteness coupling in QM. While CM exhibits a clear structural correspondence with Quantum Mechanics (QM)---most notably in its reliance on non-commutative operator structures and bounded transitions---it departs fundamentally in its treatment of difference and discreteness. Within the standard Hilbert-space formalism, non-commutativity and spectral discreteness are mathematically independent properties, as established in non-commutative geometry: position and momentum operators, for instance, are non-commuting yet possess continuous spectra. In QM, however, the physical framework couples non-commutativity to fixed empirical constants and measurement postulates, producing discreteness as a structural feature of the theory. CM identifies this coupling as a Tier-3 projection condition rather than a Tier-1 structural necessity, and demonstrates at Tier-2 that non-commutativity is sustainable without discretization. Within this framework, intelligence is mathematically tractable and substrate-independent, analyzable without external observation or measurement. The operational limit constant c does not function as a physical quantum but as a logical boundary condition governing convergence and phase transition. This distinguishes c from Planck's constant ℏ: the former regulates internal operability and accessibility, while the latter fixes physical quantization through empirical calibration. The three-tier architecture formally positions CM as follows. Tier-1 (Noology) constitutes the regulative source, specifying the conditions under which a structure qualifies as real. Tier-2 (CM) constitutes the executive operational domain, in which M₃(ℂ) is the unique minimal non-commutative substrate. Tier-3 (MUT/GUT) constitutes the projective display layer, in which physical theories including QM appear as projections of Tier-2 dynamics. CM and QM share a common Tier-1 origin without being in direct correspondence; their shared non-commutativity descends from Tier-1, while QM's discreteness is introduced at Tier-3 by projection conditions absent from Tier-2. By defining a metric space of semantic states with distance functions satisfying non-negativity, symmetry, and the triangle inequality, CM ensures formal rigor and internal closure. The variability of semantic differences allows CM to reconcile non-commutative structure with classical continuity, thereby avoiding probabilistic collapse or observer-dependence. Inaccessibility and convergence are determined entirely by internal operational constraints. CM thus clarifies that its resemblance to QM is structural rather than physical, and locates that resemblance within a broader Tier architecture from which the projection origin of QM's characteristic features is examinable. The framework generalizes non-commutative formalisms into a domain where intelligence is modeled as a geometric-operational process, not a quantum phenomenon, while maintaining a strict distinction from physical quantum theory.
A finitist, relational axiomatization of physics: quantum theory and a relativity sector derived from four axioms about group-valued relations and closure. Contributions to the foundations of quantum mechanics (Born rule derivation, quantum reconstruction, local tomography, complex field selection), the emergence of time and causal structure in discrete networks, discrete Noether theorems, lattice gauge structure, and the Schrödinger equation derived by two independent routes. Every claim is graded in a Claim Ledger; every numerical claim is machine-verified with archived scripts; negative results are reported at full strength. What this paper does The universe is taken to be constituted by relations rather than objects. Stable relations form closures (self-consistent cycles) whose holonomies carry the physical content. Four axioms — primacy of relations (group-valued, edge-borne), closure stability, chirality from order, and observation as bidirectional group exchange — yield, at explicitly graded and conditional levels: Quantum sector Exchange-completeness theorems for finite label groups: abelian at all cycle ranks; non-abelian on the single cycle (Wilson readouts plus class-sum convolutions generate the full matrix algebra); the multi-cycle non-abelian case on the operational-equivalence quotient, with the obstruction completely characterized via class-preserving outer automorphisms — and the quotient's necessity now stratified by the source of word blindness (see New in Version 24.0). The Born rule, proved for finite abelian networks from a strictly weaker relational readout premise (statistics of realizable effects depend only on relational content); non-contextuality has this single source; additivity is basis-relative and declared as such. The Schrödinger equation by two routes of unequal premise grade, maintained side by side: a spectral route — the action operator is a weighted Cayley-graph Laplacian in the Pontryagin dual basis, the derived Gibbs state's unique canonical (modular) flow yields the Schrödinger equation with Hamiltonian equal to the action operator, no continuum limit, zero conjectures consumed, the single non-theorem step one flagged identification; and a Madelung route — physical and mechanism-rich (probability density derived from constraint gaps), valid exactly on the domain of the pseudo-continuity conjecture, with its full premise bill stated (continuity equation, Wallstrom circulation condition, m, V). A dedicated comparison subsection gives the line-by-line premise accounting and the machine-measured agreement region. Complex field selection: ℂ selected over ℝ and ℍ within the GPT comparison class in the covered sectors, with a second independent route from chirality (Frobenius–Schur dichotomy, quaternionic double exclusion); "uniquely selected" expressly not claimed. Positivity as pairing: all five in-text positive-semidefiniteness theorems traced to one mechanism (M = B†B with native factor); the Kraus form and complete positivity derived rather than assumed. The Noether sector on Noether's two theorems exactly: Noether I recovered on the holonomy action (compact Lie realization); Noether II identified as present (Bianchi as horn-filling, Schläfli as its Regge form); selection rules recovered for finite groups; the GNS bridge proved non-vacuously on the full exchange algebra; the sole potential extension — conservation as the kernel of exchange — isolated as a registered conjecture, consumed nowhere. A local–global representation theorem: six generative quantities (closure invariant, flux quantization, Weyl phase, non-abelian Stokes, orientation visibility, terminal normalization) are evaluations of cohomology classes against closed chains — one syntax, six exact machine probes. The gatekeeper no-go theorems registered and discharged: Kochen–Specker (the framework posits no global valuation — outcomes are resolutions of constraint gaps, and basis-relative additivity blocks state-independent variants), Pusey–Barrett–Rudolph (the statistical envelope is over resolutions yet to happen, not values already held; machine witness: identical configuration ensembles with opposite relative phase have opposite statistics), Wallstrom (registered as an explicit input, structurally discharged in the finite-abelian sector), Hegerfeldt (the Lieb–Robinson exponential tail identified as the only claimable front form for the continuum limit), Frauchiger–Renner (cross-agent certainty transfer presupposes kernel-free record transport, exactly what exchange-incompleteness excludes), and no-cloning (inherited in the covered sectors); Conway–Kochen and Colbeck–Renner noted as concordant. Relativity sector Time from finite capacity plus genuine randomness: the staging theorem (Θ(d) dependency depth, unbounded chains via the Moore bound; the quantitative failure law conditionalized on measure-level independence with exact minimal witnesses); the temporal quantum defined combinatorially, no Hamiltonian input. The speed of light grounded in an exact discrete dependency cone (combinatorial, no quantum input), the Lieb–Robinson bound consumed at cross-check grade only; a boost no-go theorem reducing Lorentz invariance to named statistical conditions, with the Collins fine-tuning objection recorded as a gate. The trace-descent theorem group: the growth-history measure forced onto the Mazurkiewicz trace quotient; chain reflection positivity at every depth with completely explicit spectrum. An equation sector of nine verification families (Schrödinger, Dirac, Maxwell/U(1), canonical commutator, Yang–Mills SU(2), Regge calculus, Klein–Gordon, Noether loop, Cartan curvature), where every machine-precision claim is the shadow of a proved backbone lemma — including the factor ½ of H = ½L + V, identified as the Wilson Fourier coefficient fixed by the action theorem. Four experimentally testable predictions, including a discriminating flat-versus-sigmoid visibility protocol. The Standard Model gauge group, ħ, and G remain open, with attack routes registered. How to read Three entry paths are marked in the document. Path A (derivational core): axioms → group structure → Noether sector → least action → Born rule → positivity. Path B (physical mechanisms): constraint propagation → time as determination → wave function as gap envelope → fields. Path C (scope and limits): the Claim Ledger, then Discussion and Open Problems — for the reader who wants to know what is claimed and what is not before reading anything else. The Claim Ledger is the single authoritative register of claim status; wherever body text sounds stronger, the Ledger governs. New in Version 24.0 (Version 23.0 is the immediately preceding public release; this version supersedes the internal V12–V15 and V17–V19 series, whose numbers are not used externally.) Version 24.0 resolves the structure of the multi-cycle non-abelian obstruction — the sector's longest-standing open front — following an external research exchange with three rounds of independent re-verification (fourteen core figures, three commutant instruments implemented independently, exact integer arithmetic on the obstruction side) and two rounds of counter-review that corrected one quantifier on each side: A dichotomy of the multi-cycle obstruction (new remark). Word blindness on multi-cycle networks has two identified sources, jointly covering every tested case, with opposite behaviour as cycle rank grows. Type I (global; graded): a class-preserving outer automorphism yields a commutant element by an argument free of cycle-rank reference; its non-triviality holds at theorem grade for b₁ ≥ d(G) via generating tuples, is monotone in b₁, and the threshold is measured at b_σ = 2 on the tested Wall group (at b₁ = 1 the permutation is the identity — no universal claim is made, and the existence of groups with threshold above 2 is registered open). Type II (local; measured): Out_c trivial but fusion fails on a proper subgroup, the blind pairs sitting in non-generating sectors — the same mechanism that defeats Wilson generation; this blindness heals: on every verified group (A₄, SL(2,3), A₄×ℤ₂) the full commutant collapses to trivial at b₁ = 3 by exact computation on two independently implemented instruments, although word readouts remain blind — the shift primitives separate, above a threshold, and the natural explanation (tuples becoming generating) is refuted by the persistence of blind blocks. Three boundaries at full strength: no exhaustiveness proof (a third source is not excluded); no general healing theorem (the verified groups all heal at 3, cause unidentified); the verified Type II sample is narrow. The quotient proposition restated in stratified form. The operational-equivalence quotient's necessity is now part of the proposition's own statement, in three strata: necessary where Out_c ≠ 1 at every b₁ ≥ b_σ(G), with b_σ ≤ d(G) at theorem grade; one-dimensional at b₁ = 2 on the fusion-type groups (verified cases); trivial at b₁ ≥ 3 on every verified fusion-type group and at every tested b₁ for word-separation-complete groups (a fourteen-group scan of orders ≤ 31 found no third source). Pre-registered validation preceded the restatement: a stratification-exhaustiveness scan (pass), a new-witness search (no new witness in range, downgrade clause applied as pre-registered), and a zero-conflict audit of the three strata against all archived data. The residual open problem is now precisely located. What remains of multi-cycle completeness: the rare Out_c ≠ 1 groups (54 in the exhaustive range through order 96) above their measured thresholds, the low-b₁ fusion stratum, a general healing theorem, and whether a threshold above 2 occurs. The multiplicity-freeness conjecture's mechanism sentence is corrected with the two regimes stated separately (at b₁ = 2 the shifts do not separate — the blind-pair transposition commutes with every primitive, integer-exact — and reduce the commutant to
Niels Bohr stands at the head of the interpretation of quantum mechanics, as its philosophical pillar and its organizer, although the formalism of the new mechanics was made by others. This paper asks what Bohr was, and shows that the question comes down to one question about the doctrine of complementarity. The frame is that of Operatiology (Japanese: Sousa Genron, 操作原論), the executive layer of Cognitional Mechanics (Japanese: Chinou Rikigaku, 知能力学), which stands under the regulative layer of Noology (Japanese: 知学). The frame separates a Tier-2 layer, made of states, operations, words of operations and classes of states, which is deterministic, from a Tier-3 layer of description, which is commutative, analytic and classical, and in which Hilbert space, measure and probability are found. In this frame a pair of descriptions that cannot be held together arises when operations whose results depend on their order are written in a language of description that does not depend on order. Bohr saw correctly that the exclusion is a relation between descriptions; he then stated its cause as exclusive aspects of nature. The statistical character of the theory is likewise a feature of the measure in Tier-3, and Bohr read it as a trait of nature. The two senses in which the theory has been called complete concern two different maps and do not contradict each other. The formalisms fit complementarity because they share one source, which is not evidence that the aspects belong to the object. Bohr was the person who found the problem correctly and assigned its cause to the wrong place. The break is confined to the layer of interpretive premises; the empirical content of the formalism is untouched. A finite model and numerical checks of every arithmetic statement used are given in Appendix A. The Python program below is Appendix A of the paper. It uses Python 3 with numpy and the standard library only, and checks finite arithmetic statements and only those. In the four-state model it checks the two operations, their composition orders and the classes of states they generate. It counts the composition-preserving maps of the three-element structure into the maps of finite sets and examines which of them preserve the difference of the two operations. It checks the Kennard inequality for the spreads of a position distribution and a momentum distribution, the way the classes of states refine when an operation is added to the family, the two maps behind the two senses of "complete" on one model, the push of a measure on states to classes and a readout that the operations cannot see, and the realizations of one noncommutative structure by maps and by matrices. The program checks nothing about nature, about history or about any person. Run it as python3 -I a1.py. # Appendix A. Verification code for the Bohr paper (Python 3, numpy only). # Every check prints one line; an assertion stops the run if a check fails. # The code checks finite arithmetic facts only. It does not check any # statement about nature, about history, or about a person. import itertools import random from fractions import Fraction import numpy as np # ---------------------------------------------------------------------- # Section 0. Tools: maps on a finite set, composition, closure, classes # ---------------------------------------------------------------------- NAMES = ('p', 'q', 'r', 'r2') # the four states of the model N = len(NAMES) def amap(d, names=NAMES): """A map given as a dict of names; stored as a tuple of indices.""" idx = {s: i for i, s in enumerate(names)} return tuple(idx[d[s]] for s in names) def comp(f, g): """(f o g)(s) = f(g(s)); a map is the tuple of its values.""" return tuple(f[g[i]] for i in range(len(g))) def closure(gens, n): """All finite compositions of the generators, including the empty one.""" ident = tuple(range(n)) seen = {ident} frontier = [ident] while frontier: nxt = [] for f in frontier: for g in gens: h = comp(g, f) if h not in seen: seen.add(h) nxt.append(h) frontier = nxt return seen def partition(monoid, n): """Operational partition (Definition 2.2 of the Math V5 paper): s1 ~ s2 iff w(s1) = w(s2) for every non-identity map w of the monoid.""" ident = tuple(range(n)) hist = sorted(w for w in monoid if w != ident) cls = {} for s in range(n): cls.setdefault(tuple(w[s] for w in hist), []).append(s) return sorted(cls.values()) def refines(fine, coarse): return all(any(set(c) <= set(d) for d in coarse) for c in fine) def label(part, names): return '{' + ', '.join('{' + ','.join(names[i] for i in c) + '}' for c in part) + '}' def class_of(part, n): out = [None] * n for k, c in enumerate(part): for s in c: out[s] = k return out def induced(w, part, n): """The action of the map w on classes; checks that it is well defined.""" cof = class_of(part, n) res = [] for c in part: targets = {cof[w[s]] for s in c} assert len(targets) == 1, 'not well defined on classes' res.append(targets.pop()) return tuple(res) # ---------------------------------------------------------------------- # Section 1. The four-state model (Example 2.9 of the Math V5 paper) # ---------------------------------------------------------------------- print('== 1. The four-state model ==') E = tuple(range(N)) A = amap({'p': 'p', 'q': 'q', 'r': 'p', 'r2': 'p'}) B = amap({'p': 'p', 'q': 'q', 'r': 'q', 'r2': 'q'}) O = closure([A, B], N) TAG = {E: 'e', A: 'A', B: 'B'} assert O == {E, A, B} assert comp(A, B) == B and comp(B, A) == A assert comp(A, A) == A and comp(B, B) == B print('closure of {A,B} has', len(O), 'elements: e, A, B') print('A o B = B, B o A = A, A o A = A, B o B = B : verified') r = NAMES.index('r') print('witness state r: (A o B)(r) =', NAMES[comp(A, B)[r]], ', (B o A)(r) =', NAMES[comp(B, A)[r]]) assert comp(A, B)[r] != comp(B, A)[r] PI_O = partition(O, N) print('partition PiO =', label(PI_O, NAMES)) assert PI_O == [[0], [1], [2, 3]] subs = [{E}, {E, A}, {E, B}, {E, A, B}] equal_to_PiO = [] for sub in subs: assert all(comp(f, g) in sub for f in sub for g in sub) part = partition(sub, N) print(' submonoid', sorted(TAG[f] for f in sub), '->', label(part, NAMES)) if part == PI_O: equal_to_PiO.append(sub) assert equal_to_PiO == [{E, A, B}] print('only the whole monoid reaches PiO: Cmin = O') # ---------------------------------------------------------------------- # Section 2. Exclusion: no commutative target carries both A and B # ---------------------------------------------------------------------- print() print('== 2. Composition-preserving maps of {e,A,B} into T(n) ==') def exclusion_count(n): ident = tuple(range(n)) T = list(itertools.product(range(n), repeat=n)) idem = [t for t in T if comp(t, t) == t] homs = [(a, b) for a in idem for b in idem if comp(a, b) == b and comp(b, a) == a] faithful = [(a, b) for a, b in homs if len({ident, a, b}) == 3] commuting = [(a, b) for a, b in homs if comp(a, b) == comp(b, a)] comm_faithful = [(a, b) for a, b in commuting if len({ident, a, b}) == 3] assert all(a == b for a, b in commuting) return len(T), len(homs), len(faithful), len(commuting), \ len(comm_faithful), faithful def orbits(pairs, n): perms = list(itertools.permutations(range(n))) def conj(p, f): inv = [0] * n for i, x in enumerate(p): inv[x] = i return tuple(p[f[inv[i]]] for i in range(n)) seen, count = set(), 0 for pr in pairs: if pr in seen: continue count += 1 for p in perms: seen.add((conj(p, pr[0]), conj(p, pr[1]))) return count print(' n |T(n)| homs faithful commuting commuting&faithful') faithful3 = None for n in (2, 3, 4): t, h, f, c, cf, fl = exclusion_count(n) print('%2d %7d %5d %9d %10d %19d' % (n, t, h, f, c, cf)) assert cf == 0 if n == 2: assert f == 0 if n == 3: faithful3 = fl assert f > 0 print('no commuting image is faithful: psi(A) = psi(B) whenever the image commutes') print('faithful images need n >= 3 points; on n = 3 the number of orbits under') print('relabelling is', orbits(faithful3, 3)) assert orbits(faithful3, 3) == 1 # the two submonoids {e,A} and {e,B} are each faithful in a commutative target mult = {(x, y): x * y for x in (0, 1) for y in (0, 1)} for name, g in (('A', A), ('B', B)): psi = {E: 1, g: 0} assert all(psi[comp(f, h)] == mult[(psi[f], psi[h])] for f in psi for h in psi) assert len(set(psi.values())) == 2 print('submonoid {e,%s} -> ({0,1}, x): composition-preserving and injective' % name) joint = [] for a in (0, 1): for b in (0, 1): psi = {E: 1, A: a, B: b} if all(psi[comp(f, h)] == mult[(psi[f], psi[h])] for f in psi for h in psi): joint.append((a, b)) print('joint maps of {e,A,B} into ({0,1}, x):', joint, '-> psi(A) = psi(B) in each') assert all(a == b for a, b in joint) # ---------------------------------------------------------------------- # Section 3. The Kennard inequality as a relation between two distributions # ---------------------------------------------------------------------- print() print('== 3. Spreads of position and momentum distributions (hbar = 1) ==') NG = 2 ** 15 X = np.linspace(-60.0, 60.0, NG, endpoint=False) DX = X[1] - X[0] K = np.fft.fftshift(2 * np.pi * np.fft.fftfreq(NG, d=DX)) DK = K[1] - K[0] def spreads(psi): px = np.abs(psi) ** 2 px = px / (px.sum() * DX) mx = (X * px).sum() * DX sx = np.sqrt((((X - mx) ** 2) * px).sum() * DX) pk = np.abs(np.fft.fftshift(np.fft.fft(psi))) ** 2 pk = pk / (pk.su
The Admissibility of Natural Physics, Part I begins where an admissibility-first reconstruction of single-system quantum mechanics ends. Its central question is not whether the familiar tensor-product formalism can be assumed, but whether any physical composition law can be derived without importing composite systems, global state spaces, entanglement, locality, or signalling as primitives. The book develops a disciplined reconstruction of binary quantum composition from operational and structural requirements. It first records the exact content and limitations of the inherited single-system closure, establishes dependency and non-circularity statutes, and introduces the possible object of natural physics only as a provisional target ledger rather than as an assumed ontology. It then examines joint preparation, product states and effects, marginal consistency, operational no-signalling, minimal and maximal probabilistic composites, local tomography, and the classification of admissible tensor-product representations. Particular attention is given to the distinction between a mathematical representation theorem and the uniqueness of a physical composition rule. Real, complex, quaternionic, Jordan-algebraic, minimal, maximal, restricted, and non-tomographic alternatives are compared under explicitly declared admissibility conditions. The complex Hilbert-space tensor product is recovered only on branches satisfying the required factorization, coherence, scalar, and operational closure conditions. Where several inequivalent composites survive, the result is a classified family rather than a falsely asserted uniqueness theorem. Entanglement is introduced only after composition has been commissioned. It is defined as the failure of an admitted joint state to belong to the convex closure of admitted product preparations. The analysis proves, within the resulting predictive grammar, that entanglement is a property of composite-state geometry, not an additional force, substance, interaction mechanism, or signalling channel. Throughout, the argument enforces quotient primacy, refinement stability, finite diagnostic closure, regeneration stability, explicit dependency receipts, local termination, and the possibility of Undefined as a legitimate scientific outcome. Part I therefore supplies neither a speculative ontology nor a presupposed many-world formalism. It provides a conditional classification theorem for binary physical composition and identifies precisely what remains to be established before interaction, repeated composition, particle identity, locality, fields, symmetries, and particle content may be addressed.