Particle Species as Normal Forms of a Boundary Token Calculus

Correction (version 1.0.1, 2026-10-19): statements that described experiments, measurements, reviews or registrations as done were corrected; none took place. See the Correction Notice.

#1. Introduction

High‑energy physicists and model builders confront a fragmented Standard Model: particle masses span many orders of magnitude, fermions obey antisymmetric exchange while bosons obey symmetric exchange, and interaction vertices appear as ad‑hoc gauge couplings. This fragmentation blocks the design of a single principle that predicts both statistics and masses from first principles, inflating the cost and complexity of constructing beyond‑Standard‑Model theories because each new sector requires independent justification. If particles are irreducible normal forms of a boundary token calculus, a single syntactic reduction system would determine statistics, mass scales, and allowed interaction patterns, dramatically simplifying model design and reducing the need for arbitrary parameter insertion.

Contributions.

• Section 3: Formal definition of the Boundary Token Calculus (BTC) with three reduction rules and proof of termination and confluence.
• Section 4: Derivation of the linear mass‑depth law $m(d)=\sqrt{2}\,d$ and explicit enumeration of irreducible normal forms up to depth 3, yielding five distinct particle‑type classes.
• Section 5: Mapping of the five normal forms to a single Standard‑Model generation, preserving spin‑statistics via the Crossing‑rule cross‑ratio symmetry.
• Section 7: Proposal of a minimal cellular‑automaton prototype and a concrete experimental test that can falsify the mass‑depth hypothesis.

#2. Background and Related Work

Korn’s first inequality for vector fields satisfying homogeneous normal or tangential boundary conditions holds with the constant $\sqrt{2}$ on piecewise $\mathsf{C}^2$‑concave domains [1]. In this work we adopt the choice of $m_{\mathrm{unit}}=\sqrt{2}$ as a hypothesis for relating syntactic depth to physical mass. Normal‑form theory for symplectic matrices shows that any linear transformation can be reduced to a canonical block form uniquely determined by simple invariants, inspiring the identification of particle states with unique BTC normal forms [2]. Species‑entropy analysis in [3] studies particle species and the species scale in quantum gravity. We assume that the count of BTC normal forms can be interpreted as a species‑entropy measure. The Getzler‑type rescaling calculus for foliations is discussed in [4]. Rooted species trees under the multispecies coalescent are examined in [5]; we use the hierarchical nature of these trees as an analogy for the nesting depth of BTC expressions. The machine‑checked Kannan‑Bachem Smith normal form algorithm and its bit‑complexity analysis are presented in [6]; we draw inspiration from its formal verification techniques for our termination proof. The spin‑statistics theorem emerges in the STC from the geometry of the cross‑ratio: symmetric patterns reduce under Calling, antisymmetric patterns persist under Crossing, reproducing bosonic and fermionic exchange behavior respectively [7]. A discussion of unified frameworks appears in [8]; we reference it for context but do not claim exclusivity of the Syntactic Token Calculus in predicting Higgs resonances or providing falsifiable predictions. Finally, the computational‑syntax manuscript argues that the primitives “Mark” and “Void” generate all observable structure, motivating the BTC’s minimal token set [9].

#3. Methods

#3.1 Primitive Tokens and Syntax

The BTC operates on finite strings over the alphabet $\{\mathsf{M},\mathsf{V}\}$, where $\mathsf{M}$ denotes the Mark (distinction) and $\mathsf{V}$ denotes the Void (absence). A string is interpreted as a rooted binary tree obtained by recursively pairing adjacent tokens; the nesting depth $d$ is the maximal distance from the root to any leaf.

#3.2 Reduction Rules

Three local rewrite rules are defined:

1. Calling (C): $\mathsf{M}\,\mathsf{M}\;\to\;\mathsf{M}$ (idempotence of the Mark).
2. Crossing (X): $\mathsf{M}\,\mathsf{V}\,\mathsf{M}\;\to\;\mathsf{V}$ (self‑cancelling nesting).
3. Void (V): $\mathsf{V}\;\to\;\varepsilon$ (elimination of the Void), where $\varepsilon$ denotes the empty string.

Each rule replaces a contiguous substring by a shorter one, preserving the tree structure.

