Testing Whether Physics Chooses Certain Math Structures

In the paper's words

Mathematics developed without physical motivation repeatedly finds core physical application: complex numbers in quantum mechanics, fiber bundles in gauge theory, and max-plus algebra in optimal control. The standard explanation—unreasonable effectiveness—treats this as a philosophical puzzle rather than a measurable phenomenon. The gap addressed here is the absence of any quantitative test of whether physical instantiation of pre-existing mathematical structures is statistically non-accidental and predictable from structural features alone.

The abstract, verbatim, and its opening sentence is the claim. Every line below is quoted from the text.

Numbers it reports

1. An earlier survey of the role of mathematics in physical sciences distinguishes the mundane role of mathematics (numerical calculation, integration) from a "sovereign" role in which higher mathematics finds applications in subtle empirical problems, and notes that concept-driven revolutions are rare—Thomas Kuhn's list contains quantum mechanics and only six other major concept-driven revolutions in 500 years, against roughly twenty tool-driven revolutions in the same period by Dyson's count [6].

   from 2. Background and Related Work

2. Labeled as projections with stated assumptions: if annotation of one structure's feature vector and instantiation status takes between one and four expert-hours (an assumption; no source gives a figure), a 100-structure registry requires 100–400 expert-hours, or roughly 3–13 annotator-weeks at 30 hours per week—small enough that the study is bounded by annotation quality, not by scale.

   from 7. Practical Implications and Engineering Pathways

3. The ultrametric thesis argues that positional notation is inherently an ultrametric tree of nested cycles with the Archimedean line a derived abstraction, demonstrates with the observation that every base names itself "base-10" that a numeral string cannot internally specify its own interpretation rule, and—methodologically most relevant here—attaches explicit certainty labels to every non-textbook claim and states a concrete falsification experiment: a depth-2 tree of 8 transmon qubits with tree-only gates, whose central claim is falsified if tree geometry yields no statistically significant logical-error improvement over a 2D nearest-neighbour layout [11].

   from 2. Background and Related Work

4. Then $$ |I(S) \cup I(D)| = 4 + 4 - 3 = 5, \qquad d_{\mathrm{J}}(S,D) = 1 - \frac{3}{5} = 0.4. $$ With threshold $\theta = 0.5$, this pair qualifies as candidate.

   from 4.1 Worked example of the isomorphism measure

5. Sum: $$ P(X \leq 5) = 0.121577 + 0.270162 + 0.285179 + 0.190119 + 0.089779 + 0.031921 = 0.988737, $$ $$ P(X \geq 6) = 1 - 0.988737 = 0.011263 \approx 0.011. $$ Lowering the chance rate from $0.15$ to $0.10$ moves the tail probability from $0.067$ to $0.011$, crossing the $0.05$ threshold.

   from 4.4 Sensitivity to the chance rate

6. Hence $$ P(X \geq 7) = P(X \geq 6) - P_6 = 0.067303 - 0.045373 = 0.021930 \approx 0.022. $$ The sensitivity picture is therefore asymmetric in the observed count: one fewer instantiation ($k = 5$) raises the tail from $0.067$ to $0.170$ and destroys the signal, while one more ($k = 7$) lowers it from $0.067$ to $0.022$ and strengthens it past the conventional threshold.

   from 4.5 Sensitivity to the observed count

How it is done

1. We define a relational skeleton as the equivalence class of a mathematical structure under its invariant-preserving automorphisms; we define an isomorphism measure between skeletons and dynamical systems as a Jaccard-type overlap of invariant sets; and we define a retrospective selection test comparing observed instantiation counts against a chance null.

   from 1. Introduction

2. A dialogue-format treatment of moonshine in mathematical physics documents concrete cases where pure-mathematical objects carry physical weight: the two-qubit Bell inequality whose operator calculation gives $||C|| = 2\sqrt{2}$ against the classical bound of $2$, confirmed by experiment, and the representation of most sporadic groups as two-generator permutation groups acting on sets with computable Euler characteristic $2-2g = B+W+F-n$ [5].

   from 2. Background and Related Work

3. For finite invariant sets we define the Jaccard-type distance $$ d_{\mathrm{J}}(S, D) = 1 - \frac{|I(S) \cap I(D)|}{|I(S) \cup I(D)|}, $$ with $d_{\mathrm{J}} = 0$ when the invariant sets coincide and $d_{\mathrm{J}} = 1$ when they are disjoint.

   from 3.1 Objects and definitions

4. We assume: $N = 20$ structures in a pilot registry of pre-1850, pre-physical origin (complex numbers, quaternions, fiber-bundle-like constructs, non-Euclidean geometries, idempotent semirings, ultrametric spaces, and similar families; the exact list is a protocol output, Section 7). $k = 6$ of them later instantiated, a rate consistent with the case density documented in Section 2.

   from 3.3 Assumed inputs

What would falsify it

1. The framework converts a metaphysical claim into a falsifiable registry study, gives mathematics-ontology projects a concrete curation target, and proposes a minimal next test: an expert-annotated registry of pre-1850 structures scored against the same null model.

   from Abstract

2. The claim is deliberately reformulated so that it can fail: given a set of mathematical structures developed without physical motivation, one should be able to predict which ones later find physical application, and the hit rate should correlate with structural invariants rather than with historical or pragmatic factors such as the size of the community working on a structure.

   from 1. Introduction

3. A registry protocol and a minimal falsification path, adapted from the certainty-labeled and falsification-experiment methodology of the ultrametric thesis literature [11], together with readiness assessment and binding constraints (Section 7).

   from 1. Introduction

Where the claim stops

1. Its sharpest result—that a symmetry feature raises the conditional instantiation rate by a factor of $7.5$ with Fisher probability $\approx 0.018$—is exactly as strong as its assumed counts, and the sensitivity analysis shows how weak that is.

   from 6. Discussion

2. Every input ($N = 20$, $k = 6$, $p = 0.15$, the $5$-of-$8$ split) is a declared assumption standing in for a registry that does not yet exist.

   from 6. Discussion

3. No independent estimate of $p$ exists in the cited literature; until one is constructed from a real registry, the unconditional test cannot reject the null at all.

   from 6. Discussion

Where to read

1. Abstract238 words · 1 min
2. 1. Introduction732 words · 3 min
3. 2. Background and Related Work957 words · 4 min
4. 3. Methods644 words · 3 min
5. 4. Analysis1,178 words · 5 min
6. 5. Results344 words · 1 min
7. 6. Discussion595 words · 3 min
8. 7. Practical Implications and Engineering Pathways658 words · 3 min
9. 8. Conclusion235 words · 1 min
10. Provenance and AI Involvement240 words · 1 min