A coloring of the plane without monochromatic right triangles
Bal\'azs Bursics, P\'eter Komj\'ath

TL;DR
This paper proves that under the Continuum Hypothesis, it is possible to color the plane with countably many colors without creating a monochromatic right triangle, resolving a previously claimed result.
Contribution
It provides a complete and correct proof of a coloring of the plane avoiding monochromatic right triangles under the Continuum Hypothesis, clarifying earlier claims.
Findings
Existence of a coloring with no monochromatic right triangles under CH
Complete proof of the coloring construction
Addresses and corrects previous claims by Erdős and Komjáth
Abstract
We give a full, correct proof of the following result, earlier claimed by Erd\H{o}s and Komj\'ath. If the Continuum Hypothesis holds then there is a coloring of the plane with countably many colors, with no monocolored right triangle.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMathematics and Applications · Advanced Topology and Set Theory · Limits and Structures in Graph Theory
A coloring of the plane without monochromatic right triangles
Balázs Bursics
Péter Komjáth111Partially supported by Hungarian National Research Grant OTKA K 131842
Abstract
We give a full, correct proof of the following result, earlier claimed in [1]. If the Continuum Hypothesis holds then there is a coloring of the plane with countably many colors, with no monocolored right triangle.
One2222010 Mathematics Subject Classification. Primary 03E50 Secondary 51M04, 05D10. Key words and phrases: Continuum Hypothesis, Ramsey theory of Euclidean spaces of Paul Erdős’s favorite topics consisted the applications of the Axiom of Choice to construct paradoxical sets and colorings of the Euclidean spaces. Among a large number of other questions, he raised the following: is there a coloring of the plane with countably many colors, with no monocolored right angled triangles. In [1] this was shown to be equivalent to the Continuum Hypothesis.
Recently, the senior author observed that the proof of the positive direction in [1] is incomplete. Here we give a full, correct proof.
We notice that later Schmerl in [2] gave another, more general proof, which, however, is less elementary.
Notation. Definitions. We use the notation and terminology of axiomatic set theory. The ordinals are von Neumann ordinals, is the least uncountable ordinal.
Theorem. (CH) There is with no monochromatic right angles.
Proof. Using CH, we decompose and the set of planar lines and circles into the increasing, continuous sequence of sets as and such that and
(1) if , then their connecting line and Thales circle are in ,
(2) if are not collinear, then their circuit is in ,
(3) if , then ,
(4) if , is a circle, then the antipodal point of in is in ,
(5) if is a line, , then the line perpendicular to with also contained in .
This can be done by the usual Skolem-type closing arguments.
We are going to construct the coloring and the function by transfinite recursion on for and for , satisfying the following:
(6) is injective,
(7) if , , , then ,
(8) if is a circle, , , , then are not antipodal,
(9) if is a circle, , then ,
(10) if is a line, , then ,
(11) if are perpendicular lines, , then .
Claim 1. There is no right triangle monocolored by .
Proof. Assume that form a right triangle with the right angle at and . Let be the circle around . If , then we obtain a contradiction with (9). If , then we get a contradiction with (8), as are antipodal.
Claim 2. If , then there is at most one such that .
Proof. By (3).
We add the following condition:
(12) if , is a line with , is the line perpendicular to at , , then .
Notice that by (3) and (5), and by (1).
Assume that and are already constructed, we have to define and .
Enumerate as . By recursion on define so that
[TABLE]
satisfies (7), and is different from the (possible) color disqualified by (12). Clearly (6) is satisfied, and also is infinite.
Next we define on the circuits in . If is such a circuit, set . By (2), we have .
Case 1. or takes distinct values on the two elements of .
In this case, set .
Case 2. and assumes the same value on the elements of .
In this case, set .
Finally, we define on the lines in . Let be a line. Set . Notice that by (1), . If is nonempty, let be its unique point.
Case 1. or .
Then let .
Case 2. .
Then set .
Claim 3. ().
Proof. If is a circuit, then this is obvious in Case 2 and in Case 1 is minus at most 2 elements.
If is a line, the statement follows as is a coinfinite set.
Claim 4. satisfies (8).
Proof. Assume that is a circle, are antipodal and .
Case 1. .
In this case one of , say must be in by (6). Then, by (4), is also in , and we are finished by induction.
Case 2. .
If , then by (6).
If , then by (1), a contradiction again.
Assume finally, that , . If, in the definition of , Case 1 applies, then . We can therefore assume that Case 2 holds, and . Let be the connecting line of and , the connecting line of and .
x$$y$$z$$C$$L$$L^{\prime}
Then by (1) and then by (5). Further, by (10), , which, with , contradicts (11).
Claim 5. (9) holds.
Proof. Assume that and . If , then does not contain element from by (7). If and Case 2 holds in the definition of , then there is nothing to prove. Assume finally, that , and Case 1 holds. Then, if , then has at most one element in , at most one in by (6), that is at most 2.
Claim 6. (10) holds.
Proof. Assume that , . If , then does not increase in . If and is empty, then by (6). Otherwise, is a singleton by (1), let be its unique element. If , then again , otherwise we are in Case 2 of the definition of where we specifically added to .
Claim 7. (11) holds.
Proof. Assume that are perpendicular, , .
Case 1. .
In this case by (3), so the configuration in (11) already appers in , .
Case 2. , .
As , by the definition of the latter there is , . This is exactly what is ruled out at the coloring of by (12).
Case 3. .
Subcase 3.1. .
As , by the definition of there is with . Likewise, there is with . Now are distinct elements of and , contradicting (6).
Subcase 3.2. .
As , there is , . Similarly, there is , .
Let be the circuit containing .
x$$y$$z$$C$$L$$L^{\prime}
As are perpendicular, and are antipodal in . As in there are 3 points of color , . But this contradicts to the antipodality of and .
The proof of the theorem is concluded.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] P. Erdős, P. Komjáth: Countable decompositions of ℝ 2 superscript ℝ 2 \mathbb{R}^{2} and ℝ 3 superscript ℝ 3 \mathbb{R}^{3} , Disc. Comp. Geometry , 5 (1990), 325–331.
- 2[2] James H. Schmerl: Avoidable algebraic subsets of Euclidean space, Trans. Amer. Math. Soc. , 352 (1999), 2479–2489.