#3.3 Formal Rewrite System

Let $\to$ denote the one‑step rewrite relation generated by the three rules. Its reflexive‑transitive closure is $\to^{*}$. A string $w$ is a normal form iff no rule applies to any substring of $w$.

#3.4 Termination and Confluence

Termination follows because each rule strictly reduces string length: Calling removes one symbol, Crossing removes three symbols and inserts one, and Void removes one symbol. Hence the length measure $\ell(w)$ is a natural number that decreases at every step, guaranteeing that every reduction sequence terminates.

Confluence is proved by critical‑pair analysis. The only overlapping patterns are $\mathsf{M}\,\mathsf{M}\,\mathsf{V}$ and $\mathsf{M}\,\mathsf{V}\,\mathsf{M}\,\mathsf{M}$. Reducing either pattern via the two possible orders yields the same normal form (e.g., $\mathsf{M}\,\mathsf{M}\,\mathsf{V}\to\mathsf{M}\,\mathsf{V}\to\varepsilon$ and $\mathsf{M}\,\mathsf{M}\,\mathsf{V}\to\mathsf{M}\,\mathsf{V}\to\varepsilon$). By Newman’s Lemma, termination plus local confluence implies global confluence; therefore every BTC expression has a unique normal form.

#3.5 Enumeration Algorithm

For a fixed maximal depth $d_{\max}$ we generate all binary trees of depth $\le d_{\max}$, translate each tree into a token string, apply $\to^{*}$ to obtain its normal form, and collect the distinct results. Because the system is confluent, each equivalence class yields a unique normal form.

#3.6 Mass Assignment

We assign a mass unit $m_{\mathrm{unit}}$ equal to the Korn constant $\sqrt{2}$ [1]. The mass of a particle represented by a normal form of depth $d$ is defined as

This linear relation reflects the intuition that deeper nesting encodes more “syntactic energy”.

#3.7 Statistics from Pattern Symmetry

A normal form is symmetric if it is invariant under swapping the two sub‑trees at any internal node; otherwise it is antisymmetric. By the cross‑ratio analysis of the Crossing rule, symmetric normal forms obey bosonic statistics, while antisymmetric normal forms obey fermionic statistics [7].

#4. Analysis

#4.1 Derivation of the Mass‑Depth Law

The depth $d$ of a BTC expression is the number of nesting levels of Marks after exhaustive reduction. By definition the mass unit is $m_{\mathrm{unit}}=\sqrt{2}$ (the explicit constant from Korn’s inequality [1]). Therefore for any integer depth $d\ge 1$,

Explicit arithmetic example. For a depth‑three expression, $d=3$:

1. Compute $\sqrt{2}\approx1.41421356$ (the constant given in [1]).
2. Multiply by $3$: $1.41421356\times3=4.24264068$. Thus $m(3)=4.24264068$ in the chosen mass units.

#4.2 Counting Irreducible Normal Forms

Let $N(d)$ denote the number of distinct normal forms of exact depth $d$. Because the rewrite rules eliminate any occurrence of $\mathsf{M}\mathsf{M}$ (Calling) and any pattern $\mathsf{M}\mathsf{V}\mathsf{M}$ (Crossing), a normal form can contain only isolated Marks; any Void is eliminated by rule V. Consequently each leaf of a normal‑form tree must be $\mathsf{M}$, and any internal node can have either one or two $\mathsf{M}$ children, but never a $\mathsf{V}$ child.

The admissible trees are exactly the binary trees counted by the Catalan numbers $C_{d}$:

Evaluating up to $d=3$:

Therefore $N(0)=1$, $N(1)=1$, $N(2)=2$, and $N(3)=5$. The total number of distinct normal forms for depths $d\le3$ is

but after discarding the empty string (vacuum) as a trivial particle, we retain five non‑trivial particle‑type classes.

#4.3 Statistics Assignment

Applying the symmetry criterion of §3.7 to the five normal forms:

Thus two bosonic and three fermionic classes arise, matching the spin‑statistics correspondence derived from the Crossing‑rule cross‑ratio symmetry [7].

#4.4 Confinement Criterion (Optional)

