Skip to main content
CenXiv.org
This website is in trial operation, support us!
We gratefully acknowledge support from all contributors.
Contribute
Donate
cenxiv logo > math > arXiv:2306.00101

Help | Advanced Search

Mathematics > Logic

arXiv:2306.00101 (math)
[Submitted on 31 May 2023 (v1) , last revised 31 Aug 2024 (this version, v4)]

Title: $\widetilde{\mid}\hspace{1mm}$-divisibility of ultrafilters II: The big picture

Title: $\widetilde{\mid}\hspace{1mm}$-超滤器的可分性 II:整体图景

Authors:Boris Šobot
Abstract: A divisibility relation on ultrafilters is defined as follows: ${\cal F}\hspace{1mm}\widetilde{\mid}\hspace{1mm}{\cal G}$ if and only if every set in $\cal F$ upward closed for divisibility also belongs to $\cal G$. After describing the first $\omega$ levels of this quasiorder, in this paper we generalize the process of determining the basic divisors of an ultrafilter. First we describe these basic divisors, obtained as (equivalence classes of) powers of prime ultrafilters. Using methods of nonstandard analysis we determine the pattern of an ultrafilter: the collection of its basic divisors as well as the multiplicity of each of them. All such patterns have a certain closure property in an appropriate topology. We isolate the family of sets belonging to every ultrafilter with a given pattern. We show that every pattern with the closure property is realized by an ultrafilter. Finally, we apply patterns to obtain an equivalent condition for an ultrafilter to be self-divisible.
Abstract: 关于超滤器的整除关系定义如下:当且仅当属于 $\cal F$ 的每个向上封闭于整除性的集合也属于 $\cal G$ 时,有 ${\cal F}\hspace{1mm}\widetilde{\mid}\hspace{1mm}{\cal G}$。 在描述了这个拟序关系的前 $\omega$ 个层次之后,本文推广了确定超滤器基本整除元的过程。 首先我们描述这些基本整除元,它们被表示为(等价类中的)素超滤器的幂。 利用非标准分析的方法,我们确定了超滤器的模式:即其基本整除元的集合以及每个元的多重性。 所有这些模式在适当的拓扑中有某种闭合性质。 我们分离出属于具有给定模式的所有超滤器的集合族。 我们证明具有闭合性质的每个模式都被某个超滤器实现。 最后,我们将模式应用于得到一个超滤器为自整除的等价条件。
Subjects: Logic (math.LO)
MSC classes: 03H15, 11U10, 54D35, 54D80
Cite as: arXiv:2306.00101 [math.LO]
  (or arXiv:2306.00101v4 [math.LO] for this version)
  https://doi.org/10.48550/arXiv.2306.00101
arXiv-issued DOI via DataCite

Submission history

From: Boris Sobot [view email]
[v1] Wed, 31 May 2023 18:23:27 UTC (21 KB)
[v2] Tue, 26 Dec 2023 10:36:33 UTC (21 KB)
[v3] Sat, 22 Jun 2024 12:09:43 UTC (22 KB)
[v4] Sat, 31 Aug 2024 15:40:18 UTC (25 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled
  • View Chinese PDF
  • View PDF
  • HTML (experimental)
  • TeX Source
license icon view license
Current browse context:
math.LO
< prev   |   next >
new | recent | 2023-06
Change to browse by:
math

References & Citations

  • NASA ADS
  • Google Scholar
  • Semantic Scholar
a export BibTeX citation Loading...

BibTeX formatted citation

×
Data provided by:

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
IArxiv Recommender (What is IArxiv?)
  • Author
  • Venue
  • Institution
  • Topic

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)
  • About
  • Help
  • contact arXivClick here to contact arXiv Contact
  • subscribe to arXiv mailingsClick here to subscribe Subscribe
  • Copyright
  • Privacy Policy
  • Web Accessibility Assistance
  • arXiv Operational Status
    Get status notifications via email or slack

京ICP备2025123034号