Open AccessDivisibility in beta N and *N
Author(s) -
Boris Šobot
Publication year - 2019
Publication title -
reports on mathematical logic
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.101
H-Index - 6
eISSN - 2084-2589
pISSN - 0137-2904
DOI - 10.4467/20842589rm.19.003.10651
Subject(s) - divisibility rule , mathematics , compactification (mathematics) , infinite divisibility , pure mathematics , extension (predicate logic) , discrete mathematics , computer science , programming language
The paper first covers several properties of the extension of the divisibility relation to a set *N of nonstandard integers, including an analogue of the basic theorem of arithmetic. After that, a connection is established with the divisibility in the Stone–Čech compactification βN, proving that the divisibility of ultrafilters introduced by the author is equivalent to divisibility of some elements belonging to their respective monads in an enlargement. Some earlier results on ultrafilters on lower levels on the divisibility hierarchy are illuminated by nonstandard methods. Using limits by ultrafilters we obtain results on ultrafilters above these finite levels, showing that for them a distribution by levels is not possible.