Skip to main content
Springer logoLink to Springer
. 2022 Dec 4;62(5-6):641–655. doi: 10.1007/s00153-022-00859-x

The structure of κ-maximal cofinitary groups

Vera Fischer 1,, Corey Bacal Switzer 1
PMCID: PMC10227154  PMID: 37260527

Abstract

We study κ-maximal cofinitary groups for κ regular uncountable, κ=κ<κ. Revisiting earlier work of Kastermans and building upon a recently obtained higher analogue of Bell’s theorem, we show that:

  1. Any κ-maximal cofinitary group has <κ many orbits under the natural group action of S(κ) on κ.

  2. If p(κ)=2κ then any partition of κ into less than κ many sets can be realized as the orbits of a κ-maximal cofinitary group.

  3. For any regular λ>κ it is consistent that there is a κ-maximal cofinitary group which is universal for groups of size <2κ=λ. If we only require the group to be universal for groups of size κ then this follows from p(κ)=2κ.

Keywords: Cardinal characteristics, κ-Cofinitary groups, Higher Baire spaces, Bell’s theorem

Introduction

Given a set X we denote by S(X) the group of permutations of X. The group S(ω) and its subgroups have been of interest in set theory of the reals, both for their combinatorial, as well as descriptive set theoretic properties (see for example [1, 4, 9, 11, 12]). Of particular interest are the maximal cofinitary subgroups. Here, a permutation fS(ω) is cofinitary if it has only finitely many fixed points. A group GS(ω) is cofinitary if all of its non-identity elements are cofinitary. The group G is moreover said to be maximal if no proper supergroup is cofinitary.

An important area of set theory, which has been of increased interest in the past decades, is the study of analogues of combinatorial sets of reals in the higher Baire spaces, κκ and 2κ. In this paper, we study such higher counterparts to maximal cofinitary groups. Throughout the paper, we fix a regular, uncountable cardinal κ and assume that κ<κ=κ. In analogy with the countable case, a permutation fS(κ) is said to be κ-cofinitary if it has <κ many fixed points. A subgroup GS(κ) is said to be κ-cofinitary if all of its non-identity elements are κ-cofinitary and moreover maximal it there are no proper κ-cofinitary supergroups. There is a long list of literature regarding the set theoretic properties of maximal cofinitary groups on ω (both from purely combinatorial, as well as descriptive set theoretic point of view), while higher counterparts have already been studied in [1, 2]. For more recent studies of a close relative to the κ-maximal cofinitary groups, namely κ-maximal almost disjoint families see [5, 6].

A main tool in our analysis of the structure of κ-maximal cofinitary groups is the following recent higher counterpart of Bell’s theorem (see [10, Theorem 4.3]): If P is a κ-specifically centered partial order, κ<κ=κ and {Dα:α<λ} is a family of dense subsets of P,where λ<κ=λ and λ<p(κ),then there is a filter GP such that GDαfor all α. Here p(κ) denotes the κ-pseudointersection number.

Given a group GS(κ) we look at the orbits arising from its action on κ: for every gG and ακ the action is such that (g,α)g(α). In [8, Theorem 9] Kastermans showed that if G is a maximal cofinitary group (on ω) then G has only finitely many orbits. Below, we obtain the following:

Theorem

[See Theorem 2.1] If GS(κ) is a κ-maximal-cofinitary group then it has less than κ-many orbits.

Kastermans [8, Theorem 10] also shows that in the ω-case this is, at least consistently, the only restriction on the orbit structure of a maximal cofinitary group. Specifically he proves that under MA, for any n<ω and any partition {Ok|k<n} of ω, there is a maximal cofinitary group G whose orbits are exactly this partition. Building on the above mentioned generalization of Bell’s theorem (see [10], as well as [3]), we establish the following higher Baire spaces analogue:

Theorem

[See Theorem 3.9] If p(κ)=2κ then given any λ<κ and any partition {Oα|α<λ} of κ there is a κ-maximal cofinitary group G so that the orbits of G are exactly {Oα|α<λ}.

Finally we investigate the possible isomorphism types of κ-maximal cofinitary groups. Kastermans proved that under MA there is a maximal cofinitary group G which is universal for groups of size less than continuum i.e. if H is any group of size <20 then H embeds into G. Here we obtain the existence of an universal κ-maximal cofinitary group:

Theorem

[See Theorem 4.6] Assume GCH. For any regular δ>κ there is a forcing extension preserving cardinals and cofinalities in which 2κ=δ and there is a κ-maximal cofinitary group which is universal for groups of size <δ.

If we restrict the conclusion of this theorem to groups of size κ then the statement follows from p(κ)=2κ. In particular this conclusion follows from 2κ=κ+.

We conclude the paper with interesting remaining open questions.

κ-Maximal cofinitary groups have <κ many orbits

We proceed with the proof of the following theorem:

Theorem 2.1

If GS(κ) is a κ-maximal cofinitary group then it has less than κ many orbits.

Note that the proof of this theorem follows along almost the exact same lines as Kastermans’ proof, [8, Theorem 9] of the ω case.

Proof

Assume GS(κ) is a κ-cofinitary group with κ many orbits. Enumerate them without repetition as {Oα|α<κ}. We will show that G is not maximal. In fact, we will produce a new permutation hG so that G,h:=Gh is κ-cofinitary.

