Triangles in the Plane and arithmetic progressions in thick compact subsets of $\mathbb{R}^d$

This paper establishes explicit criteria, based on Yavicoli-thickness, $r$-uniformity, and Newhouse thickness conditions, under which compact subsets of $\mathbb{R}^d$ (particularly in the plane) are guaranteed to contain similar copies of any linear 3-point configuration or any triangle.

The Gist

Imagine you are a detective trying to find specific patterns hidden inside a very messy, fragmented pile of rocks. In the world of mathematics, these "rocks" are points in space, and the "patterns" are things like straight lines with equal spacing (arithmetic progressions) or triangles.

For a long time, mathematicians knew that if you had a huge pile of rocks (one that takes up a lot of space, like a solid block of cheese), you could easily find these patterns. But what if your pile of rocks was actually a dust cloud? It might look like it has no volume at all, yet it could still be incredibly dense and complex.

This paper asks a simple question: How "thick" does a dust cloud need to be to guarantee it contains a perfect triangle or a perfect 3-step ladder?

Here is the breakdown of their discovery using some everyday analogies.

1. The Problem: The "Ghost" Clouds

Imagine a cloud of dust in a room.

• The Old Way (Hausdorff Dimension): Mathematicians used to measure the cloud by asking, "How much space does it fill?" If the cloud is very "fractal" (like a coastline that gets more detailed the closer you look), it might have a high "dimension."
• The Problem: The authors point out that you can have a cloud that looks incredibly complex and fills a lot of "dimensional space," yet it is so cleverly arranged that it never forms a straight line of three dots or a triangle. It's like a puzzle where the pieces are there, but they are arranged in a way that never lets you complete the picture.

2. The New Tool: "Newhouse Thickness" (The Gap Lemma)

To solve this, the authors use a different ruler called Thickness.

Imagine the dust cloud is actually a series of islands separated by oceans (gaps).