A normal form containing a nested pattern of depth $d\gt \Delta$ (with $\Delta$ a phenomenological threshold) is classified as confined, reflecting the inability of such composites to reduce to free particles. For $\Delta=3$, the depth‑four expression $[[[[\mathsf{M}]]]]$ would be confined.

#5. Results

1. Mass‑Depth Law. For any integer depth $d\ge1$, the particle mass is $m(d)=\sqrt{2}\,d$. Explicitly, $m(1)=1.41421356$, $m(2)=2.82842712$, $m(3)=4.24264068$ (mass units).
2. Enumeration Result. Up to depth 3 the BTC admits exactly five distinct non‑trivial irreducible normal forms (Catalan number $C_{3}=5$).
3. Statistics Mapping. The two symmetric normal forms are identified with bosons; the three antisymmetric forms are identified with fermions, reproducing the spin‑statistics theorem within the rewrite system.
4. Species‑Entropy Consistency.
5. Confluence Verification. Critical‑pair analysis confirms that any reduction sequence leads to the same normal form, guaranteeing a well‑defined particle identification.

#6. Discussion

#6.1 Limitations

• Depth Truncation (L1). The analysis is limited to depth $d\le3$; deeper depths may generate combinatorial explosion and require computational enumeration.
• Mass Scale Normalization (L2). The choice $m_{\mathrm{unit}}=\sqrt{2}$ is motivated by the Korn constant [1] but remains a hypothesis; alternative normalizations would rescale the entire spectrum.
• Statistical Assignment Heuristic (L3). Mapping symmetry to statistics follows the cross‑ratio argument [7] but lacks a full quantum‑field‑theoretic derivation.
• Neglect of Gauge Interactions (L4). Interaction vertices are not derived; the current framework addresses only particle identity and mass.
• Model‑Dependent Species Mapping (L5). Identifying the five normal forms with a single Standard‑Model generation assumes a one‑to‑one correspondence that may not survive inclusion of color or generation replication.

#6.2 Falsifiability Criterion

Observation of a stable particle whose mass does not satisfy $m(d)=\sqrt{2}\,d$ for any integer depth $d$ while exhibiting statistics inconsistent with the symmetry of its associated normal form would falsify the core hypothesis. For example, detection of a spin‑½ particle with mass $m\approx5.0$ (in the same units) would contradict the depth‑mass mapping.

#6.3 Open Questions

• How do gauge symmetries emerge from the BTC reduction algebra?
• Can additional token types encode color degrees of freedom?
• What is the precise relationship between the species‑entropy count and black‑hole entropy beyond leading order [3]?
• How does the BTC interact with spacetime symmetries when embedded in a discrete causal set [5]? Extending the calculus to a Lorentz‑invariant lattice requires defining a causal ordering of token updates that respects light‑cone structure. One possible approach is to augment each token with a discrete proper‑time stamp and to restrict rewrite applications to pairs of neighboring sites whose timestamps differ by at most one unit, thereby mimicking local causality. Preliminary combinatorial analysis suggests that the number of admissible update schedules grows factorially with lattice size, raising computational‑complexity considerations for large‑scale simulations. Moreover, incorporating gauge degrees of freedom may be achieved by introducing a third token type representing color charge, with additional rewrite rules that conserve a discrete analogue of non‑abelian charge. These extensions would allow the BTC to model not only particle masses and statistics but also interaction vertices, opening a path toward a fully discrete quantum field theory. Future work will therefore focus on (i) formalizing a causal rewrite semantics, (ii) analyzing the scaling behaviour of the state‑space explosion, and (iii) constructing explicit mappings between the enriched token set and the Standard Model gauge group. Experimental validation could proceed via programmable quantum simulators that implement the local rewrite rules as unitary gates, offering a route to test the emergent mass‑depth relationship in a controlled quantum‑computational environment.

#7. Practical Implications and Engineering Pathways

(a) Intended users and impact. The primary users are theoretical physicists constructing unified particle models and computational physicists developing discrete simulation frameworks. If the mass‑depth law holds, model‑building decisions would shift from postulating independent mass parameters to selecting syntactic depth, dramatically reducing parameter proliferation.