The construction of this h is done in stages. We will recursively define <κ-length partial injections hα:κκ so that for all α we have hαhα+1 and for limit ordinals λ we have hλ=ξ<λhξ. The desired h will be α<κhα. Let h0=. Since we take unions at limit stages, we just need to define the successor stage. Assume hα has been defined. Let ξ=min(κ\dom(hα)κ\range(hα)), let η be least so that (dom(hα)range(hα){ξ})Oη= and let ζ=minOη. If ξdom(hα) let hα+1=hα{(ξ,ζ)} and otherwise let hα+1=hα{(ζ,ξ)}. Let h=α<κhα. Clearly hS(κ). Moreover, hG since, at each stage we moved something from one orbit to another since ξOη (for the same reason h actually has no fixed points). It remains to show that G,h is a κ-cofinitary group. The following observation is important.

Claim 2.2

For each α,β<κ there is at most one pair (ξ,ζ)κ2 so that ξOα, ζOβ and h(ξ)=ζ or h(ζ)=ξ. In other words, h sends at most one element from Oα to an element of Oβ or vice versa for each pair of α and β.

Proof of Claim

Fix α,β<κ and suppose hδ(ξ)=ζOβ with ξOα for some δ<κ. Then, for all γδ it’s not the case that dom(hγ)range(hγ)Oα= and the same for Oβ so by the construction of h, no further pairs from Oα×Oβ or Oβ×Oα will be added to hγ.

Let WG(x) consist of the set of words or the form w(x)=g0xk0g1xk1g2xkl-1gl for l<ω, g0,,glG, x a fresh variable symbol and k0,,kl-1Z. Clearly every element of G,h can be represented as a word in WG(h). We want to show that for each w(x)WG(x) the word w(h) is either the identity or has <κ many fixed points. The key step in this is the introduction of the following tree.

Definition 2.3

The G-orbits tree of h is the graph1 consisting of vertex set {Oα|α<κ} and for αβ<κ we put an edge from Oα to Oβ if there is an ξOα so that h(ξ)Oβ or vice versa.

Claim 2.4

The G-orbits tree of h is acyclic.

Proof of Claim

Suppose towards a contradiction that there are α0,,αl+1=α0 so that for all i<l+1 there is an edge from Oαi to Oαi+1. By the previous claim, for each i<l+1 there is a unique pair (ξ,ζ) so that ξOαi and ζOαi+1 and either h(ξ)=ζ or h(ζ)=ξ. Let α be least so that all of these pairs are in hα+1. Since α is least, the pair (ξ,ζ)hα+1\hα is such that ξOαi and ζOαi+1 and either h(ξ)=ζ or h(ζ)=ξ for some i<l+1 and, moreover, there are already elements from both Oαi and Oαi+1 in dom(hα)range(hα). But this contradicts the defining procedure for hα+1 so we get a contradiction.

We’re now ready to finish the proof. Suppose w(x)WG(x) and w(h) is not the identity. Let w(x)=g0xk0g1xk1g2xkl-1gl. Suppose that for some α we have that w(h)(α)=α. First let’s see that this gives rise to a fixed point for some gj. To see this, consider the sequence of ordinals α,gl(α),hsign(kl-1)(gl(α)),,w(h)(α)=α i.e. the sequence of ordinals that appear as we successively evaluate w(h)(α) from the right to the left. Call this the evaluation sequence. Consider also the sequence of orbits Oα0,Oα1,,Oαl+|k0|++|kl-1| in which each element of the evaluation sequence is in. Observe that, omitting repetitions that arise from the elements of G appearing in w(h), this sequence of orbits is a walk in the G-orbits tree of H. Moreover since α is a fixed point, it must be the case that this walk begins and ends in the same orbit and therefore there is an i so that Oαi is the furthest from Oα0 in the G-orbits tree of h. Fix the least such i. It follows that there are ordinals ξ,ζ in the evaluation sequence so that ξOαi-1, ζOαi and either h(ξ)=ζ or h(ζ)=ξ. The cases are symmetric so assume the former. We have that since Oαi maximizes the distance from Oα0, the next element in the sequence of orbits not equal to Oαi must be closer, and, since the G-orbits tree of h is acyclic, it must in fact be Oαi-1. By the shape of w(x) we have that there is a piece of the word of the form xigjx with i{-1,1} and, that piece of the evaluation sequence is then x(ξ)=ζ, gj(ζ), xi(gj(ζ)). Also, we know that gj(ζ)Oαi since gjG and Oαi is an orbit of G and, by the argument above, xi(gj(ζ))Oαi-1. But by the first claim the only way this could occur is if i=-1 and gj(ζ)=ζ. Therefore ζ is a fixed point of gj.

To finish the proof now, note that if w(h) has κ many fixed points then, since there are only finitely many gj’s there must be some j so that κ many of the fixed points of w(h) give rise to a fixed point for the same gj. Moreover, each one of these fixed points must give rise to a distinct fixed point in gj since these are all bijections and hence the corresponding evaluation sequences are never equal. But this means that some gj has κ many fixed points contradicting the fact that it is a member of a κ-cofinitary group.

A potentially interesting observation is that the above proof works not only for a κ-cofinitary group but in fact for a group GS(κ) so that every non-identity element has <μ fixed points for any fixed μκ, in particular a group where the number of fixed points of each non-identity element is finite. This suggests that such μ-cofinitary subgroups of S(κ) may be interesting alternative analogues to the countable case on κ.

In [8] Kastermans sketches a corollary of the ω case of this result, due to Blass, that there is no Abelian maximal cofinitary group. It’s clear by looking at the proof that the same idea works verbatim in our context. Hence we get the following.

Corollary 2.5

