Wiki
Wiki

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

Updated


Statement

Lemma 2 (p. 3). Stated inside the proof of Theorem 1, for the sets X,Y⊂RdX,Y\subset\mathbb R^d and the finite group GG of that theorem, which stay fixed throughout: "Suppose that there exists λ′>0\lambda'>0 for which Theorem 1 is true. Then, for any λ′′≥λ′\lambda''\geq\lambda' Theorem 1 is also true. In other words, the set Z′=(X,0)∪(Y,λ)Z'=(X,0)\cup(Y,\lambda) [sic] is subtransitive, and if GG is soluble, then Z′Z' is subsoluble."

The λ\lambda in the definition of Z′Z' is a misprint for λ′′\lambda''; the proof uses Z′=(X,0)∪(Y,λ′′)Z'=(X,0)\cup(Y,\lambda''). In the corpus's words: if the prism (X×{0})∪(Y×{λ′})(X\times\{0\})\cup(Y\times\{\lambda'\}) is subtransitive (subsoluble when GG is soluble) for some λ′>0\lambda'>0, then so is (X×{0})∪(Y×{λ′′})(X\times\{0\})\cup(Y\times\{\lambda''\}) for every λ′′≥λ′\lambda''\ge\lambda'.

Source. M.-R. Ivan, I. Leader and M. Walters, Generalised Prisms and Euclidean Ramsey Theory, arXiv:2606.13472v1 (11 June 2026), Lemma 2, p. 3; proof pp. 3–4.

Read depth. Claims checked: statement read clause by clause on the PDF; the proof read in full.

Proof pointer

Take a finite transitive set UU containing a copy of the prism at height λ′\lambda', and form the two-level product U×{0,a}U\times\{0,a\} with a2=(λ′′)2−(λ′)2a^2=(\lambda'')^2-(\lambda')^2. It is transitive under the product of UU's group with C2C_2, and it contains a copy of the prism at height λ′′\lambda'', because the cross distances gain exactly a2a^2.

Two details of the printed proof (pp. 3–4) are read here as follows. The proof takes a≠0a\ne0, so the case λ′′=λ′\lambda''=\lambda' is the hypothesis itself. In the soluble case it says "HH is soluble" of the full symmetry group HH of UU; what the argument needs, and what subsolubility supplies, is some soluble group acting transitively on UU, and the product of that group with C2C_2 is soluble. Neither point changes the statement. The proof never uses GG beyond the hypothesis on λ′\lambda'.

Dependencies

None outside the paper; the group facts used are recorded on the elementary-facts page.

Bears on