Chapter 3: Problem 38
If \(f:[a, b] \rightarrow \mathbb{R}\), consider the graph of \(f\) as a subset of
\(\mathrm{C}\), namely, \(\\{t+i f(t)\) : \(t \in[a, b]\\}\). The length \(L\) of this
graph is by definition the supremum of the lengths of all inscribed polygons.
(An "inscribed polygon" is the union of the line segments joining \(t_{j-1}+i
f\left(t_{j-1}\right)\) to \(t_{j}+i f\left(t_{j}\right), 1 \leq j \leq n\),
where \(\left.a=t_{0}<\cdots
Short Answer
Step by step solution
Key Concepts
These are the key concepts you need to understand to accurately answer the question.