OctoInformBeta

OpenAI preprint, September 2026 · §3. Projection tools · §3

Corollary 3.6 [Splitting finite linear tests]: In real rank zero with full projections of arbitrarily small trace, projections have subprojections carrying any fraction approximately in all tracial states

Splitting a projection by any fraction on finitely many tests.

Hover over a blue or green term in the text, or a node in the graph, to find it in the other. Select it to read its declaration both in Lean and in words.

The Setting

Take a unital C*^*-algebra DD, a projection q∈Dq \in D and a number s∈[0,1]s \in [0,1]. The question is whether qq contains a projection ee that carries the fraction ss of qq in every tracial state τ\tau of DD at once. The fraction is measured against finitely many test elements hh of DD, by comparing τ(eh)\tau(eh) with sτ(qh)s\,\tau(qh); the test h=1h = 1 compares τ(e)\tau(e) with sτ(q)s\,\tau(q).

The algebra DD is assumed to have real rank zero and full projections of arbitrarily small trace, both defined in the next section.

Traces, Real Rank Zero and Full Projections

A tracial state τ\tau of DD is a linear functional on DD that is positive, normalized and tracial, that is: τ(1)=1,τ(ab)=τ(ba)(a,b∈D).\tau(1) = 1, \qquad \tau(ab) = \tau(ba) \quad (a, b \in D).(1)✦ The set of tracial states of DD is T(D)T(D), and for a projection g∈Dg \in D we write sup⁡ττ(g)\sup_\tau \tau(g) for the supremum of τ(g)\tau(g) over τ∈T(D)\tau \in T(D).

A C*^*-algebra DD has real rank zero when for every self-adjoint element aa of DD and every ε>0\varepsilon > 0 there is a self-adjoint element bb of DD with finite spectrum and ∥a−b∥<ε\|a - b\| < \varepsilon.✦

An element gg of DD is full when the two-sided ideal of DD generated by gg is dense in DD.✦ We say that DD has full projections of arbitrarily small trace when for every δ>0 there is a full projection g∈D with supττ(g)<δ.\text{for every } \delta > 0 \text{ there is a full projection } g \in D \text{ with } \sup_\tau \tau(g) < \delta.(2)

For projections ee and qq of DD, e≤qe \le q means that q−eq - e is positive, and ee is then a subprojection of qq.

The Claim

Theorem 1. Let DD be a C*^*-algebra of real rank zero with full projections of arbitrarily small trace, as in (2). Let qq be a projection in DD, s∈[0,1]s \in [0,1], FF a finite subset of DD and ε>0\varepsilon > 0. Then there is a projection e∈De \in D with e≤qe \le q such that |τ(eh)−sτ(qh)|<εfor every h∈F and every τ∈T(D).\bigl|\tau(eh) - s\,\tau(qh)\bigr| < \varepsilon \qquad \text{for every } h \in F \text{ and every } \tau \in T(D).(3)✦

What Is Checked

The claim is stated over the library’s definitions of a tracial state (1), of real rank zero and of a full element, with e≤qe \le q taken in the order of DD.