[Blass, See Theorem 12 of [8]] There is no Abelian κ-maximal cofinitary group.

Controlling the number of orbits of a κ-maximal cofinitary group

We continue by recalling some facts about the cardinal p(κ) and a forcing notion introduced by the first author in [2] for adding a κ-maximal cofinitary group of a fixed size. We refer the reader to [3] for more information on p(κ) and [2] for more information about this forcing notion.

Definition 3.1

Let F be a family of subsets of κ. We say that F has the strong intersection property if for any subfamily FF of size <κ the intersection F has size κ. The pseudointersection number for κ, denoted p(κ) is the least size of a family F with the strong intersection property for which there is no A[κ]κ which is almost contained2 in all FF.

We will not need this definition of p(κ) but rather an equivalent one in terms of a certain forcing axiom. To this end we give the following definition.

Definition 3.2

Let P be a <κ-closed, κ-centered poset with P=γ<κCγ witnessing κ-centeredness. We say that P has canonical lower bounds if there is a function f=fP:κ<κκ such that whenever λ<κ and (pα|α<λ) is a decreasing sequence of conditions with pαCγα then there is a ppα for all α in Cf(γα|α<λ).

The significance of this definition is that the forcing axiom for the class of <κ-closed, κ-centered posets with canonical lower bounds is equivalent to p(κ)=2κ. More precisely,

Theorem 3.3

[Theorem 1.8 of [3]] If P is a <κ-closed, κ-centered poset with canonical lower bounds and below every pP there is a κ-sized antichain. Then for any collection D of <p(κ) many dense subsets of P, there is a filter GP which meets every element of D.

The point for us here is that we will show the forcing notion introduced in [2] is a <κ-closed, κ-centered poset with canonical lower bounds and hence, under the hypothesis p(κ)=2κ we have a forcing axiom for this poset. We now recall the relevant poset.

Let A be an index set and denote by WA the set of all reduced words in the alphabet {ai|aAandi{-1,1}}. We denote by W^A the good words i.e. those that are either the power of a singleton or start and end with a different letter. Given a mapping ρ:AS(κ), denote by ρ^ its canonical extension to a group homomorphism from the free group FA on A to S(κ). We say that ρ induces a κ-cofinitary representation if the image of ρ^ is κ-cofinitary. Whenever sA×κ×κ we let sa={(α,β)κ×κ|(a,α,β)s} and sa-1={(β,α)|(a,α,β)s} for each a in A. If each sa is a partial function we may occasionally abuse notation and write sa(α) for the unique β so that (a,α,β)s (if it exists). For a word wWA and a set sA×κ×κ recall the relation ew[s]κ×κ defined recursively by stipulating

  1. if w=a for some aA then ew[s]=sa.

  2. if w=a-1 for some aA then ew[s]=sa-1.

  3. if w=aiu for some uWA, aA and i{-1,1} without cancelation then (α,β)ew[s] if and only if there is a γκ so that (γ,β)eai[s] and (β,α)eu[s](α,γ).

We also define ew[s,ρ] for ρ:BS(κ) inducing a κ-cofinitary representation by (α,β)ew[s,ρ] if and only if (α,β)ew[s{(b,γ,δ)|bBandρ(b)(γ)=δ}].

Definition 3.4

[See [2], Definition 2.2] Let A and B be disjoint sets and let ρ:BS(κ) induce a κ-cofinitary representation. The forcing notion Q=QA,ρκ is defined as the set of all pairs (s,F)[A×κ×κ]<κ×[W^AB]<κ so that sa is injective for each aA. We let (s,F)Q(t,E) if st, FE and for every ακ and wE if ew[s,ρ](α)=α then ew[t,ρ](α)=α (and in particular is defined).

It’s clear that QA,ρκ is <κ-closed and it’s shown in [2, Lemma 2.3] that QA,ρκ is κ+-Knaster for any A and ρ. We want to show that QA,ρκ has canonical lower bounds when |A|κ. First observe the following.

Proposition 3.5

If |A|κ then QA,ρκ is κ-centered.

Proof

It suffices to note that for any A and ρ, any two conditions in QA,ρκ with the same first coordinate are compatible. Thus, if |A|κ then there are only κ many first coordinates so the sets Cs={(t,F)Q|t=s} witness the κ-centeredness of Q.

Lemma 3.6

If |A|κ then QA,ρκ has canonical lower bounds.

Proof

Fix bijections g0:κ<κ[A×κ×κ]<κ and g1:κ[A×κ×κ]<κ. For each γ<κ let Cγ be the set of conditions with first coordinate g1(γ). As mentioned above these sets are all directed. Let f:κ<κκ be defined by, for each λ<κ and (λα|α<λ)κ<κ, setting f(λα|α<λ)=g1-1(sup(g0(λαα<λ))). In other words, the lower bound of any sequence of conditions (pα|α<λ) can be found by taking the sup of the first coordinates and looking in the directed set associated with that supremum.

As a consequence of this lemma we have the following.

Lemma 3.7

Assume that B is a set of size less than p(κ) and ρ:BS(κ) induces a κ-cofinitary representation. Then there is an hS(κ)\ρ^ so that the group freely generated by the image of ρ^ and h is κ-cofinitary.

We also get the following.

Theorem 3.8

p(κ)ag(κ)

This was known, though it does not seem to have appeared in the literature in this explicit form. Instead it has been shown that p(κ)b(κ) (see [10, Theorem 2.9]) and that b(κ)ag(κ) (see [1, Theorem 3.2]).

