arxiv: 2604.25382 · v1 · submitted 2026-04-28 · 🧮 math.OA

Recognition: unknown

A finitary criterion for selfless tracial C*-algebras

Ali Jabbari

Pith reviewed 2026-05-07 13:47 UTC · model grok-4.3

classification 🧮 math.OA

keywords selfless C*-algebrastracial C*-algebrasapproximate selflessnessstrict comparisonunique tracetracial ultrapowersgroup C*-algebrasC*-probability spaces

0 comments

The pith

For separable tracial C*-algebras selflessness is equivalent to a finitary approximate condition on traces of unitaries and alternating words.

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

The paper shows that a tracial C*-algebra is selfless exactly when it meets an approximate version of the property that can be verified using only finite collections of elements and finite-length words. Selflessness itself guarantees that the algebra has a unique trace and satisfies strict comparison, properties that control how positive elements behave under the trace. The equivalence is obtained by lifting the finitary condition through a diagonal argument inside the tracial ultrapower, so that any separable algebra satisfying the local condition automatically satisfies the global one. This turns an abstract infinitary definition into a concrete criterion that can be checked on finite data.

Core claim

For separable tracial C*-algebras, selflessness is equivalent to approximate selflessness: for every finite set F, every N ≥ 1 and ε > 0 there exists a unitary u with |τ(u^k)| < ε for 1 ≤ |k| ≤ N and |τ(w)| < ε for all alternating words w of length ≤ N built from centered elements of F and powers u^n with |n| ≤ N. The equivalence follows from a diagonalization construction inside the tracial ultrapower that assembles a sequence of such unitaries into a single unitary satisfying the full selflessness relations.

What carries the argument

The finitary approximate selflessness condition, which requires the existence of a unitary whose low powers and alternating words with elements from any finite set have small trace, serves as the local test that the diagonalization argument lifts to the global selflessness property in the ultrapower.

If this is right

Every separable tracial C*-algebra satisfying the finitary condition automatically has a unique trace and strict comparison.
The C*-algebras of countable groups whose extreme boundary is topologically free are selfless, proved by verifying the finitary condition directly.
The finitary criterion supplies a new tool for studying the relationship between selflessness, nuclearity and Z-stability in separable algebras.
Approximate selflessness can be used to construct or rule out examples by checking traces on finite words rather than on the whole algebra.

Where Pith is reading between the lines

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

The criterion may make it feasible to decide selflessness for algebras presented by finite or recursive relations by checking only finitely many words at each stage.
It could be combined with approximation techniques from finite-dimensional models to produce new classes of selfless algebras beyond group examples.
If the finitary condition holds uniformly in some quantitative sense, it might imply stronger forms of regularity such as absorption of the Jiang-Su algebra.

Load-bearing premise

The diagonalization inside the tracial ultrapower transfers every instance of the finitary approximate condition into a single unitary that witnesses full selflessness for separable algebras.

What would settle it

A separable tracial C*-algebra that meets the approximate selflessness condition for every finite set, N and ε yet fails to be selfless, or conversely a selfless separable algebra that violates the finitary condition for some choice of F, N and ε.

read the original abstract

We study the class of selfless C*-probability spaces introduced by Robert. It is known that a selfless tracial algebra has strict comparison and a unique trace. We prove that for separable tracial C*-algebras, selflessness is equivalent to approximate selflessness, a finitary condition: for every finite set $F$, every $N \geq 1$ and $\varepsilon > 0$ there exists a unitary $u$ with $|\tau(u^k)| < \varepsilon$ ($1 \leq |k| \leq N$) and $|\tau(w)| < \varepsilon$ for all alternating words $w$ of length $\leq N$ built from centered elements of $F$ and powers $u^n$ ($|n| \leq N$). The equivalence is established using a diagonalisation argument in the tracial ultrapower. As an application, we give a concise proof that countable groups with a topologically-free extreme boundary are C*-selfless. We also discuss the relation to nuclearity and $\mathcal{Z}$-stability.

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.

Desk Editor's Note private letter to a colleague

The paper gives a usable finitary test for selflessness in separable tracial C*-algebras via ultrapower diagonalization, plus a clean application to certain group algebras.

read the letter

The main point is that selflessness equals this approximate finitary condition for separable tracial C*-algebras: for any finite F, N, and epsilon there is a unitary u making traces of its low powers and the relevant alternating words small. The proof lifts the finite conditions by enumerating them and taking an ultralimit in the tracial ultrapower. This equivalence is new and gives a practical check that could help confirm strict comparison and unique trace without the full infinite property. The application to countable groups with topologically free extreme boundary is short and direct, showing their C*-algebras are selfless. The tie-in to nuclearity and Z-stability is noted but stays light. The diagonalization uses only routine ultrapower facts and separability for the countable list, which is fine and avoids any circularity or fitting issues. The alternating-word condition is tailored but sufficient for the equivalence. No load-bearing gaps appear from the description. This is aimed at people working on classification of tracial C*-algebras who need concrete tests for examples. A reader wanting finitary criteria or quick proofs for group algebras will find it useful. It is technical progress rather than a field shift, but the thinking is clear and the literature engagement is honest. I would send it to referees.

Referee Report

0 major / 2 minor

Summary. The paper proves that for separable tracial C*-algebras, selflessness is equivalent to approximate selflessness: for every finite set F, N ≥ 1 and ε > 0 there exists a unitary u such that |τ(u^k)| < ε for 1 ≤ |k| ≤ N and |τ(w)| < ε for all alternating words w of length ≤ N built from centered elements of F and powers u^n with |n| ≤ N. The equivalence is obtained via a diagonalization argument inside the tracial ultrapower. Applications include a concise proof that countable groups with topologically free extreme boundary are C*-selfless, together with remarks on nuclearity and Z-stability.

