pith. sign in

arxiv: 1907.05215 · v1 · pith:MZ45I2TPnew · submitted 2019-07-11 · 🧮 math.OA

Pure infiniteness and paradoxicality for graph C^*-algebras

Francesca Arici , Baukje Debets , Karen R. Strung This is my paper

Pith reviewed 2026-05-24 22:52 UTC · model grok-4.3

classification 🧮 math.OA
keywords pure infinitenessgraph C*-algebraspath groupoidsparadoxical setsessential principalityrow-finite graphsC*-dynamical systems
0
0 comments X

The pith

For row-finite graphs without sinks, pure infiniteness of the path groupoid C*-algebra holds exactly when the groupoid is essentially principal and its topology has a basis of (G_E^a, 2, 1)-paradoxical sets.

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

The paper gives necessary and sufficient conditions for pure infiniteness of the path groupoid C*-algebra coming from a row-finite graph without sinks. It proves that the algebra is purely infinite if and only if the groupoid is essentially principal and the topology admits a basis of (G_E^a, 2, 1)-paradoxical sets. This equivalence turns a property of the C*-algebra into concrete checks on the underlying groupoid and its dynamics. The result matters because it converts an algebraic question into one about topological groupoid features that can be inspected directly from the graph.

Core claim

We obtain necessary and sufficient conditions for pure infiniteness of the path groupoid C*-algebra of a row-finite graph without sinks. In particular we show that for such a path groupoid G_E, the properties of being essential principal and the existence of a basis of (G_E^a, 2, 1)-paradoxical sets for the topology are not only sufficient, but also necessary.

What carries the argument

The path groupoid G_E of the graph E, where essential principality and the existence of a basis of (G_E^a, 2, 1)-paradoxical sets together determine whether the associated C*-algebra is purely infinite.

If this is right

  • Pure infiniteness of the C*-algebra reduces exactly to two groupoid properties that can be read off the graph.
  • Any earlier sufficient condition using essential principality and paradoxical sets is now also necessary.
  • The result covers every row-finite graph without sinks.
  • The C*-algebra is purely infinite precisely when the groupoid action exhibits the stated paradoxical behavior at the topological level.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The same style of characterization could be tested on graphs that do have sinks after suitable adjustments to the groupoid.
  • One could look for explicit links between these paradoxical sets and the K-theory groups of the C*-algebra.
  • Specific families of graphs, such as those arising from shifts of finite type, now become immediate test cases for the conditions.

Load-bearing premise

The standard definitions of essential principality and (G_E^a, 2, 1)-paradoxical sets from earlier work apply directly and correctly to these path groupoids of row-finite graphs without sinks.

What would settle it

A concrete row-finite graph without sinks whose path groupoid is essentially principal and possesses a basis of (G_E^a, 2, 1)-paradoxical sets, yet whose C*-algebra fails to be purely infinite.

read the original abstract

We obtain necessary and sufficient conditions for pure infiniteness of the path groupoid $C^*$-algebra of a row-finite graph without sinks. In particular we show that for such a path groupoid $\mathcal{G}_E$, the properties of being essential principal and the existence of a basis of $(\mathcal{G}_E^a, 2, 1)$-paradoxical sets for the topology are not only sufficient, but also necessary.

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

0 major / 3 minor

Summary. The manuscript establishes necessary and sufficient conditions for pure infiniteness of the path groupoid C*-algebra C*(G_E) of a row-finite graph E without sinks. It proves that G_E is essentially principal and that the topology on G_E^a admits a basis of (G_E^a, 2, 1)-paradoxical sets if and only if C*(G_E) is purely infinite.

Significance. If the result holds, the paper supplies a complete groupoid-theoretic characterization of pure infiniteness for this class of C*-algebras. The necessity direction is obtained by direct construction of the paradoxical sets from the assumption that C*(G_E) is purely infinite, via the standard bijection between open bisections and partial isometries; this is a strength because it relies on established correspondences rather than additional hypotheses. The result therefore tightens the connection between the topological dynamics of the groupoid and the C*-algebraic property.

minor comments (3)
  1. [§1] §1: the abstract states that the listed conditions are 'not only sufficient, but also necessary,' but does not indicate whether sufficiency is taken from prior literature or reproved here; a single sentence clarifying the division of labor would help readers locate the new contribution.
  2. [§3.2] §3.2, Definition of (G_E^a, 2, 1)-paradoxical set: the paper invokes this notion from earlier work; a brief one-sentence reminder of the precise definition (or an explicit reference to the exact statement used) would improve readability without lengthening the text.
  3. [Theorem 4.3] Theorem 4.3 (necessity): the argument uses the reduced groupoid C*-algebra throughout; confirm that the same conclusion holds for the full groupoid C*-algebra or add a remark explaining why the reduced case is the appropriate setting.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for the positive assessment of our manuscript and the recommendation for minor revision. No major comments were provided in the report.