Having set up the necessary facts about QA,ρκ we are now ready to begin proving the following theorem.

Theorem 3.9

If p(κ)=2κ then given any λ<κ and any partition {Oα|α<λ} of κ there is a κ-maximal cofinitary group so that ORB(G)={Oα|α<λ}.

The rest of the section is devoted to proving Theorem 3.9. As in the case of Theorem 2.1 we follow the corresponding proof of [8, Theorem 16]. From now on assume p(κ)=2κ. This assumption will be used via Theorem 3.3. Given a group GS(κ) denote by ORB(G) the set of orbits of G. Fix λ,μ<κ and partition κ into λ many bounded pieces {Bα|α<λ} and μ many unbounded pieces {Uγ|γ<μ}. To begin with fix a group Gκ, so that ORB(Gκ)={Bα|α<λ}{Uγ|γ<μ} and Gκ is isomorphic to the free group with κ many generators. To see that such a group exists note that, for any νκ using the forcing notion QA,ρν and the fact that is is <ν-closed, we can find ν-many elements of S(ν) which generate a ν-cofinitary group which is free and acts transitively on ν. Now, pushing forward these groups onto each Bα and Uγ via a bijection with its cardinal we can find a group G of size κ which is freely generated and for each gG we have that gUγ is an element of the free group we built acting transitively on Uγ.

Remark 1

There is a subtle difference here between the uncountable and the countable case. Namely, in the countable case we need only one element to generate the type of group described above whereas a counting argument shows that in the uncountable case we need κ many.

Now, enumerate S(κ) as {fα|κ<α<2κ}. We will build a continuous, increasing chain of κ-cofinitary groups Gα for κα<2κ so that for each α we have ORB(Gα)={Bγ|γ<λ}{Uγ|γ<μ} and either fαGα or Gα+1,fα is not κ-cofinitary. Clearly this will suffice to prove the theorem. To begin we need several lemmas. The first was proved by the first author in the original paper on κ-cofinitary groups.

Lemma 3.10

[Lemma 2.6 of [2]] Let (s,F)QA,ρκ, aA.

  1. Let ακ\dom(sa). Then there is an I=Ia,α such that |κ\I|<κ and for all βI we have that (s{(a,α,β)},F)(s,F).

  2. Let βκ\ran(sa). Then there is a J=Ja,β such that |κ\J|<κ and for all αJ we have that (s{(a,α,β)},F)(s,F).

As an immediate consequence of this we get the following result which will be used in the proof of Theorem 3.9. Note that the following is a slight strengthening of Lemma 3.7.

Lemma 3.11

Assume that B is a set of size less than p(κ), T[κ]κ and ρ:BS(κ) induces a κ-cofinitary representation. Then there is an hS(κ)\ρ^ so that the group freely generated by the image of ρ^ and h is κ-cofinitary and |hT×T|=κ.

Proof

Let A={a} be a singleton. Fix (s,F)QA,ρκ and α<κ. Since T is unbounded there is a β>α so that βT. Now by Lemma 3.10 there are co-κ many γ so that (s{a,β,γ},F)QA,ρκ, in particular such a γ can be found in T. In other words, the set of conditions (sF) so that sa(A\α)×A is dense in QA,ρκ. Applying Theorem 3.3 to this collection of dense sets alongside those used in Lemma 3.7 then gives the requisite h.

We also need a generalization of the notion of a “hitable" function from Kastermans’ proof.

Definition 3.12

Let C[κ]κ, GS(C) and let f:CC be a partial injection of size κ. We say that f is hitable with respect to G if for every gG we have |f\g|=κ and for each wWG(x) we have that either w(f) is the identity or has only <κ many fixed points (on the domain in which it’s defined).

Note that if C=dom(f) then being hitable means that fG and G,f is κ-cofinitary. The point of this definition is that we need to construct our groups in such a way that if fα is hitable with respect to Gα but Gα,fα collapses orbits then we need a way to “kill" the fact that fα is hitable without changing the orbits of Gα. To explain this more succinctly, for GHS(κ) let us say that H preserves the orbit structure of G if ORB(G)=ORB(H).

Lemma 3.13

Let C[κ]κ and f:CC be a partial injection of size κ. Suppose that GS(κ) is a κ-cofinitary group induced by a mapping ρ:BS(κ), A is a set disjoint from B and f is hitable with respect to G. Let (s,F)QA,Gκ and aA. Then there is an αdom(f) so that (s{(a,α,f(α))},F)(s,F).

Proof

It suffices to prove the lemma in the case that |F|=1 since we can iterate the argument <κ many times to generalize it. Suppose that F={w}. Fix aA. To begin, observe that we may assume that dom(f)dom(sa)= since |dom(sa)|<κ and |dom(f)|=κ so we can “thin out" f to a hitable function with domain disjoint from sa. Similarly we can assume that f itself has no fixed points by thinning out.

