deletions | additions       diff --git a/Making_a_Spanner_Proof_by__.md b/Making_a_Spanner_Proof_by__.md  index d167b28..fea2de4 100644  --- a/Making_a_Spanner_Proof_by__.md  +++ b/Making_a_Spanner_Proof_by__.md 
...
### Inductive Hypothesis  Assume that \(G(t)\) is a t-spanner for \(n-1\) points.   ### Inductive Step: RTP Step  RTP:  \(G(t)\) is a t-spanner for \(n\) points. #### Notation  Let `k` be the point added as part of our inductive step. Let \(p(i,j)\) refer to the length of the t-path connecting i and j. We adopt the following strategy for constructing an `i,j` t-path. Assume WLOG we start from `i`. At every step, we choose the edge whose end-point lies in the same segment as `j`.