Exercise 1: Why Both Pieces Are Needed Together — Possible Solution
========================================================================

An unavoidable set alone would only tell you that every possible map
must contain at least one configuration from a specific finite list -
it guarantees your search covers every case that could ever arise, but
it says nothing about whether those specific configurations are
actually SAFE (colorable in four colors without trouble). Without a
further guarantee about what happens once one of those configurations
shows up, you'd know your list is complete, but not know whether the
theorem is actually true for any of the cases on it.

Reducible configurations alone would have the opposite problem: proving
that a particular configuration, if it appears, can always be reduced
to a smaller four-colorable case tells you something true about THAT
specific configuration - but without a guarantee that every possible
map must contain at least one configuration from your checked list,
you'd have no way to know you'd actually covered every possible map
that could ever exist. There could always be some map, not represented
anywhere in your list, that behaves completely differently.

Put together, the two pieces close the gap completely: the unavoidable
set guarantees every possible map contains at least one of the listed
configurations (nothing is missed), and reducibility guarantees every
one of those specific configurations can always be handled successfully
(nothing goes wrong once found). Only when both properties hold
simultaneously does the finite, computer-checkable list actually prove
something true about every map that could ever exist, including
infinitely many maps never individually examined.

ANSWER: An unavoidable set alone guarantees completeness (every map
contains at least one listed configuration) but not safety; reducible
configurations alone guarantee safety for specific cases but not
completeness across every possible map. Only combining both closes the
gap - guaranteeing every possible map is both covered by the list and
safely handled once found, which is what lets a finite, checkable list
prove something about infinitely many maps.

WHY THIS WORKS AS AN ANSWER
------------------------------
This identifies the two separate real properties (completeness and
safety) each piece provides on its own, and explains precisely why
neither alone closes the logical gap a full proof requires.