🔢 mathematics

$\Pi^0_4$ conservation of a Carlson-Simpson lemma for 1-variable words

This paper establishes that the 2-coloring version of the Carlson-Simpson lemma for 1-variable words is a $\forall \Pi^0_4$ -conservative extension of $\mathsf{RCA}_0 + \mathsf{B}\Sigma_2$ , thereby proving that neither the indivisibility of the universal triangle-free Henson graph nor the tree theorem for pairs implies $\Sigma^0_2$ -induction.

Original authors: Quentin Le Houérou, Ludovic Patey

Published 2026-07-31

📖 6 min read🧠 Deep dive

CC BY 4.0

Original authors: Quentin Le Houérou, Ludovic Patey

Original paper licensed under CC BY 4.0 (http://creativecommons.org/licenses/by/4.0/). ✨ This is an AI-generated explanation of the paper below. It is not written or endorsed by the authors. For technical accuracy, refer to the original paper. Read full disclaimer

The Hidden Rules of the Mathematical Universe

Imagine you are a detective trying to figure out the rules of a game, but instead of playing cards or chess, you are playing with the very fabric of mathematics itself. This field is called Reverse Mathematics. While most mathematicians ask, "What can I prove if I assume these rules?", reverse mathematicians ask the opposite: "What is the minimum set of rules I need to prove this specific fact?" It's like trying to find the smallest engine that can still power a car. If you can prove a theorem using a tiny, weak engine, you know you don't need a massive, complex one.

To understand this paper, you need to know about a few key players. First, there are variable words. Think of these not as words in a dictionary, but as sentences with blank spaces, like "The _ is big." You can fill the blank with any letter, creating a whole family of related words. The Carlson-Simpson Lemma is a powerful rule that says if you color these variable words with a few different colors, you can always find a giant, infinite structure where every possible way of filling the blanks results in the same color. It's a guarantee of order in a chaotic world.

Finally, there are logical strength levels. Mathematicians have built a ladder of "power." At the bottom is a basic system called RCA₀ (think of it as a calculator that can do simple arithmetic). Higher up is ACA₀, a much stronger system that can handle more complex patterns. The big question in this field is: "How high up the ladder do we have to climb to prove the Carlson-Simpson Lemma?" For a long time, people thought you needed to climb very high, almost to the top. This paper investigates whether that's true or if the lemma can actually be proven with a much smaller, weaker engine.

The Great Discovery: A Smaller Engine for a Big Theorem

In this paper, authors Quentin Le Houérou and Ludovic Patey tackle a specific version of the Carlson-Simpson Lemma involving just two colors and one variable (like our "The _ is big" example). They prove a surprising result: you do not need the massive, powerful engine of ACA₀ to prove this. Instead, they show that a much weaker system, called RCA₀ combined with a modest rule called BΣ₀², is actually enough.

To put it in their technical language, they prove that adding this specific version of the lemma to the weak system is @Π₀⁴-conservative. What does that mean in plain English? It means that if you use this powerful lemma to prove a statement about numbers (specifically a certain type of statement called a @Π₀⁴ sentence), you aren't actually proving anything new that you couldn't have proven with the weaker system alone. The lemma is "safe" to use; it doesn't secretly add extra power to your mathematical toolbox.

This finding is a big deal because it settles a long-standing debate. For years, it was believed that this lemma was so strong it implied the existence of complex mathematical objects that the weaker system couldn't handle. The authors prove that this is false. They explicitly show that the lemma does not imply Σ₀²-induction (a specific type of mathematical reasoning) and does not imply ACA₀. In fact, they show that even the "indivisibility of the universal triangle-free Henson graph" (a fancy way of saying you can't split a specific infinite graph into two parts without one part looking exactly like the whole) and the "tree theorem for pairs" (a rule about organizing branches on a tree) are also much weaker than previously thought. They don't require the heavy machinery of ACA₀ either.

How They Solved the Puzzle

So, how did they prove this? They didn't just guess; they built a mathematical "filter" using a concept called largeness. Imagine you have a giant bag of numbers. Some numbers are "large" in a very specific, structured way. The authors created a system to measure how "large" a set of numbers needs to be to guarantee that you can find a monochromatic (single-colored) pattern inside it.

They used a clever trick involving parameterized largeness. Think of it like a game where you have to find a hidden treasure in a forest. The "largeness" of the forest tells you how likely you are to find the treasure. The authors showed that if your forest is "large enough" according to their new, refined rules, you can always find the treasure (the monochromatic pattern) without needing to upgrade your map to a more powerful system. They proved that this "largeness" property stays intact even when you apply the complex rules of the Carlson-Simpson Lemma.

By showing that this "largeness" can be maintained within the weaker system, they demonstrated that the lemma doesn't force you to climb the ladder to ACA₀. They essentially built a bridge that allows you to cross the river of the theorem without needing the expensive boat (ACA₀); a sturdy raft (RCA₀ + BΣ₀²) is perfectly sufficient.

Why It Matters

This paper answers a question posed by other mathematicians (Chong, Li, Wang, and Yang) about whether certain powerful theorems force us to accept stronger mathematical axioms. The answer is a definitive no for these specific cases.

The authors prove that:

The Carlson-Simpson Lemma for 2 colors is strictly weaker than ACA₀.
The indivisibility of the universal triangle-free Henson graph (for 2 colors) does not imply Σ₀²-induction.
The Tree Theorem for pairs (for 2 colors) also does not imply Σ₀²-induction.

They didn't just suggest this; they provided a rigorous mathematical proof. They showed that the "strength" of these theorems is exactly what you'd expect if you only had the weaker system, and no more. This helps mathematicians understand the true "cost" of these theorems. It tells us that the universe of mathematics has more subtle layers than we thought, where some very powerful-sounding rules can actually live comfortably in a much simpler world.

