[Paper Review] Minimal idempotent ultrafilters and the Auslander-Ellis theorem

Alexander Kreuzer|arXiv (Cornell University)|May 28, 2013

Advanced Topology and Set Theory11 references3 citations

TL;DR

This paper establishes the logical equivalence between the existence of minimal idempotent ultrafilters on countable algebras of sets and the Auslander-Ellis theorem (AET) within reverse mathematics, while showing that higher-order formulations of the ultrafilter existence are Π¹₂-conservative over refinements of AET. It demonstrates that AET and the existence of such ultrafilters are interderivable in RCA₀, and that higher-order consequences align with extended versions of AET, resolving foundational questions about their proof-theoretic strength in combinatorics and dynamics.

ABSTRACT

We characterize the existence of minimal idempotent ultrafilters (on N) in the style of reverse mathematics and higher-order reverse mathematics using the Auslander-Ellis theorem and variant thereof. We obtain that the existence of minimal idempotent ultrafilters restricted to countable algebras of sets is equivalent to the Auslander-Ellis theorem (AET) and that the existence of minimal idempotent ultrafilters as higher-order objects is $Π^1_2$-conservative over a refinement of AET.

Motivation & Objective

• To determine the reverse mathematical strength of the existence of minimal idempotent ultrafilters on countable algebras of sets.
• To analyze the proof-theoretic strength of minimal idempotent ultrafilters as higher-order objects in RCA₀^ω.
• To clarify the logical relationship between the Auslander-Ellis theorem (AET), its extensions (eAET, eAET′), and the existence of minimal idempotent ultrafilters.
• To investigate whether the partition stability of central sets (i.e., each finite partition of a central set contains a central set) is provable from AET.

Proposed method

• Uses reverse mathematics and higher-order reverse mathematics to analyze the logical strength of ultrafilter existence.
• Characterizes minimal idempotent ultrafilters via the syndeticity condition: for X ∈ 𝒰, the set {n ∈ ℕ | X−n ∈ 𝒰} is syndetic.
• Applies the Auslander-Ellis theorem (AET) as a central tool, showing that AET implies the existence of minimal idempotent ultrafilters on countable algebras.
• Constructs partial minimal idempotent ultrafilters from proximal pairs in dynamical systems using IP-limits and definable ultrafilter generation.
• Establishes Π¹₂-conservativity of higher-order ultrafilter existence over refined versions of AET (eAET, eAET′).
• Leverages known results on Hindman’s theorem (HT) and iterated Hindman’s theorem (IHT), showing AET is equivalent to IHT over RCA₀.

Experimental results

Research questions

• RQ1 Is the existence of minimal idempotent ultrafilters on countable algebras of sets equivalent to the Auslander-Ellis theorem (AET) over RCA₀?
• RQ2 What is the Π¹₂-conservative strength of the existence of minimal idempotent ultrafilters as higher-order objects in RCA₀^ω?
• RQ3 Are the extended versions of AET (eAET and eAET′) equivalent to the existence of minimal idempotent ultrafilters in higher-order systems?
• RQ4 Does the Auslander-Ellis theorem suffice to prove that every finite partition of a central set contains a central set?
• RQ5 What is the proof-theoretic strength of the statement that central sets are partition regular?

Key findings

• The existence of minimal idempotent ultrafilters restricted to countable algebras of sets is equivalent to the Auslander-Ellis theorem (AET) over RCA₀.
• The existence of minimal idempotent ultrafilters as higher-order objects is Π¹₂-conservative over refinements of AET, specifically eAET and eAET′.
• The paper shows that AET is equivalent to the iterated Hindman’s theorem (IHT) over RCA₀, confirming its foundational role in combinatorial dynamics.
• The construction of a partial minimal idempotent ultrafilter from a proximal pair (x₁, y₁) in a dynamical system relies on IP-limits and definable ultrafilter generation.
• The statement that every finite partition of a central set contains a central set is not known to be provable from AET alone, leaving its strength open.
• The results extend to minimal idempotent ultrafilters over any countable semigroup G, provided the Auslander-Ellis theorem holds for G.