Difference between revisions of "Menelaus' Theorem"
Richardhixx (talk | contribs) m (Missing negative) |
|||
Line 9: | Line 9: | ||
<center><asy> | <center><asy> | ||
+ | unitsize(16); | ||
defaultpen(fontsize(8)); | defaultpen(fontsize(8)); | ||
pair A=(7,6), B=(0,0), C=(10,0), P=(4,0), Q=(6,8), R; | pair A=(7,6), B=(0,0), C=(10,0), P=(4,0), Q=(6,8), R; |
Revision as of 16:10, 8 January 2018
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.
Proof:
Draw a line parallel to through to intersect at :
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,
Plugging in the coordinates for yields . From we have Likewise, and
Substituting these values yields which simplifies to
QED