In short, Le Houérou and Patey have shown that we don't need to bring out the heavy artillery to solve these particular puzzles. The tools we already have in our basic toolkit are strong enough, provided we look at them with the right kind of "largeness" in mind.

Technical Summary of "A $\Pi^0_4$ conservation of a Carlson-Simpson lemma for 1-variable words"

Problem Statement
The paper investigates the reverse-mathematical strength of the Carlson-Simpson Lemma for 1-variable words ( $CSL^1_\ell$ ). This lemma states that for every finite coloring of 1-variable words over a finite alphabet, there exists an infinite $\omega$ -variable word such that all 1-variable words derived from it are monochromatic. While the general Carlson-Simpson Lemma is known to be strictly weaker than $ACA_0$ (Arithmetical Comprehension Axiom), its precise logical strength relative to weaker induction principles was an open question. Specifically, the authors address a question posed by Chong, Li, Wang, and Yang regarding whether the indivisibility of the universal triangle-free Henson graph (a consequence of $CSL^1_2$ ) or the Tree Theorem for pairs ( $TT^2_2$ ) implies $\Sigma^0_2$ -induction ( $I\Sigma^0_2$ ).

Methodology
The authors employ a refinement of the indicator method of Kirby and Paris, utilizing a parameterized variant of Ketonen and Solovay's $\alpha$ -largeness. The core technical framework involves:

Parameterized Largeness: The authors define $\alpha$ -largeness for finite sets of integers, parameterized by a $\Delta^0_0$ formula $\theta$ . They focus on ordinals of the form $\omega^n \cdot k$ . A set is $\omega^n$ -large if it contains sufficiently many pairwise $\theta$ -apart $\omega^{n-1}$ -large subsets.
Combinatorial Core: The proof establishes that this notion of largeness is closed under the application of the Graham-Rothschild theorem and the Carlson-Simpson lemma for 1-variable words. This is achieved through a series of technical propositions (Propositions 4.2 and 5.7) that demonstrate how to "group" blocks of solutions into larger solutions while preserving the largeness property.
- For the Graham-Rothschild theorem, they define $GR^n_\ell$ - $\alpha$ -largeness.
- For the Carlson-Simpson lemma, they introduce a novel concept of block-homogeneity ( $BCSL^1$ ). Unlike the standard Level Carlson-Simpson lemma ( $LCSL^1$ ), which requires homogeneity over all possible colorings of the projection of variable words, block-homogeneity restricts the color space to a finite set of "block colors" ( $\ell^{2n}$ ), making it amenable to primitive recursive bounds.
Model Construction: To prove the conservation result, the authors construct a model $N$ from a countable model $M$ of $RCA_0 + B\Sigma^0_2 + \neg \phi$ (where $\phi$ is a $\Pi^0_4$ sentence). They define a cut $I$ in $M$ based on a decreasing sequence of sets $X_i$ that satisfy specific largeness and monochromaticity conditions. The second-order part of the new model consists of all sets coded in $M$ relative to this cut.

Key Contributions and Results

Main Theorem (Theorem 1.1): The paper proves that $WKL_0 + CSL^1_2$ $W K L_{0} + C S L_{2}^{1}$ is a $\Pi^0_4$ $Π_{4}^{0}$ -conservative extension of $RCA_0 + B\Sigma^0_2$ $R C A_{0} + B Σ_{2}^{0}$ .
- This implies that $WKL_0 + CSL^1_2$ does not imply $ACA_0$ nor $\Sigma^0_2$ -induction ( $I\Sigma^0_2$ ).
- Consequently, the statement $\forall \ell CSL^1_\ell$ (which implies $B\Sigma^0_3$ ) is strictly stronger than the fixed-color version $CSL^1_2$ .
Application to the Henson Graph: The authors demonstrate that the indivisibility of the universal triangle-free Henson graph for 2-colorings is $\Pi^0_4$ -conservative over $RCA_0 + B\Sigma^0_2$ . This confirms that this structural Ramsey property does not imply $I\Sigma^0_2$ , answering the question of Chong et al. in the negative.
Application to the Tree Theorem: The paper establishes that $WKL_0 + TT^2_2$ (Tree Theorem for pairs and two colors) is also $\Pi^0_4$ -conservative over $RCA_0 + B\Sigma^0_2$ . This is derived from the fact that $CSL^1_k$ implies $TT^2_k$ over $RCA_0$ .
Distinction from Ordered Variants: The paper highlights a fundamental difference between the unordered Carlson-Simpson Lemma ( $CSL^1_2$ ) and the Ordered Variable Word theorem ( $OVW^1_2$ ). While $CSL^1_2$ is weak (conservative over $B\Sigma^0_2$ ), $OVW^1_2$ implies $ACA_0$ over $RCA_0$ .

Significance
The paper provides a precise calibration of the logical strength of the 1-variable Carlson-Simpson Lemma. By proving it is $\Pi^0_4$ -conservative over $RCA_0 + B\Sigma^0_2$ , the authors show that the combinatorial power of this lemma is strictly weaker than the induction principles required for Hindman's Theorem or the Ordered Variable Word theorem.

The significance lies in resolving the open question regarding the implication of $I\Sigma^0_2$ by the indivisibility of the Henson graph and the Tree Theorem for pairs. The results demonstrate that these theorems, while non-trivial, do not reach the strength of $ACA_0$ or full $\Sigma^0_2$ -induction. The methodology of using parameterized $\alpha$ -largeness to establish conservation results for statements involving variable words offers a robust tool for separating combinatorial principles from induction axioms in reverse mathematics.

The Hidden Rules of the Mathematical Universe

The Great Discovery: A Smaller Engine for a Big Theorem

How They Solved the Puzzle

Why It Matters

More like this