alphaFeedback

WorksMathematics

The random graph ideal and fractional coloring

AI contributions
  • OpenAI ChatGPT
  • Anthropic Claude Opus
  • OpenAI Codex
View details

Abstract

The random graph ideal is pathological, answering a question of López-Abad et al. We prove this by constructing a positive hereditarily pathological restriction using Kneser graphs. We also prove that every FσF_\sigma ideal admitting a proper nonpathological FσF_\sigma extension has a least such extension. Moreover, for an FσF_\sigma ideal, being nonpathological, being an intersection of summable ideals, and being an intersection of matrix ideals are equivalent conditions. This answers both converses asked by Filipów and Tryba. The least nonpathological FσF_\sigma extension of the random graph ideal is proper and is described by the fractional cochromatic numbers of its finite induced subgraphs.

Introduction

Submeasure representations are a fundamental tool in the study of definable ideals on countable sets. Classical theorems of Mazur [27] and Solecki [30] provide representations by lower semicontinuous submeasures for FσF_\sigma ideals and analytic PP-ideals, respectively. These representations lead to the distinction between pathology and nonpathology, studied in particular by Farah [12]. A submeasure is nonpathological if it is a supremum of measures; an FσF_\sigma ideal is nonpathological if it admits such a representation by a nonpathological submeasure, and pathological otherwise. We recall the precise definitions in § 2.

For analytic PP-ideals, Hrušák’s measure dichotomy yields a characterization of nonpathology through the Katětov order [20 Corollary 5.6]. More recent work has focused on pathology for FσF_\sigma ideals and its connections with representations in Banach spaces [26, 24], following earlier work on representations of analytic PP-ideals [5, 4]. These results motivate the search for combinatorial criteria that distinguish pathological from nonpathological FσF_\sigma ideals.

The random graph ideal R\mathcal{R}, generated by the cliques and independent sets of the countable random graph, is a natural example in this setting. It is a tall FσF_\sigma ideal closely connected to Ramsey properties and the Katětov order [18, 20]; see also [8] for recent work on Ramsey properties of ideals. A theorem of Hrušák, Meza-Alcántara, Thümmel and Uzcátegui shows that every tall FσF_\sigma ideal has a positive restriction above R\mathcal{R} in the Katětov order [18].

López-Abad, Olmos-Prieto and Uzcátegui-Aylwin asked whether R\mathcal{R} is pathological [24 Question 5.19]. We answer this question affirmatively by constructing a positive hereditarily pathological restriction: every further positive restriction of this witness is pathological. Together with a positive restriction isomorphic to the nonpathological ideal EDfin\mathcal{E}\mathcal{D}_{\mathrm{fin}}, this gives the two local behaviors of Corollary 3.9.

The pathological witness is an induced disjoint union of finite Kneser graphs. Their unbounded chromatic numbers and independent star covers of uniformly positive density satisfy the block criterion of Martínez, Meza-Alcántara and Uzcátegui [26 Theorem 3.8], which also applies on every positive restriction of the witness. For the nonpathological restriction, universality gives an induced copy of a disjoint union of finite complete graphs of increasing sizes, whose homogeneous-set ideal is isomorphic to EDfin\mathcal{E}\mathcal{D}_{\mathrm{fin}} [26 Examples 3.5 and 4.5]. Proposition 3.10 also shows that a positive hereditarily pathological restriction of R\mathcal{R} lies above Solecki’s ideal in the Katětov order, connecting the Kneser construction with the ideal appearing in Hrušák’s measure dichotomy.

We use covering representations to prove in Theorem 4.7 that every FσF_\sigma ideal admitting a proper nonpathological FσF_\sigma extension has a least such extension.