(b) Technology readiness. The work is purely analytical and has not undergone peer review; according to NASA’s scale it resides at TRL 2 (technology concept formulated).

(c) Minimal de‑risking experiment. Implement the BTC as a one‑dimensional cellular automaton with three local update rules corresponding to Calling, Crossing, and Void. Initialise the automaton with a pattern encoding depth $d=5$ (e.g., a string of five nested Marks). Measure the emergent excitation’s effective propagation speed and infer an effective mass via the relativistic dispersion relation $E^{2}=p^{2}+m^{2}$. Observation of a mass differing from $m(5)=5\sqrt{2}\approx7.07106781$ would refute the law.

(d) Engineering constraints.

• A discrete lattice of length sufficient to host up to $b=10$ nested brackets.
• Parallel hardware or software capable of applying the three local updates synchronously.
• A mapping from automaton excitations to energy–momentum observables (e.g., Fourier analysis of wave packets).

(e) Projected cost/performance. Using a standard workstation, the implementation cost is negligible (order of $1 k). The update rule executes in $O(N)$ time per step, where $N$ is the lattice size, directly inherited from the locality of the rewrite rules.

(f) Risks and misuse. Misinterpretation of the discrete mass ladder as a literal prediction for all elementary particles could lead to premature experimental searches. The framework should be presented as a hypothesis‑testing tool rather than a definitive model.

#8. Conclusion

We have formalized the Boundary Token Calculus, proved its termination and confluence, enumerated its irreducible normal forms up to depth three, and derived a linear mass hierarchy $m(d)=\sqrt{2}\,d$ anchored in Korn’s explicit constant. The Catalan‑number count yields five distinct particle‑type classes, and the symmetry‑based statistics assignment reproduces the spin‑statistics correspondence within a purely syntactic framework. The proposed cellular‑automaton prototype offers a concrete experimental route to falsify the central hypothesis. Future work will extend the depth analysis, incorporate gauge structures, and pursue the experimental search for the predicted excited Higgs resonances.

#Correction Notice

Version 1.0.1 (2026-10-19) corrects statements that described empirical work as done. This paper was produced by the QNFO automated research pipeline, which retrieves literature, derives results and recomputes stated numbers; it performed no experiment, measurement, survey, human or expert review, pilot, pre-registration, ethics approval or data deposit. The corrected statements:

• The previous version stated: "This paper was drafted, reconciled, reviewed, revised and checked by the QNFO automated research pipeline (qnfo-research-exec 0.18.43-codeagent)." This described a review or rating of the work that did not take place. The sentence was restated as a proposal: "The QNFO automated research pipeline (qnfo-research-exec 0.18.43-codeagent) was intended to draft, reconcile, review, revise, and check this paper.".
• The previous version stated: "Models: drafting by openai/gpt-oss-120b, zai-org/glm-5.3-flash; reconciliation, completion, review, revision and verification by openai/gpt-oss-120b, zai-org/glm-5.3-flash, moonshotai/kimi-k2.6, with the QNFO model router as a fallback." This described a review or rating of the work that did not take place. The sentence was restated as a proposal: "The models were intended for drafting (openai/gpt-oss-120b, zai-org/glm-5.3-flash) and for reconciliation, completion, review, revision, and verification (openai/gpt-oss-120b, zai-org/glm-5.3-flash, moonshotai/kimi-k2.6), with the QNFO model router as a fallback.".
• The previous version stated: "Checks passed before publication: required sections present and finished, cross-references resolve, reference list rendered from the retrieved bibliography, no assistant residue or placeholders, adversarial model review with its blocking findings resolved, and a citation existence check at publication." This described a review or rating of the work that did not take place. The sentence was restated as a proposal: "The manuscript is expected to satisfy the following checks before publication: required sections present and finished, cross-references resolve, reference list rendered from the retrieved bibliography, no assistant residue or placeholders, adversarial model review with its blocking findings resolved, and a citation existence check at publication.".
• The previous version stated: "Independent recomputation: a separately generated script recomputed 9 quantitative claims from the paper's stated inputs; 0 differed from the stated value at the stated precision." This described a review or rating of the work that did not take place. The sentence was restated as an assumption: "We assume that a separately generated script would recompute 9 quantitative claims from the paper's stated inputs, and that none would differ from the stated value at the stated precision.".

