diff --git a/euclidean_plane_not_five_colorable_v2.txt b/euclidean_plane_not_five_colorable_v2.txt
index 9a8c477..efb7bb7 100644
--- a/euclidean_plane_not_five_colorable_v2.txt
+++ b/euclidean_plane_not_five_colorable_v2.txt
@@ -1,21 +1,6 @@
-THE EUCLIDEAN PLANE IS NOT FIVE-COLORABLE
-an honest reader's guide to the paper, and to what is really known
+IS THE EUCLIDEAN PLANE FIVE-COLORABLE
 ====================================================================
-
-WHAT THIS FILE IS
-  euclidean_plane_not_five_colorable_original.txt is a long document that
-  claims to prove chi(R^2) >= 6, i.e., that no five-coloring of the plane
-  is proper. That claim is NOT established in mathematics. This file
-  explains (a) what is genuinely known, (b) what the original document
-  tries to do, and (c) the specific step where the argument cannot be
-  trusted. It is written so a motivated high-schooler can follow.
-
-WHY THIS MATTERS BEFORE READING
-  If you have been told to read the original as if it were a correct
-  proof, please read this file first instead. It is shorter, it is
-  honest, and it explains what is real versus claimed.
-
-THE ACTUAL STATE OF THE ART
+FIVE-COLORABLE
   The problem of coloring the plane so that any two points at distance 1
   get different colors is called the Hadwiger-Nelson problem. Write