Vertex-Anchored Geometry: Discrete Extremal Points as the Organizing Primitive of Non-Archimedean Space

In the paper's words

Non-Archimedean (ultrametric) geometry, in which the strong triangle inequality d(x,z) ≤ max\d(x,y),d(y,z)\ replaces the Euclidean one, lacks the smooth infinitesimal structure on which most physical and geometric intuition rests. We argue that in this setting the correct organizing primitive is not the point or the ball but the vertex: the discrete extremal point of a simplicial or polytopal complex. We support this thesis in three registers.

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

Numbers it reports

1. Section 4 carries out the explicit derivations: the ball–tree correspondence with ball counts $N_k = q^k$, the quantization of apparent size with step ratio $q$, and the redundancy theorem for polystochastic line constraints with full arithmetic for the cases $(n,d) = (4,3)$ and $(3,4)$.

   from 1. Introduction

How it is done

1. (i) Geometrically, we derive that ultrametric balls are simultaneously clopen and centered at every interior point, so that the geometry collapses onto a rooted tree whose nodes — the vertices — carry all metric information; ball counts grow as $N_k = q^k$ at depth $k$ for residue degree $q$.

   from Abstract

2. Section 4 carries out the explicit derivations: the ball–tree correspondence with ball counts $N_k = q^k$, the quantization of apparent size with step ratio $q$, and the redundancy theorem for polystochastic line constraints with full arithmetic for the cases $(n,d) = (4,3)$ and $(3,4)$.

   from 1. Introduction

3. The ball–tree correspondence of Lemma 1 and Section 4.2 is derived here from the strong triangle inequality alone.

   from 2. Background and Related Work

4. Ultrametric spaces and trees.

   from 3. Methods

What would falsify it

1. Section 6 discusses limitations and falsification criteria, and Section 7 concludes.

   from 1. Introduction

2. Future work should seek a full linear‑algebraic proof of constraint redundancy and explore physical models that could test the apparent‑size quantization prediction.

   from 6. Discussion

Where the claim stops

1. The primary limitation is the reliance on a very small set of explicit cases for the redundancy phenomenon; a general proof for all $d\gt n$ remains open.

   from 6. Discussion

2. Future work should seek a full linear‑algebraic proof of constraint redundancy and explore physical models that could test the apparent‑size quantization prediction.

   from 6. Discussion

3. While these works do not directly address ultrametric geometry, they share a conceptual emphasis on discrete combinatorial building blocks—cubic vertices—that generate the full interaction structure.

   from 2. Background and Related Work

Where to read

1. Abstract221 words · 1 min
2. 1. Introduction338 words · 1 min
3. 2. Background and Related Work774 words · 3 min
4. 3. Methods398 words · 2 min
5. 4. Analysis610 words · 3 min
6. 5. Results75 words · 1 min
7. 6. Discussion84 words · 1 min
8. 7. Conclusion73 words · 1 min
9. Appendix A. Divergence report143 words · 1 min
10. Appendix B. Claim attribution120 words · 1 min