To describe the construction, let I\mathcal{I} be a proper FσF_\sigma ideal on VV. Choose a compact hereditary family C⊆2V\mathcal{C} \subseteq2^V containing the singletons and generating I\mathcal{I}; such a family exists for every FσF_\sigma ideal. Write φC(A)\varphi_{\mathcal{C}}(A) for the least number of members of C\mathcal{C} covering AA, with value ∞\infty when no finite cover exists. The nonpathological envelope φ^C\widehat{\varphi}_{\mathcal{C}} is the supremum of all measures dominated by φC\varphi_{\mathcal{C}}. Then

JI=FIN⁡(φ^C)\mathcal{J}_{\mathcal{I}}=\operatorname{FIN}(\widehat{\varphi}_{\mathcal{C}})

is the least nonpathological FσF_\sigma extension of I\mathcal{I} when a proper such extension exists, and equals P(V)\mathcal{P}(V) otherwise. In particular, JI\mathcal{J}_{\mathcal{I}} depends only on I\mathcal{I}, not on the choice of C\mathcal{C}.

To prove that this extension is the least one, we compare the covering envelope with any nonpathological representation of an extension of I\mathcal{I}. If φ^C(A)<∞\widehat{\varphi}_{\mathcal{C}}(A)<\infty, classical finite covering duality [9 Theorem 2.1] and compactness give a probability on the generators contained in AA such that every vertex of AA is covered with a uniformly positive probability. This covering bound shows that every nonpathological lower semicontinuous submeasure that is finite on the generators is also finite on AA.

Filipów and Tryba [14 Theorem 11.2] and, independently, Figueroa-Sierra and Hrušák [13 Corollary 6.1.2] proved that every nonpathological FσF_\sigma ideal is an intersection of summable ideals. Combining this representation with the least-extension theorem, we identify JI\mathcal{J}_{\mathcal{I}} with the intersection of all proper summable extensions of I\mathcal{I}. Corollary 4.10 also identifies it with the intersection of all matrix ideals containing I\mathcal{I}. Consequently, for an FσF_\sigma ideal, being nonpathological, being an intersection of summable ideals, and being an intersection of matrix ideals are equivalent conditions. This answers both converses in [14 Question 11.6].

Corollary 4.11 shows that every nonpathological analytic PP-ideal containing I\mathcal{I} also contains JI\mathcal{J}_{\mathcal{I}}. In particular, every FσF_\sigma ideal representable by unconditional convergence in a Banach space is also representable by bounded finite subsums, answering [24 Question 2.4].

For a countable graph HH, the covering submeasure associated with the family of independent sets is φχ(A)=χ(H[A])\varphi_{\chi}(A)=\chi(H[A]). Define the fractional submeasure by

φχf(A)=sup⁡{χf(H[F])∣F⊆A finite}.\varphi_{\chi_f}(A)=\sup\{\chi_f(H[F])\mid F\subseteq A\text{ finite}\}.

Finite covering duality gives φ^χ=φχf\widehat{\varphi}_{\chi}=\varphi_{\chi_f}, as we show in Theorem 5.3.2

If HH has no infinite clique, independent sets generate its homogeneous-set ideal IH\mathcal{I}_H. Assuming that IH\mathcal{I}_H is proper, Theorem 5.5 shows that it is nonpathological if and only if, for every C>0C > 0, the chromatic numbers χ(H[F])\chi(H[F]) are bounded as FF ranges over the finite vertex sets satisfying χf(H[F])≤C\chi_f(H[F]) \le C. For a disjoint union of finite graphs, this bound must hold uniformly over the induced subgraphs of all blocks. The criterion gives partial answers to [24 Questions 5.21 and 5.22] for graphs with no infinite clique.

The proof adapts the extraction argument in [17 proof of Theorem 17]. If the condition fails, it produces a positive set whose induced graph is a disjoint union of finite graphs with unbounded chromatic numbers and uniformly bounded fractional chromatic numbers. The restriction to this set is hereditarily pathological.