Circularity Check

0 steps flagged

No circularity: necessity proved by direct construction from standard groupoid correspondences

full rationale

The paper derives necessary and sufficient conditions for pure infiniteness of C*(G_E) by showing equivalence to essential principality plus a basis of (G_E^a, 2, 1)-paradoxical sets. The necessity direction is obtained via explicit construction of paradoxical sets from the pure infiniteness assumption on the reduced groupoid C*-algebra, invoking only the standard bijection between open bisections and partial isometries (no fitted parameters, no self-definitional loops, and no load-bearing self-citation chains). All definitions and the row-finite no-sinks restriction are taken as external inputs from prior literature and do not reduce the target equivalence to a tautology. This is a self-contained mathematical equivalence with independent content.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 0 invented entities

The central claim rests on the domain restriction to row-finite graphs without sinks together with standard background definitions from groupoid C*-algebra theory; no free parameters or new entities are introduced in the abstract.

axioms (2)
  • domain assumption The graph is row-finite and contains no sinks
    The statement of necessary and sufficient conditions is restricted to this class of graphs.
  • standard math Standard definitions and properties of path groupoids, essential principality, and (n,m)-paradoxical sets from prior C*-algebra literature
    The equivalence is stated in terms of these established notions.

pith-pipeline@v0.9.0 · 5597 in / 1347 out tokens · 25425 ms · 2026-05-24T22:52:03.896038+00:00 · methodology

discussion (0)

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

Lean theorems connected to this paper

Citations machine-checked in the Pith Canon. Every link opens the source theorem in the public Lean library.

What do these tags mean?
matches
The paper's claim is directly supported by a theorem in the formal canon.
supports
The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
extends
The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
uses
The paper appears to rely on the theorem as machinery.
contradicts
The paper's claim conflicts with a theorem or certificate in the canon.
unclear
Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.

Reference graph

Works this paper leans on