• The Analogy: Think of a bridge connecting two islands. If the bridge is wide and the ocean gap is narrow, the "thickness" is high. If the bridge is a tiny thread and the ocean is a vast sea, the "thickness" is low.
• The Rule: The paper proves that if your cloud of islands is "thick" enough (meaning the bridges are sturdy and the gaps aren't too wide), you are guaranteed to find specific patterns.

The Big Discovery for 1D (The Line):
If you have a set of points on a line where the "bridges" are at least as wide as the "gaps" (a thickness of 1), you are guaranteed to find three points in a perfect row (an arithmetic progression). It's like saying, "If your island chain is sturdy enough, you can't avoid building a straight path across it."

3. The Big Discovery for 2D (The Plane)

This is where the paper gets really exciting. They moved from a line to a flat surface (like a sheet of paper).

The "Sandwich" Trick:
To find a triangle, you can't just look at one cloud. You have to look at a Cartesian product (imagine taking your cloud of islands and making a copy of it, then stacking them to make a 3D block, or in 2D, making a grid).

• The Result: If you take a "thick" cloud on a line and combine it with itself (creating a grid of points), that grid must contain the corners of any triangle you can imagine.
• The Analogy: Imagine you have a very sturdy, thick rope (the cloud). If you weave two of these ropes together to make a net, the paper proves that no matter how you try to weave it, you will inevitably create a perfect triangle shape within the net.

4. The "Yavicoli" Thickness (The 3D Version)

For higher dimensions (like 3D space), the math gets harder because you can't just line things up in a row. The authors use a more complex version of "thickness" developed by a mathematician named Yavicoli.

• The Analogy: Imagine a 3D sponge. To find a triangle inside, the sponge needs to be "uniformly dense." It can't have huge holes where the pattern could hide.
• The Condition: They found a specific formula for how "thick" and "uniform" this 3D sponge needs to be. If it meets the criteria, it must contain a perfect triangle, even if the triangle is tilted or rotated in any direction.

5. Why This Matters

Before this paper, we knew that "big" sets (like a solid ball) have these patterns. We also knew that "fractal" sets might have them, but we couldn't be sure without very strict, hard-to-check rules.

This paper gives us a practical checklist:

1. Check the Gaps: Are the gaps between your points too wide compared to the points themselves? (Thickness).
2. Check the Uniformity: Is the pattern spread out evenly, or is it clumped? (Uniformity).

If you pass this checklist, you don't need to look for the pattern; it is mathematically impossible for it to be missing.

Summary in One Sentence

If you have a cloud of points that is "thick" enough (meaning the gaps between them aren't too huge compared to the points themselves), you are guaranteed to find perfect triangles and straight-line patterns hidden inside, no matter how you rotate or scale them.

The "Aha!" Moment:
It's like realizing that if you build a fence with sturdy posts and narrow gaps, you can't accidentally avoid creating a perfect square or a perfect triangle somewhere in the design. The geometry forces the pattern to exist.

Technical Summary

Here is a detailed technical summary of the paper "Triangles in the Plane and Arithmetic Progressions in Thick Compact Subsets of $\mathbb{R}^d$" by Samantha Sandberg-Clark and Krystal Taylor.

1. Problem Statement

The paper addresses the problem of identifying minimal size conditions on a subset $A \subset \mathbb{R}^d$ that guarantee the existence of specific 3-point configurations, specifically:

• Arithmetic Progressions (3-APs): Sets of the form $\{a, \frac{a+b}{2}, b\}$.
• Triangles: Similar copies of any given triangle (including equilateral triangles).

Context and Limitations of Previous Work:

• Positive Measure: By the Lebesgue density theorem, any set of positive Lebesgue measure stably realizes all finite configurations. However, this does not apply to "thin" sets (e.g., Cantor sets) which often have measure zero.
• Hausdorff Dimension: While Hausdorff dimension is a standard measure of size in geometric measure theory, it is insufficient to guarantee the existence of 3-APs or similar triangles. Keleti and Máthé demonstrated that sets with full Hausdorff dimension can avoid containing any 3-APs.
• Fourier Decay: Previous results (e.g., Łaba and Pramanik) required strong Fourier decay conditions, which are restrictive.
• Gap: There was a lack of explicit, geometric criteria based on "thickness" (a topological/structural notion of size) that could guarantee these configurations in compact, measure-zero sets, particularly in higher dimensions ($d \geq 2$).

2. Methodology

The authors employ thickness, a concept introduced by Newhouse for the real line and generalized by Yavicoli for $\mathbb{R}^d$, combined with a Gap Lemma approach.

A. Thickness Concepts

1. Newhouse Thickness ($\tau$): Defined for compact sets $C \subset \mathbb{R}$. It measures the ratio of the lengths of "bridges" (intervals remaining after removing gaps) to the lengths of the "gaps" themselves.
   • Key Property: If $\tau(C) \geq 1$, $C$ contains a 3-AP.
2. Yavicoli Thickness ($\tau(C, \{S_I\})$): A higher-dimensional generalization defined via a system of balls $\{S_I\}$ that generates the compact set.
   • It is defined as the infimum over generations $n$ of the ratio:
     $$\frac{\min_i \text{rad}(S_{I,i})}{h_I(C)}$$
     where $h_I(C) = \max_{x \in S_I} \text{dist}(x, C)$ is the maximum distance from the parent ball to the set.
   • $r$-Uniformity: To prevent artificial inflation of thickness (e.g., in singleton sets), the authors require the set to be $r$-uniformly dense. This ensures that within any ball of radius $r \cdot \text{rad}(S_I)$, there exists a child ball.

B. The Gap Lemma

The core tool is the Newhouse Gap Lemma (and its higher-dimensional Yavicoli variant). It provides conditions under which two compact sets $C_1$ and $C_2$ must intersect:

1. Their convex hulls intersect.
2. Neither set lies entirely within a "gap" of the other.
3. The product of their thicknesses satisfies a specific lower bound (e.g., $\tau(C_1)\tau(C_2) \geq 1$ in 1D, or a more complex bound involving $r$ in higher dimensions).

C. Proof Strategy

To prove the existence of a configuration (e.g., a 3-AP $\{a, \lambda a + (1-\lambda)b, b\}$), the authors:

1. Decompose the compact set $C$ into two disjoint subsets $A$ and $B$ (typically derived from disjoint first-generation children in the ball construction).
2. Construct a target set $T = \lambda A + (1-\lambda)B$ (or a rotated/transformed version for triangles).
3. Apply the Gap Lemma to show that $T \cap C \neq \emptyset$.
4. Prove that the intersection point implies the existence of the desired configuration.

3. Key Contributions and Results

A. Results in $\mathbb{R}$ (Using Newhouse Thickness)

• Proposition 2.1: Generalizes the known result that $\tau(C) \geq 1$ implies a 3-AP. It proves that for any $\lambda \in (0,1)$, if $\tau(C) \geq 1$, then $C$ contains a non-degenerate 3-term progression $\{a, (1-\lambda)a + \lambda b, b\}$.
• Theorem 2.2: If $C \subset \mathbb{R}$ has $\tau(C) \geq 1$, then the Cartesian product $C \times C \subset \mathbb{R}^2$ contains a similar copy of any 3-point configuration (including any triangle).
  • Significance: This is one of the first explicit criteria guaranteeing triangles in the plane for sets of the form $C \times C$ without requiring positive measure.
• Sharpness: The authors construct an "off-center Cantor set" with thickness exactly 1 that contains no 4-term arithmetic progression, demonstrating that thickness $\geq 1$ is sharp for 3-APs but insufficient for longer progressions.

B. Results in $\mathbb{R}^d$ (Using Yavicoli Thickness)

• Theorem 2.7 (Convex Combinations): For a compact set $C \subset \mathbb{R}^d$ generated by a system of balls, if $C$ is $r$-uniformly dense ($0 < r < 1/2$) and satisfies a specific thickness threshold:
  $$\tau(C, \{S_I\}) \geq \frac{2(1-\lambda)}{\lambda(1-2r)}$$
  and possesses two disjoint first-generation children, then $C$ contains a 3-point convex combination $\{a, \lambda a + (1-\lambda)b, b\}$.
  • Corollary: For $\lambda = 1/2$ (3-APs), the threshold is $\tau \geq \frac{2}{1-2r}$.
• Theorem 2.11 (Triangles in $\mathbb{R}^2$): For any triangle $T$ in $\mathbb{R}^2$, if $C \subset \mathbb{R}^2$ satisfies the thickness condition:
  $$\tau(C, \{S_I\}) \geq \frac{r}{\alpha^2 + (1-\lambda)^2} \cdot \frac{2}{1-2r} \cdot \frac{\alpha^2 + \lambda^2}{\alpha^2 + (1-\lambda)^2}$$
  (where $\alpha, \lambda$ parameterize the shape of the triangle), then $C$ contains a similar copy of $T$.
  • Corollary 2.12.1: For equilateral triangles, the condition simplifies to $\tau \geq \frac{2}{1-2r}$.

C. Technical Improvements

• Lowering Thresholds: The authors improve upon Yavicoli's previous work (which required thickness $> 10^7$ for general configurations) by deriving explicit, much lower thresholds (often $< 10$) for 3-point configurations.
• Handling Higher Dimensions: They navigate the loss of total ordering in $\mathbb{R}^d$ by using the $r$-uniformity condition and specific geometric constructions of disjoint children to apply the Gap Lemma.

4. Significance

1. First Explicit Criteria in the Plane: This paper provides some of the first explicit, non-measure-theoretic criteria for the existence of triangles and 3-APs in subsets of $\mathbb{R}^2$.
2. Beyond Hausdorff Dimension: It demonstrates that Newhouse/Yavicoli thickness is a more robust predictor for the existence of arithmetic progressions and triangles than Hausdorff dimension alone, particularly for "thin" fractal sets.
3. Generalization of Newhouse's Work: It successfully extends Newhouse's 1D Gap Lemma results to higher dimensions and more complex configurations (triangles) using a refined notion of thickness.
4. Constructive Examples: The paper provides concrete examples (e.g., perturbed self-similar sets and circle packings) where these theorems apply, showing that such sets exist and are not merely theoretical abstractions.

5. Conclusion

Sandberg-Clark and Taylor establish that thickness, when combined with uniformity, is a sufficient condition for the realization of 3-point configurations (arithmetic progressions and triangles) in compact subsets of $\mathbb{R}^d$. Their results bridge the gap between 1D fractal geometry and higher-dimensional geometric measure theory, offering a new toolkit for analyzing the structural richness of "thin" sets.