New Math for Studies Where Everything Connects

In the paper's words

Standard parametric statistics assume independent, identically distributed (i.i.d.) observations, an assumption that fails when all events share a common causal ancestry encoded by an ultrametric (p‑adic) structure. This paper addresses the gap between classical significance testing and a fully connected reality in which dependence follows a Bruhat–Tits tree. We formalize a p‑adic probability measure on such a tree, derive ultrametric analogues of the central limit theorem and hypothesis‑testing formulas, and compute the variance inflation for a binary hierarchical dataset of depth three.

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

Numbers it reports

1. The analytical result shows that the variance of the sample mean under ultrametric dependence is $0.3625$, compared with the i.i.d. variance $0.125$, a factor of $2.9$ increase that dramatically deflates classical $p$‑values.

   from Abstract

2. Clinical drug trials, evolutionary genomics, and large‑scale social‑science surveys all rely on $p$‑values to decide whether an observed effect is “statistically significant.” In practice, the decision is made by researchers, regulatory agencies, and policy makers who allocate billions of dollars to interventions that pass a $p\lt 0.05$ threshold.

   from 1. Introduction

3. Under the i.i.d. assumption, variance would be $$ \operatorname{Var}_{\text{iid}}(\bar{X})=\frac{\sigma^{2}}{N}=\frac{1}{8}=0.125. \tag{5} $$ The inflation factor is $$ \frac{0.3625}{0.125}=2.9. \tag{6} $$ Thus, classical tests underestimate the sampling variance by a factor of $2.9$, leading to overly optimistic $p$‑values.

   from 4.4 Comparison with i.i.d. Variance

4. Parameter Value Branching factor $b$ $3$ Depth $d$ $2$ Number of leaves $N=b^{d}=3^{2}=9$ — Marginal variance $\sigma^{2}$ $1$ (unit variance) Base correlation $\rho_{0}$ $0.4$ (root‑only sharing) Maximal sibling correlation $\rho_{1}$ $0.7$ (siblings) 2.1 Pair counts Depth $\ell=0$ (root) : $M_{0}=b^{0}=1$.

   from 2. Worked example A: Ternary tree ($b=3$, $d=2$)

5. The inflation factor is $$ \frac{0.350}{0.111}\approx 3.15. \tag{9} $$ Thus, even with a modest depth, a ternary branching structure inflates the variance by more than threefold relative to the classical assumption.

   from 2. Worked example A: Ternary tree ($b=3$, $d=2$)

6. Our minimal next experiment (Section 7(c)) proposes a pilot with $N=64$ observations, mirroring the participant‑count scale of that AR experiment while scaling the data‑collection cost linearly.

   from 5. Conceptual connections to the cited literature

How it is done

1. We formalize a p‑adic probability measure on such a tree, derive ultrametric analogues of the central limit theorem and hypothesis‑testing formulas, and compute the variance inflation for a binary hierarchical dataset of depth three.

   from Abstract

2. Derivation of an ultrametric central limit theorem and corresponding hypothesis‑testing formulas (Section 3).

   from 1. Introduction

3. We model the universe as a rooted infinite $p$‑adic tree $\mathcal{T}$ (Bruhat–Tits tree).

   from 3.1 Model of a Fully Connected Reality

4. This constitutes the ultrametric central limit theorem (U‑CLT).

   from 3.2 Ultrametric Central Limit Theorem

What would falsify it

1. If empirical datasets with known hierarchical ancestry exhibit variance close to the i.i.d. prediction despite strong shared ancestry, the ultrametric model would be falsified.

   from 7.2 Failure Modes and Falsifiability

2. Each node represents a causal ancestor; leaves correspond to observable events.

   from 3.1 Model of a Fully Connected Reality

3. If the observed variance exceeds the i.i.d. prediction by a factor near $2.9$, the ultrametric model gains support; a variance close to the i.i.d. value would falsify it.

   from 7. Practical Implications and Engineering Pathways

Where the claim stops

1. The correlation model (linear interpolation of $\rho_{ij}$) is a simplifying assumption; real‑world dependence may follow more complex $p$‑adic kernels.

   from 7.1 Limitations

2. The analysis assumes a perfectly balanced binary tree; irregular branching would modify pair counts.

   from 7.1 Limitations

3. Future work should focus on empirical estimation of ultrametric correlation parameters and on extending the theory to irregular and high‑dimensional trees.

   from 8. Conclusion

Where to read

1. Abstract150 words · 1 min
2. 1. Introduction209 words · 1 min
3. 2. Background and Related Work156 words · 1 min
4. 3. Methods235 words · 1 min
5. 4. Analysis144 words · 1 min
6. 5. Results64 words · 1 min
7. 6. Discussion1,389 words · 6 min
8. 6. Discussion182 words · 1 min
9. 7. Practical Implications and Engineering Pathways253 words · 1 min
10. 8. Conclusion79 words · 1 min
11. Provenance and AI Involvement225 words · 1 min