Wiki
Wiki

Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.

Updated


Source. Kenneth Moore, A pyramid with a Ramsey base is Ramsey, arXiv:2608.09649v1, Theorem 1.2 on p. 2, proof on pp. 3–5 (canonical PDF).

Statement. If BB is a finite Ramsey set in a Euclidean space and z∉aff⁡(B)z\notin\operatorname{aff}(B), then X=B∪{z}X=B\cup\{z\} is Ramsey. Thus for every positive integer rr there is a dimension NN such that every rr-coloring of RN\mathbb R^N contains a monochromatic congruent copy of XX. There is no transitivity or convex-projection assumption on the base or apex. For an empty base, if that convention is allowed, the conclusion is the elementary singleton case.

Inputs. The classical product theorem and Frankl–Rödl simplex theorem are exact external inputs. The finite-witness lemma has a complete proof relative to the stated Rado selection principle.

Complete relative proof. Assume B≠∅B\ne\varnothing. Work up to congruence in aff⁡(X)\operatorname{aff}(X). If d=dim⁡aff⁡(B)d=\dim\operatorname{aff}(B), orthogonal projection onto the base and a choice of unit normal identify

B⊆Rd,z=(u,h)∈Rd+1,h>0.B\subseteq\mathbb R^d,\qquad z=(u,h)\in\mathbb R^{d+1}, \qquad h>0.

Here BB is embedded as B×{0}B\times\{0\}, uu is unrestricted in Rd\mathbb R^d, and for every b∈Bb\in B,

∥(b,0)−z∥2=∥b−u∥2+h2.(1)\|(b,0)-z\|^2=\|b-u\|^2+h^2. \tag{1}

We induct on the number of colors. For one color, any Euclidean space containing a copy of XX suffices. Suppose r≥2r\ge2 and the assertion holds for r−1r-1. Some dimension d2d_2 then satisfies Rd2→r−1X\mathbb R^{d_2}\to_{r-1}X. Lemma 2.3 supplies a finite set of distinct points

C={c1,…,cm}⊆Rd2,C→r−1X.C=\{c_1,\ldots,c_m\}\subseteq\mathbb R^{d_2}, \qquad C\to_{r-1}X.

In particular m≥1m\ge1. Let e1,…,eme_1,\ldots,e_m be the standard orthonormal basis of Rm\mathbb R^m and set

si=(ci,hei),S={s1,…,sm}⊆Rd2+m.s_i=(c_i,he_i),\qquad S=\{s_1,\ldots,s_m\}\subseteq\mathbb R^{d_2+m}.

If ∑iti=0\sum_i t_i=0 and ∑itisi=0\sum_i t_i s_i=0, the last mm coordinates give hti=0ht_i=0 for every ii. Since h>0h>0, all tit_i vanish. Thus SS is affinely independent, and the simplex theorem makes SS Ramsey. The product theorem consequently makes

P=B×S={(b,ci,hei):b∈B, 1≤i≤m}⊆Rd+d2+mP=B\times S =\{(b,c_i,he_i):b\in B,\ 1\le i\le m\} \subseteq\mathbb R^{d+d_2+m}

Ramsey.

For each ii, let

Pi={(b,ci,hei):b∈B},ai=(u,ci,0),A={a1,…,am}.P_i=\{(b,c_i,he_i):b\in B\},\qquad a_i=(u,c_i,0),\qquad A=\{a_1,\ldots,a_m\}.

Within each PiP_i, distances equal the corresponding base distances. Moreover,

∥(b,ci,hei)−ai∥2=∥b−u∥2+h2.(2)\|(b,c_i,he_i)-a_i\|^2=\|b-u\|^2+h^2. \tag{2}

The point aia_i is distinct from every point of PiP_i, since hei≠0he_i\ne0. Equations (1)–(2) show that Pi∪{ai}P_i\cup\{a_i\} is congruent to XX. Also ∥ai−aj∥=∥ci−cj∥\|a_i-a_j\|=\|c_i-c_j\|, so AA is congruent to CC.

Choose n0n_0 with Rn0→rP\mathbb R^{n_0}\to_r P and put N=max⁡(n0,d+d2+m)N=\max(n_0,d+d_2+m). Embed PP and AA in RN\mathbb R^N by adding zero coordinates. Restricting a coloring to a coordinate copy of Rn0\mathbb R^{n_0} shows that every rr-coloring of RN\mathbb R^N contains a monochromatic copy P′P' of PP. Call its color red and let ϕ:P→P′\phi:P\to P' be a congruence.

We need to transport all the auxiliary apices by the same ambient isometry. To justify this, fix p0∈Pp_0\in P. Equality of pairwise distances implies, by polarization,

⟨p−p0,q−p0⟩=⟨ϕ(p)−ϕ(p0),ϕ(q)−ϕ(p0)⟩(p,q∈P).\langle p-p_0,q-p_0\rangle =\langle\phi(p)-\phi(p_0),\phi(q)-\phi(p_0)\rangle \qquad(p,q\in P).

Thus the rule p−p0↦ϕ(p)−ϕ(p0)p-p_0\mapsto\phi(p)-\phi(p_0) extends linearly to an inner-product-preserving map between the spans of these vectors: a vanishing linear combination has squared norm zero after applying the rule as well. Extend orthonormal bases of the two spans to orthonormal bases of RN\mathbb R^N. Mapping the extra basis vectors correspondingly gives an orthogonal map QQ on RN\mathbb R^N. The ambient isometry

ϕ~(v)=ϕ(p0)+Q(v−p0)\widetilde\phi(v)=\phi(p_0)+Q(v-p_0)

extends ϕ\phi. Put ai′=ϕ~(ai)a_i'=\widetilde\phi(a_i).

If one ai′a_i' is red, then ϕ~(Pi∪{ai})\widetilde\phi(P_i\cup\{a_i\}) is a red copy of XX. Otherwise the set {a1′,…,am′}\{a_1',\ldots,a_m'\} uses at most r−1r-1 colors. It is congruent to CC, so the defining property of CC again gives a monochromatic copy of XX. This proves the induction step and hence the theorem. □\square

Source precision. The ambient-embedding sentence on source p. 4 names PP and CC; the apices subsequently transported lie in AA. The proof above explicitly embeds PP and AA and supplies the ambient-isometry extension argument. These are explanatory expansions of the construction, not a new theorem or an author-issued erratum. No numerical dimension estimate or formal verification is claimed.

Relation to the later source. Mirabi's Theorem 1.1 has the same conclusion, with a different proof using equivalence relations and a cyclic product construction.

Bears on. #174.