-
Notifications
You must be signed in to change notification settings - Fork 0
/
geometry-unbound.xml
10370 lines (9378 loc) · 340 KB
/
geometry-unbound.xml
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
<?xml version="1.0" encoding="UTF-8" ?>
<?xml-stylesheet type="text/xsl" href="book-html.xsl"?>
<title>Geometry Unbound</title>
<author>Kiran S. Kedlaya</author>
<date>version of 21 June 2013</date>
<copyright>
<p>
2006--2013 Kiran S. Kedlaya.
Permission is granted to copy, distribute and/or modify this document
under the terms of the GNU Free Documentation License, Version 1.2
or any later version published by the Free Software Foundation;
with no Invariant Sections, no Front-Cover Texts, and no Back-Cover Texts.
Please consult the section of the Introduction
entitled ``License information'' for further details.
</p>
<p>
Disclaimer: it is the author's belief that all use of quoted material, such as
statements of competition problems, is in compliance with the ``fair use''
doctrine of US copyright law. However, no guarantee is made or implied that
the fair use doctrine will apply to all derivative works, or in the copyright
law of other countries.
</p>
</copyright>
<introduction>
<section>
<title>
Origins, goals, and outcome
</title>
<p>
The original text underlying this book was a set of notes<footnote>The
original notes have been circulating on the Internet since 1999, under
the pedestrian title ``Notes on Euclidean Geometry''.</footnote> I compiled,
originally as a participant and later as an instructor, for the Math
Olympiad Program (MOP),<footnote>The program has actually been called the
Math Olympiad Summer Program (MOSP) since 1996, but in accordance to common custom, we refer to the original acronym.</footnote> <tex-index label="MOP (Math Olympiad Program)" />
<tex-index label="MOSP (Math Olympiad Summer Program)" />
the annual summer program to prepare U.S.
high school students for the International Mathematical Olympiad
(IMO).<tex-index label="IMO (International Mathematical Olympiad)" />
Given the overt mission of the MOP, the notes as originally compiled
were intended to bridge the gap between the knowledge of Euclidean geometry
of American IMO prospects and that of their counterparts from other
countries. To that end, they included a large number of challenging
problems culled from Olympiad-level competitions from around the world.
</p>
<p>
However, the resulting book you are now reading shares with the MOP
a second mission, which is more covert and even a bit subversive.
In revising it, I have attempted to
usher the reader from the comfortable world
of Euclidean geometry to the gates of ``geometry'' as the term is defined
(in multiple ways)
by modern mathematicians, using the solving of routine and nonroutine
problems as the vehicle for discovery. In particular, I have aimed to
deliver something more than ``just another problems book''.
</p>
<p>
In the end, I became unconvinced that I would succeed in this mission
through my own efforts alone; as a result, the manuscript remains in some
ways unfinished. For one, it still does not include figures (though
some of these do exist online; see the chapter ``About the license'');
for another,
I would ideally like to include some additional material in Part III
(examples: combinatorial geometry, constructibility).
</p>
<p>
Rather than continue endlessly to ``finish'' the manuscript,
I have instead decided to carry the spirit of the distribution of the
notes to a new level, by deliberately releasing an incomplete manuscript
as an ``open source'' document using the
GNU Free Documentation License;
<tex-index label="GNU Free Documentation License" /> (for more on which see the
chapter ``About the license'').
My hope is that this will encourage readers to make use of this still
unpolished material
in ways I have not foreseen.
</p>
</section>
<section>
<title>
Methodology
</title>
<p>
This book is not written in the manner of a typical textbook.
(Indeed, it is not really designed to serve as a textbook at all,
though it could certainly be used as one with highly motivated students.)
That is, we do not
present full developments of key theorems up front, leaving
only routine exercises for the reader to consider. For one, we leave
strategic gaps in the exposition for the reader to fill in. For another,
we include a number of nonroutine problems, of the sort found on the
IMO or related national competitions. The reader may or may not succeed
in solving these, but attempting them should provide a solid test of
one's understanding. In any case, solutions to the exercises
and problems are included in the back; we have kept these brief, and they
are only intended to make sense once you have already thought a bit about the
corresponding exercises/problems on your own.
</p>
<p>
In addition to the MOP (and in some sense the Socratic method), <tex-index label="Socratic method" />
inspirations for this approach include the
famous Moore method <tex-index label="Moore method" /> of learning through problems,
and the number theory curriculum of the late Arnold Ross's
<tex-index label="Ross, Arnold" /> renowned
summer mathematics program<footnote>Arnold Ross
may no longer be with us, but
fortunately his program is: its web site is
\url{http://www.math.ohio-state.edu/ross/</footnote>.} for high school students.
We also take inspiration from the slender classic
\emph{Geometry Revisited} by H.S.M. Coxeter <tex-index label="Coxeter, Harold Scott MacDonald" />
and S. Greitzer, <tex-index label="Greitzer, Samuel" />
among whose pages this author discovered the beauty of Euclidean
geometry so carefully hidden by many textbook writers. Indeed,
we originally considered titling this book \textit{``Geometry Revisited''
Revisited} in homage to the masters; we ultimately chose instead to
follow Aeschylus <tex-index label="Aeschylus" />
and Percy Bysshe Shelley <tex-index label="Shelley, Percy Bysshe" />
in depicting geometry as a titanic subject
released from the shackles of school curricula.
</p>
</section>
<section>
<title>
Structure of the book
</title>
<p>
Aside from this introduction, the book is divided into four parts.
The first part, ``Rudiments'', is devoted to the foundations of Euclidean geometry
and to some of the most pervasive ideas within the subject.
The second part, ``Special situations'', treats some common environments of
classical synthetic geometry; it is here where one encounters many of
the challenging Olympiad problems which helped inspire this book.
The third part, ``The roads to modern geometry'', consists of two<footnote>We
would like to have additional such chapters, perhaps in a subsequent
edition of the book, perhaps in a derivative version.</footnote> chapters
which treat slightly more advanced topics (inversive and projective geometry).
The fourth part, ``Odds and ends'',
is the back matter of the book, to be consulted
as the need arises; it includes hints for the exercises
and problems (for more on the difference, see below),
plus bibliographic references, suggestions for further reading,
information about the open source license, and an index.
</p>
<p>
Some words about terminology <tex-index label="terminology" />
are in order at this point.
For the purposes of this book, a \emph{theorem}
<tex-index label="theorem|textbf" /> is an important result
which either is given with its proof, or is given without its proof
because inclusion of a proof would lead too far afield. In the
latter case, a reference is provided.
A \emph{corollary} <tex-index label="corollary|textbf" /> is a result which is
important in its own right, but is easily deduced from a nearby theorem.
A \emph{fact} <tex-index label="fact|textbf" /> is a result which is
important but easy enough to deduce that its proof is left to the reader.
</p>
<p>
Most sections of the text are accompanied by a section labeled
``Problems'', which are additional assertions which the reader
is challenged to verify. Some of these are actually what we would call
\emph{exercises}, <tex-index label="exercise|textbf" /> i.e., results which the reader
should not have
any trouble proving on his/her own, given what has come before.
By contrast, a true \emph{problem} <tex-index label="problem|textbf" /> is a result that
can be obtained using
the available tools, but which also requires some additional insight.
In part to avoid deterring the reader from trying the more challenging
problems (but also to forestall some
awkwardness in cross-referencing), we have used
the term ``problem'' in both cases.
Hints have been included in the back matter
of the book for selected problems; in order that the hints
may also cover facts,
some problems take the form ``Prove Fact 21.13.''
In order to keep the book to a manageable size, and also to avoid challenging
the reader's willpower, solutions have not been included; they may be
instead found online at
</p>
<p>
I have attributed my source for each problem to the best of my
knowledge. Problems from the USA Mathematical Olympiad (USAMO),
International Mathematical Olympiad (IMO), USA Team Selection Test
(TST), and William Lowell Putnam
competition (Putnam) are listed by year and
number; problems from other national or regional contests
are listed by country/contest
and year.
Problems I obtained from MOP are so labeled when I was unable to determine
their true origins; most of these probably come from national contests.
\emph{Arbelos}<footnote>For the origin of the name ``arbelos'', see
<cross-ref type="Section" tex-label="sec:inv magic" />.</footnote>
refers to Samuel Greitzer's student publication from 1982--1987
\cite{bib:greitzer},
and \emph{Monthly} refers to the \textit{American Mathematical Monthly}.
Problems listed as ``Original'' are my own problems which
have not before appeared in print (excluding prior versions of this
book). Attributions to other people or web sites should be self-explanatory.
</p>
</section>
<section>
<title>
Acknowledgments
</title>
<p>
The acknowledgments for a book such as this cannot help but be at once
tediously voluminuous and hopelessly inadequate.
That being so, there is nothing to done other than to proceed forthwith.
</p>
<p>
Let me start with those most directly involved. Thanks to Reid
Barton <tex-index label="Barton, Reid" /> for assembling a partial set of solutions to
the included problems. Thanks to Marcelo Alvisio <tex-index label="Alvisio, Marcelo" />
for expanding this solution set, for reporting numerous typos in the
1999 manuscript, and for rendering the missing diagrams from the 1999
manuscript using \textit{The Geometer's
Sketchpad\textsuperscript{\textregistered}}.
Thanks to Arthur Baragar <tex-index label="Baragar, Arthur" />
for helpful (though not yet carried out)
advice concerning the rendering of diagrams.
</p>
<p>
Let me next turn to those whose contributions are more diffuse.
I first learned Euclidean geometry in the manner of this book
from my instructors and later colleagues at the MOP, including
Titu Andreescu, <tex-index label="Andreescu, Titu" /> R\u{a}zvan Gelca,
<tex-index label="Gelca, R\u{a}zvan" />
Anne Hudson, <tex-index label="Hudson, Anne" />
Gregg Patruno, <tex-index label="Patruno, Gregg" />
and Dan Ullman. <tex-index label="Ullman, Dan" />
The participants
of the 1997, 1998, and 1999 MOPs also deserve thanks for working through
the notes that formed the basis for this book.
</p>
<p>
I owe a tremendous expository debt to Bjorn Poonen <tex-index label="Poonen, Bjorn" />
and Ravi Vakil, <tex-index label="Vakil, Ravi" />
my collaborators on the 1985-2000 Putnam compilation
\cite{bib:putnam}. In that volume,
we embarked on a grand experiment: to
forge a strong expository link between challenging ``elementary''
problems and ``deep'' mathematics. The warm reception received by that
volume has emboldened me to apply to the present book
some of what we learned from this experiment.
</p>
<p>
Thanks to the compilers of the wonderfully comprehensive
MacTutor History of Mathematics, <tex-index label="MacTutor History of Mathematics" /> available
online at
\begin{center}
<url>http://www-gap.dcs.st-and.ac.uk/\~{}history/index.html</url>.
\end{center}
We have used MacTutor as our reference for historical comments, English spellings of names, and birth and death dates. (All dates are A.D.
unless denoted B.C.E.<footnote>The latter stands for ``Before the Common
Era'', while the former might be puckishly deciphered as
``Arbitrary Demarcation''.</footnote>) <tex-index label="B.C.E." />
</p>
</section>
</introduction>
<part>
<title>
Rudiments
</title>
<chapter>
<title>
Construction of the Euclidean plane
</title>
<p>
The traditional axiomatic development of Euclidean geometry originates
with the treatment by Euclid of Alexandria
(325?--265? B.C.E.) <tex-index label="Euclid of Alexandria" /> in the classic
\textit{Elements}, <tex-index label="Elements@\textit{Elements" /> (of Euclid)}
<tex-index label="Euclid's \textit{Elements" />}
and was modernized
by David Hilbert (1862--1943) <tex-index label="Hilbert, David" />
in his 1899 \textit{Grundlagen der Geometrie (Foundations
of Geometry)}. For the purposes of this book, however, it is more
convenient to start with the point of view of a coordinate plane, as
introduced by Ren\'e Descartes<footnote>This attribution explains the term ``Cartesian coordinates'' <tex-index label="Cartesian coordinates" /> to refer to this type of geometric description.</footnote> (1596--1690) <tex-index label="Descartes, Ren\'e" />
and Pierre de Fermat (1601--1665). <tex-index label="Fermat, Pierre de" />
We will return to the axiomatic
point of view in due course, when we discuss hyperbolic geometry in
<cross-ref type="Chapter" tex-label="chap:inversion" />; however, the coordinate-based point of view will
also recur when we dabble briefly in algebraic geometry (see <cross-ref type="Section" tex-label="sec:alggeo" />).
</p>
<p>
Of course one must assume \emph{something} in order to get started.
What we are assuming are the basic properties of the real numbers, which
should not be too much of an imposition.
The subtlest of these properties is the
\emph{least upper bound property}: \index{least upper bound
property (of real numbers)|textbf} every set of real numbers which is
bounded above has a least upper bound. More precisely, if <m>S</m> is a set
of real numbers and there exists a real number <m>x</m> such that
<m>x \geq y</m> for all <m>y \in S</m>, then there is a (unique) real number <m>z</m>
such that:
<ol>
<li>[(a)] <m>z \geq y</m> for all <m>y \in S</m>;
</li>
<li>[(b)] if <m>x \geq y</m> for all <m>y \in S</m>, then <m>x \geq z</m>.
</li>
</ol>
</p>
<p>
One theme we carry through our definitions is that certain numerical
quantities (lengths of segments along a line, areas, arc and angle
measures) should be treated with special algebraic rules, including
systematic sign conventions. In so doing, one can make some statements
more uniform, by eliminating some dependencies on the relative positions
of points. This uniformity was unavailable to Euclid in the absence
of negative numbers, hampering efforts to maintain logical consistency;
see <cross-ref type="Section" tex-label="sec:angles" /> for a tricky example.
</p>
<p>
In any case, while the strictures
of logic dictate that this chapter must occur first, the reader need not
be so restricted. We recommend skipping this chapter on first reading
and coming back a bit later, once one has a bit of a feel for what
is going on. But do make sure to come back at some point: for mathematicians (such as the reader and the author)
to communicate, it is always of the utmost importance to agree on the
precise definitions of even the simplest of terms.<footnote>As mathematician/storyteller Lewis Carroll, <tex-index label="Carroll, Lewis (Charles Lutwidge Dodgson)" /> \textit{n\'e</footnote> Charles Lutwidge Dodgson, <tex-index label="Dodgson, Charles Lutwidge (Lewis Carroll)" /> put it in the voice of \emph{Through the Looking Glass} character Humpty Dumpty: ``When I use a word... it means exactly what I choose it to
mean---neither more nor less.''}
</p>
<section>
<title>
The coordinate plane, points and lines
</title>
<p>
We start by using Cartesian coordinates to define the basic geometric
concepts: points, lines, and so on.
The reader should not think his/her intelligence is being insulted by
our taking space to do this: it is common in a mathematical text to begin
by defining very simple objects, if for no other reason than to make sure
the author and reader agree on the precise meaning and usage of fundamental
words, as well as on the notation to be used to symbolize them (see previous footnote).
</p>
<p>
For our purposes, the \emph{plane} <tex-index label="plane|textbf" />
<m>\RR^2</m> is the set of ordered pairs <m>(x,y)</m> of real numbers;
we call those pairs
the \emph{points} <tex-index label="point|textbf" /> of the plane. A \emph{line}
<tex-index label="line|textbf" /> (or to be more precise, a \emph{straight line}<footnote>The
term ``straight line'' may be redundant in English, but it is not so in
other languages. For instance, the Russian term for a curve
literally translates as ``curved line''.</footnote>)
will be any subset of the plane of the form
<dm>
\{(x,y) \in \RR^2: ax + by + c = 0\}
</dm>
for some real numbers <m>a,b,c</m> with <m>a</m> and <m>b</m> not both zero. Then as
one expects, any two distinct points <m>P_1 = (x_1, y_1)</m> and <m>P_2 = (x_2, y_2)</m>
lie on a unique line, namely
<dm>
\line{P_1P_2} = \{ ((1-t)x_1 + tx_2, (1-t)y_1 + ty_2): t \in \RR \}.
</dm>
Similarly, we define the
\emph{ray} <tex-index label="ray|textbf" />
<dm>
\ray{P_1P_2} = \{ ((1-t)x_1 + tx_2, (1-t)y_1 + ty_2): t \in [0,\infty) \}
</dm>
and the \emph{segment} (or \emph{line segment})
<tex-index label="line!segment|textbf" /> <tex-index label="segment|textbf" />
<dm>
\seg{P_1P_2} = \{ ((1-t)x_1 + tx_2, (1-t)y_1 + ty_2): t \in [0,1] \}.
</dm>
Any segment lies on a unique line, called the \emph{extension}
<tex-index label="extension (of a segment)|textbf" /> of the segment.
We say points <m>P_1, \dots, P_n</m> are \emph{collinear} \index{collinearity
(of points)|textbf}
if they lie on a single line; if <m>\ell</m> is that line,
we say that <m>P_1, \dots, P_n</m> lie on <m>\ell</m> \emph{in order}
<tex-index label="order (of points on a line)|textbf" /> if for any distinct
<m>i,j,k \in \{1, \dots,n\}</m> with <m>i < j</m>, we have <m>i < k < j</m> if and only if
<m>P_k</m> lies on the segment <m>P_iP_j</m>. For <m>n=3</m>, we also articulate this
by saying that <m>P_2</m> lies \emph{between} <tex-index label="betweenness (of points on a line)|textbf" /> <m>P_1</m> and <m>P_3</m>.
We say lines <m>\ell_1, \dots, \ell_n</m> are
\emph{concurrent} <tex-index label="concurrence!of lines|textbf" /> if they contain (or
``pass through'') a single point.
</p>
<p>
We will postpone defining angles for the moment, but we may as well define
parallels and perpendiculars now. We say two lines <m>ax+by+c=0</m> and <m>dx+ey+f=0</m> are
\emph{parallel} <tex-index label="parallelness (of lines)|textbf" /> if <m>ae-bd = 0</m>, and
\emph{perpendicular} <tex-index label="perpendicularity (of lines)|textbf" />
if <m>ae+bd = 0</m>. Then the following facts are easily
verified.
</p>
<fact>
<attribution>
Triangle inequality
</attribution>
<statement>
<p>
Through any given point, there is a unique line parallel/perpendicular to any
given line.
</p>
</statement>
</fact>
<p>
For <m>\ell</m> a line and <m>P</m> a point, the intersection of <m>\ell</m> with the
perpendicular to <m>\ell</m> through <m>P</m> is called the \emph{foot}
<tex-index label="foot of a perpendicular" /> of the perpendicular through <m>P</m>.
</p>
<fact>
<statement>
<p>
Given three lines <m>\ell_1, \ell_2, \ell_3</m>, the following relations hold.
\begin{center}
\begin{tabular}{ccc}
If <m>\ell_1</m> and <m>\ell_2</m> are: &
and <m>\ell_2</m> and <m>\ell_3</m> are: &
then <m>\ell_1</m> and <m>\ell_3</m> are: \\
parallel &parallel &parallel \\
parallel &perpendicular &perpendicular \\
perpendicular &parallel &perpendicular \\
perpendicular &perpendicular &parallel.
\end{tabular}
\end{center}
</p>
</statement>
</fact>
<p>
Given a segment <m>\seg{P_1P_2}</m>, there is a unique
point <m>M</m> on <m>\seg{P_1P_2}</m> with <m>P_1M = MP_2</m>, called the
\emph{midpoint} <tex-index label="midpoint!of a segment|textbf" /> of
<m>\seg{P_1P_2}</m>. There is a uniq
ue line through <m>M</m> perpendicular
to <m>\line{P_1P_2}</m>, called the \emph{perpendicular bisector}
<tex-index label="perpendicular bisector (of a segment)|textbf" />
of <m>\seg{P_1P_2}</m>.
</p>
<p>
Of course there is nothing special about having only two dimensions; one can
construct an <m>n</m>-dimensional Euclidean space for any <m>n</m>. In particular, it is not
unusual to do this for <m>n=3</m>, resulting in what we call
\emph{space geometry}<footnote>The term ``solid geometry'' <tex-index label="solid geometry" />
<tex-index label="geometry!solid" />
is more common, but less consistent.</footnote> <tex-index label="space geometry" /> <tex-index label="geometry!space" />
as opposed to \emph{plane geometry}.
<tex-index label="plane geometry" /> <tex-index label="geometry!plane" />
Although we prefer for simplicity not to discuss space geometry, we will make
occasional reference to it in problems.
</p>
</section>
<section>
<title>
Distances and circles
</title>
<p>
The
\emph{distance} <tex-index label="distance!between two points|textbf" />
between two points <m>P_1 = (x_1, y_1)</m> and <m>P_2 =
(x_2, y_2)</m> is defined
by
<dm>
P_1P_2 = d(P_1, P_2) = \sqrt{(x_1-x_2)^2 + (y_1 - y_2)^2};
</dm>
we also describe this quantity as the
\emph{length} <tex-index label="length (of a segment)|textbf" /> of the
segment <m>\seg{P_1P_2}</m>. If <m>\seg{P_1P_2}</m> and <m>\seg{P_3P_4}</m> are collinear segments (i.e., the points <m>P_1,P_2,P_3,P_4</m> are collinear), we define the
\emph{signed ratio of lengths}
<tex-index label="ratio of lengths, signed (of collinear segments)|textbf" />
<tex-index label="signed ratio of lengths (of collinear segments)|textbf" />
of the segments <m>\seg{P_1P_2}</m>
and <m>\seg{P_3P_4}</m> to be the ratio <m>P_1P_2/P_3P_4</m> if the intersection of
the rays <m>\ray{P_1P_2}</m> and <m>\ray{P_3P_4}</m> is a ray, and <m>-P_1P_2/P_3P_4</m> otherwise. (In the latter case, the intersection of the two rays may be
a segment, a point, or the empty set.)
</p>
<p>
From the distance formula, one can verify the \emph{triangle inequality}.
<tex-index label="triangle inequality|textbf" />
</p>
<fact>
<statement>
<p>
Given points <m>P_1, P_2, P_3</m>, we have
<dm>
P_1P_2 + P_2P_3 \geq P_1P_3,
</dm>
with equality if and only if <m>P_3</m> lies on the segment <m>\seg{P_1P_2}</m>.
</p>
</statement>
</fact>
<p>
We can also define the distance from a point to a line.
</p>
<fact>
<attribution>
Law of Sines
</attribution>
<statement>
<p>
Let <m>P</m> be a point and <m>\line{QR}</m> a line. Let <m>S</m> be the intersection of
<m>\line{QR}</m>
with the line through <m>P</m> perpendicular to <m>\line{QR}</m>.
Then the minimum distance
from <m>P</m> to any point on <m>\line{QR}</m> is equal to <m>PS</m>.
</p>
</statement>
</fact>
<p>
We call this minimum the \emph{distance} from <m>P</m> to <m>\line{QR}</m>, and denote it
<m>d(P,\line{QR})</m>.
<tex-index label="distance!from a point to a line" />
</p>
<p>
With a notion of distance in hand, we may define
a \emph{circle} <tex-index label="circle|textbf" /> (resp.\ a \emph{disc}
<tex-index label="disc|textbf" /> or \emph{closed disc},
<tex-index label="disc!closed|textbf" /> <tex-index label="closed!disc|textbf" />
an \emph{open disc}) <tex-index label="disc!open|textbf" />
<tex-index label="open!disc|textbf" />
as the set of points <m>P</m> in the plane with the property that
<m>OP = r</m> (resp.\ <m>OP \leq r</m>)
for some point <m>O</m> (the \emph{center}) \index{center!of
a circle/disc|textbf} and
some positive real number <m>r</m> (the \emph{radius}); \index{radius
(of a circle/disc)|textbf} note that both <m>O</m> and <m>r</m> are uniquely determined by the circle. We call the quantity
<m>2r</m> the \emph{diameter} <tex-index label="diameter!of a circle/disc|textbf" />
of the circle/disc.
Given a closed disc with center <m>O</m> and radius <m>r</m>, we call the circle
of the same center and radius the \emph{boundary} of the disc;
<tex-index label="boundary!of a disc|textbf" />
we call the open disc of the same center and radius the
\emph{interior} of the circle or of the closed disc.
<tex-index label="interior!of a circle/disc|textbf" />
</p>
<fact>
<statement>
<p>
Any three distinct points which do not lie on a straight line lie on
a unique circle.
</p>
</statement>
</fact>
<p>
Any segment joining the center of a circle to a point on the circle is
called a \emph{radius}<footnote>This is the first of numerous occasions
on which we use the same word to denote both a segment and its length.
This practice stems from the fact that Euclid did not have an independent
concept of ``length'', and instead viewed segments themselves as
``numbers'' to be manipulated arithmetically.</footnote> \index{radius
(of a circle/disc)|textbf} of the circle.
Any segment joining two points on a circle is
called a \emph{chord} <tex-index label="chord (of a circle)|textbf" />
of the circle. A chord passing through the center is
called a \emph{diameter}; clearly its length is twice the radius of the
circle.
</p>
<fact tex-label="fact:intersect line circle">
<statement>
<p>
Any line and circle intersect at either zero, one, or two points.
Any two distinct circles intersect at either zero, one, or two points.
</p>
</statement>
</fact>
<p>
A line and circle that meet at exactly one point are said to be
\emph{tangent}. <tex-index label="tangent line (of a circle)|textbf" />
If <m>\omega</m> is a circle, <m>A</m> is a point on <m>\omega</m>, and <m>\ell</m> is a line
through <m>A</m>, we will speak frequently of the ``second
intersection <tex-index label="second intersection (of a line and circle)|textbf" /> of
<m>\ell</m> and <m>\omega</m>''; when the two are tangent, we mean this to be <m>A</m> itself.
</p>
<p>
Two distinct circles which meet in exactly one point are also said to be
\emph{tangent}. In this case, either one circle lies inside the other, in
which case the two are said to be \emph{internally tangent},
<tex-index label="internal tangency (of circles)|textbf" />
or neither circle
contains the other, in which case the two are said to be
\emph{externally tangent}.
<tex-index label="external tangency (of circles)|textbf" />
</p>
<p>
Two or more circles with the same center are said to be \emph{concentric};
<tex-index label="concentricity (of circles)|textbf" /> concentric circles which do not
coincide also do not intersect.
</p>
<fact>
<statement>
<p>
Through any point <m>P</m> on a circle <m>\omega</m>,
there is a unique line tangent to <m>\omega</m>:
it is the line perpendicular to the radius of <m>\omega</m> ending at <m>P</m>.
</p>
</statement>
</fact>
<p>
It will be useful later (in the classification of rigid motions; see
<cross-ref type="Theorem" tex-label="thm:classify rigid" />) to have in hand the ``triangulation
principle''; <tex-index label="triangulation|principle (of navigation)|textbf" />
this fact was used once upon a time for navigation at sea, and nowadays figures in the satellite-based navigation technology known as the Global Positioning System. <tex-index label="Global Positioning System" />
</p>
<fact tex-label="fact:triangulation principle">
<statement>
<p>
Let <m>A,B,C</m> be distinct points. Then any point <m>P</m> in the plane
is uniquely determined by the three distances <m>PA, PB, PC</m>; that is, if
<m>P,Q</m> are points in the plane with <m>PA=QA, PB=QB, PC=QC</m>, then
<m>P=Q</m>.
</p>
</statement>
</fact>
<p>
For <m>n \geq 4</m>, if <m>P_1, \dots, P_n</m> are distinct points and <m>\omega</m> is a circle,
we say that \emph{<m>P_1, \dots, P_n</m> lie on <m>\omega</m> in that order}
if <m>P_1, \dots, P_n</m> lie on <m>\omega</m> and the polygon
<m>P_1\cdots P_n</m> is simple (hence convex).
</p>
<exercises>
<exercise>
<p>
Prove <cross-ref type="Fact" tex-label="fact:triangulation principle" />.
</p>
</exercise>
<exercise tex-label="ex:appower">
<p>
Let <m>\omega_1</m> and <m>\omega_2</m> be circles with respective centers
<m>O_1</m> and <m>O_2</m> and respective radii <m>r_1</m> and <m>r_2</m>,
and let <m>k</m> be a real number
not equal to 1. Prove that the set of points <m>P</m> such that
<dm>
PO_1^2 - r_1^2 = k(PO_2^2 - r_2^2)
</dm>
is a circle. (This statement will be reinterpreted later in terms
of the power of a point <tex-index label="power of a point" /> with respect to a circle;
see <cross-ref type="Section" tex-label="sec:powerofapoint" />.)
</p>
</exercise>
<exercise>
<attribution>
IMO 1988/1
</attribution>
<p>
Consider two circles of radii <m>R</m> and <m>r</m> (<m>R > r</m>) with the same
center. Let <m>P</m> be a fixed point on the smaller circle and <m>B</m> a variable
point on the larger circle. The line <m>\line{BP}</m>
meets the larger circle again at
<m>C</m>. The perpendicular <m>\ell</m> to <m>\line{BP}</m> at <m>P</m> meets the smaller circle again at
<m>A</m>. (As per our convention, if <m>\ell</m> is tangent to the circle at <m>P</m>,
then we take <m>A = P</m>.)
<ol>
<li>[(i)] Find the set of values of <m>BC^2 + CA^2 + AB^2</m>.
</li>
<li>[(ii)] Find the locus of the midpoint of <m>\seg{AB}</m>.
</li>
</ol>
</p>
</exercise>
</exercises>
</section>
<section>
<title>
Triangles and other polygons
</title>
<p>
The word ``polygon'' can mean many slightly different things, depending on
whether one allows self-intersections, repeated vertices, degeneracies,
etc. So one has to be a bit careful when defining it, to make sure that
everyone agrees on what is to be allowed.
</p>
<p>
Let <m>P_1,\dots, P_n</m> be a sequence of at least three points in the plane.
The \emph{polygon} (or \emph{closed polygon})
<tex-index label="polygon|textbf" /> <tex-index label="polygon, closed|textbf" />
<tex-index label="closed polygon|textbf" /> with vertices <m>P_1, \dots, P_n</m>
is the <m>(n+1)</m>-tuple <m>(P_1, \dots, P_n, U)</m>,
where <m>U</m> is the
union of the segments
<m>\overline{P_1P_2}, \dots, \overline{P_{n-1}P_n}, \overline{P_nP_1}</m>.
We typically refer to this polygon as <m>P_1\cdots P_n</m>;
each of the <m>P_i</m> is called
a \emph{vertex}<footnote>The standard
plural of ``vertex'' is ``vertices'', although ``vertexes'' is also acceptable.
What is not standard and should be avoided
is the back-formation ``vertice'' as a synonym of ``vertex''.</footnote>
<tex-index label="vertex!of a polygon|textbf" />
of the polygon, and each of the segments making up <m>U</m> is called a
\emph{side}. <tex-index label="side (of a polygon)|textbf" />
</p>
<p>
The \emph{perimeter} of a polygon
<tex-index label="perimeter (of a polygon)|textbf" /> is the sum of the lengths
of its underlying segments. It is often convenient to speak of the
\emph{semiperimeter} of a polygon,
<tex-index label="semiperimeter (of a polygon)|textbf" /> which is simply half
of the perimeter.
</p>
<p>
A polygon is \emph{nondegenerate}
<tex-index label="nondegenerate polygon|textbf" />
<tex-index label="polygon!nondegenerate|textbf" />
if no two of its vertices are equal and no vertex lies on a segment
of the polygon other than the two of which it is an endpoint.
Note that for a nondegenerate polygon, the union of segments
uniquely determines the vertices up to cyclic shift and reversal of
the list.
</p>
<p>
A polygon
is \emph{simple} (or \emph{non-self-intersecting})
<tex-index label="polygon!simple|textbf" /> <tex-index label="simple polygon|textbf" />
<tex-index label="polygon!non-self-intersecting|textbf" />
<tex-index label="non-self-intersecting polygon|textbf" />
if it is nondegenerate and no two segments of the polygon intersect
except at a shared endpoint.
</p>
<p>
For <m>P_1\cdots P_n</m> a polygon, a \emph{diagonal} of <m>P_1\cdots P_n</m>
is any segment joining two nonconsecutive vertices.
A simple polygon is \emph{convex} if any two diagonals intersect (possibly
at an endpoint).
<tex-index label="polygon!convex|textbf" />
<tex-index label="convex!polygon|textbf" />
</p>
<fact>
<statement>
<p>
If the points <m>P_1, \dots, P_n</m> lie on a circle, then the polygon
<m>P_1\cdots P_n</m> is simple if and only if it is convex.
</p>
</statement>
</fact>
<p>
If <m>P_1 \cdots P_n</m> is a convex polygon, we define the
\emph{interior}
<tex-index label="interior!of a convex polygon|textbf" />
of <m>P_1\cdots P_n</m> to be the set of points <m>Q</m> such that
for each <m>i</m>, the segment <m>P_iQ</m> intersects the polygon only at its
endpoint <m>P_i</m>.
%(One can define the interior of any simple polygon, but we will postpone
%doing so until we discuss interiors of more general sets in
%<cross-ref type="Section" tex-label="sec:properties" />.)
</p>
<p>
A nondegenerate polygon of three, four, five or six sides
is called a \emph{triangle}, <tex-index label="triangle|textbf" />
\emph{quadrilateral}, <tex-index label="quadrilateral|textbf" />
\emph{pentagon}, <tex-index label="pentagon|textbf" />
or \emph{hexagon}, <tex-index label="hexagon|textbf" /> respectively.
Since triangles will occur quite often in our discussions, we adopt
some special conventions to deal with them. We will often refer to the triangle
with vertices <m>A,B,C</m> as <m>\triangle ABC</m>, and we will list its sides
in the order <m>\seg{BC}, \seg{CA}, \seg{AB}</m>. We will often refer to its
side lengths as <m>a = BC, b = CA, c = AB</m>.
</p>
<p>
Let <m>ABC</m> be a triangle. If two of the sides <m>AB,BC,CA</m> have equal lengths, we
say <m>\triangle ABC</m> is \emph{isosceles}; if all three sides have equal lengths, we say <m>\triangle ABC</m> is \emph{equilateral}. If the angles of
<m>ABC</m> are all acute, we say <m>ABC</m> is \emph{acute} <tex-index label="acute!triangle|textbf" />
<tex-index label="triangle!acute|textbf" />.
</p>
<p>
Let <m>ABCD</m> be a convex quadrilateral. If lines <m>\line{AB}</m> and <m>\line{CD}</m>
are parallel, we say <m>ABCD</m> is a \emph{trapezoid}. <tex-index label="trapezoid|textbf" />
If in addition lines <m>\line{BC}</m> and <m>\line{DA}</m> are parallel, we say
<m>ABCD</m> is a \emph{parallelogram}. <tex-index label="parallelogram|textbf" />
If in addition <m>\line{AB} \perp \line{BC}</m>, we say <m>ABCD</m> is a \emph{rectangle}.
<tex-index label="rectangle|textbf" />
If in addition <m>AB=BC=CD=DA</m>, we say <m>ABCD</m> is a \emph{square}.
<tex-index label="square|textbf" />
</p>
</section>
<section>
<title>
Areas of polygons
</title>
<p>
If <m>P_1\cdots P_n</m> is a polygon and <m>P_i = (x_i, y_i)</m>, we define the
\emph{directed/signed area}
<tex-index label="area!directed (of a polygon)|textbf" />
<tex-index label="directed area (of a polygon)|textbf" />
<tex-index label="area!signed (of a polygon)|textbf" />
<tex-index label="signed area (of a polygon)|textbf" />
of <m>P_1\cdots P_n</m>, denoted <m>[P_1\cdots P_n]_{\pm}</m>, by the formula
<dm>
[P_1\cdots P_n]_{\pm} = \frac{1}{2} (x_1y_2 - x_2y_1 + x_2y_3 - x_3y_2 + \cdots
+ x_{n-1}y_n - x_n y_{n-1} + x_n y_1 - x_1 y_n).
</dm>
This formula is sometimes called the \emph{surveyor's formula}
<tex-index label="formula, surveyor's|textbf" />
<tex-index label="surveyor's formula|textbf" />
or the \emph{shoelace formula};
<tex-index label="formula, shoelace|textbf" />
<tex-index label="shoelace formula|textbf" />
the latter name serves as a mnemonic in the following fashion.
If one draws the <m>2 \times (n+1)</m> matrix
<dm>
\begin{pmatrix} x_1 &x_2 &\cdots &x_n &x_1 \\
y_1 &y_2 &\cdots &y_n &y_1
\end{pmatrix},
</dm>
the terms of the shoelace formula are obtained by
multiplying terms along the diagonals and attaching signs as follows:
<dm>
\xymatrix@=2pt{
\ar[rrrddd] & \ar[rrrddd] & \ar[rrrddd] & - \ar[rrrddd] & - & - &- \\
&x_1 &x_2 &\cdots &x_n &y_1 & \\
&y_1 &y_2 &\cdots &y_n &y_1 & \\
\ar[rrruuu] & \ar[rrruuu] & \ar[rrruuu] & + \ar[rrruuu] & + & + &+
}
</dm>
</p>
<p>
We define the \emph{area} of the polygon <m>P_1\cdots P_n</m>,
<tex-index label="area!of a polygon|textbf" />
denoted <m>[P_1\cdots P_n]</m>,
to be the absolute value of its directed area.
</p>
<fact>
<statement>
<p>
<ul>
<li>
For any polygon <m>P_1\cdots P_n</m>,
<dm>
[P_1\cdots P_n]_{\pm} = [P_2\cdots P_n P_1]_{\pm}
= -[P_n\cdots P_2P_1]_{\pm}.
</dm>
</li>
<li>
For any polygons <m>P_1\cdots P_nXY</m> and <m>YXQ_1\cdots Q_m</m>,
<dm>
[P_1\cdots P_nXY]_{\pm} + [YXQ_1\cdots Q_m]_{\pm}
= [P_1\cdots P_nQ_1\cdots Q_m]_{\pm}.
</dm>
</li>
<li>
For any triangle <m>ABC</m>,
<dm>
[ABC] = \frac{1}{2} BC \times d(A, \line{BC}).
</dm>
In particular, <m>[ABC] \neq 0</m>.
</li>
<li>
For any convex quadrilateral <m>ABCD</m>, <m>[ABC]_{\pm}</m> and <m>[ABD]_{\pm}</m>
have the same (nonzero) sign.
</li>
<li>
For any simple polygon <m>P_1\cdots P_n</m>, the directed areas
<m>[P_iP_jP_k]_{\pm}</m> all have the same sign, and it is the same as the sign
of <m>[P_1\cdots P_n]_{\pm}</m>. (This follows from the previous parts of this
Fact; do you see how?)
</li>
</ul>
</p>
</statement>
</fact>
<p>
For <m>P_1\cdots P_n</m> a convex polygon,
we call the sign of <m>[P_1\cdots P_n]_{\pm}</m> the
\emph{orientation} of <m>P_1\cdots P_n</m>;
<tex-index label="orientation (of a convex polygon)" />
we refer to positive and negative orientations also as
``counterclockwise'' and ``clockwise'', respectively.
</p>
</section>
<section>
<title>
Areas of circles and measures of arcs
</title>
<p>
Everything we have discussed so far was described purely in terms of
basic algebraic operations on the real numbers: addition, subtraction,
multiplication, division and square roots. The area of a circle and the
measure of an arc cannot be described
quite so simply; one must use the least upper bound property.
</p>
<p>
Given a circle <m>\omega</m>, the \emph{area} of the circle
<tex-index label="area!of a circle" /> is defined to be the least upper bound of the
set of areas of convex polygons <m>P_1\cdots P_n</m> with vertices on <m>\omega</m>;
note that this set is indeed bounded, for instance by the area of any
square containing <m>\omega</m> in its interior.
</p>
<fact>
<statement>
<p>
<ul>
<li>
There exists a constant <m>\pi</m> such that the area of a circle of radius
<m>r</m> is equal to <m>\pi r^2</m>.
</li>
<li>
The area of a circle is also equal to the greatest lower bound of the
set of areas of convex polygons <m>P_1\cdots P_n</m> containing <m>\omega</m> in its
interior.
</li>
</ul>
</p>
</statement>
</fact>
<p>
Next we consider arcs and their measures.
Given three distinct points <m>A,B,C</m> on a circle <m>\omega</m>,
we define the \emph{arc} <tex-index label="arc|textbf" />
<m>\arc{ABC}</m> as the set of points <m>D \in \omega</m>
such that the quadrilateral <m>ABCD</m> is not simple (including the
points <m>A,B,C</m>).
Since <m>\omega</m> is uniquely determined by any arc, we may
unambiguously speak of the \emph{center} and \emph{radius} of an arc.
<tex-index label="center!of an arc|textbf" /> <tex-index label="radius!of an arc|textbf" />
There is a unique point
<m>M</m> on <m>\arc{ABC}</m> with <m>AM = MC</m> (namely the intersection of <m>\arc{ABC}</m>
with the perpendicular bisector of <m>AC</m>), called the
\emph{midpoint} <tex-index label="midpoint!of an arc|textbf" /> of <m>\arc{ABC}</m>.
If the line <m>\line{AB}</m> passes through the center of <m>\omega</m>, we call