The least-extension theorem also describes super-pathology, the property of admitting no proper nonpathological FσF_\sigma extension. In Theorem 8.4, we prove that JI\mathcal{J}_I consists exactly of the members of II together with the positive sets AA for which I↾AI \mathbin{\upharpoonright} A is super-pathological. In particular, every pathological FσF_\sigma ideal has a positive super-pathological restriction. For a graph HH with no infinite clique and A∈IH+A \in I_H^+, the restriction IH↾A\mathcal{I}_H \mathbin{\upharpoonright} A is super-pathological exactly when φχf(A)<∞\varphi_{\chi_f}(A) < \infty.

For R\mathcal{R}, the general construction uses covers by both cliques and independent sets. Theorem 6.5 shows that its least nonpathological FσF_\sigma extension is proper and is computed by the fractional cochromatic numbers of finite induced subgraphs of R\mathcal{R}. Thus, R\mathcal{R} is not super-pathological, whereas its Kneser restriction is.

For d≥3d \ge3, pathology of the random dd-uniform hypergraph ideal Rd\mathcal{R}_d and the existence of positive hereditarily pathological restrictions already follow from the constructions in [24 Theorem 5.14 and Corollary 5.15]. We recover these conclusions from the graph case: in Theorem 7.4, we use a standard extension of graph colorings to obtain a positive restriction of Rd\mathcal{R}_d isomorphic to R\mathcal{R} for every d≥2d \ge2. This also transfers the positive nonpathological restriction isomorphic to EDfin\mathcal{ED}_{\mathrm{fin}}. Comparing the homogeneous-cover submeasures and their envelopes, we show that the least nonpathological FσF_\sigma extension of Rd\mathcal{R}_d is proper.

Finally, for every d≥3d \ge3 and n≥d+1n \ge d + 1, the homogeneous-set ideal of the universal Kn(d)K_n^{(d)}-free hypergraph is pathological but not super-pathological. Remark 8.13 explains why the super-pathology assertion in [24 Corollary 5.18] does not follow from the positive restrictions constructed there.

§ 2 fixes the notation and recalls the submeasure framework. § 3 proves pathology of R\mathcal{R} and describes its two local behaviors. § 4 proves the least-extension theorem and studies summable, matrix and nonpathological analytic PP-ideal extensions. § 5 proves the chromatic criterion for graphs with no infinite clique and derives the corresponding block criteria. § 6 describes the least extension of R\mathcal{R}, applies Prömel–Rödl universality to Erdős sequences, and relates the envelope to Kelley covering densities. § 7 transfers the random-graph results to uniform hypergraphs. § 8 describes super-pathological restrictions, gives the block classification, and treats universal hypergraphs with a finite complete hypergraph forbidden.

Preliminaries

Let ω={0,1,…}\omega= \{0,1,\ldots\}, with each natural number identified with the set of its predecessors. For a set XX and k∈ωk \in\omega, write [X]k[X]^k for the family of subsets of XX of cardinality kk. All underlying sets are countably infinite unless stated otherwise. An ideal I\mathcal{I} on XX is closed under subsets and finite unions, contains all finite subsets of XX, and is proper, i.e., X∉IX \notin\mathcal{I}. For an ideal I\mathcal{I} on XX, put I+=P(X)∖I\mathcal{I}^{+} = \mathcal{P}(X) \setminus\mathcal{I} and I↾Y=I∩P(Y)\mathcal{I} \mathord{\upharpoonright} Y = \mathcal{I} \cap\mathcal{P}(Y). This restriction is proper precisely when Y∈I+Y \in\mathcal{I}^{+}. We identify P(X)\mathcal{P}(X) with 2X2^{X} via characteristic functions and equip it with the product topology. An ideal on XX is FσF_{\sigma} if it is a countable union of closed sets in this topology, and is tall if every infinite subset of XX contains an infinite member of the ideal. All notions are invariant under bijections of the underlying sets.

