Difference between revisions of "Menelaus' Theorem"
Swimmerstar (talk | contribs) m |
|||
Line 6: | Line 6: | ||
A necessary and sufficient condition for points <math>P, Q, R</math> on the respective sides <math>BC, CA, AB</math> (or their extensions) of a triangle <math>ABC</math> to be collinear is that | A necessary and sufficient condition for points <math>P, Q, R</math> on the respective sides <math>BC, CA, AB</math> (or their extensions) of a triangle <math>ABC</math> to be collinear is that | ||
− | <center><math>BP\cdot CQ\cdot AR = | + | <center><math>BP\cdot CQ\cdot AR = PC\cdot QA\cdot RB</math></center> |
where all segments in the formula are [[directed segment]]s. | where all segments in the formula are [[directed segment]]s. |
Revision as of 05:40, 16 May 2014
This article is a stub. Help us out by expanding it.
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,
$Z\cdotPR = -X\cdot(R-1)(P-1)+Y\cdotR(1-P)$ (Error compiling LaTeX. Unknown error_msg)
Plugging in the coordinates for yields:
We know that, since
,
. Likewise,
, and
.
Substituting these values yields:
$(Q-1)(R-1)(P-1) = \frac{(1-Q)\cdot QC \cdot (1-P) \cdot PB \cdot (1-R) \cdot AR}{QA\cdotCP\cdotBR}$ (Error compiling LaTeX. Unknown error_msg)
Which simplifies to:
QED