Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
A finite configuration is a nonempty finite subset of a Euclidean space. It is Ramsey if, for every integer , some integer has the property that every -coloring of contains a monochromatic congruent copy of the configuration. There is no measurability requirement.
A configuration is transitive if a finite group of ambient isometries preserves it and acts transitively on its points. It is soluble if such a group can be chosen soluble. It is subtransitive, respectively subsoluble, if it is congruent to a subset of a finite transitive, respectively soluble, configuration in some Euclidean space. The enclosing space may have greater dimension. Solubility refers to a chosen transitive subgroup; the full symmetry group need not be soluble.
For a group , write and let be the subgroup generated by commutators of elements of . The group is soluble when for some nonnegative integer .
Elementary facts. Finite isometry groups have a fixed point. Every finite transitive configuration is spherical. Subsets and congruent copies preserve the subtransitive, subsoluble and Ramsey properties. If is soluble, then so are its subgroups, homomorphic images, finite direct powers, and an extension of by a soluble group. In particular, is soluble. Cartesian products of finite transitive configurations are transitive under the product of their chosen groups.
Complete proof. If a finite isometry group acts on , average an arbitrary orbit:
Each isometry is affine, so for every . Translation by turns the action into an orthogonal linear action. Every orbit then has a constant norm, proving sphericity, with radius zero allowed for a singleton. A congruent copy or a subset of a subset of an enclosing transitive set has the same type of enclosure. A monochromatic copy of an enclosing Ramsey set contains a monochromatic copy of every specified subset. Congruence transports that assertion without changing distances.
Derived subgroups of a subgroup are contained in the corresponding derived subgroups of its ambient group. Homomorphisms carry commutators to commutators. Commutators in a direct product are computed coordinate by coordinate; hence a finite product of soluble groups is soluble. If , , and , then and . This proves the extension assertion. Cyclic groups are abelian, so the assertion applies to .
Finally, coordinatewise isometries preserve the sum of squared coordinate distances. Given two elements of a product of transitive configurations, choose an isometry taking each coordinate of the first to the corresponding coordinate of the second. Their product acts transitively. If all chosen groups are soluble, their product is soluble.
These are complete elementary expansions of the conventions and group facts used on source pp. 1–6, arXiv:2606.13472v1. The deep assertion that every subsoluble set is Ramsey is the exact external Kříž input, not a consequence of these elementary facts alone.
Bears on. #174.