Skip to content
FQFT · Microscopic ArchitectureMICRO-23

FQFT-MICRO-23 — Tree-Boundary Completion Candidate

Visual-metric boundary completion on the infinite 5-regular tree T5.

Mathematical Theorem

Because the universal cover of a connected 5-regular graph is the infinite regular tree T5, one mathematical completion is the boundary at infinity T5 equipped with a visual metric.


MIC-T02 — Boundary Visual Metric Theorem

Let T5 be the infinite 5-regular tree rooted at o. The boundary T5 is the space of infinite self-avoiding rays starting at o. For visual parameter α>0, the visual metric is

dα(ξ,η)=eα|ξη|,

where |ξη| is the length of the common initial segment of rays ξ and η.

Properties of (T5,dα)

  1. Compactness: (T5,dα) is a compact, totally disconnected, perfect metric space (a Cantor set).
  2. Hausdorff Dimension:
dimH(T5,dα)=ln4α.
  1. Self-Similarity Tuning: Any finite dimension D>0 can be realized by selecting visual scaling parameter α:
α=ln4D.

The Physical Obstruction for Pure Tree Boundaries

The boundary T5 is not the vertex set of any graph in the refinement sequence.
  1. The vertices of T5 (the "bulk") are entirely absent from T5.
  2. The nearest-neighbor graph Laplacian on T5 does not induce the standard Dirichlet Laplacian on T5.
  3. Pure boundary points represent asymptotic directions at infinity, not local spatial coordinates.

Therefore, boundary completion is mathematically sound as an abstract metric space, but physically distinct from a refinement that retains bulk local interactions.