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:
Any -maximal cofinitary group has many orbits under the natural group action of on .
If then any partition of into less than many sets can be realized as the orbits of a -maximal cofinitary group.
For any regular it is consistent that there is a -maximal cofinitary group which is universal for groups of size . If we only require the group to be universal for groups of size then this follows from .
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 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 is cofinitary if it has only finitely many fixed points. A group 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 . 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 is said to be -cofinitary if it has many fixed points. A subgroup 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 is a -specifically centered partial order, and is a family of dense subsets of ,where and ,then there is a filter such that for all . Here denotes the -pseudointersection number.
Given a group we look at the orbits arising from its action on : for every and the action is such that . 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 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 , for any and any partition 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 then given any and any partition of there is a -maximal cofinitary group G so that the orbits of G are exactly .
Finally we investigate the possible isomorphism types of -maximal cofinitary groups. Kastermans proved that under 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 then H embeds into G. Here we obtain the existence of an universal -maximal cofinitary group:
Theorem
[See Theorem 4.6] Assume . For any regular there is a forcing extension preserving cardinals and cofinalities in which 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 . In particular this conclusion follows from .
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 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 is a -cofinitary group with many orbits. Enumerate them without repetition as . We will show that G is not maximal. In fact, we will produce a new permutation so that is -cofinitary.
The construction of this h is done in stages. We will recursively define -length partial injections so that for all we have and for limit ordinals we have . The desired h will be . Let . Since we take unions at limit stages, we just need to define the successor stage. Assume has been defined. Let , let be least so that and let . If let and otherwise let . Let . Clearly . Moreover, since, at each stage we moved something from one orbit to another since (for the same reason h actually has no fixed points). It remains to show that is a -cofinitary group. The following observation is important.
Claim 2.2
For each there is at most one pair so that , and or . In other words, h sends at most one element from to an element of or vice versa for each pair of and .
Proof of Claim
Fix and suppose with for some . Then, for all it’s not the case that and the same for so by the construction of h, no further pairs from or will be added to .
Let consist of the set of words or the form for , , x a fresh variable symbol and . Clearly every element of can be represented as a word in . We want to show that for each 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 and for we put an edge from to if there is an so that or vice versa.
Claim 2.4
The G-orbits tree of h is acyclic.
Proof of Claim
Suppose towards a contradiction that there are so that for all there is an edge from to . By the previous claim, for each there is a unique pair so that and and either or . Let be least so that all of these pairs are in . Since is least, the pair is such that and and either or for some and, moreover, there are already elements from both and in . But this contradicts the defining procedure for so we get a contradiction.
We’re now ready to finish the proof. Suppose and w(h) is not the identity. Let . Suppose that for some we have that . First let’s see that this gives rise to a fixed point for some . To see this, consider the sequence of ordinals i.e. the sequence of ordinals that appear as we successively evaluate from the right to the left. Call this the evaluation sequence. Consider also the sequence of orbits 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 is the furthest from in the G-orbits tree of h. Fix the least such i. It follows that there are ordinals in the evaluation sequence so that , and either or . The cases are symmetric so assume the former. We have that since maximizes the distance from , the next element in the sequence of orbits not equal to must be closer, and, since the G-orbits tree of h is acyclic, it must in fact be . By the shape of w(x) we have that there is a piece of the word of the form with and, that piece of the evaluation sequence is then , , . Also, we know that since and is an orbit of G and, by the argument above, . But by the first claim the only way this could occur is if and . Therefore is a fixed point of .
To finish the proof now, note that if w(h) has many fixed points then, since there are only finitely many ’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 . Moreover, each one of these fixed points must give rise to a distinct fixed point in since these are all bijections and hence the corresponding evaluation sequences are never equal. But this means that some 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 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 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 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 and [2] for more information about this forcing notion.
Definition 3.1
Let be a family of subsets of . We say that has the strong intersection property if for any subfamily of size the intersection has size . The pseudointersection number for , denoted is the least size of a family with the strong intersection property for which there is no which is almost contained2 in all .
We will not need this definition of but rather an equivalent one in terms of a certain forcing axiom. To this end we give the following definition.
Definition 3.2
Let be a -closed, -centered poset with witnessing -centeredness. We say that has canonical lower bounds if there is a function such that whenever and is a decreasing sequence of conditions with then there is a for all in .
The significance of this definition is that the forcing axiom for the class of -closed, -centered posets with canonical lower bounds is equivalent to . More precisely,
Theorem 3.3
[Theorem 1.8 of [3]] If is a -closed, -centered poset with canonical lower bounds and below every there is a -sized antichain. Then for any collection of many dense subsets of , there is a filter which meets every element of .
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 we have a forcing axiom for this poset. We now recall the relevant poset.
Let A be an index set and denote by the set of all reduced words in the alphabet . We denote by 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 , denote by its canonical extension to a group homomorphism from the free group on A to . We say that induces a -cofinitary representation if the image of is -cofinitary. Whenever we let and for each a in A. If each is a partial function we may occasionally abuse notation and write for the unique so that (if it exists). For a word and a set recall the relation defined recursively by stipulating
if for some then .
if for some then .
if for some , and without cancelation then if and only if there is a so that and .
We also define for inducing a -cofinitary representation by if and only if .
Definition 3.4
[See [2], Definition 2.2] Let A and B be disjoint sets and let induce a -cofinitary representation. The forcing notion is defined as the set of all pairs so that is injective for each . We let if , and for every and if then (and in particular is defined).
It’s clear that is -closed and it’s shown in [2, Lemma 2.3] that is -Knaster for any A and . We want to show that has canonical lower bounds when . First observe the following.
Proposition 3.5
If then is -centered.
Proof
It suffices to note that for any A and , any two conditions in with the same first coordinate are compatible. Thus, if then there are only many first coordinates so the sets witness the -centeredness of .
Lemma 3.6
If then has canonical lower bounds.
Proof
Fix bijections and . For each let be the set of conditions with first coordinate . As mentioned above these sets are all directed. Let be defined by, for each and , setting . In other words, the lower bound of any sequence of conditions 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 and induces a -cofinitary representation. Then there is an so that the group freely generated by the image of and h is -cofinitary.
We also get the following.
Theorem 3.8
This was known, though it does not seem to have appeared in the literature in this explicit form. Instead it has been shown that (see [10, Theorem 2.9]) and that (see [1, Theorem 3.2]).
Having set up the necessary facts about we are now ready to begin proving the following theorem.
Theorem 3.9
If then given any and any partition of there is a -maximal cofinitary group so that .
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 . This assumption will be used via Theorem 3.3. Given a group denote by the set of orbits of G. Fix and partition into many bounded pieces and many unbounded pieces . To begin with fix a group , so that and is isomorphic to the free group with many generators. To see that such a group exists note that, for any using the forcing notion and the fact that is is -closed, we can find -many elements of which generate a -cofinitary group which is free and acts transitively on . Now, pushing forward these groups onto each and via a bijection with its cardinal we can find a group G of size which is freely generated and for each we have that is an element of the free group we built acting transitively on .
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 as . We will build a continuous, increasing chain of -cofinitary groups for so that for each we have and either or 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 , .
Let . Then there is an such that and for all we have that .
Let . Then there is a such that and for all we have that .
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 , and induces a -cofinitary representation. Then there is an so that the group freely generated by the image of and h is -cofinitary and .
Proof
Let be a singleton. Fix and . Since T is unbounded there is a so that . Now by Lemma 3.10 there are co- many so that , in particular such a can be found in T. In other words, the set of conditions (s, F) so that is dense in . 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 , and let be a partial injection of size . We say that f is hitable with respect to G if for every we have and for each 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 then being hitable means that and is -cofinitary. The point of this definition is that we need to construct our groups in such a way that if is hitable with respect to but collapses orbits then we need a way to “kill" the fact that is hitable without changing the orbits of . To explain this more succinctly, for let us say that H preserves the orbit structure of G if .
Lemma 3.13
Let and be a partial injection of size . Suppose that is a -cofinitary group induced by a mapping , A is a set disjoint from B and f is hitable with respect to G. Let and . Then there is an so that .
Proof
It suffices to prove the lemma in the case that since we can iterate the argument many times to generalize it. Suppose that . Fix . To begin, observe that we may assume that since and so we can “thin out" f to a hitable function with domain disjoint from . Similarly we can assume that f itself has no fixed points by thinning out.
We will show that there are many so that the fixed points of are the same as the fixed points of . Clearly this suffices to prove the lemma. There are several cases.
Case 1: There is no occurrence of a in w. In this case so there are no new fixed points.
Case 2: There are both occurrences in w of a or and of some other or with . In this case, since and , there are many points in the domain of f so that for any if is defined then already is defined. Therefore again
Case 3: Only a, and elements of B occur in W. In this case there are two further subcases. To explain, let denote the partial permutation obtained by replacing every instance of in the evaluation of w with f. In essence, this is akin to treating the word w as a word in with a free variable and substituting in f for this free variable. Since f is hitable with respect to , it must be the case that is either the identity on its domain or is -cofinite and these are the two subcases.
If is -cofinite then there is a sized subset of in the domain of so that the pair does not lead to any fixed points in and therefore (recalling that the domains of and f are disjoint by assumption), has the same fixed points as for any such .
If is the identity on its domain, then it must be the case that there are two occurrences of a or in the word w. Thus there is either an occurrence of , or for and . In any of these cases note that there are many so that the same is used in the evaluation of . Therefore we can find a -sized subset of in the so that is only used in one of the two occurrences and thus for any such we have will not contain any new elements so once again so there are no new fixed points.
Since this concludes all of the cases the proof is not complete.
Lemma 3.14
Suppose is a -cofinitary group of size , an is an injection which is hitable with respect to G. Then there is a permutation so that is -cofinitary and .
Proof
By Lemma 3.13, for each and there is a dense set of conditions (s, F) in so that there is a and . 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 for . The desired group will be . We already stated what is and for limit we have that . Fix and assume that we have constructed and that we have induces a -cofinitary representation with . We need to find a new permutation so that is -cofinitary, and if then is not -cofinitary. We will define h separately on each and in such a way that is a bijection for each and similarly for each .
For each let for some . Note that since there are less than many bounded subsets , we don’t need to be worried if has fixed points for any . It suffices to ensure that for each and each word the permutation has many fixed points.3
We will construct differently depending on .
Case 1: or is not cofinitary. In this case we don’t need to worry about and so we construct for each using Lemma 3.7.
Case 2: , is cofinitary and there a and an unbounded subset so that . Fix such a and U. This means that is hitable, and, on this unbounded subset respects the orbit . Therefore by Lemma 3.14 we can construct so that . Construct the remaining as in Case 1. Note that in this case now will no longer be cofinitary since will have many fixed points.
Case 3: The first two cases fail. In particular, , is cofinitary and there are distinct so that . Fix such and and let be unbounded so that . We construct and as follows. First use Lemma 3.11 to construct so that moves many elements of to itself. Now consider the function . This is a partial function from to 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 and intersect on a set of size . If is not hitable on any unbounded set then already we have ensured that cannot be added to . In either case now extend h to all as in Case 1.
Finally let extend by stipulating that . By what we have shown we get that is a -cofinitary group respecting the orbits of so that if then is not -cofinitary. This completes the construction.
Let . Clearly this is a -cofinitary group whose orbits are exactly and . We need to check that G is maximal. Suppose is a permutation so that . By our construction that means that the element h added at stage was such that either or has many fixed points. In either case this means that 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 to one which extends the image of to a -cofinitary group which embeds an arbitrary group H as opposed to just the free group . Let be a mapping inducing a -cofinitary representation with (as sets). Considering H as a set, let be the words in . For a word we write if by applying the rules 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 a mapping inducing a -cofinitary representation. The forcing notion consists of pairs so that (s, F) satisfies the same requirements as in Definition 3.4 with (as a set) and if with then (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 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 forces that H embeds into . In fact the image of the generic embedding is isomorphic to , 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 . Write for .
Definition 4.3
Let be of size and . We say that is obtained from (s, F) by applying A-relations if for every we have if and only if there is a so that and .
Informally (t, F) is obtained from (s, F) 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 it follows that . Moreover it’s immediate that . In fact and . To see this we need the following lemma.
Lemma 4.4
Suppose that is of size , and (t, F) is obtained from (s, F) by applying A-relations. Let and suppose that . Then there is a word so that w and reduce to the same element of H and .
Proof
Suppose that is not defined but . It follows that there is an so that and a pair so that and hence, by definition, there is a word so that and . Thus we can omit the occurrence of a in w by replacing it with . Continuing to apply this procedure we can reduce w to a new word so that (as words in H) and is defined.
As a corollary of this lemma we get the following.
Lemma 4.5
Suppose that is of size , and (t, F) is obtained from (s, F) by applying A-relations. The following hold.
If is obtained from (t, F) by applying A-relations then .
Proof
The only one that’s not obvious in light of Lemma 4.4 is the third one. Suppose that there is a so that there is a so that and . By applying the procedure described in Lemma 4.4 we can find a so that and . As a result 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 , and the sets , and are dense. That is dense is clear and the proofs for the other two are the same so we only prove that is dense.
Fix a condition and apply -relations to it to obtain a . If we’re done so suppose not. By Lemma 3.10 there are co-boundedly many so that is a condition in the bigger forcing notion defined by Definition 3.4. We just need to show that for some such is a condition in . From this it will follow immediately that since the extension relation is the same. Let . We claim that this works. Indeed suppose not and w be a word of minimal length so that but . Fix a so that . 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 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 or for and . In either case it follows that since t was obtained by applying -relations which is a contradiction to our assumption.
To finish the proof now observe that by these density arguments adds an injective map from H into whose image is -cofinitary. That it is in fact an embedding follows from the fact that closing under -relations is dense for each and therefore the image of the embedding is isomorphic to .
Using Theorem 4.2 we can now obtain:
Theorem 4.6
Assume . For any regular , there is a -closed, -c.c. forcing notion forcing that there is a -maximal cofinitary group G of size which embeds every group of size .
Proof
Assume and fix regular. Obviously the desired poset will be an iteration whose iterands will be of the form . Let us fix a bookkeeping function , which is surjective and so that for each the preimage is unbounded in . We will define a -supported, -length iteration of posets of size . It follows that we can, via coding, think of each as an element of . Also, if is a name for a subset of for some then, using a standard nice names argument, we can also think of 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 be the trivial poset. At limit stages we take -sized supports. Suppose has been defined as have names and where induces a -cofinitary representation.
Case 1: codes a nice name for an element of which codes a group for some . In this case let be the name for the forcing notion . Let . Finally let be the name for the generic mapping added by which embeds into a -cofinitary group extending the image of and let name an arbitrary set consisting of the disjoint union of and a set of the same cardinality as .
Case 2: Otherwise. In this case let be the name for the poset where A is an arbitrary set of set (say itself). Let and be defined as in Case 1.
We claim that 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 be a name for a group of size for some . Without loss we can assume that is a nice name for a subset of . It follows that in fact was added by some for . Moreover since the preimage of is unbounded in , there is an so that and so at stage we forced that embeds into G. To see that G is maximal, suppose is a name for a permutation. By standard arguments was added by some for . At a later stage, say we were in case 2. Let be the group added by . By the properties of the forcing we have that “ is a -maximal cofinitary group" and, in particular, it follows that either is forced to be in or else there is a word so that 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 and fix regular. Given any partition of into many pieces for some there is a cofinality preserving forcing which forces that and there is a -maximal cofinitary group G which is universal for groups of size and .
Kastermans’ original theorem on the case used as opposed to obtaining the universal group by brute force (pun intended). We would like to obtain the same here using in place of . However, since we need to assume that 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 then there is a -maximal cofinitary group which embeds every group of size .
Proof
Enumerate and the collection of all groups with domain as . Our group will be constructed transfinitely. We will inductively define an increasing, continuous chain of groups so that for each embeds into and either or is not -cofinitary. Our group will be as before.
At stage 0 first use to build a so that embeds a -cofinitary copy of in . Next, if is hitable with respect to then use Lemma 3.14 to find a so that is -cofinitary and cannot be added to any subgroup of containing without killing -cofinitariness. If is not hitable then let be the identity and in either case let .
Now suppose we have constructed a -cofinitary group so that for all there is an embedding , and for every either or is not -cofinitary. Let be a mapping which induces a -cofinitary representation equal to . Now use to find a so that embeds into a -cofinitary extension of . Finally if is hitting with respect to then use Lemma 3.14 as in stage 0 to find a . Finally let .
This completes the construction. Let . 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 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 and a -maximal cofinitary group, a -maximal cofinitary group so that ?
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
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 we let then we will have that for all even finite n and 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.
Here, if we say that B is almost contained in C if has size .
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.
Kastermans actually works under the assumption that holds as opposed to and just shows that the group embeds all countable groups. However, it’s obvious how to generalize his construction to and .
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]