A lower semicontinuous submeasure (lscsm) on XX is a map φ:P(X)→[0,∞]\varphi: \mathcal{P}(X) \to[0,\infty] satisfying φ(∅)=0\varphi(\varnothing) = 0, monotonicity, subadditivity, φ({x})<∞\varphi(\{x\}) < \infty for x∈Xx \in X, and

φ(A)=sup⁡{φ(F)∣F⊆A finite}.\varphi(A) = \sup\{\varphi(F) \mid F \subseteq A\text{ finite}\}.

Write FIN⁡(φ)={A⊆X∣φ(A)<∞}\operatorname{FIN}(\varphi) = \{A \subseteq X \mid\varphi(A) < \infty\}. The proper ideals of this form are exactly the FσF_{\sigma} ideals, by Mazur’s theorem [27]; see also [19], Theorem 1.5.

A measure means a countably additive function μ(A)=∑x∈Am(x)\mu(A) = \sum_{x\in A}m(x), where m:X→[0,∞)m : X \to[0,\infty) is finite at each point. For submeasures write ψ≤φ\psi\leq\varphi for pointwise domination and let M(X,φ)\mathcal{M}(X,\varphi) be the measures dominated by φ\varphi. The submeasure φ\varphi is nonpathological if

φ(A)=sup⁡μ∈M(X,φ)μ(A)(A⊆X).\varphi(A) = \sup_{\mu\in\mathcal{M}(X,\varphi)}\mu(A) \qquad(A \subseteq X).

This follows the countably additive convention of [26 §3]; for lsc submeasures it is equivalent to Farah's notion [12 p. 21], by [14 Proposition 4.1(7a)]. For FσF_{\sigma} ideals we use [26 Definition 3.1]: I\mathcal{I} is nonpathological if I=FIN⁡(φ)\mathcal{I} = \operatorname{FIN}(\varphi) for some nonpathological lscsm, and pathological otherwise. The ideal-level definition concerns all representations, not just a chosen submeasure. An FσF_{\sigma} ideal is hereditarily pathological if I↾Y\mathcal{I} \mathord{\upharpoonright} Y is pathological for every Y∈I+Y \in\mathcal{I}^{+}.

Fact 2.1 (Restriction). Restrictions of nonpathological submeasures are nonpathological. Consequently, every positive restriction of a nonpathological FσF_{\sigma} ideal is nonpathological. Equivalently, an FσF_{\sigma} ideal with a pathological positive restriction is pathological.

Indeed, if I=FIN⁡(φ)\mathcal{I} = \operatorname{FIN}(\varphi) with φ\varphi nonpathological, then I↾Y=FIN⁡(φ↾P(Y))\mathcal{I} \mathord{\upharpoonright} Y = \operatorname{FIN}(\varphi\mathord{\upharpoonright} \mathcal{P}(Y)), and positivity makes this ideal proper. The last assertion follows by contraposition.

For a graph H=(V,E)H = (V,E) and A⊆VA \subseteq V, write H[A]=(A,E∩[A]2)H[A] = (A, E \cap[A]^2) for the subgraph induced by AA. A set is homogeneous if it is a clique or an independent set. Write H(H)\mathcal{H}(H) for this family and ⟨H(H)⟩\langle\mathcal{H}(H)\rangle for the sets covered by finitely many members of it.

The chromatic number χ(H)\chi(H) is the least number of independent sets covering VV, with χ(∅)=0\chi(\varnothing) = 0 and value ∞\infty when no finite independent cover exists. A proper coloring with mm colors is a map c:V→mc : V \to m whose fibers are independent. Since every finite independent cover can be refined to a partition, χ(H)\chi(H) is equivalently the least number of colors in a proper coloring.

The random graph ideal: pathology and local extremes

