Summary: Repeated Binary Distance Subdivision

Structural Decomposition and Operational Complexity

Problem Formulation (§ 67)

Given:

Segment \(AB\) with midpoint \(M\) already located (\(AM = \frac{1}{2} AB\)).

Construct:
  1. Using the existing construction scaffolding of § 66, determine point \(Q'\) on arc \(B(2 AB)\) at distance \(BQ' = AP' = \sqrt{\frac{3}{2}} AB\).

  2. Intersect arcs from \(Q'\) and \(q'\) with radius \(BQ'\) to locate point \(N\).

  3. \(N\) is the midpoint of \(AM\) (\(AN = \frac{1}{4} AB\)).

  4. Iterate the step by setting \(BR' = AQ'\) to determine \(O\) (\(AO = \frac{1}{8} AB\)).

Demonstrate:
  • Apollonius’ median theorem applied to \(\triangle P'BE\) gives the exact algebraic radius \(BQ' = \sqrt{3/2} AB\).

  • Similarity of triangles \(\triangle Q'BN \sim \triangle Q'BE\) yields \(BN = \frac{BQ'^2}{BE} = \frac{(3/2) AB^2}{2 AB} = \frac{3}{4} AB\).

  • Consequently \(AN = AB - BN = \frac{1}{4} AB = \frac{1}{2} AM\).

Operational Complexity:
  • Each subsequent subdivision step reuses the established center \(B\) and axis \(BE\).

  • Requires \(4C_1 + 2C_3\) per dyadic step.