Math 2.0

Geometry Triangles and circles Theorem

Intersecting secants theorem

Builds on Concyclic pointsEuclidean distancePower of a point

Statement

Let AA, BB, CC and DD be concyclic points of the Euclidean plane ℝ2\mathbb{R}^2, with A≠DA \neq D and B≠CB \neq C. Let dd be the Euclidean distance. Suppose that the lines ADAD and BCBC meet at a point PP outside the circle. Then d(P,A) d(P,D)=d(P,B) d(P,C).d(P, A)\, d(P, D) = d(P, B)\, d(P, C).

Remarks

Both products are equal to the power d(P,O)2−r2d(P, O)^2 - r^2 of PP, where OO is the centre and rr the radius. A proof: the triangles PACPAC and PBDPBD are similar, because they have the same angle at PP and equal inscribed angles at CC and DD. If the second line becomes tangent, then B=CB = C, and the statement becomes the tangent–secant theorem.

Reading path

To understand this page from the ground up, read these 4 pages in order. The foundations come first.

Show the path as a graph
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Concyclic points concept
  2. Euclidean distance concept
  3. Power of a point concept
  4. Intersecting secants theorem statement

Further reading

  1. Web https://en.wikipedia.org/wiki/Intersecting_secants_theorem, lead section
  2. Web https://en.wikipedia.org/wiki/Power_of_a_point, Intersecting secants theorem, intersecting chords theorem
About this page
Tag0J5XR7BW2S
URIm2://0J5XR7BW2S
Aliasessecant-theorem
Kindstatement, theorem
WritingW1 stated
MSC51M04
StatusThis copy of the site has no build data. Run m2 status 0J5XR7BW2S.
UsesConcyclic points, Euclidean distance, Power of a point
Same as

Markdown · JSON · Edit on GitHub

What this page needs for W2

  • edge about out: the concepts that the statement is about (0 of 1)
  • edge proves in: at least one proof node (0 of 1)
  • edge instance_of or illustrates in: one example that shows the statement at work (0 of 1)
  • explanation L2 (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

No page links to this page yet.