Summary: Linear Distance Doubling¶
Structured Decomposition and Operational Complexity
Problem Formulation (§ 64)¶
- Given:
Two distinct points \(A, B\) defining distance \(AB\).
- Construct:
Describe circle \(B(AB)\).
Using the unchanged span \(AB\), step off three successive chords on the circumference: * \(C = B(AB) \cap A(AB)\) * \(D = B(AB) \cap C(AB)\) * \(E = B(AB) \cap D(AB)\)
The point \(E\) is the required collinear doubled endpoint.
- Demonstrate:
Central angles: \(\angle ABC = \angle CBD = \angle DBE = 60^\circ\).
Total angle: \(\angle ABE = 180^\circ\), ensuring collinearity of \(A, B, E\).
Segment addition: \(AE = AB + BE = AB + AB = 2AB\).
- Operational Complexity (Lemoine OpCount):
Compass operations: \(3C_1 + 3C_3\) (one initial circle plus two chord-marking arcs with same aperture).
Simplicity: \(S = 6\).
Exactitude: \(E = 3\).
Circles: \(3\).
Distinct compass apertures: \(1\) (constant radius \(AB\)).