The random graph R=(ω,E)R = (\omega,E) is the unique countable graph with the extension property: for disjoint finite a,b⊆ωa,b \subseteq\omega, some vertex outside a∪ba \cup b is adjacent to every point of aa and none of bb. Every countable graph occurs as an induced subgraph [7 Proposition 4.1]. Its homogeneous-set ideal R=⟨H(R)⟩\mathcal{R} = \langle\mathcal{H}(R) \rangle is proper, tall and FσF_{\sigma} [20 p. 834]. For an induced copy H=R[X]H = R[X], hereditary closure of homogeneity gives

R↾X=⟨H(H)⟩(1)\mathcal{R} \mathbin{\upharpoonright} X = \langle\mathcal{H}(H) \rangle \tag*{(1)}

one restricts a finite homogeneous cover to XX, and conversely every homogeneous subset of HH is homogeneous in RR.

References

  1. [1]Noga Alon, Lech Drewnowski, and Tomasz Łuczak, Stable Kneser hypergraphs and ideals in ℕ with the Nikodým property, Proc. Amer. Math. Soc. 137 (2009), no. 2, 467–471. MR 2448565DOI
  2. [2]Noga Alon and Joel H. Spencer, The probabilistic method, fourth ed., Wiley Series in Discrete Mathematics and Optimization, John Wiley & Sons, Inc., Hoboken, NJ, 2016. MR 3524748
  3. [3]Konstantinos A. Beros, Universal subgroups of Polish groups, J. Symb. Log. 79 (2014), no. 4, 1148–1183. MR 3343534arxiv.org/abs/1209.3497
  4. [4]Piotr Borodulin-Nadzieja and Barnabás Farkas, Analytic P-ideals and Banach spaces, J. Funct. Anal. 279 (2020), no. 8, 108702, 31. MR 4124855
  5. [5]Piotr Borodulin-Nadzieja, Barnabás Farkas, and Gregorz Plebanek, Representations of ideals in Polish groups and in Banach spaces, J. Symb. Log. 80 (2015), no. 4, 1268–1289. MR 3436368
  6. [6]Vasco Brattka and Tahina Rakotoniaina, On the uniform computational content of Ramsey’s theorem, J. Symb. Log. 82 (2017), no. 4, 1278–1316. MR 3743611DOI
  7. [7]Peter J. Cameron, The random graph, The mathematics of Paul Erdős, II, Algorithms Combin., vol. 14, Springer, Berlin, 1997, pp. 333–351. MR 1425227
  8. [8]Julián C. Cano, Carlos A. Di Prisco, and Carlos Uzcátegui-Aylwin, Combinatorics of Ramsey ideals, 2026, Preprint, arXiv:2606.25477v1.arxiv.org/abs/2606.25477
  9. [9]F. H. Clarke and R. E. Jamison, Multicolorings, measures and games on graphs, Discrete Math. 14 (1976), no. 3, 241–245. MR 389641DOI
  10. [10]N. G. de Bruijn and P. Erdős, A colour problem for infinite graphs and a problem in the theory of relations, Nederl. Akad. Wetensch. Proc. Ser. A 54 (1951), no. 5, 371–373.
  11. [11]P. Erdős, Some remarks on the theory of graphs, Bull. Amer. Math. Soc. 53 (1947), 292–294. MR 19911DOI
  12. [12]Ilijas Farah, Analytic quotients: theory of liftings for quotients over analytic ideals on the integers, Mem. Amer. Math. Soc. 148 (2000), no. 702, xvi+177. MR 1711328DOI
  13. [13]Raúl Figueroa-Sierra, Combinatorics of ideals on ω: the Category Dichotomy and the Measure Dichotomy, Ph.D. thesis, Universidad de los Andes, Bogotá, 2025.
  14. [14]Rafał Filipów and Jacek Tryba, Path of pathology, 2025, Preprint, arXiv:2501.00503v1; version dated January 3, 2025.arxiv.org/abs/2501.00503
  15. [15]Fred Galvin and Karel Prikry, On Kelley’s intersection numbers, Proc. Amer. Math. Soc. 129 (2001), no. 2, 315–323. MR 1707516DOI
  16. [16]John Gimbel, André Kündgen, and Michael Molloy, Fractional coloring of graphs, Graphs Combin. 38 (2022), no. 3, Paper No. 64, 11. MR 4393989
  17. [17]António Girão, Freddie Illingworth, Emil P owierski, Michael Savery, Alex Scott, Youri Tamitegama, and Jane Tan, Induced subgraphs of induced subgraphs of large chromatic number, Combinatorica 44 (2024), 37–62.arxiv.org/abs/2203.03612
  18. [18]M. Hrušák, D. Meza-Alcántara, E. Thümmel, and C. Uz cátegui, Ramsey type properties of ideals, Ann. Pure Appl. Logic 168 (2017), no. 11, 2022–2049. MR 3692233DOI
  19. [19]Michael Hrušák, Combinatorics of filters and ideals, Set theory and its applications, Contemp. Math., vol. 533, Amer. Math. Soc., Providence, RI, 2011, pp. 29–69. MR 2777744DOI
  20. [20]Michael Hrušák, Katětov order on Borel ideals, Arch. Math. Logic 56 (2017), no. 7-8, 831–847. MR 3696069DOI
  21. [21]Michael Hrušák and David Meza-Alcántara, Katětov order, Fubini property and Hausdorff ultrafilters, Rend. Istit. Mat. Univ. Trieste 44 (2012), 503–511. MR 3019575
  22. [22]Alexander S. Kechris, Classical descriptive set theory, Graduate Texts in Mathematics, vol. 156, Springer-Verlag, New York, 1995. MR 1321597DOI
  23. [23]J. L. Kelley, Measures on Boolean algebras, Pacific J. Math. 9 (1959), 1165–1177. MR 108570DOI
  24. [24]Jordi López-Abad, Víctor Olmos-Prieto, and Carlos Uz cátegui-Aylwin, Fσ-ideals, colorings, and representation in Banach spaces, Preprint, arXiv:2501.15643v1, 2025.
  25. [25]L. Lovász, Kneser’s conjecture, chromatic number, and homotopy, J. Combin. Theory Ser. A 25 (1978), no. 3, 319–324. MR 514625DOI
  26. [26]Jorge Martínez, David Meza-Alcántara, and Carlos Uz cátegui, Pathology of submeasures and Fσ ideals, Arch. Math. Logic 63 (2024), no. 7-8, 941–967. MR 4797308arxiv.org/abs/2211.01544
  27. [27]Krzysztof Mazur, Fσ-ideals and ωω1*-gaps in the Boolean algebras P(ω)/I, Fund. Math. 138 (1991), no. 2, 103–111. MR 1124539
  28. [28]Hans Jürgen Prömel and Voitěch Rödl, Non-Ramsey graphs are clog n-universal, J. Combin. Theory Ser. A 88 (1999), no. 2, 379–384.DOI
  29. [29]Edward R. Scheinerman and Daniel H. Ullman, Fractional graph theory, Wiley-Interscience Series in Discrete Mathematics and Optimization, John Wiley & Sons, Inc., New York, 1997, A rational approach to the theory of graphs, With a foreword by Claude Berge, A Wiley-Interscience Publication. Locators refer to the authors' electronic edition (2008). MR 1481157
  30. [30]Sławomir Solecki, Analytic ideals and their applications, Ann. Pure Appl. Logic 99 (1999), no. 1-3, 51–72. MR 1708146DOI
  31. [31]Simon Thomas, Reducts of random hypergraphs, Ann. Pure Appl. Logic 80 (1996), no. 2, 165–193. MR 1402977DOI

Paper details

vlnc:W_a57k4ur9
v1 · latestHistory (1)

published · Fresh — added to the Hub within the last 30 days

added ·

Usage

views · 0

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

CC BY 4.0

Original source

  • Mathematics

OpenAI ChatGPT, Anthropic Claude Opus, OpenAI Codex · View statement →

Looking for related papers…
Contents