25 extracted references · 25 canonical work pages

  1. [1]

    Purely infinite C∗-algebras arising from dynamical systems

    Claire Anantharaman-Delaroche. Purely infinite C∗-algebras arising from dynamical systems. Bull. Soc. Math. France , 125(2):199–225, 1997

    work page 1997

  2. [2]

    The ideal structure of the C∗-algebras of infinite graphs

    Teresa Bates, Jeong Hee Hong, Iain Raeburn, and W ojciech Szyma´ nski. The ideal structure of the C∗-algebras of infinite graphs. Illinois J. Math. , 46(4):1159–1176, 2002. 12 FRANCESCA ARICI, BAUKJE DEBETS, AND KAREN R. STRUNG

    work page 2002

  3. [3]

    TheC∗-algebras of row- finite graphs

    Teresa Bates, David Pask, Iain Raeburn, and W ojciech Szy ma´ nski. TheC∗-algebras of row- finite graphs. New York J. Math. , 6:307–324, 2000

    work page 2000

  4. [4]

    Ideal structure and pure infiniteness of ample groupoid C∗ -algebras

    Christian B¨ onicke and Kang Li. Ideal structure and pure infiniteness of ample groupoid C∗ -algebras. Ergodic Theory Dynam. Systems , pages 1–30, 2018

    work page 2018

  5. [5]

    Purely infinite C∗-algebras as- sociated to ´ etale groupoids

    Jonathan Brown, Lisa Orloff Clark, and Adam Sierakowski. Purely infinite C∗-algebras as- sociated to ´ etale groupoids. Ergodic Theory Dynam. Systems , 35(8):2397–2411, 2015

    work page 2015

  6. [6]

    Simple C∗-algebras generated by isometries

    Joachim Cuntz. Simple C∗-algebras generated by isometries. Comm. Math. Phys. , 57(2):173– 185, 1977

    work page 1977

  7. [7]

    The structure of multiplication and addi tion in simple ∗-algebras

    Joachim Cuntz. The structure of multiplication and addi tion in simple ∗-algebras. Math. Scand., 40(2):215–233, 1977

    work page 1977

  8. [8]

    Dimension functions on simple Cspec∗-algebras

    Joachim Cuntz. Dimension functions on simple Cspec∗-algebras. Math. Ann., 233(2):145–153, 1978

    work page 1978

  9. [9]

    A class of C∗-algebras and topological Markov chains

    Joachim Cuntz and W olfgang Krieger. A class of C∗-algebras and topological Markov chains. Invent. Math. , 56(3):251–268, 1980

    work page 1980

  10. [10]

    Purely infinite Cuntz-Krieger algebras of directed graphs

    Jeong Hee Hong and W ojciech Szyma´ nski. Purely infinite Cuntz-Krieger algebras of directed graphs. Bull. London Math. Soc. , 35(5):689–696, 2003

    work page 2003

  11. [11]

    David Kerr and Piotr W. Nowak. Residually finite actions and crossed products. Ergodic Theory Dynam. Systems , 32(5):1585–1614, 2012

    work page 2012

  12. [12]

    Christopher Phillips

    Eberhard Kirchberg and N. Christopher Phillips. Embed ding of exact C∗-algebras in the Cuntz algebra O2. J. Reine Angew. Math. , 525:17–53, 2000

    work page 2000

  13. [13]

    Non-simple pure ly infinite C∗-algebras

    Eberhard Kirchberg and Mikael Rørdam. Non-simple pure ly infinite C∗-algebras. Amer. J. Math., 122(3):637–666, 2000

    work page 2000

  14. [14]

    Infinite non-sim ple C∗-algebras: absorbing the Cuntz algebras O∞

    Eberhard Kirchberg and Mikael Rørdam. Infinite non-sim ple C∗-algebras: absorbing the Cuntz algebras O∞. Adv. Math. , 167(2):195–264, 2002

    work page 2002

  15. [15]

    Cuntz–Krie ger algebras of directed graphs

    Alex Kumjian, David Pask, and Iain Raeburn. Cuntz–Krie ger algebras of directed graphs. Pacific J. Math. , 184(1):161–174, 1998

    work page 1998

  16. [16]

    Graphs, groupoids, and Cuntz- Krieger algebras

    Alex Kumjian, David Pask, Iain Raeburn, and Jean Renaul t. Graphs, groupoids, and Cuntz- Krieger algebras. J. Funct. Anal. , 144(2):505–541, 1997

    work page 1997

  17. [17]

    On infinite simple C∗-algebras

    Hua Xin Lin and Shuang Zhang. On infinite simple C∗-algebras. J. Funct. Anal. , 100(1):221– 231, 1991

    work page 1991

  18. [18]

    Purely infinite C∗-algebras of real rank zero

    Cornel Pasnicu and Mikael Rørdam. Purely infinite C∗-algebras of real rank zero. J. Reine Angew. Math. , 613:51–73, 2007

    work page 2007

  19. [19]

    Alan L. T. Paterson. Graph inverse semigroups, groupoi ds and their C∗-algebras. J. Operator Theory, 48(3, suppl.):645–662, 2002

    work page 2002

  20. [20]

    Graph algebras , volume 103 of CBMS Regional Conference Series in Mathe- matics

    Iain Raeburn. Graph algebras , volume 103 of CBMS Regional Conference Series in Mathe- matics. Published for the Conference Board of the Mathematical Sci ences, W ashington, DC; by the American Mathematical Society, Providence, RI, 2005

    work page 2005

  21. [21]

    A groupoid approach to C∗-algebras, volume 793 of Lecture Notes in Mathe- matics

    Jean Renault. A groupoid approach to C∗-algebras, volume 793 of Lecture Notes in Mathe- matics. Springer, Berlin, 1980

    work page 1980

  22. [22]

    M. Rørdam. Classification of nuclear, simple C∗-algebras. In Classification of nuclear C∗- algebras. Entropy in operator algebras , volume 126 of Encyclopaedia Math. Sci. , pages 1–145. Springer, Berlin, 2002

    work page 2002

  23. [23]

    Purely infinite C∗-algebras arising from crossed prod- ucts

    Mikael Rørdam and Adam Sierakowski. Purely infinite C∗-algebras arising from crossed prod- ucts. Ergodic Theory Dynam. Systems , 32(1):273–293, 2012

    work page 2012

  24. [24]

    Graph theory for C∗-algebras

    Yasuo W atatani. Graph theory for C∗-algebras. In Operator algebras and applications, Part I (Kingston, Ont., 1980) , volume 38 of Proc. Sympos. Pure Math. , pages 195–197. Amer. Math. Soc., Providence, R.I., 1982

    work page 1980

  25. [25]

    A property of purely infinite simple C∗-algebras

    Shuang Zhang. A property of purely infinite simple C∗-algebras. Proc. Amer. Math. Soc. , 109(3):717–720, 1990. Institute for Mathematics, Astrophysics, and Particle Phys ics, Radboud University, Postbus 9010, 6500 GL Nijmegen, The Netherlands E-mail address : f.arici@math.ru.nl Section of Analysis, Department of Mathematics, KU Leuven, C elestijnenlaan 200...

    work page 1990