We will show that there are κ many αdom(f) so that the fixed points of ew[s{(a,α,f(α)},ρ] are the same as the fixed points of ew[s,ρ]. Clearly this suffices to prove the lemma. There are several cases.

Case 1: There is no occurrence of a in w. In this case ew[s,ρ]=ew[s{(a,α,f(α))},ρ] so there are no new fixed points.

Case 2: There are both occurrences in w of a or a-1 and of some other ba or b-1 with bA. In this case, since |sb|<κ and |dom(f)|=κ, there are κ many points in the domain of f so that for any γ<κ if ew[s{(a,α,f(α))},ρ](γ) is defined then already ew[s,ρ](γ) is defined. Therefore again ew[s,ρ]=ew[s{(a,α,f(α))},ρ]

Case 3: Only a, a-1 and elements of B occur in W. In this case there are two further subcases. To explain, let ew[f,ρ] denote the partial permutation obtained by replacing every instance of sa in the evaluation of w with f. In essence, this is akin to treating the word w as a word in Im(ρ^) with a free variable and substituting in f for this free variable. Since f is hitable with respect to Im(ρ^), it must be the case that ew[f,ρ] is either the identity on its domain or is κ-cofinite and these are the two subcases.

If ew[f,ρ] is κ-cofinite then there is a κ sized subset of α in the domain of dom(f) so that the pair (α,f(α)) does not lead to any fixed points in ew[f,ρ] and therefore (recalling that the domains of sa and f are disjoint by assumption), ew[s{(a,α,f(α))},ρ] has the same fixed points as ew[s,ρ] for any such α.

If ew[f,ρ] is the identity on its domain, then it must be the case that there are two occurrences of a or a-1 in the word w. Thus there is either an occurrence of a2, a-2 or aib0bkaj for b0,,bkB and i,j{-1,1}. In any of these cases note that there are <κ many γ so that the same (α,f(α)) is used in the evaluation of ew[f,ρ](γ). Therefore we can find a κ-sized subset of α in the dom(f) so that (α,f(α)) is only used in one of the two occurrences and thus for any such α we have ew[s{(a,α,f(α))},ρ] will not contain any new elements so once again ew[s,ρ]=ew[s{(a,α,f(α))},ρ] so there are no new fixed points.

Since this concludes all of the cases the proof is not complete.

Lemma 3.14

Suppose GS(κ) is a κ-cofinitary group of size <p(κ), C[κ]κ an f:CC is an injection which is hitable with respect to G. Then there is a permutation gS(κ)\G so that G,g is κ-cofinitary and |gf|=κ.

Proof

By Lemma 3.13, for each α<κ and aA there is a dense set of conditions (sF) in QA,ρκ so that there is a β>α and (a,β,f(β))s. Given this the construction of g follows similarly to that in Lemmas 3.7 and 3.11.

We can now prove Theorem 3.9.

Proof (Proof of Theorem 3.9)

As mentioned before we will construct a continuous increasing sequence of κ-cofinitary free groups Gα for κα<2κ. The desired group will be G=κα<2κGα. We already stated what Gκ is and for κ<λ<2κ limit we have that Gλ=γ<λGγ. Fix α and assume that we have constructed Gα and that we have ρα:αS(κ) induces a κ-cofinitary representation with Im(ρ^α)=Gα. We need to find a new permutation h:κκ so that Gα,h is κ-cofinitary, Gα,hGαZ and if fαGα then Gα,h,fα is not κ-cofinitary. We will define h separately on each Uγ and Bγ in such a way that hUβ:UβUβ is a bijection for each β and similarly for each Bβ.

For each Bβ let hBβ=gBβ for some gGκ. Note that since there are less than κ many bounded subsets Bγ, we don’t need to be worried if w(h)γ<λBγ has fixed points for any wWα. It suffices to ensure that for each Uγ and each word wWα the permutation w(h)Uγ:UγUγ has <κ many fixed points.3

We will construct hUγ differently depending on fα.

Case 1: fαGα or Gα,fα is not cofinitary. In this case we don’t need to worry about fα and so we construct hUγ for each γ using Lemma 3.7.

Case 2: fαGα, Gα,fα is cofinitary and there a γ and an unbounded subset UUγ so that fαU:UU. Fix such a γ and U. This means that fαU is hitable, and, on this unbounded subset respects the orbit Uγ. Therefore by Lemma 3.14 we can construct hUγ:UγUγ so that |hUfU|=κ. Construct the remaining hUξ as in Case 1. Note that in this case now Gα,h,fα will no longer be cofinitary since fα-1hU will have κ many fixed points.

Case 3: The first two cases fail. In particular, fαGα, Gα,fα is cofinitary and there are distinct γ,ξ<μ so that |fαUγ×Uξ|=κ. Fix such γ and ξ and let UUγ be unbounded so that Im(fU)Uξ. We construct hUξ and hUγ as follows. First use Lemma 3.11 to construct hUξ so that hUξ moves κ many elements of Im(fα) to itself. Now consider the function fα-1(hUξ)(fαU). This is a partial function from Uγ to Uγ with unbounded domain. If it is hitable with respect to this unbounded domain then follow the same procedure as in Case 2 to make sure that hUγ and fα-1(hUξ)(fαU) intersect on a set of size κ. If fα-1(hUξ)(fαU) is not hitable on any unbounded set then already we have ensured that fα cannot be added to Gα+1. In either case now extend h to all Uζ as in Case 1.

Finally let ρα+1:α+1S(κ) extend ρα by stipulating that ρα+1(α)=h. By what we have shown we get that Gα+1:=Im(ρ^α+1)Gα is a κ-cofinitary group respecting the orbits of Gα so that if fαGα then Gα+1,fα is not κ-cofinitary. This completes the construction.

Let G=α<2κGα. Clearly this is a κ-cofinitary group whose orbits are exactly {Bα|α<λ} and {Uγ|γ<μ}. We need to check that G is maximal. Suppose f=fαS(κ) is a permutation so that fαG. By our construction that means that the element h added at stage α was such that either fαh-1 or fα-1hfα has κ many fixed points. In either case this means that G,fα is not κ-cofinitary thus completing the proof.

Universal κ-maximal cofinitary groups

In this section we prove Theorem 4.6, which generalizes [7, Theorem III.15].4 The main ingredient is a slight augmentation of the forcing notion QA,ρκ to one which extends the image of ρ to a κ-cofinitary group which embeds an arbitrary group H as opposed to just the free group FA. Let ρ:BS(κ) be a mapping inducing a κ-cofinitary representation with HB= (as sets). Considering H as a set, let WH be the words in {ai|aHi{-1,1}}. For a word wWH we write w1 if by applying the rules aa-1=a-1a=1 and all cancellations that result from the operation of H gives the identity.

Definition 4.1

Let H be a group, B a set disjoint from H and ρ:BS(κ) a mapping inducing a κ-cofinitary representation. The forcing notion QH,ρκ consists of pairs (s,F)[H×κ×κ]<κ×[W^HB]<κ so that (sF) satisfies the same requirements as in Definition 3.4 with A=H (as a set) and if wF with w1 then eW[s,ρ]=id (on its domain). The extension relation is the same as in Definition 3.4.

Essentially the same argument as in [2] shows that this forcing notion is <κ-closed and κ+-Knaster. Moreover, the same argument as in the previous section shows that if |H|κ then this poset is <κ-centered with canonical lower bounds. We will first show the following.

Theorem 4.2

Let H, B and ρ be as above. Then the forcing notion QH,ρκ forces that H embeds into S(κ). In fact the image of the generic embedding is isomorphic to Im(ρ^)H, and this group is κ-cofinitary.

The key to proving theorem 4.2 is the following idea of applying relations from H restricted to some small subset. To avoid unnecessary repetitions, for the next few lemmas let us fix a group H and a ρ:BS(κ). Write Q for QH,ρκ.

Definition 4.3

Let AH be of size <κ and (s,F)Q. We say that (t,F)[H×κ×κ]<κ×[W^HB]<κ is obtained from (sF) by applying A-relations if for every aA we have (a,α,β)t if and only if there is a wWH so that aw1 and ew[s,ρ](β)=α.

Informally (tF) is obtained from (sF) by applying A-relations if t extends s to be closed under “everything it has to be" vis-à-vis words whose letters come from A. Since |A|<κ it follows that |t|<κ. Moreover it’s immediate that st. In fact (t,F)Q and (t,F)(s,F). To see this we need the following lemma.

Lemma 4.4

Suppose that AH is of size <κ, (s,F)Q and (tF) is obtained from (sF) by applying A-relations. Let wWH and suppose that ew[t,ρ](α)=β. Then there is a word w¯WH so that w and w¯ reduce to the same element of H and ew¯[s,ρ](α)=β.

Proof

Suppose that ew[s,ρ](α) is not defined but ew[t,ρ](α)=β. It follows that there is an aA so that w=uav and a pair (γ,ξ) so that (a,γ,ξ)t and hence, by definition, there is a word w0 so that aw01 and ew[s,ρ](ξ)=γ. Thus we can omit the occurrence of a in w by replacing it with w0-1. Continuing to apply this procedure we can reduce w to a new word w¯ so that ww¯ (as words in H) and ew¯[s,ρ] is defined.

As a corollary of this lemma we get the following.

Lemma 4.5

Suppose that AH is of size <κ, (s,F)Q and (tF) is obtained from (sF) by applying A-relations. The following hold.

  1. (t,F)Q

  2. (t,F)Q(s,F)

  3. If (t,F) is obtained from (tF) by applying A-relations then t=t.

Proof

The only one that’s not obvious in light of Lemma 4.4 is the third one. Suppose that there is a (a,α,β)t so that aA there is a wWH so that aw1 and ew[t,ρ](β)=α. By applying the procedure described in Lemma 4.4 we can find a w¯ so that aw¯1 and ew¯[s,ρ](β)=α. As a result (a,α,β)t contradicting our assumption.

With these lemmas proved, we can now show Theorem 4.2.

Proof (Proof of Theorem 4.2)

The main thrust of what’s left to do consists in showing that for each hH, wWHB and α<κ the sets Dh,α={(s,F)Q|β(h,α,β)s}, Rh,α={(s,F)Q|β(h,β,α)s} and Ww={(s,F)Q|wF} are dense. That Ww is dense is clear and the proofs for the other two are the same so we only prove that Dh,α is dense.

Fix a condition (s,F)Q and apply {h}-relations to it to obtain a (t,F)(s,F). If (t,F)Dh,α we’re done so suppose not. By Lemma 3.10 there are co-boundedly many β so that (t{h,α,β},F) is a condition in the bigger forcing notion defined by Definition 3.4. We just need to show that for some such β (t{h,α,β},F) is a condition in Q. From this it will follow immediately that (t{h,α,β},F)Q(s,F) since the extension relation is the same. Let β>dom(th)range(th){α}. We claim that this β works. Indeed suppose not and w be a word of minimal length so that ew[t{h,α,β},ρ]id but w1. Fix a γ so that ew[t{h,α,β},ρ](γ)γ. Since β is larger than anything in the domain or range of w it must be the case that the pair (α,β) is used in the evaluation of ew[t{h,α,β},ρ](γ) either in the beginning of w, at the end of w or in the middle, in which case it needs to be used again in reverse immediately. The third case would imply that w is not minimal so this cannot be true. Therefore w can either be written as whi or hiw for i{-1,1} and wWH. In either case it follows that since t was obtained by applying {h}-relations (h,α,β)t which is a contradiction to our assumption.

To finish the proof now observe that by these density arguments Q adds an injective map from H into S(κ) whose image is κ-cofinitary. That it is in fact an embedding follows from the fact that closing under {h}-relations is dense for each {h} and therefore the image of the embedding is isomorphic to Im(ρ^)H.

Using Theorem 4.2 we can now obtain:

Theorem 4.6

Assume GCH. For any regular δ>κ, there is a <κ-closed, κ+-c.c. forcing notion Pδ forcing that there is a κ-maximal cofinitary group G of size δ which embeds every group of size <δ.

Proof

Assume GCH and fix δ>κ regular. Obviously the desired poset will be an iteration whose iterands will be of the form QH,ρκ. Let us fix a bookkeeping function F:δ[δ]<δ, which is surjective and so that for each a[δ]<δ the preimage F-1({a}) is unbounded in δ. We will define a <κ-supported, δ-length iteration of posets Pα of size <δ. It follows that we can, via coding, think of each Pα as an element of [δ]<δ. Also, if a˙ is a Pα name for a subset of λ for some λ<δ then, using a standard nice names argument, we can also think of a˙ as coded by an element of [δ]<δ. Similarly, using standard coding arguments if H is a group of size <δ then it can be coded into an element of [δ]<δ.

The forcing is now defined as follows. Let P0 be the trivial poset. At limit stages we take <κ-sized supports. Suppose Pα has been defined as have names ρ˙α and B˙α where 1αρ˙α:B˙αS(κˇ) induces a κ-cofinitary representation.

Case 1: F(α) codes a Pβ nice name H˙α for an element of [δ]<δ which codes a group for some β<α. In this case let Q˙α be the Pα name for the forcing notion QH˙α,ρ˙ακ. Let Pα+1=PαQ˙α. Finally let ρ˙α+1 be the name for the generic mapping added by Q˙α which embeds H˙α into a κ-cofinitary group extending the image of ρ˙α and let B˙α+1 name an arbitrary set consisting of the disjoint union of B˙α and a set of the same cardinality as H˙α.

Case 2: Otherwise. In this case let Q˙α be the Pα name for the poset QA,ρκ where A is an arbitrary set of set κ+ (say κ+ itself). Let Pα+1,ρ˙α+1 and B˙α+1 be defined as in Case 1.

We claim that Pδ is the required poset. Clearly it is <κ-closed and κ+-c.c. and adds a κ-cofinitary group, call it G. To see that G embeds every group of cardinality <δ, let H˙ be a Pδ name for a group of size λ for some λ<δ. Without loss we can assume that H˙ is a nice name for a subset of λ. It follows that in fact H˙ was added by some Pβ for β<δ. Moreover since the preimage of F-1({H˙}) is unbounded in δ, there is an α>β so that F(α)=H˙ and so at stage α we forced that H˙ embeds into G. To see that G is maximal, suppose f˙:κκ is a Pδ name for a permutation. By standard arguments f˙ was added by some Pα for α<δ. At a later stage, say β>α we were in case 2. Let Gβ+1 be the group added by Pβ+1. By the properties of the forcing QA,ρκ we have that VPβ+1Gβ+1 is a κ-maximal cofinitary group" and, in particular, it follows that either f˙ is forced to be in Gβ+1 or else there is a word w(x)WGβ+1(x) so that w(f˙) is forced to not be κ-cofinitary. In either case it follows that the same holds in G (working in V[G]) from which the maximality of G follows.

By interweaving the proofs of the above result and Theorem 3.9 we can also obtain the following.

Corollary 4.7

Assume GCH and fix δ>κ regular. Given any partition of κ into λ many pieces {Oξ|ξ<λ} for some λ<κ there is a cofinality preserving forcing P which forces that 2κ=δ and there is a κ-maximal cofinitary group G which is universal for groups of size <δ and ORB(G)={Oξ|ξ<λ}.

Kastermans’ original theorem on the ω case used MA as opposed to obtaining the universal group by brute force (pun intended). We would like to obtain the same here using p(κ)=2κ in place of MA. However, since we need to assume that |H|κ in order to ensure we can apply the forcing axiom characterization we only obtain the weaker result that G can be universal for groups of size at most κ. Specifically we have the following.

Theorem 4.8

If p(κ)=2κ then there is a κ-maximal cofinitary group which embeds every group of size κ.

Proof

Enumerate S(κ)={fα|α<2κ} and the collection of all groups with domain κ as {Hα|α<2κ}. Our group will be constructed transfinitely. We will inductively define an increasing, continuous chain of groups Gα so that for each α Hα embeds into Gα and either gαGα or Gα,gα is not κ-cofinitary. Our group will be G:=α<2κGα as before.

At stage 0 first use QH0κ to build a φ0 so that φ0:H0S(κ) embeds a κ-cofinitary copy of H0 in S(κ). Next, if g0 is hitable with respect to φ0(H0) then use Lemma 3.14 to find a g0 so that φ0(H0),g0 is κ-cofinitary and f0 cannot be added to any subgroup of S(κ) containing g0 without killing κ-cofinitariness. If f0 is not hitable then let g0 be the identity and in either case let G0:=φ0(H0),g0.

Now suppose we have constructed a κ-cofinitary group Gα so that for all βα there is an embedding φβ:HβGα, and for every βα either gβGβ or Gβ,gβ is not κ-cofinitary. Let ρα:BS(κ) be a mapping which induces a κ-cofinitary representation equal to Gα. Now use QHα+1,ρακ to find a φα+1 so that φα+1 embeds Hα+1 into a κ-cofinitary extension of Gα. Finally if fα+1 is hitting with respect to Im(φα+1),Gα then use Lemma 3.14 as in stage 0 to find a gα+1. Finally let Gα+1=Gα,Im(φα+1),gα+1.

This completes the construction. Let G=α<2κGα. Clearly this embeds every group of size κ and, by the same argument as was used in Theorem 3.9 it will be a κ-maximal cofinitary group.

Again this theorem can be proved with the added assumption that the universal G has any particular set of <κ many orbits we like.

Conclusion and open questions

We finish by recording some open questions on the structure of κ-maximal cofinitary groups.

Question 1

Is it consistent that there is a partition of κ of size <κ which is not the set of orbits of a κ-maximal cofinitary group?

This seems to be unknown even in the ω case and would be extremely interesting to investigate further.

The next has to do with the analogue of another theorem of Kastermans. Kastermans also showed in [8, Theorem 8] that it’s consistent that there is a locally finite maximal cofinitary group. Recall that a group is locally finite if every finitely generated sungroup is finite. The obvious analogue of this result for κ, that there is a locally <κ κ-maximal cofinitary group, is trivially true since any group of size >κ is locally <κ for any uncountable κ. Therefore the following question is more appropriate and seems to represent the first place that there many be a divergence in the theories of maximal cofinitary groups on ω and on κ.

Question 2

Is it consistent that there is a locally finite κ-maximal cofinitary group?

Finally we repeat the observation noted after the proof of Theorem 2.1 in a question form.

Question 3

Fix μ<κ and define a group to be (κ,μ)-cofinitary if it is a subgroup of S(κ) all of whose non-identity elements have less than μ many fixed points. How do the maximal (κ,μ)-cofinitary groups differ? In particular, can the associated cardinal characteristics be different? Can there be μ0<μ1<κ and G0 a (κ,μ0)-maximal cofinitary group, G1 a (κ,μ1)-maximal cofinitary group so that G0G1?

Acknowledgements

The authors would like to thank the Austrian Science Fund (FWF) for the generous support through Grant Numbers Y1012-N35 and I4039.

Funding Information

Open access funding provided by Austrian Science Fund (FWF).

Footnotes

1

In order to show the comparison between the current proof and Kastermans [8, Definition 14] we keep his terminology of a G-orbits tree. However, in the our case, unlike in the case of ω, this graph is not necessarily a tree, namely it’s not necessarily connected. For example if, for all n<ω we let On={n} then we will have that h(n)=n+1 for all even finite n and h(n)=n-1 for all odd finite n and these orbits will form a connected component unto themselves (obviously this situation can’t happen in the ω case). However the fact that the G-orbits tree is a tree and not just an acyclic graph is not used in Kastermans’ proof and won’t be needed in ours either.

2

Here, if B,C[κ]κ we say that B is almost contained in C if B\C has size <κ.

3

Note this is where the fact that we have <κ many orbits is used and it’s exactly this that would break if we tried to rerun the proof with κ many orbits.

4

Kastermans actually works under the assumption that CH holds as opposed to MA and just shows that the group embeds all countable groups. However, it’s obvious how to generalize his construction to MA and <20.

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Contributor Information

Vera Fischer, Email: vera.fischer@univie.ac.at.

Corey Bacal Switzer, Email: corey.bacal.switzer@univie.ac.at.

References

  • 1.Andreas, B., Tapani, H.,Yi, Z.: Mad families and their neighbors. Preprint (2007)
  • 2.Fischer V. Maximal cofinitary groups revisited. MLQ Math. Log. Q. 2015;61(4–5):367–379. doi: 10.1002/malq.201400070. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 3.Fischer V, Montoya DC, Schilhan J, Soukup DT. Towers and gaps at uncountable cardinals. Fundamenta Mathematicae. 2019;6:66. [Google Scholar]
  • 4.Haim, H.: Saharon Shelah Borel maximal cofinitary group. arXiv:1610.01344
  • 5.Haim, H.: Saharon Shelah κ-Madness and Definability. arXiv:1805.07048
  • 6.Horowitz, H., Shelah, S.: On the non-existence of κ-mad families. arXiv:1906.09538
  • 7.Kastermans, B.: Cofinitary Groups and Other Almost Disjoint Families of Reals. ProQuest LLC, Ann Arbor (2006). Thesis (Ph.D.)—University of Michigan
  • 8.Kastermans B. Isomorphism types of maximal cofinitary groups. Bull. Symb. Logic. 2009;15(3):300–319. doi: 10.2178/bsl/1246453976. [DOI] [Google Scholar]
  • 9.Kastermans B, Zhang Y. On cofinitary groups. Uch. Zap. Kazan. Univ. Ser. Fiz.-Mat. Nauki. 2012;154(2):159–166. [Google Scholar]
  • 10.Schilhan J. Generalised pseudointersections. Math. Log. Q. 2019;65(4):479–489. doi: 10.1002/malq.201800084. [DOI] [Google Scholar]
  • 11.Schrittesser, D.: On Horowitz and Shelah’s maximal eventually different family. RIMS Kyôkyûroku, No. 2042, 99–105
  • 12.Schrittesser D. Compactness of maximal eventually different families. Bull. Lond. Math. Soc. 2018;50:340–348. doi: 10.1112/blms.12139. [DOI] [Google Scholar]

Articles from Archive for Mathematical Logic are provided here courtesy of Springer

RESOURCES