On rapid idempotent ultrafilters

被引:0
|
作者
Peter Krautzberger
机构
[1] American Mathematical Society,
来源
Semigroup Forum | 2014年 / 89卷
关键词
Set theory; Infinite combinatorics; Ultrafilter; Idempotent ultrafilter; Rapid ultrafilter; Strongly summable ultrafilter;
D O I
暂无
中图分类号
学科分类号
摘要
This short note contains the proofs of two small but somewhat surprising results about ultrafilters on N\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathbb {N}$$\end{document}: (1) strongly summable ultrafilters are rapid, (2) every rapid ultrafilter induces a closed left ideal of rapid ultrafilters. As a consequence, there will be rapid minimal idempotents in all models of set theory with rapid ultrafilters. The history of this result has been published as an experiment in mathematical writing on the author’s website (Krautzberger, One Day in Colorado or Strongly Summable Ultrafilters are Rapid, 2012) and (Krautzberger, Rapid Idempotent Ultrafilters, 2012) where you can can also find additional remarks by Blass and Hindman, offering a form of peer-review.
引用
收藏
页码:692 / 696
页数:4
相关论文
共 50 条