Approximating monochromatic triangles in a two-colored plane (Q1307377): Difference between revisions

A two-coloring of the plane is a function \(F:\mathbb{R}^2\to\{\text{black, white}\}\). This is, of course, equivalent to a partition of \(\mathbb{R}^2\) into disjoint sets \(B_F=F^{-1}\)(black) and \(W_F=F^{-1}\)(white). This paper investigates the following question: Given a two-coloring \(F\) of the plane and a triangle \(T\), to what extent can we guarantee that \(T\) admits an approximation of a monochromatic copy of \(T\)? A simple initial interpreation is given in the following definition and theorem. Given a two-coloring \(F\) of the plane, a triangle is called pseudo-monochromatic if its vertices are contained entirely in one of the sets \(\text{cl}(B_F)\) or \(\text{cl}(W_F)\), where cl denotes the topological closure. Theorem 1. Given any triangle \(T\) and any two-coloring \(F\) of the plane each point of the set \(\text{cl}(B_F)\cap \text{cl}(W_F)\) is a vertex of a pseudo-monochromatic triangle congruent to \(T\).