Summary: Reduction of Circle Intersections to Homothetic Projection

Quantitative Operations & Complete Reduction Schema

1. The Complete Reduction Schema

Every Euclidean construction consists of a finite chain of three elementary intersection operations:

  1. Line–Line Meet: Two lines intersect at a point \(P = L_1 \cap L_2\) (directly drawn with straightedge).

  2. Line–Circle Meet: A line intersects an un-drawn circle \((M_1, r_1)\) at points \(g_1, h_1\) (solved by Problem 7 via homothety to drawn circle \(\Omega\)).

  3. Circle–Circle Meet: Two un-drawn circles intersect at points \(P_1, P_2\) (solved by Problem 8 via radical axis, reducing directly to Problem 7).

2. Geometrographic Operation Table for Problems 6–8

Straightedge Operation Costs for Fundamental Problems 6–8

Problem

Method & Apparatus

Operation Symbol

Simplicity & Exactitude

6. Segment Transfer

Parallel radii + similitude center \(A\)

\(12R_1 + 6R_2\)

\(S = 18, E = 12, N_C = 0\)

7. Line–Circle Meet

Homothetic projection onto \(\Omega\)

\(16R_1 + 9R_2\)

\(S = 25, E = 16, N_C = 0\)

8. Circle–Circle Meet

Radical axis + Problem 7

\(27R_1 + 15R_2\)

\(S = 42, E = 27, N_C = 0\)

Across all eight problems, the number of circles drawn remains strictly zero (\(m_1 = m_2 = m_3 = 0, N_C = 0\))—completing the Poncelet–Steiner program!