Definable Maximal Cofinitary Groups

• Definable maximal cofinitary groups are permutation subgroups of S∞ in which every non-identity element fixes only finitely many points, achieving maximality under this property.
• Researchers use forcing and coding techniques to construct these groups with low definability levels, including co-analytic and arithmetic presentations.
• These groups exhibit forcing resilience, such as Cohen-indestructibility, and support diverse algebraic structures, ranging from free groups to nontrivial direct products.

A definable maximal cofinitary group is a permutation subgroup of $S_\infty$—the full symmetric group on $\omega$—such that every non-identity element fixes only finitely many points (cofinitary), is maximal with respect to this property (no proper cofinitary extension exists), and is definable at some complexity level in the descriptive set-theoretic/projective hierarchy. Research in the past decade has focused extensively on the existence and construction of such groups at low levels of definability, particularly co-analytic (i.e., $\Pi^1_1$) and arithmetic ($\Sigma^0_n$, $\Pi^0_n$) presentations, and their preservation under various forcing extensions, notably Cohen forcing.

1. Cofinitary Groups and Maximality

Let $\omega$ denote the set of natural numbers and define $S_\infty$ as the group of all bijections $\sigma:\omega\to\omega$ under composition. A permutation $\sigma\in S_\infty$ is called cofinitary if $\mathrm{fix}(\sigma)=\{n<\omega:\sigma(n)=n\}$ is finite. A subgroup $\omega$0 is cofinitary if every non-identity $\omega$1 is cofinitary. A maximal cofinitary group (MCG) is a cofinitary subgroup $\omega$2 that cannot be properly extended to a larger cofinitary subgroup.

The significance of maximality is the non-existence of $\omega$3 such that $\omega$4 generates a larger cofinitary subgroup. In practice, for every $\omega$5, the group $\omega$6 must fail to be cofinitary—usually because some product has infinitely many fixed points (Fischer et al., 2016).

2. Descriptive Set-Theoretic Complexity

Research prioritizes the definability of MCGs within various pointclasses:

• Borel ($\omega$7), analytic ($\omega$8), and co-analytic ($\omega$9) subsets of $\Pi^1_1$0 (coded as subsets of $\Pi^1_1$1).
• Arithmetic ($\Pi^1_1$2, $\Pi^1_1$3): subclasses of Borel defined via quantifier complexity, relevant for low-complexity constructions.

A subset $\Pi^1_1$4 is $\Pi^1_1$5-definable if it can be specified as the complement of an analytic set via a co-analytic predicate on codes of permutations. In the context of maximal objects (such as MCGs) under ZFC-minus-Choice, co-analyticity is often the lowest complexity achievable via general methods (Fischer et al., 2016, Mejak et al., 2022).

3. Construction Schemes: Forcing and Coding

Forcing is the predominant paradigm for creating definable maximal cofinitary groups. The principal method starts with a countable cofinitary group $\Pi^1_1$6 and recursively builds an increasing chain $\Pi^1_1$7 such that at each successor stage, a new generator is adjoined via a generic object for a specialized poset—often a version of Zhang's forcing (Fischer et al., 2016, Schrittesser, 2020). The conditions are finite injective partial functions $\Pi^1_1$8 (initial segments of permutations), with additional coding maps $\Pi^1_1$9 ensuring every new group word codes a prescribed real $\Sigma^0_n$0.

Key combinatorial properties are enforced during the extension:

• Maintaining cofinitariness via control of fixed points: every local extension must avoid introducing new infinite fixed point sets for relevant words.
• Maximizing via the “generic hitting” lemma: for any candidate extension $\Sigma^0_n$1, the generic permutation can be forced to agree with $\Sigma^0_n$2 on infinitely many points, precluding further cofinitary extension (Fischer et al., 2016, Schrittesser, 2020).

A crucial advancement is robust coding: new generators code predetermined reals into their orbit structures using parity modulo $\Sigma^0_n$3 or prime index counts, rendering each group element bi-interpretable with sequences from the constructible hierarchy ($\Sigma^0_n$4) (Fischer et al., 2023). This coding mechanism underpins the definability of the final group and its resilience under forcing.

4. Cohen-Indestructibility and Forcing Resilience

