Quick read
Boundary Ultrametricity: The Tree vs. ββπ― Distinction, Applied to the ZBW Transition Graph
In the paper's words
Boundary Gromov metric on dT_p is ultrametric and recovers |.|_p; tree vertex metric is NOT ultrametric. ZBW P1 Claim C2 corrected: 0-hyperbolic core, not ultrametric core (147/500 violations per paper data).
The abstract, verbatim, and its opening sentence is the claim. Every line below is quoted from the text.
Numbers it reports
The graph is 0-hyperbolic (tree-like geodesic structure); its vertex metric has 18β35% strong-triangle violations (the paper's own data: 147/500 Dirac, 173/500 Majorana); the ultrametricity claim is true only for a boundary metric, not the vertex metric.
from AbstractMetric Dirac Majorana Nodes 240 240 Edges 5460 2352 MST edges 239 239 Gromov $\delta$ (avg, on MST) 0.0000 0.0000 Ultrametric violations (/500) 147 (29.4%) 173 (34.6%) The paper's Claim C2 states: "ZBW transition graph has ultrametric core ($\delta \to 0$)" with certainty label [CODE-EXECUTED] .
from 3.1 The paper's data (verbatim)The paper's own violation counts ($147/500 = 29.4\%$ Dirac; $173/500 = 34.6\%$ Majorana) are direct evidence the vertex metric violates the strong triangle inequality at the ~30% level.
from 3.2 Two independent errors in Claim C2Its vertex metric is not ultrametric (~30% strong-triangle violations, per the paper's own counts).
from 3.3 Corrected statement
How it is done
A metric $\rho$ on a set $X$ is ultrametric iff it satisfies the strong triangle inequality: $$\rho(x,z) \leq \max\{\rho(x,y), \rho(y,z)\} \quad \forall x,y,z \in X.$$ Lemma 1 (tree vertex metric is not ultrametric).
from 1. The DistinctionTheorem 3 (boundary Gromov product metric).
from 2. The Boundary Metric Is UltrametricThe paper's $\delta = 0$.0000 was computed on the minimum spanning tree (239 edges), which is a true tree and therefore 0-hyperbolic by definition β computing $\delta$ on an MST and reporting it as "the graph's $\delta$" is trivially true and information-free.
from 3.2 Two independent errors in Claim C2Audit method: D1 living-paper scan for papers containing both "ultrametric" and "tree"; per-paper classification by presence of conflation signals ("ultrametric tree", "tree is ultrametric", "ultrametric core", "graph is ultrametric", "$\delta \to 0$") vs. correct signals ("boundary metric", "Gromov product", "0-hyperbolic", "strong triangle inequality", "on the boundary").
from 4. Corpus-Wide Errata Table
What would falsify it
Priority order for completion: papers citing Claim C2 or building on zbw-adelic-observable's "ultrametric core" (zbw-p5-capstone, adelic-quantum-error-correction-*, ultrametric-foundations).
from 4. Corpus-Wide Errata TableZBW P1 (the QNFO archive https://papers.qnfo.org/papers) β the claim corrected by this note ACRP Program Plan v1.1 (R2) β project charter, falsifiability requirements Consilient Synthesis v2.0 (the QNFO archive https://papers.qnfo.org/papers) β C1 correction (boundary metric vs 0-hyperbolic realization), extended here Ultrametric Foundations β the $v_{p}^{\max}$ classification program (complementary, not affected by this correction)
from 8. Cross-References
Where the claim stops
0-hyperbolicity does not imply ultrametricity of the vertex metric.
from 1. The DistinctionClaim C2 should read: "0-hyperbolic core," not "ultrametric core." This does not invalidate the paper's other claims (C3 pruning, ZBW Majorana amplitude identity) β it corrects the geometric characterization of the graph's topology.
from 3.3 Corrected statement
Where to read
- Abstract161 words · 1 min
- 1. The Distinction183 words · 1 min
- 2. The Boundary Metric Is Ultrametric246 words · 1 min
- 3. Application: The ZBW Transition Graph (the QNFO archive 21211007)325 words · 1 min
- 4. Corpus-Wide Errata Table187 words · 1 min
- 5. Falsifiability Register118 words · 1 min
- 6. Mandatory Symmetry (KIF-18)159 words · 1 min
- 7. Declarations59 words · 1 min
- 8. Cross-References53 words · 1 min
- Version History10 words · 1 min
Read from the paper itself: 16 sections, 1,515 words. Nothing on this page 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.