Section 3: C. Revolution Around an Axis (Axial Reflection)

Julius Petersen — Methods and Theories (Authorized Translation by Sophus Haagensen, 1879 · pp. 65–69)

C. Revolution Around an Axis (Axial Reflection, pp. 65–69, Problems 336–348)

[p. 60] Revolution around an axis (reflection across a straight line of symmetry) is a special case of Replacing, yet so fruitful that it warrants independent treatment. By revolving one half of a figure around an axis of symmetry, symmetric intersections become direct intersections of known curves, and broken equal-angle paths straighten into single segments:

  • Problem 336 (p. 61): To a given line to draw a perpendicular, of which two given curves shall cut off equal parts from the line. Revolve one curve around the given line as axis; its intersections with the other curve determine the sought perpendiculars immediately.

  • Problem 338 — Hero’s Reflection Problem (p. 61, Hero of Alexandria): In a given line to find a point X, from which lines drawn to two given points A and B (situated on the same side of the line) shall form equal angles with the given line. - Construction & Remark: Revolve A around the given line to \(A_1\); the straight line \(B X A_1\) determines \(X\). As Petersen notes (p. 61), an elastic body or a ray of light striking a plane mirror reflects at an angle equal to the angle of incidence; since \(AX + XB = A_1 X + XB = A_1 B\) while any other point \(X'\) yields a broken path \(A_1 X' + X' B > A_1 B\), the distance travelled by light is a minimum.

Petersen Problem 338 — Hero's Mirror Reflection & Shortest Optical Path [ M1 M2 ]: y = 0 [ A A1 ]: x - 2 = 0 [ A1 B ]: -16*x + 12*y + 104 = 0 [ A X ]: 6*x + 9*y/2 - 39 = 0 M1 = (0, 0) M2 = (16, 0) A = (2, 6) B = (14, 10) A1 = (2, -6) F = (2, 0) X = (13/2, 0) A B A1 F X

Figure 5.1a — Petersen’s Problem 338 (p. 61): Axial Reflection & Hero’s Shortest Optical Path. Revolving A across mirror axis M1M2 into A1 straightens the broken path into line A1B, determining X \(= (13/2, 0)\) where segments AX and XB make equal angles with the mirror and achieve minimum path length \(20\).

  • Problem 339 — Polygonal Billiards (pp. 61–62): Two balls M and N lie on an n-sided polygonal billiard table; roll M against side AB so that after striking all n sides successively it hits N. Unfold \(M \mapsto M_1 \mapsto M_2 \mapsto \dots \mapsto M_n\) by reflecting successively across each side in order, reducing the \(n\)-cushion path to a single straight line!

  • Problem 340 — Minimum-Perimeter Inscribed Polygon (p. 62): In a given n-gon to inscribe another n-gon of minimum perimeter. Consecutive sides must form equal angles with each host side; unfolding the entire polygon through \(n\) axial reflections straightens the perimeter into one segment, proving why odd-\(n\) polygons admit a unique determinate solution (for an acute triangle, its orthic triangle) whereas even-\(n\) polygons are either impossible or indeterminate (porismatic)!