A classification of finite Euclidean Ramsey configurations
A finite set of at least two points with affine span is Euclidean Ramsey if and only if there is a matrix such that for all and for all , where , , , and is the multiplication homomorphism.
All steps of both directions—algebraic descent from to , the modular coloring obstruction, the -adic lattice identity, Gaussian smoothing, permutation averaging, and the ultrafilter Hales–Jewett argument—are rigorously proved.
“Theorem 1.1 (Classification). Let A = {a1, . . . , as} ⊂ R d be a finite set of at least two points with affine span R d , and define pi , F, B, mF as above. Then A is Ramsey if and only if there is a matrix P ∈ Matd+1(B) such that (pi ⊗ 1)TP(1 ⊗ pi) = 0 (1 ≤ i ≤ s), mF (Pαβ) = δαβ (1 ≤ α, β ≤ d).” · Show in paper