Complex Analysis: Theory and Applications · Problem 1.3.23

Complex Numbers — Howell & Matthews

Mathematics — Complex Analysis · triangle-inequality-induction

Problem

Prove by induction that ∣∑k=1nzk∣≤∑k=1n∣zk∣\left|\displaystyle\sum_{k=1}^n z_k\right| \leq \displaystyle\sum_{k=1}^n |z_k| for all natural numbers nn.
Intuitive explanation

This is the triangle inequality for sums — a foundational property showing that the magnitude of a sum never exceeds the sum of magnitudes. The key insight is that induction lets you apply the two-term triangle inequality ∣z+w∣≤∣z∣+∣w∣|z + w| \leq |z| + |w| repeatedly: once you know the inequality holds for nn terms, you can treat their sum as a single complex number and add one more term, letting the base case do the heavy lifting. This pattern of "assume it works for nn, then show it works for n+1n+1" is exactly what induction is built for.

Intuitive explanation

This is the triangle inequality for sums — a foundational property showing that the magnitude of a sum never exceeds the sum of magnitudes. The key insight is that induction lets you apply the two-term triangle inequality ∣z+w∣≤∣z∣+∣w∣|z + w| \leq |z| + |w| repeatedly: once you know the inequality holds for nn terms, you can treat their sum as a single complex number and add one more term, letting the base case do the heavy lifting. This pattern of "assume it works for nn, then show it works for n+1n+1" is exactly what induction is built for.

Related theory

Browse the problem library