Skip to main content
Mathematics LibreTexts

6.1: Similar triangles

  • Page ID
    23612
  • \( \newcommand{\vecs}[1]{\overset { \scriptstyle \rightharpoonup} {\mathbf{#1}} } \)

    \( \newcommand{\vecd}[1]{\overset{-\!-\!\rightharpoonup}{\vphantom{a}\smash {#1}}} \)

    \( \newcommand{\id}{\mathrm{id}}\) \( \newcommand{\Span}{\mathrm{span}}\)

    ( \newcommand{\kernel}{\mathrm{null}\,}\) \( \newcommand{\range}{\mathrm{range}\,}\)

    \( \newcommand{\RealPart}{\mathrm{Re}}\) \( \newcommand{\ImaginaryPart}{\mathrm{Im}}\)

    \( \newcommand{\Argument}{\mathrm{Arg}}\) \( \newcommand{\norm}[1]{\| #1 \|}\)

    \( \newcommand{\inner}[2]{\langle #1, #2 \rangle}\)

    \( \newcommand{\Span}{\mathrm{span}}\)

    \( \newcommand{\id}{\mathrm{id}}\)

    \( \newcommand{\Span}{\mathrm{span}}\)

    \( \newcommand{\kernel}{\mathrm{null}\,}\)

    \( \newcommand{\range}{\mathrm{range}\,}\)

    \( \newcommand{\RealPart}{\mathrm{Re}}\)

    \( \newcommand{\ImaginaryPart}{\mathrm{Im}}\)

    \( \newcommand{\Argument}{\mathrm{Arg}}\)

    \( \newcommand{\norm}[1]{\| #1 \|}\)

    \( \newcommand{\inner}[2]{\langle #1, #2 \rangle}\)

    \( \newcommand{\Span}{\mathrm{span}}\) \( \newcommand{\AA}{\unicode[.8,0]{x212B}}\)

    \( \newcommand{\vectorA}[1]{\vec{#1}}      % arrow\)

    \( \newcommand{\vectorAt}[1]{\vec{\text{#1}}}      % arrow\)

    \( \newcommand{\vectorB}[1]{\overset { \scriptstyle \rightharpoonup} {\mathbf{#1}} } \)

    \( \newcommand{\vectorC}[1]{\textbf{#1}} \)

    \( \newcommand{\vectorD}[1]{\overrightarrow{#1}} \)

    \( \newcommand{\vectorDt}[1]{\overrightarrow{\text{#1}}} \)

    \( \newcommand{\vectE}[1]{\overset{-\!-\!\rightharpoonup}{\vphantom{a}\smash{\mathbf {#1}}}} \)

    \( \newcommand{\vecs}[1]{\overset { \scriptstyle \rightharpoonup} {\mathbf{#1}} } \)

    \( \newcommand{\vecd}[1]{\overset{-\!-\!\rightharpoonup}{\vphantom{a}\smash {#1}}} \)

    \(\newcommand{\avec}{\mathbf a}\) \(\newcommand{\bvec}{\mathbf b}\) \(\newcommand{\cvec}{\mathbf c}\) \(\newcommand{\dvec}{\mathbf d}\) \(\newcommand{\dtil}{\widetilde{\mathbf d}}\) \(\newcommand{\evec}{\mathbf e}\) \(\newcommand{\fvec}{\mathbf f}\) \(\newcommand{\nvec}{\mathbf n}\) \(\newcommand{\pvec}{\mathbf p}\) \(\newcommand{\qvec}{\mathbf q}\) \(\newcommand{\svec}{\mathbf s}\) \(\newcommand{\tvec}{\mathbf t}\) \(\newcommand{\uvec}{\mathbf u}\) \(\newcommand{\vvec}{\mathbf v}\) \(\newcommand{\wvec}{\mathbf w}\) \(\newcommand{\xvec}{\mathbf x}\) \(\newcommand{\yvec}{\mathbf y}\) \(\newcommand{\zvec}{\mathbf z}\) \(\newcommand{\rvec}{\mathbf r}\) \(\newcommand{\mvec}{\mathbf m}\) \(\newcommand{\zerovec}{\mathbf 0}\) \(\newcommand{\onevec}{\mathbf 1}\) \(\newcommand{\real}{\mathbb R}\) \(\newcommand{\twovec}[2]{\left[\begin{array}{r}#1 \\ #2 \end{array}\right]}\) \(\newcommand{\ctwovec}[2]{\left[\begin{array}{c}#1 \\ #2 \end{array}\right]}\) \(\newcommand{\threevec}[3]{\left[\begin{array}{r}#1 \\ #2 \\ #3 \end{array}\right]}\) \(\newcommand{\cthreevec}[3]{\left[\begin{array}{c}#1 \\ #2 \\ #3 \end{array}\right]}\) \(\newcommand{\fourvec}[4]{\left[\begin{array}{r}#1 \\ #2 \\ #3 \\ #4 \end{array}\right]}\) \(\newcommand{\cfourvec}[4]{\left[\begin{array}{c}#1 \\ #2 \\ #3 \\ #4 \end{array}\right]}\) \(\newcommand{\fivevec}[5]{\left[\begin{array}{r}#1 \\ #2 \\ #3 \\ #4 \\ #5 \\ \end{array}\right]}\) \(\newcommand{\cfivevec}[5]{\left[\begin{array}{c}#1 \\ #2 \\ #3 \\ #4 \\ #5 \\ \end{array}\right]}\) \(\newcommand{\mattwo}[4]{\left[\begin{array}{rr}#1 \amp #2 \\ #3 \amp #4 \\ \end{array}\right]}\) \(\newcommand{\laspan}[1]{\text{Span}\{#1\}}\) \(\newcommand{\bcal}{\cal B}\) \(\newcommand{\ccal}{\cal C}\) \(\newcommand{\scal}{\cal S}\) \(\newcommand{\wcal}{\cal W}\) \(\newcommand{\ecal}{\cal E}\) \(\newcommand{\coords}[2]{\left\{#1\right\}_{#2}}\) \(\newcommand{\gray}[1]{\color{gray}{#1}}\) \(\newcommand{\lgray}[1]{\color{lightgray}{#1}}\) \(\newcommand{\rank}{\operatorname{rank}}\) \(\newcommand{\row}{\text{Row}}\) \(\newcommand{\col}{\text{Col}}\) \(\renewcommand{\row}{\text{Row}}\) \(\newcommand{\nul}{\text{Nul}}\) \(\newcommand{\var}{\text{Var}}\) \(\newcommand{\corr}{\text{corr}}\) \(\newcommand{\len}[1]{\left|#1\right|}\) \(\newcommand{\bbar}{\overline{\bvec}}\) \(\newcommand{\bhat}{\widehat{\bvec}}\) \(\newcommand{\bperp}{\bvec^\perp}\) \(\newcommand{\xhat}{\widehat{\xvec}}\) \(\newcommand{\vhat}{\widehat{\vvec}}\) \(\newcommand{\uhat}{\widehat{\uvec}}\) \(\newcommand{\what}{\widehat{\wvec}}\) \(\newcommand{\Sighat}{\widehat{\Sigma}}\) \(\newcommand{\lt}{<}\) \(\newcommand{\gt}{>}\) \(\newcommand{\amp}{&}\) \(\definecolor{fillinmathshade}{gray}{0.9}\)

    Two triangles \(A'B'C'\) and \(ABC\) are called similar (briefly \(\triangle A'B'C' \sim \triangle ABC\)) if (1) their sides are proportional; that is,

    \[A'B' = k\cdot AB, B'C' = k \cdot BC \text{ and } C'A' = k \cdot CA\]

    for some \(k > 0\), and (2) the corresponding angles are equal up to sign:

    \[\begin{array} {l} {\measuredangle A'B'C' = \pm \measuredangle ABC} \\ {\measuredangle B'C'A' = \pm \measuredangle BCA} \\ {\measuredangle C'A'B' = \pm \measuredangle CAB} \end{array}\]

    Remarks

    • According to Theorem 3.3.1, in the above three equalities, the signs can be assumed to be the same.
    • If \(\triangle A'B'C' \sim \triangle ABC\) with \(k = 1\) in 6.1.1, then \(\triangle A'B'C' \cong \triangle ABC\).
    • Note that "\(\sim\)" is an equivalence relation. That is,
      (i) \(\triangle ABC \sim \triangle ABC\) for any \(\triangle ABC\).
      (ii) if \(\triangle A'B'C' \sim \triangle ABC\), then
      \[\triangle ABC \sim \triangle A'B'C'\]
      (iii) If \(\triangle A''B''C'' \sim \triangle A'B'C'\) and \(\triangle A'B'C' \sim \triangle ABC\), then
      \[\triangle A''B''C'' \sim \triangle ABC\]

    Using the new notation "\(\sim\)", we can reformulate Axiom V:

    Theorem \(\PageIndex{1}\) Reformulation of Axiom V.

    If for the two triangles \(\triangle ABC\), \(\triangle AB'C'\), and \(k > 0\) we have \(B' \in [AB)\), \(C' \in [AC)\), \(AB' = k \cdot AB\) and \(AC' = k \cdot AC\), then \(\triangle ABC \sim \triangle AB'C'\).

    In other words, the Axiom V provides a condition which guarantees that two triangles are similar. Let us formulate three more such similarity conditions.

    Theorem \(\PageIndex{2}\) Similarity conditions

    Two triangles \(\triangle ABC\) and \(\triangle A'B'C'\) are similar if one of the following conditions holds:

    (SAS) For some constant \(k > 0\) we have

    \(AB = k \cdot A'B', AC = k \cdot A'C'\)

    and \(\measuredangle BAC = \pm \measuredangle B'A'C'.\)

    (AA) The triangle \(A'B'C'\) is nondegenerate and

    \(\measuredangle ABC = \pm \measuredangle A'B'C', \measuredangle BAC = \pm \measuredangle B'A'C'.\)

    (SSS) For some constant \(k > 0\) we have

    \(AB = k \cdot A'B', AC = k \cdot A'C', CB = k \cdot C'B'.\)

    Each of these conditions is proved by applying Axiom V with the SAS, ASA, and SSS congruence conditions respectively (see Axiom IV and the Theorem 4.2.1, Theorem 4.4.1).

    Proof

    Set \(k = \dfrac{AB}{A'B'}\). Choose points \(B'' \in [A'B')\) and \(C'' \in [A'C')\), so that \(A'B'' = k \cdot A'B'\) and \(A'C'' = k \cdot A'C'\). By Axiom V, \(\triangle A'B'C' \sim \triangle A'B''C''\).

    Applying the SAS, ASA or SSS congruence condition, depending on the case, we get that \(\triangle A'B''C'' \cong \triangle ABC\). Hence the result.

    A bijection \(X \leftrightarrow X'\) from a plane to itself is called angle preserving transformation if

    \(\measuredangle ABC = \measuredangle A'B'C'\)

    for any triangle \(ABC\) and its image \(\triangle A'B'C'\).

    Exercise \(\PageIndex{1}\)

    Show that any angle-preserving transformation of the plane multiplies all the distance by a fixed constant.

    Hint

    By the AA similarity condition, the transformation multiplies the sides of any nondegenerate triangle by some number which may depend on the triangle.

    Note that for any two nondegenerate triangles that share one side this number is the same. Applying this observation to a chain of triangles leads to a solution.


    This page titled 6.1: Similar triangles is shared under a CC BY-SA 4.0 license and was authored, remixed, and/or curated by Anton Petrunin via source content that was edited to the style and standards of the LibreTexts platform.