All simplices exhibit canonical Ramsey property

Abstract: We prove that all nondegenerate simplices have the canonical Ramsey property, thereby resolving a central open problem in canonical Euclidean Ramsey theory and providing a canonical counterpart to the celebrated simplex Ramsey theorem of Frankl and Rödl~[JAMS, 1990].

• The paper proves that every nondegenerate simplex exhibits the canonical Ramsey property, ensuring a monochromatic or rainbow copy in sufficiently high-dimensional Euclidean spaces.
• It introduces novel geometric and combinatorial constructions, such as the Finite Contraction Lemma and tree-like embeddings, to handle metric rigidity in simplex configurations.
• The work establishes dimension-independent results with explicit, though large, bounds on the ambient dimensions required for these Ramsey guarantees.

Summary of "All simplices exhibit canonical Ramsey property" (2607.11782)

Problem Overview and Historical Context

Canonical Euclidean Ramsey theory generalizes classical Ramsey theory to the geometric setting, posing questions regarding which finite point configurations must occur either monochromatically or as rainbow patterns in sufficiently high-dimensional Euclidean spaces, under arbitrary colorings. The classification of canonically Ramsey configurations—those admitting dimension-independent guarantees—is subtle due to metric rigidity: every copy must realize all prescribed pairwise distances, unlike abstract Ramsey problems where only cardinality or combinatorial structure is preserved.

The simplex Ramsey theorem of Frankl and Rödl [frankl1990] established that every nondegenerate simplex is Ramsey in the ordinary sense, confirming that sufficiently high dimensions guarantee monochromatic copies under finite colorings. However, the canonical Gallai–Ramsey property, demanding uniformity regardless of the number of colors while keeping ambient dimension fixed, remained unresolved for general simplices, despite prior positive results for acute triangles, rectangles, cuboids, hypercubes, and select higher-dimensional simplices. The central open problem addressed is: Do all nondegenerate simplices exhibit the canonical Ramsey property?

Main Contributions

The primary result proves that every nondegenerate simplex in Euclidean space has the canonical Ramsey property. Formally, for any finite nondegenerate simplex $T$, there exists a finite configuration $W = W(T)$ such that every coloring of $W$ with colors from any finite set contains either a monochromatic copy of $T$ or a rainbow copy of $T$. Moreover, there is a dimension $n_0 = n_0(T)$ (independent of the number of colors) such that every coloring of $E^n$ for $n \geq n_0$ necessarily contains either a monochromatic or rainbow copy of $T$.

This resolves a central case in the canonical classification for Euclidean configurations, confirming that the complete metric data encoded by simplicial edge lengths does not hinder canonical Ramsey phenomena even under the stricter requirements of dimension independence.

Technical Approach

The proof is constructed using a sequence of geometric and combinatorial constructions:

• Finite Contraction Lemma: Extends Frankl–Rödl’s contraction argument using Gram matrices to produce contracted simplices, decreasing squared edge lengths uniformly. This enables the creation of witnesses that themselves are simplices.
• Simplex Witness Construction: An induction assembles witnesses with prescribed metric structure and affine independence, using orthogonal products of regular simplices in auxiliary spaces to ensure both monochromatic and rainbow alternatives are realized.
• Tree-like Embedding: A recursive configuration, exploiting successive heights and circumradii, forms a highly structured simplex whose paths and subconfigurations guarantee the desired Ramsey outcomes.
• Product Amplification and Diagonalization: Syncs the positions of monochromatic product copies via orthogonal products, ensuring the presence of diagonal copies congruent to the target simplex, and guaranteeing the canonical Ramsey alternative in arbitrary colorings.
• Dimension Independence: Explicit witnesses are embedded in fixed dimensions, and ambient space is extended as necessary to ensure the configuration property holds for all higher dimensions.

The quantitative bounds on dimension $n_0(T)$ produced are large, and optimizing these remains open, particularly for higher-dimensional simplices.

Numerical and Structural Results

• For $W = W(T)$0 (triangle), prior results show $W = W(T)$1 suffices [fang2025].
• The presented construction generalizes to arbitrary $W = W(T)$2-point nondegenerate simplices, with explicit but large upper bounds on $W = W(T)$3.
• Strong existence claims: For any two nondegenerate simplices $W = W(T)$4 and $W = W(T)$5, there is a finite configuration $W = W(T)$6 such that every coloring contains a monochromatic copy of $W = W(T)$7 or a rainbow copy of $W = W(T)$8.
• Witnesses themselves can always be chosen to be simplices, preserving affine independence and achieving targeted Ramsey properties.

Implications and Future Directions

Theoretically, this result consolidates the role of simplices as the first complete class for canonical Ramsey in Euclidean geometry. It aligns with conjectures that all spherical Euclidean Ramsey configurations may be canonically Ramsey; however, the proof here relies heavily on affine independence and cannot be directly generalized to affinely dependent but spherical configurations.

Practically, these structural guarantees secure canonical alternatives for any nondegenerate simplex in geometric Ramsey problems, extending the utility of canonical color patterns in geometric combinatorics and providing templates for further algorithmic or constructive bounds in high-dimensional settings.

Potential future directions include:

• Tightening quantitative bounds: Determining the minimal ambient dimension or configuration size as a function of simplex parameters.
• Extending to broader classes: Investigating canonical Ramsey properties for general spherical (affine dependent) Euclidean configurations.
• Theoretical exploration: Understanding deeper connections between metric rigidity, affine geometry, and canonical Ramsey theory, possibly informing structures in computational geometry and related algorithmic applications.

Conclusion

This work answers a longstanding open question in canonical Euclidean Ramsey theory by proving that all nondegenerate simplices possess the canonical Ramsey property, bridging classical geometric Ramsey results and their canonical counterparts. The construction synthesizes geometric and combinatorial techniques to overcome the metric rigidity present in simplex configurations, laying groundwork for continued investigation into the canonical properties of broader geometric patterns and their quantitative characteristics.