BGM-L1. Binary Point Genealogy and the Geometry of Repeated Bisection Canonical Midpoint Markers, Metric Non-identifiability, Infinite Limits, and Physical Resolution
We investigate whether repeated subdivision between two boundary symbols 0 and 1 canintroduce a binary-coded interior point whose finite label uniquely recovers its canonical parent pair.An ordered binary tree of subdivisions is defined, with the marker of an interval of address 𝑤 givenby the finite binary fraction 0.𝑤12. We prove a bijection between such labels and the interior dyadicrationals, give an exact decoding algorithm for the parents, and count the nodes at finite subdivision depth.A binary genealogy alone does not determine metric length: non-identifiability is exhibited through afamily of snowflake metrics and a nonlinear embedding. Conversely, order-additivity, equality of the twochild lengths, and normalization uniquely determine the usual dyadic metric. We distinguish infinitebinary paths from their metrically interpreted quotient [0, 1], derive an explicit depth bound for finitephysical resolution, and provide exact-arithmetic computational verification. These constructions belongto classical dyadic subdivision theory; no claim of scientific priority or independent novelty is made.
Authors
- Alex Malachevsky (ORCID: https://orcid.org/0009-0008-6009-3196)
Publication Details
- Journal
- Zenodo (CERN European Organization for Nuclear Research)
- Published
- 2026-11-19
- DOI
- https://doi.org/10.5281/zenodo.24376394
- Primary Topic
- p-Adic Analysis and Mathematical Physics
- Type
- preprint