Answers are grounded in this paper and cite their sources.
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.
No takes yet. Share an insight, caveat, or question.
Alex Malachevsky (2026) studied this question.
Synapse has enriched 8 closely related papers on similar clinical questions. Consider them for comparative context: