pith. sign in

arxiv: 2605.14072 · v1 · pith:ZNM6C4B7new · submitted 2026-05-13 · 🧮 math.FA · math.CO· math.LO

Geometric duality, perfect graphs, and the Sierpi\'nski space

Piotr Borodulin-Nadzieja , Barnab\'as Farkas , Anna Pelczar-Barwacz This is my paper

Pith reviewed 2026-05-15 02:13 UTC · model grok-4.3

classification 🧮 math.FA math.COmath.LO
keywords perfect graphscombinatorial Banach spacesduality phenomenonSierpiński graphcliques and anti-cliquesLovász theoremstopping time spacesequence space embeddings
0
0 comments X

The pith

Duality between combinatorial Banach spaces holds precisely when the families are finite cliques and anti-cliques of a perfect graph on the naturals.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper fully characterizes the pairs of families of finite sets (F0, F1) that produce the duality phenomenon between the associated combinatorial Banach spaces. The duality occurs exactly when there is a perfect graph G on the natural numbers with F0 consisting of all finite cliques of G and F1 consisting of all finite anti-cliques of G. A reader would care because this equivalence directly connects a graph-theoretic property to the geometry of the generated spaces and immediately yields Lovász' perfect graph theorem as a corollary. The authors further examine concrete cases, such as the Sierpiński graph, and show how to embed spaces including the Schreier space and ell_p spaces into the resulting Banach space.

Core claim

The duality phenomenon between the combinatorial Banach spaces generated by families F0 and F1 of finite sets holds if and only if there exists a perfect graph G on NN such that F0 consists of all finite cliques of G and F1 consists of all finite anti-cliques of G.

What carries the argument

A perfect graph G on the natural numbers, with F0 the collection of its finite cliques and F1 the collection of its finite anti-cliques, which carries the geometric duality between the two spaces.

Load-bearing premise

The precise definition of the duality phenomenon is the one introduced in the Bang-Odell paper on the stopping time Banach space.

What would settle it

A concrete pair of families F0 and F1 of finite sets that satisfy the duality but cannot be realized as the finite cliques and anti-cliques of any perfect graph on the natural numbers.

read the original abstract

In their classical paper \emph{On the stopping time Banach space}, Bang and Odell, among a plethora of results concerning the dyadic stopping time space and its dual, presented the first non-trivial example of the \emph{duality phenomenon} between combinatorial Banach spaces. We give a full characterization of such pairs $(\mc{F}_0, \mc{F}_1)$ of families of finite sets: This duality holds iff there is a perfect graph $G$ on $\NN$ such that $\mc{F}_0$ consists of all finite cliques of $G$ and $\mc{F}_1$ consists of all finite anti-cliques of $G$. As it turns out, Lov\'asz' famous perfect graph theorem is an immediate corollary of this result. Among the many examples of such pairs of families, we investigate a particularly interesting one, when $G$ is the Sierpi\'nski graph, and study general methods of embedding combinatorial and classical sequence spaces in the generated space, including the Schreier and $\ell_p$ spaces.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

2 major / 2 minor

Summary. The paper claims a full characterization of pairs (F0, F1) of families of finite sets that exhibit the Bang-Odell duality phenomenon between the associated combinatorial Banach spaces: this holds if and only if there exists a perfect graph G on the natural numbers such that F0 consists of all finite cliques of G and F1 consists of all finite anti-cliques of G. Lovász' perfect graph theorem is recovered as an immediate corollary. The manuscript further examines the Sierpiński graph as a concrete example and develops methods for embedding combinatorial and classical sequence spaces (including Schreier and ℓ_p spaces) into the generated Banach space.

Significance. If the characterization is correct, the result forges a direct link between the geometric duality properties of combinatorial Banach spaces and the structure of perfect graphs, with the recovery of Lovász' theorem as a corollary underscoring its depth. The detailed treatment of the Sierpiński graph and the embedding techniques supply concrete, usable examples that could support further work on sequence spaces and their duals.

major comments (2)
  1. [section deriving the corollary to Lovász' theorem] The derivation of Lovász' theorem as an immediate corollary assumes duality(F0, F1) holds if and only if duality(F1, F0) holds. The stated characterization equates the phenomenon precisely with the pair (finite cliques of G, finite anti-cliques of G) for perfect G; since anti-cliques of G are cliques of the complement graph, an explicit argument is required to confirm that the geometric duality (norms or basis properties) is symmetric under this swap. This verification is not supplied by the characterization alone and is load-bearing for the corollary.
  2. [§§3-4] The precise definition of the duality phenomenon is imported from Bang-Odell and applied to the combinatorial spaces generated by F0 and F1. The characterization in §§3-4 must explicitly verify that the Banach-space duality properties (e.g., basis behavior or norm relations) hold exactly when the families are cliques and anti-cliques of a perfect graph; without this link, the 'only if' direction rests on an unexamined assumption about the definition.
minor comments (2)
  1. [Abstract] The abstract refers to 'a plethora of results' from Bang-Odell; specifying which results on the stopping-time space are used to define the duality phenomenon would improve clarity.
  2. [Notation and definitions] Notation for the families F0 and F1 should be introduced with explicit reference to the underlying set NN and checked for consistency when the Sierpiński graph is introduced.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the thorough review and valuable feedback on our manuscript. The points raised regarding the symmetry for the Lovász corollary and the explicit verification of the characterization are well-taken. We will revise the paper accordingly to strengthen these aspects.

read point-by-point responses

  1. Referee: The derivation of Lovász' theorem as an immediate corollary assumes duality(F0, F1) holds if and only if duality(F1, F0) holds. The stated characterization equates the phenomenon precisely with the pair (finite cliques of G, finite anti-cliques of G) for perfect G; since anti-cliques of G are cliques of the complement graph, an explicit argument is required to confirm that the geometric duality (norms or basis properties) is symmetric under this swap. This verification is not supplied by the characterization alone and is load-bearing for the corollary.

    Authors: We concur that the symmetry of the duality phenomenon under interchange of F0 and F1 must be established explicitly to support the corollary. Although the definition from Bang-Odell is symmetric, we will add a dedicated paragraph or lemma in the revised manuscript demonstrating that the geometric properties (such as the equivalence of norms or basis behaviors) are preserved under this swap. This will allow the characterization to directly imply that the complement graph is also perfect, thereby recovering Lovász' theorem without additional assumptions. revision: yes

  2. Referee: The precise definition of the duality phenomenon is imported from Bang-Odell and applied to the combinatorial spaces generated by F0 and F1. The characterization in §§3-4 must explicitly verify that the Banach-space duality properties (e.g., basis behavior or norm relations) hold exactly when the families are cliques and anti-cliques of a perfect graph; without this link, the 'only if' direction rests on an unexamined assumption about the definition.

    Authors: We appreciate this observation and agree that the 'only if' direction benefits from more explicit connections. In the revision of §§3-4, we will include additional details showing precisely how the duality conditions on the Banach spaces translate to the combinatorial requirements on F0 and F1 being cliques and anti-cliques, and why perfection of the graph is necessary. This will eliminate any potential ambiguity in the application of the imported definition. revision: yes

Circularity Check

0 steps flagged

Characterization independent of Lovász theorem; theorem recovered as corollary

full rationale

The paper derives its central iff characterization of the Bang-Odell duality phenomenon directly from the external definition of that phenomenon (cited from Bang-Odell) together with combinatorial arguments on families of finite sets. The perfect-graph theorem is explicitly recovered afterward as an immediate corollary rather than used as an input. No self-definitional reduction, fitted-input prediction, or load-bearing self-citation chain appears in the derivation; the symmetry under complement follows from the stated characterization once proved. This is the normal non-circular case.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

The central claim rests on the definition of the duality phenomenon taken from Bang and Odell together with the standard definition of perfect graphs; no free parameters or invented entities are introduced in the abstract.

axioms (1)
  • domain assumption Definition of the duality phenomenon between combinatorial Banach spaces as given in Bang and Odell
    The paper takes this definition as the starting point for the characterization.

pith-pipeline@v0.9.0 · 5500 in / 1257 out tokens · 49774 ms · 2026-05-15T02:13:38.931996+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

27 extracted references · 27 canonical work pages

  1. [1]

    D. E. ALSPACH ANDS. ARGYROS,Complexity of weakly null sequences, vol. 321 of Dissertationes Math. (Rozprawy Mat.), 1992

    work page 1992

  2. [2]

    APATSIDIS,Operators on the stopping time space, Studia Math., 228 (2015), pp

    D. APATSIDIS,Operators on the stopping time space, Studia Math., 228 (2015), pp. 235–258

    work page 2015

  3. [3]

    K. A. BAKER, P. FISHBURN,ANDF. S. ROBERTS,Partial orders of dimension2, Networks, 2 (1972), pp. 11–28

    work page 1972

  4. [4]

    BANG ANDE

    H. BANG ANDE. ODELL,On the stopping time Banach space, Quart. J. Math. Oxford Ser. (2), 40 (1989), pp. 257–273

    work page 1989

  5. [5]

    BEANLAND, N

    K. BEANLAND, N. DUNCAN, M. HOLT,ANDJ. QUIGLEY,Extreme points for combinatorial Banach spaces, Glasg. Math. J., 61 (2019), pp. 487–500

    work page 2019

  6. [6]

    BESSAGA ANDA

    C. BESSAGA ANDA. PEŁ CZY ´NSKI,On bases and unconditional convergence of series in Banach spaces, Studia Math., 17 (1958), pp. 151–164

    work page 1958

  7. [7]

    BORODULIN-NADZIEJA ANDB

    P. BORODULIN-NADZIEJA ANDB. FARKAS,Analytic P-ideals and Banach spaces, Journal of Func- tional Analysis, 279 (2020)

    work page 2020

  8. [8]

    BORODULIN-NADZIEJA, B

    P. BORODULIN-NADZIEJA, B. FARKAS, S. JACHIMEK,ANDA. PELCZAR-BARWACZ,The Zoo of combinatorial banach spaces, Studia Math., 282 (2025), pp. 101–132

    work page 2025

  9. [9]

    BRECH, V

    C. BRECH, V. FERENCZI,ANDA. TCACIUC,Isometries of combinatorial Banach spaces, Proc. Amer. Math. Soc., 148 (2020), pp. 4845–4854

    work page 2020

  10. [10]

    BRECH ANDC

    C. BRECH ANDC. P.NA,Banach-Stone-like results for combinatorial Banach spaces, Ann. Pure Appl. Logic, 172 (2021), p. 102989

    work page 2021

  11. [11]

    J. M. F. CASTILLO ANDM. GONZÁLEZ,An approach to Schreier’s space, Extracta Math., 6 (1991), pp. 166–169

    work page 1991

  12. [12]

    R. M. CAUSEY,Concerning the szlenk index, Studia Math., 236 (2017), pp. 201–244

    work page 2017

  13. [13]

    CHUDNOVSKY, N

    M. CHUDNOVSKY, N. ROBERTSON, P. SEYMOUR,ANDR. THOMAS,The strong perfect graph theo- rem, Ann. of Math. (2), 164 (2006), pp. 51–229

    work page 2006

  14. [14]

    CHVÁTAL,On certain polytopes associated with graphs, J

    V. CHVÁTAL,On certain polytopes associated with graphs, J. Combinatorial Theory Ser. B, 18 (1975), pp. 138–154

    work page 1975

  15. [15]

    D. R. FULKERSON,On the perfect graph theorem, in Mathematical programming (Proc. Advanced Sem., Univ. Wisconsin, Madison, Wis., 1972), Academic Press, New York-London, 1973, pp. 69– 76

    work page 1972

  16. [16]

    GASPARIS ANDD

    I. GASPARIS ANDD. H. LEUNG,On the complemented subspaces of the Schreier spaces, Studia Math., 141 (2000), pp. 273–300

    work page 2000

  17. [17]

    HOUGARDY,Classes of perfect graphs, Discrete Mathematics, 306 (2006), pp

    S. HOUGARDY,Classes of perfect graphs, Discrete Mathematics, 306 (2006), pp. 2529–2571. Creation and Recreation: A Tribute to the Memory of Claude Berge

    work page 2006

  18. [18]

    JACHIMEK,Combinatorial Banach spaces, Ph.D

    S. JACHIMEK,Combinatorial Banach spaces, Ph.D. thesis, University of Wrocław (2025)

    work page 2025

  19. [19]

    LOPEZ-ABAD ANDS

    J. LOPEZ-ABAD ANDS. TODORCEVIC,Pre-compact families of finite sets of integers and weakly null sequences in Banach spaces, Topology Appl., 156 (2009), pp. 1396–1411

    work page 2009

  20. [20]

    LOVÁSZ,A characterization of perfect graphs, J

    L. LOVÁSZ,A characterization of perfect graphs, J. Combinatorial Theory Ser. B, 13 (1972), pp. 95–98

    work page 1972

  21. [21]

    ,Normal hypergraphs and the perfect graph conjecture, Discrete Math., 2 (1972), pp. 253–267

    work page 1972

  22. [22]

    MALIGRANDA,Orlicz spaces and interpolation, vol

    L. MALIGRANDA,Orlicz spaces and interpolation, vol. 5 of Seminários de Matemática [Seminars in Mathematics], Universidade Estadual de Campinas, Departamento de Matemática, Campinas, 1989

    work page 1989

  23. [23]

    MUSIELAK,Orlicz spaces and modular spaces, vol

    J. MUSIELAK,Orlicz spaces and modular spaces, vol. 1034 of Lecture Notes in Mathematics, Springer-Verlag, Berlin, 1983

    work page 1983

  24. [24]

    M. A. PERLES,On dilworth’s theorem in the infinite case, Israel J. Math., 1 (1963), pp. 108–109. 28

    work page 1963

  25. [25]

    T. J. SHURA ANDD. TRAUTMAN,Theλ-property in Schreier’s space s and the lorentz space d(a, 1), Glasg. Math. J., 32 (1990), pp. 277–284

    work page 1990

  26. [26]

    SIERPI ´NSKI,Sur un problème de la théorie des relations, Annali della Scuola Normale Superiore di Pisa - Classe di Scienze, 2 (1933), pp

    W. SIERPI ´NSKI,Sur un problème de la théorie des relations, Annali della Scuola Normale Superiore di Pisa - Classe di Scienze, 2 (1933), pp. 285–287

    work page 1933

  27. [27]

    WÓJTOWICZ,On the permutative equivalence of unconditional bases in F-spaces, Funct

    M. WÓJTOWICZ,On the permutative equivalence of unconditional bases in F-spaces, Funct. Approx. Comment. Math., 16 (1988), pp. 51–54. (Piotr Borodulin–Nadzieja) MATHEMATICALINSTITUTE, UNIVERSITY OFWROCŁAW, PL. GRUN- WALDZKI2, 50-384 WROCŁAW, POLAND Email address:pborod@math.uni.wroc.pl (Barnabás Farkas) DMG/ALGEBRA, TU WIEN, WIEDNERHAUPTSTRASSE8-10/104, 10...

    work page 1988