Menelaus'
Theorem deals with the collinearity of points on each of the three sides
(extended when necessary) of a triangle. It is named for Menelaus of Alexandria.
Statement:
A
necessary and sufficient condition for points
on the respective sides
(or their extensions) of a
triangle
to be collinear is that
where
all segments in the formula are directed segments.
![[asy] unitsize(16); defaultpen(fontsize(8)); pair A=(7,6), B=(0,0), C=(10,0), P=(4,0), Q=(6,8), R; draw((0,0)--(10,0)--(7,6)--(0,0),blue+0.75); draw((7,6)--(6,8)--(4,0)); R=intersectionpoint(A--B,Q--P); dot(A^^B^^C^^P^^Q^^R); label("A",A,(1,1));label("B",B,(-1,0));label("C",C,(1,0));label("P",P,(0,-1));label("Q",Q,(1,0));label("R",R,(-1,1)); [/asy]](https://latex.artofproblemsolving.com/8/7/e/87e7bd56f19d2bc7aa2f8aa9681e95b0d546ef76.png)
Proof:
Draw
a line parallel to
through
to intersect
at
:
![[asy] unitsize(16); defaultpen(fontsize(8)); pair A=(7,6), B=(0,0), C=(10,0), P=(4,0), Q=(6,8), R, K=(5.5,0); draw((0,0)--(10,0)--(7,6)--(0,0),blue+0.75); draw((7,6)--(6,8)--(4,0)); draw(A--K, dashed); R=intersectionpoint(A--B,Q--P); dot(A^^B^^C^^P^^Q^^R^^K); label("A",A,(1,1));label("B",B,(-1,0));label("C",C,(1,0));label("P",P,(0,-1));label("Q",Q,(1,0));label("R",R,(-1,1)); label("K",K,(0,-1)); [/asy]](https://latex.artofproblemsolving.com/2/1/a/21a5638c7f244737d8cab27dad348acb8d143023.png)
Multiplying
the two equalities together to eliminate the
factor, we get:
Proof Using Barycentric coordinates
Disclaimer:
This proof is not nearly as elegant as the above one. It uses a bash-type
approach, as barycentric coordinate proofs tend to be.
Suppose
we give the points
the following coordinates:
Note
that this says the following:
The
line through
and
is given by: 

which yields, after simplification,
QED
AoPS
댓글 없음:
댓글 쓰기