fixes following comments by @oyamad

Author: jstac

lectures/mccall_model.md

@@ -297,10 +297,9 @@ Step 4: if the deviation is larger than some fixed tolerance, set $v = v'$ and g
 
 Step 5: return $v$.
 
-Let $\{ v_k \}$ denote the sequence generated by this algorithm.
+For small tolerance, the returned function $v$ is a close approximation to the value function $v^*$.
 
-This sequence converges to the solution
-to {eq}`odu_pv2` as $k \to \infty$, which is the value function $v^*$.
+The theory below elaborates on this point.
 
 ### The Fixed Point Theory
 

lectures/short_path.md

@@ -473,3 +473,8 @@ J = compute_cost_to_go(Q)
 print_best_path(J, Q)
 ```
 
+The total cost of the path should agree with $J[0]$ so let's check this.
+
+```{code-cell} python3
+J[0]
+```