Adjoining Almost Disjoint Permutations (Q4531083)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1746891
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Adjoining Almost Disjoint Permutations |
scientific article; zbMATH DE number 1746891 |
Statements
20 November 2002
0 references
almost disjoint families
0 references
eventually different reals
0 references
infinite symmetric groups
0 references
forcing
0 references
Adjoining Almost Disjoint Permutations (English)
0 references
0 references
0 references
0 references
0.8749545
0 references
0 references
0.8642623
0 references
0 references
0.85564995
0 references
0.85384345
0 references
0.85236645
0 references
Say that two functions \(f,g : {\mathbb N} \to {\mathbb N}\) are eventually different if \(f(n) \neq g(n)\) for all but finitely many \(n \in {\mathbb N}\). \(F \subset {\mathbb N}^{\mathbb N}\) is an eventually different family if its members are pairwise eventually different. In case we have \(F \subset \text{Sym} ({\mathbb N})\), \(F\) is called an almost disjoint permutation family. Here, \(\text{Sym} ({\mathbb N})\) denotes, as usual, the group of all permutations of the natural numbers. The author proves it is consistent with ZFC that there is an almost disjoint permutation family which is maximal (with respect to inclusion), yet contained in an eventually different family of strictly larger size. This result is established by adjoining eventually different permutations over a model for Martin's axiom MA.
0 references