Skip to content
DraconiticResearch
Search Sources API
188,932 studies31 sourcesUpdated 55 min ago
PreprintCC BY 4.0arXiv

Countryman basis and club-isomorphisms under MA(ω1)

Abstract

We show that unlike textsfPFA, textsfMAω1 is consistent with the existence of 2ω1-many Countryman lines which pairwise contain no uncountable isomorphic or reverse-isomorphic suborders. This clarifies an issue regarding the claim that textsfMAω1 implies that there is a finite basis for the Countryman lines. The family of Countryman lines comes from a family of 2ω1-many coherent trees which pairwise contain no club-isomorphic subtrees. To prove this, we first construct such a family of trees using diamondsuit, and then we iterate ccc forcings while preserving this property.

Related

  1. Strong failures of club guessing at the successor of a regular cardinal
    Curial Gallart
    arXivPreprintCC BY-NC-SA 4.0Full textLogic & foundationsarXiv
  2. Regularity of profinite isomorphisms of hyperbolic 3-manifolds
    Liam Hanany
    arXivPreprintCC BY 4.0Full textAlgebra & number theoryGeometry & topologyarXiv
  3. Match forecasts in UEFA club competitions: Elo ratings versus Transfermarkt valuations
    Gergely Csurilla, László Csató
    arXivPreprintarXiv licenceFull textStatisticsarXiv
  4. Identities and isomorphisms of finite graded matrix algebras
    Diogo Diniz, Daniela Martinez Correa, Dimas José Gonçalves +1
    arXivPreprintarXiv licenceFull textAlgebra & number theoryarXiv
  5. Isomorphisms of graded semiconnected algebras
    Darius Dramburg
    arXivPreprintCC BY 4.0Full textAlgebra & number theoryarXiv
BibTeX
@misc{polymeris2026countryman,
  title = {{Countryman basis and club-isomorphisms under MA$(ω_1)$}},
  author = {Lucas Polymeris},
  howpublished = {arXiv},
  year = {2026},
  month = oct,
  doi = {10.48550/arxiv.2610.05582},
  eprint = {2610.05582},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2610.05582},
  note = {CC BY 4.0},
}
RIS
TY  - UNPB
TI  - Countryman basis and club-isomorphisms under MA(ω_1)
AU  - Lucas Polymeris
PY  - 2026
DA  - 2026/10/04
PB  - arXiv
DO  - 10.48550/arxiv.2610.05582
UR  - https://arxiv.org/abs/2610.05582
AB  - We show that unlike textsfPFA, textsfMA_ω_1 is consistent with the existence of 2^ω_1-many Countryman lines which pairwise contain no uncountable isomorphic or reverse-isomorphic suborders. This clarifies an issue regarding the claim that textsfMA_ω_1 implies that there is a finite basis for the Countryman lines. The family of Countryman lines comes from a family of 2^ω_1-many coherent trees which pairwise contain no club-isomorphic subtrees. To prove this, we first construct such a family of trees using diamondsuit, and then we iterate ccc forcings while preserving this property.
ER  -