Choosing between incompatible ideals

DOI10.1016/J.EJC.2021.103349MaRDI QIDQ2033891zbMATH OpenOpenAlexFDO

Authors W. R. Brian, Paul Larson

Publication date 18 June 2021

Published in European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1908.10914

zbMATH Keywords

conditionally convergent seriesRamsey-theoretic problem

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Extremal set theory (05D05) Ramsey theory (05D10)

Abstract: Suppose $mathcalI$ and $mathcalJ$ are proper ideals on some set $X$. We say that $mathcalI$ and $mathcalJ$ are incompatible if $mathcalIcupmathcalJ$ does not generate a proper ideal. Equivalently, $mathcalI$ and $mathcalJ$ are incompatible if there is some $AsubseteqX$ such that $AinmathcalI$ and $XsetminusAinmathcalJ$. If some $BsubseteqX$ is either in $mathcalIsetminusmathcalJ$ or in $mathcalJsetminusmathcalI$, then we say that $B$ chooses between $mathcalI$ and $mathcalJ$. We consider the following Ramsey-theoretic problem: Given several pairs $(mathcal{I}_1,mathcal{J}_1),(mathcal{I}_2,mathcal{J}_2),dots,(mathcal{I}_k,mathcal{J}_k)$ of incompatible ideals on a set $X$, find some $AsubseteqX$ that chooses between as many of these pairs of ideals as possible. The main theorem is that for every $ninmathbbN$, there is some $I(n)inmathbbN$ such that given at least $I(n)$ pairs of incompatible ideals on any set $X$, there is some $AsubseteqX$ choosing between at least $n$ of them. This theorem is proved in two main steps. The first step is to identify a (purely finitary) problem in extremal combinatorics, and to show that our problem concerning ideals is equivalent to this combinatorial problem. The second step is to analyze the combinatorial problem in order to show that the number $I(n)$ described above exists, and to put bounds on it. We show $extstylefrac12nlo{g}_{2}n-O(n),<,I(n),<,nlnn+O(n).$ The upper bound is proved by considering a different but closely related combinatorial problem involving hypergraphs, which may be of independent interest. We also investigate some applications of this theorem to a problem concerning conditionally convergent series.

Recommendations

• Combinatorics of ideals -- selectivity versus density.
• Ideal version of Ramsey's theorem.
• Semiselective coideals
• Changes of signs in conditionally convergent series on a small set
• Ramsey type properties of ideals

Cites work

• A combinatorial problem; stability and order for models and theories in infinitary languages
• Combinatorial Cardinal Characteristics of the Continuum
• scientific article; zbMATH DE number 42114 (Why is no real title available?)
• scientific article; zbMATH DE number 718142 (Why is no real title available?)
• scientific article; zbMATH DE number 1950483 (Why is no real title available?)
• scientific article; zbMATH DE number 797421 (Why is no real title available?)
• scientific article; zbMATH DE number 894522 (Why is no real title available?)
• scientific article; zbMATH DE number 917843 (Why is no real title available?)
• Intersection Theorems for Systems of Sets
• On the density of families of sets
• The subseries number
• Three conditionally convergent series, but not four

Cited in

(2)

• Choosing a sheltered middle path
• Unboring ideals

Describes a project that uses

Uses Software

• MathOverflow

This page was built for publication: Choosing between incompatible ideals

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2033891)