Manuscript Oai211-A@1 · Oai211-A.tex · section · 3f3e4f63

Necessary repairs

Introduction and the corrected target › Necessary repairs · lines 160–207

Back to manuscript

The extension plan requires the following corrections.

  1. The Brownian CRT is not metrically one-dimensional. It has Hausdorff dimension almost surely DuquesneLeGall. Its real-tree structure excludes a surface-manifold interpretation; Hausdorff dimension is not manifold dimension.

  2. A path sum is not a channel composition. A sum of local half-diamond errors is generally neither the error of a serial channel nor an exact decoder error. We therefore define a path mixture, and separately construct a serial family for which the composition can be calculated.

  3. An additive law does not concentrate one root mark. Uniform concentration of sums at scale does not imply concentration of an observable attached to the single root block.

  4. {Absolute control is not a uniform relative law at shallow depth.} Path averages are controlled uniformly only after imposing a minimum depth. The root and bounded-depth paths are excluded from that relative conclusion.

  5. Size conditioning and experimental conditioning differ. Shared ancestors make path marks dependent. Repeated experimental trials are required to be conditionally independent after the marked tree and the tested path are fixed.

  6. A metric limit does not instantiate a quantum interface. A code, channel, decoder, complement, and physical correspondence must be supplied independently. A combinatorial corner is not automatically a boundary quantum register.

  7. The FK specialization has an analytic gate. The finite-variance offspring law reported in the supplied preprint is not silently assumed as an independently verified fact. Section sec:blocks prints sufficient analytic conditions and proves the resulting conditional specialization.

  8. Failure of a sufficient certificate can be inconclusive. It is not automatically a recovery obstruction, geometric failure, or nonexistence theorem.