The two-color map problem

A number of straight lines are drawn in the plane, dividing it into regions. Show that each
region may be colored either red or black in such a way that no two neighboring regions
have the same color.

Proof. There are several good proofs known. This proof is by induction. Let P(n) be the
statement of the result for n lines. Clearly P(1) is true; color one side of the line red and
the other side black. Suppose P(n) is true. Let a diagram be drawn with n + 1 lines.
Disregarding any one line, the regions may be colored in the desired way, by P(n). Now
add the last line. Change the color of all regions on one side of the line, and leave the
colors of all regions on the other side of the line. If two regions share a boundary then
they have opposite colors, whether their common boundary is part of the last line or not.