Quick read · plain language
A New Way to Build Discrete Space and Time
A plain-language version of “p‑adic Spacetime and the Evading of Lorentz‑Invariance No‑Go Theorems”
The short version
Scientists found a way to build a discrete model of space and time that avoids a major blocking theorem. They used a special kind of geometry called p-adic geometry, where every point in a ball is at its center. The model keeps important symmetries while using a finite number of points at each step.
The problem with old approaches
Scientists want to combine two big ideas. One idea says space and time are smooth and continuous. The other idea says matter comes in tiny discrete packets. These two ideas clash when people try to build a theory of quantum gravity.
A group of theorems called "no-go theorems" blocked progress. These theorems said you cannot build a discrete space-time model that also respects a key symmetry. This symmetry means no single point of view is special. All moving observers see the same laws of physics.
The old proofs of these theorems used ordinary geometry. They relied on properties that do not hold in a different kind of geometry.
A different kind of geometry
The paper uses p-adic geometry. This is a geometry where distances work in a strange way, unlike ordinary geometry where a ball has a single center. Every point in a ball is at the center of that ball. This is like a tree where branches never come back together.
The authors define two key ideas for this new setting. First, they define "local finiteness." This means only a finite number of points sit near any given point. Second, they define invariance under a group of transformations. This group preserves a quadratic form, like a stretched version of a sphere.
The tree model
The authors use a tree as their model of space and time. This is a regular tree where each point connects to a fixed number of neighbors. For a prime number, each point has that prime plus one neighbors.
The tree has a root. Points at the same distance from the root form a level. The number of points at a given level is the prime plus one, times the prime raised to that level minus one.
The total number of points within a given depth grows quickly. For the prime two and depth ten, there are about three thousand points.
What was found
Two points are "comparable" if one lies on the path from the root to the other. This is like saying one point is an ancestor of the other. The authors count these pairs.
For the prime two and depth ten, there are about twenty-eight thousand comparable pairs. But most pairs are not comparable. The fraction of comparable pairs is very small. As the depth grows, this fraction drops to zero.
This sparseness of causal ordering is a key feature. It means the model does not impose a strong preferred time direction.
The authors also show the tree is invariant under a full symmetry group. This group acts on the tree and preserves its structure. The old no-go theorems fail because their assumptions break down in this setting.
What the paper does not show
The model is only a static scaffold. It does not include dynamics. There is no rule for how things move or change.
The link between tree depth and physical time is only a guess. No experiment connects them.
The prime is a free choice. The paper does not explain why nature would pick one prime over another.
The model does not build a full space-time distance rule. The light-cone structure is discrete and does not match continuous light-ray directions.
The emergence of smooth space-time from the discrete model is assumed but not proved.
The paper also leaves open how to add matter fields and interactions. It does not give a dynamical law for emergent relativistic propagation. It does not link the prime to observable constants.
Words used here
- p-adic geometry
- a way of measuring distances where every point in a ball is at its center, unlike ordinary geometry where a ball has a single center
- non-Archimedean
- a geometry where distances work in a strange way, unlike ordinary geometry where a ball has a single center
- Bruhat-Tits tree
- an infinite branching tree used as a discrete model of space
- p-adic orthogonal group
- the full symmetry group that acts on the tree and preserves its structure
- Lorentzian metric
- a full space-time distance rule
- null directions
- light-ray directions
- locally finite
- only a finite number of points sit near any given point
- no-go theorem
- a proof that something cannot be done under given assumptions
- quadratic form
- a rule that assigns a number to each point, like a stretched version of distance squared
- ultrametric
- a way of measuring where the longest leg of a triangle always determines the whole size
Learn more in plain language
- Quantum gravitySimple English Wikipedia
- Lorentz scalarWikipedia (English, more technical)
- Symmetry groupWikipedia (English, more technical)
This plain-language version was written by an AI model from the text of the paper and checked against plain-language rules: everyday words, no mathematics, no unexplained names. It leaves details out and can still be wrong; the paper is the source of record. To report a problem, open the paper, select the passage and choose Report.
For specialists: the technical digest, quoted from the paper
In the paper's words
The incompatibility between a discrete quantum substrate and the continuous Lorentz‑invariant manifolds of general relativity has motivated a series of no‑go theorems that forbid locally finite, Poincaré‑invariant networks on Archimedean Minkowski space. These theorems block the construction of fundamentally discrete spacetime models that retain the observed absence of a preferred inertial frame. Existing proofs rely on Archimedean geometry, ultrametric norms, and compactness properties that do not hold in a p‑adic setting.
The abstract, verbatim; every line below is quoted from the text.
What it claims
that an invariant locally finite graph exists on Q_p^n and thereby evades the Archimedean no‑go theorem—would be falsified if:
Numbers it reports
It derives exact formulas for the number of events at depth $d$, the total number of events within a depth‑$D$ ball, and the number of comparable ordered pairs, all with explicit arithmetic. [10] maps the adjacency operator of the Bruhat–Tits tree to an effective Hamiltonian, derives a Lieb‑Robinson bound that yields a dimensionless speed of light, and shows how Lorentz invariance can emerge as a continuum symmetry from the underlying combinatorial geometry. [11] constructs a branching $p$‑adic fractal model that reproduces Minkowski‑type dimensions and emergent Schrödinger dynamics, further supporting the plausibility of non‑Archimedean foundations for spacetime physics.
from 2. Background and Related WorkEvent budget – Equation (3) yields $V_{10}=3070$ events within depth 10.
from 5. ResultsEquiangular line bound – From [5] the $p$‑adic inequality $$ |n|^{2}\le |d|\max\{|n|,\gamma^{2}\} \tag{11} $$ implies, for $d=5$ and $\gamma=0.5$ (both $p$‑adic absolute values equal 1), that $|n|^{2}\le5$.
from 5. ResultsThe projected computational cost is therefore $\sim10^{4}$ CPU‑seconds under the stated assumptions.
from (e) Order‑of‑Magnitude Projections
How it is done
We define a $p$‑adic analogue of local finiteness and invariance under the $p$‑adic orthogonal group preserving a quadratic form, then derive combinatorial properties of the Bruhat–Tits tree that serve as a concrete $p$‑adic spacetime scaffold.
from AbstractWe prove that the Archimedean no‑go theorem fails in the $p$‑adic setting by constructing an invariant locally finite graph on the Bruhat–Tits tree (Sec.
from 1. IntroductionThe result shows that $p$‑adic statistical‑mechanical systems can display qualitatively different behavior from their real counterparts, highlighting the special role of the prime parameter. [3] introduces $p$‑adic Stark regulators and formulates an Iwasawa‑Greenberg main conjecture for Artin motives, providing a framework for $p$‑adic $L$‑functions that parallels Archimedean analytic number theory. [4] proves a $p$‑adic version of Hilbert’s theorem 90, establishing that semi‑linear representations over a $p$‑adic field become trivial after passing to a suitable finite Galois extension.
from 2. Background and Related WorkThe rooted $(p+1)$-regular Bruhat–Tits tree $\mathcal{T}_p$ provides a canonical discrete space on which $O_Q(\mathbb{Q}_p)$ acts transitively on vertices at a given depth.
from 3.3. Bruhat–Tits Tree as a Model
What would falsify it
The main claim—that an invariant locally finite graph exists on $\mathbb{Q}_p^n$ and thereby evades the Archimedean no‑go theorem—would be falsified if: A rigorous proof showed that any $p$‑adic orthogonal transformation necessarily maps a locally finite graph to one with infinite degree, contradicting Sec.
from 6.2. FalsifiabilityCan the prime $p$ be linked to observable constants, perhaps via the phase‑transition threshold of [2]?
from 6.3. Open QuestionsThis demonstrates that the Archimedean no‑go arguments do not extend to non‑Archimedean geometry, opening a pathway for discrete fundamental physics without observable preferred frames.
from Abstract
Where the claim stops
While [2] suggests a distinguished role for $p=3$ in a Potts model, the present analysis does not derive a physical criterion for choosing $p$.
from 6.1. LimitationsAbsence of Lorentz structure – Although the graph is invariant under the $p$‑adic orthogonal group, a full Lorentzian metric with null cones is not constructed; the $p$‑adic light‑cone of [6] is discrete and does not reproduce continuous null directions.
from 6.1. LimitationsContinuum limit – The emergence of smooth spacetime and standard relativistic physics from the discrete model is assumed but not proved.
from 6.1. Limitations
Where to read
- Abstract186 words · 1 min
- 1. Introduction242 words · 1 min
- 2. Background and Related Work415 words · 2 min
- 3. Methods277 words · 1 min
- 4. Analysis523 words · 2 min
- 5. Results174 words · 1 min
- 6. Discussion246 words · 1 min
- 7. Practical Implications and Engineering Pathways292 words · 1 min
- 8. Conclusion130 words · 1 min
- Provenance and AI Involvement225 words · 1 min
Read from the paper itself: 32 sections, 2,848 words. Nothing in this digest is written by a model; a line that is not a sentence of the paper is not shown. Have a specific question? Ask this paper.