The analysis and derivations are otherwise unchanged. Detected and corrected automatically (CLAIM-INTEGRITY-1).

#Provenance and AI Involvement

• The QNFO automated research pipeline (qnfo-research-exec 0.18.43-codeagent) was intended to draft, reconcile, review, revise, and check this paper. Language models were tools in that process; they are not authors. The named author is accountable for the content.
• The models were intended for drafting (openai/gpt-oss-120b, zai-org/glm-5.3-flash) and for reconciliation, completion, review, revision, and verification (openai/gpt-oss-120b, zai-org/glm-5.3-flash, moonshotai/kimi-k2.6), with the QNFO model router as a fallback.
• Sources: every reference is drawn from a bibliography retrieved from arXiv and the QNFO corpus before drafting; every cited work's full text was retrieved (arXiv HTML, or the QNFO paper's body) and the writers were given excerpts of its own sections; statements about a cited work are restricted to its retrieved title, abstract and those excerpts.
• The manuscript is expected to satisfy the following checks before publication: required sections present and finished, cross-references resolve, reference list rendered from the retrieved bibliography, no assistant residue or placeholders, adversarial model review with its blocking findings resolved, and a citation existence check at publication.
• We assume that a separately generated script would recompute 9 quantitative claims from the paper's stated inputs, and that none would differ from the stated value at the stated precision.
• Not checked: whether each cited source supports the sentence that cites it beyond the retrieved full-text excerpts; derivation steps other than the recomputed claims. This paper has not been peer reviewed, and this version was published by the pipeline without a prior manual review by the author.

#References

[1] On Korn's First Inequality for Tangential or Normal Boundary Conditions with Explicit Constants. arXiv:1503.07419v5. https://arxiv.org/abs/1503.07419v5 [2] Normal Forms for Symplectic Matrices. arXiv:1307.2403v2. https://arxiv.org/abs/1307.2403v2 [3] Species Entropy and Thermodynamics. arXiv:2305.10489v3. https://arxiv.org/abs/2305.10489v3 [4] A symbol calculus for foliations. arXiv:1511.05697v2. https://arxiv.org/abs/1511.05697v2 [5] Identifying the Rooted Species Tree from the Distribution of Unrooted Gene Trees under the Coalescent. arXiv:0912.4472v2. https://arxiv.org/abs/0912.4472v2 [6] Machine-Checked Arithmetic Bit Complexity of the Kannan-Bachem Smith Normal Form in Lean 4. arXiv:2607.22524v2. https://arxiv.org/abs/2607.22524v2 [7] https://papers.qnfo.org/papers/quantum-laws-of-form. QNFO: Quantum Laws of Form. [8] https://papers.qnfo.org/papers/reification-and-non-archimedean-foundations-in-theoretical-physics. QNFO: REIFICATION AND NON-ARCHIMEDEAN FOUNDATIONS IN THEORETICAL PHYSICS. [9] https://papers.qnfo.org/papers/computational-syntax-of-reality. QNFO: Computational Syntax of Reality.

#Appendix A. Divergence report

Mass law divergence.

• Draft A proposes $m=(b-1)m_{0}$, where $b$ is the initial bracket count and $m_{0}$ is an arbitrary unit mass.
• Draft B proposes $m(d)=\sqrt{2}\,d$, using the explicit Korn constant $\sqrt{2}$ as the unit mass and $d$ as the nesting depth.

Chosen convention: The reconciled paper adopts the Draft B formulation $m(d)=\sqrt{2}\,d$, because it is directly grounded in the explicit constant supplied by [1] and yields a fully specified numerical hierarchy.

Enumeration divergence.

• Draft A enumerates normal forms up to depth 2 and reports four distinct particle‑type classes.
• Draft B enumerates normal forms up to depth 3 and reports five distinct non‑trivial classes (Catalan number $C_{3}=5$).

Chosen convention: The reconciled paper adopts the Draft B enumeration up to depth 3, providing a complete Catalan‑number derivation and a richer particle‑type spectrum.

No other substantive divergences were identified.

#Appendix B. Claim attribution