Significance. If the result holds, the finitary criterion supplies a concrete, checkable condition for selflessness in the separable setting, which is known to imply strict comparison and uniqueness of the trace. The diagonalization argument relies only on standard ultrapower properties and separability, making it reliable. The application to group C*-algebras is a clear strength, delivering a streamlined proof, while the discussion of nuclearity and Z-stability situates the work within broader classification questions.

minor comments (2)

The precise definition of 'alternating words' (including the centering of elements from F) is stated in the abstract but would benefit from an explicit example or expanded definition in the main text for readers unfamiliar with the construction.
A short remark comparing the finitary condition here with other approximation properties (e.g., quasidiagonality or MF approximations) would help situate the result.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for their positive report and for recommending acceptance of the manuscript. We are pleased that the significance of the finitary criterion for selflessness and the application to group C*-algebras were noted.

Circularity Check

0 steps flagged

No significant circularity identified

full rationale

The paper proves equivalence between selflessness and its finitary approximate version for separable tracial C*-algebras by a diagonalisation argument inside the tracial ultrapower. This enumerates a countable dense set of finite conditions (F, N, ε, alternating words) and constructs a sequence of unitaries whose ultralimit satisfies the global vanishing conditions on traces. The argument invokes only standard facts about ultrapowers (preservation of norms, algebraic relations, and traces) and separability; it does not reduce the target property to a fitted parameter, a self-referential definition, or any load-bearing self-citation. The construction is therefore self-contained and independent of the result being proved.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 0 invented entities

The proof rests on standard constructions from C*-algebra theory without introducing new free parameters or postulated entities.

axioms (2)

standard math Existence and basic properties of tracial ultrapowers for separable C*-algebras
Invoked in the diagonalization argument to transfer the finitary condition to the full algebra.
standard math Trace properties and alternating word evaluations in C*-probability spaces
Used to define the approximate selflessness condition.

pith-pipeline@v0.9.0 · 5473 in / 1403 out tokens · 68468 ms · 2026-05-07T13:47:23.334212+00:00 · methodology

discussion (0)

Reference graph

Works this paper leans on

15 extracted references · 5 canonical work pages · 2 internal anchors

[1]

Amrutam, D

T. Amrutam, D. Gao, S. Kunnawalkam Elayavalli, and L. Robert,Selfless reduced free product C*-algebras, arXiv:2505.13265v2, 2025

work page arXiv 2025
[2]

Dykema,Faithfulness of free product states, J

K.J. Dykema,Faithfulness of free product states, J. Funct. Anal.154(1998), 323–329

1998
[3]

Farah, B

I. Farah, B. Hart, M. Lupini, L. Robert, A. Tikuisis, A. Vignati, and W. Winter, Model theory of C*-algebras, Mem. Amer. Math. Soc.271(2021), no. 1324

2021
[4]

D. Gao, S. Kunnawalkam Elayavalli, G. Patchell, and L. Teryoshin,Selfless reduced amalgamated free products and HNN extensions, arXiv:2604.06982, 2026

work page internal anchor Pith review Pith/arXiv arXiv 2026
[5]

Hayes, S

B. Hayes, S. Kunnawalkam Elayavalli, G. Patchell, and L. Robert,Selfless inclusions and free complexifications, arXiv:2510.13398v2, 2025

work page arXiv 2025
[6]

Jacelon,A simple, monotracial, stably projectionlessC ∗-algebra, J

B. Jacelon,A simple, monotracial, stably projectionlessC ∗-algebra, J. Lond. Math. Soc.87(2014), no. 2, 365–383

2014
[7]

Matui and Y

H. Matui and Y. Sato,Strict comparison andZ-absorption of nuclear C*-algebras, Acta Math.209(2012), 179–196

2012
[8]

X. Ma, D. Wang, and W. Yang,Topologically free strong boundary actions of CAT(0) groups and applications to C*-algebras, arXiv:2510.05669v1, 2025

work page arXiv 2025
[9]

Proximality and selflessness for group C*-algebras

N. Ozawa,Proximality and selflessness for group C*-algebras, preprint, arXiv:2508.07938v7

work page internal anchor Pith review Pith/arXiv arXiv
[10]

Robert,Selfless C*-algebras, Adv

L. Robert,Selfless C*-algebras, Adv. Math.478(2025), 110409

2025
[11]

A. M. Sinclair and R. R. Smith,Finite von Neumann Algebras and Masas, London Math. Soc. Lecture Note Ser., Vol. 351, Cambridge Univ. Press, Cambridge, 2008

2008
[12]

A. S. Toms,On the classification problem for nuclearC ∗-algebras, Ann. of Math.167 (2008), no. 3, 1029–1044

2008
[13]

Voiculescu, K.J

D.V. Voiculescu, K.J. Dykema, and A. Nica,Free Random Variables, CRM Mono- graph Series, Vol. 1, Amer. Math. Soc., Providence, 1992

1992
[14]

Winter,Strongly self-absorbingC ∗-algebras areZ-stable, J

W. Winter,Strongly self-absorbingC ∗-algebras areZ-stable, J. Noncommut. Geom. 5(2011), 253–264

2011
[15]

Winter,Localizing the Elliott conjecture at strongly self-absorbingC ∗-algebras, J

W. Winter,Localizing the Elliott conjecture at strongly self-absorbingC ∗-algebras, J. Reine Angew. Math.692(2014), 193–231. Department of Applied Mathematics and Informatics, Kyrgyz-Turkish Manas University, Bishkek, Kyrgyzstan Email address:ali.jabbari@manas.edu.kg & jabbari al@yahoo.com

2014