A maximal cofinitary group $\Sigma^0_n$5 is Cohen-indestructible if it remains maximal in every generic extension obtained by adding Cohen reals. The technical basis is a strong generic hitting lemma: for any forcing that adds a new cofinitary permutation $\Sigma^0_n$6, a two-step forcing can produce a generic $\Sigma^0_n$7 such that $\Sigma^0_n$8 and $\Sigma^0_n$9 agree on infinitely many points, contradicting the cofinitariness of any extension (Fischer et al., 2016).

Expanding on this, the concept of tightness was introduced: a cofinitary group (or more generally an eventually different family) is tight if, for every sequence of injective trees outside certain ideals, a group element densely diagonalizes all of them simultaneously. Tightness implies strong preservation under not only Cohen but also Sacks, Miller, and other proper forcings (Fischer et al., 2023). Accordingly, tight maximal cofinitary groups built in $\Pi^0_n$0 using robust coding remain maximal and co-analytic after arbitrary countable support iterations of proper forcing notions.

5. Achieving Low Projective and Arithmetic Complexity

Significant progress has been made in reducing the definability complexity of MCGs:

• Co-analytic ($\Pi^0_n$1): Fischer–Schrittesser–Törnquist constructed Cohen-indestructible $\Pi^0_n$2 maximal cofinitary groups in $\Pi^0_n$3, consistent with large continuum (Fischer et al., 2016).
• Arithmetic ($\Pi^0_n$4, $\Pi^0_n$5): Mejak–Schrittesser gave a construction of a closed ($\Pi^0_n$6) generating set for a maximal cofinitary group, the group being $\Pi^0_n$7 ($\Pi^0_n$8), and proved this is optimal for freely generated cases in terms of Borel hierarchy (Mejak et al., 2022).
• Projective maximal witnesses: Intermediate--sized MCGs (with size between $\Pi^0_n$9 and continuum) are obtained via coding and iterated forcing, yielding $\omega$0-definable examples (Fischer et al., 2019, Fischer et al., 2016, Schrittesser, 2020) (see also optimality results).

The following table illustrates benchmark constructions and their complexity (all claims in the data):

Complexity	Context	Method	Key Reference
$\omega$1	ZF	Hausdorff gap/Borel	Horowitz–Shelah
$\omega$2	$\omega$3, $\omega$4 large	Forcing + Coding	Fischer–Schrittesser–Törnquist (Fischer et al., 2016)
$\omega$5/F$\omega$6	ZF	Explicit recursion	Mejak–Schrittesser (Mejak et al., 2022)
$\omega$7	$\omega$8	Self-coding forcing	Fischer–Schrittesser (Fischer et al., 2019)

6. Isomorphism Types and Generalizations

Definable maximal cofinitary groups are constructed with various isomorphism types. Classically, the free group on continuum many generators appears, but recent results include arithmetic representations of $\omega$9 and $S_\infty$0 for finite $S_\infty$1, using arithmetic generating sets at the $S_\infty$2 or $S_\infty$3 level (Schembecker, 30 Dec 2025). These constructions answer questions on whether definable MCGs necessarily decompose into free products or could be realized as nontrivial direct products, demonstrating the existence of MCGs with nontrivial center structure beyond classical examples.

7. Open Problems and Future Research

Several open questions persist:

• Is it possible to construct a $S_\infty$4 maximal cofinitary group? Current methods preclude freely generated MCGs at this low complexity due to group topology constraints (Dudley, Slutsky, Kastermans).
• Can product constructions be generalized to infinite secondary factors or non-finite groups, preserving arithmetic definability of MCGs (Schembecker, 30 Dec 2025)?
• Classification of projective and arithmetic complexity spectra for maximal cofinitary groups under different set-theoretic hypotheses (GCH, large continuum) (Schrittesser, 2020, Fischer et al., 2016).
• Implications for maximal discrete sets in analytic hypergraphs, and the transfer of coding techniques to other permutation or function families (Schrittesser, 2020).

This research area interweaves forcing methods, fine combinatorial coding, descriptive set theory, and permutation group theory, with recent results establishing strong connections between definability, maximality, and forcing-indestructibility. Advances in robust coding and tightness yield maximal cofinitary groups both resilient and highly definable, with growing attention to their algebraic diversity and possible characterizations.