Math 2.0

Geometry Proof

Proof of the intercept theorem with vectors

Builds on LineEuclidean distanceLength of a vectorLinear independence

Proof

We write all points with vectors from SS and compare coefficients.

  1. Two distinct lines meet in at most one point, because exactly one line passes through two distinct points. So ℓ1∩ℓ2={S}\ell_1 \cap \ell_2 = \set{S}.
  2. Write ℓ1={P0+τw:τ∈ℝ}\ell_1 = \set{P_0 + \tau w : \tau \in \R} with w≠0w \neq 0. Then S=P0+τ1wS = P_0 + \tau_1 w and A=P0+τ2wA = P_0 + \tau_2 w with τ1≠τ2\tau_1 \neq \tau_2, since A≠SA \neq S.
  3. Let p=A−S=(τ2−τ1)w≠0p = A - S = (\tau_2 - \tau_1) w \neq 0. Each point P0+τwP_0 + \tau w equals S+τ−τ1τ2−τ1pS + \frac{\tau - \tau_1}{\tau_2 - \tau_1} p. So ℓ1={S+σp:σ∈ℝ}\ell_1 = \set{S + \sigma p : \sigma \in \R}.
  4. In the same way, with q=C−S≠0q = C - S \neq 0, we get ℓ2={S+σq:σ∈ℝ}\ell_2 = \set{S + \sigma q : \sigma \in \R}.
  5. The vectors pp and qq are linearly independent. Otherwise q=μpq = \mu p for a real μ\mu, so C∈ℓ1C \in \ell_1. Then C∈ℓ1∩ℓ2C \in \ell_1 \cap \ell_2 and C≠SC \neq S, against step 1.
  6. By steps 3 and 4, B=S+spB = S + s p and D=S+tqD = S + t q for real numbers ss and tt. Since B≠SB \neq S and D≠SD \neq S, we have s≠0s \neq 0 and t≠0t \neq 0.
  7. By step 5, C−A=q−p≠0C - A = q - p \neq 0 and D−B=tq−sp≠0D - B = t q - s p \neq 0. So C−AC - A and D−BD - B are direction vectors of the lines ACAC and BDBD.
  8. Two lines are parallel when they have the same direction vectors, up to a nonzero factor. So D−B=μ(C−A)D - B = \mu (C - A) for a real μ\mu.
  9. Step 8 says tq−sp=μq−μpt q - s p = \mu q - \mu p, that is (t−μ)q+(μ−s)p=0(t - \mu) q + (\mu - s) p = 0. By step 5, t=μt = \mu and s=μs = \mu. So s=ts = t.
  10. With the Euclidean distance and the length, ∣SB∣=∥sp∥=∣s∣ ∣SA∣\abs{SB} = \norm{s p} = \abs{s} \, \abs{SA} and ∣SD∣=∥sq∥=∣s∣ ∣SC∣\abs{SD} = \norm{s q} = \abs{s} \, \abs{SC}.
  11. Also ∣BD∣=∥sq−sp∥=∣s∣ ∥q−p∥=∣s∣ ∣AC∣\abs{BD} = \norm{s q - s p} = \abs{s} \, \norm{q - p} = \abs{s} \, \abs{AC}.
  12. All of ∣SB∣\abs{SB}, ∣SD∣\abs{SD} and ∣BD∣\abs{BD} are positive, by steps 6 and 7. Dividing, each of the three quotients ∣SA∣∣SB∣\frac{\abs{SA}}{\abs{SB}}, ∣SC∣∣SD∣\frac{\abs{SC}}{\abs{SD}} and ∣AC∣∣BD∣\frac{\abs{AC}}{\abs{BD}} equals 1∣s∣\frac{1}{\abs{s}}.
  13. Hence ∣SA∣∣SB∣=∣SC∣∣SD∣=∣AC∣∣BD∣\dfrac{\abs{SA}}{\abs{SB}} = \dfrac{\abs{SC}}{\abs{SD}} = \dfrac{\abs{AC}}{\abs{BD}}.

Idea

From SS, the points BB and DD are multiples sps p and tqt q of the vectors to AA and CC. The parallel condition forces s=ts = t, because pp and qq point in independent directions. So one scaling by ss maps AA, CC to BB, DD, and every length scales by ∣s∣\abs{s}.

Reading path

To understand this page from the ground up, read these 5 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. Euclidean distance concept
  2. Length of a vector concept
  3. Line concept
  4. Linear independence concept
  5. Proof of the intercept theorem with vectors proof

Where this leads

1 page builds on this one.

Further reading

  1. Web https://en.wikipedia.org/wiki/Intercept_theorem, Scalar multiplication in vector spaces
About this page
TagJ9J2RW0BFN
URIm2://J9J2RW0BFN
Kindproof
WritingW0 stub
MSC51M04
ProvesIntercept theorem
UsesLine, Euclidean distance, Length of a vector, Linear independence
Changed4 November 2026

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • an inventory row: the row of the inventory that the node accounts for (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.