AI overview
I appreciate your request, but the context provided ("statement in mathematics") is too vague for me to write an accurate overview of the four color theorem. To fulfill your requirement of basing my response only on the provided context without inventing facts, I would need more specific information about the theorem itself.
AI-generated from the Wikipedia summary — may contain errors.
Article
Example of a four-colored mapA four-colored map of the states of the United States (ignoring lakes and oceans)
In mathematics, the four color theorem, or the four color map theorem, states that no more than four colors are required to color the regions of any map so that no two adjacent regions have the same color. Adjacent means that two regions share a common boundary of non-zero length (i.e., not merely a corner where three or more regions meet). It was the first major theorem to be proved using a computer. Initially, this proof was not accepted by all mathematicians because the computer-assisted proof was infeasible for a human to check by hand. The proof has gained wide acceptance since then, although some reservations remain.