Skip to main content
Proceedings of the National Academy of Sciences of the United States of America logoLink to Proceedings of the National Academy of Sciences of the United States of America
. 2002 May 21;99(11):7356–7360. doi: 10.1073/pnas.112074699

Traces, ideals, and arithmetic means

Victor Kaftal 1,, Gary Weiss 1
PMCID: PMC124235  PMID: 12032287

Abstract

This article grew out of recent work of Dykema, Figiel, Weiss, and Wodzicki (Commutator structure of operator ideals) which inter alia characterizes commutator ideals in terms of arithmetic means. In this paper we study ideals that are arithmetically mean (am) stable, am-closed, am-open, soft-edged and soft-complemented. We show that many of the ideals in the literature possess such properties. We apply these notions to prove that for all the ideals considered, the linear codimension of their commutator space (the “number of traces on the ideal”) is either 0, 1, or ∞. We identify the largest ideal which supports a unique nonsingular trace as the intersection of certain Lorentz ideals. An application to elementary operators is given. We study properties of arithmetic mean operations on ideals, e.g., we prove that the am-closure of a sum of ideals is the sum of their am-closures. We obtain cancellation properties for arithmetic means: for principal ideals, a necessary and sufficient condition for first order cancellations is the regularity of the generator; for second order cancellations, sufficient conditions are that the generator satisfies the exponential Δ2-condition or is regular. We construct an example where second order cancellation fails, thus settling an open question. We also consider cancellation properties for inclusions. And we find and use lattice properties of ideals associated with the existence of “gaps.”


The algebra B(H) of bounded linear operators on a separable, infinite-dimensional, complex Hilbert space has only one nonzero proper closed two-sided ideal, the class of compact operators K(H). There is, however, a rich structure of nonclosed two-sided ideals of B(H) (operator ideals). Their study was initiated by Calkin (1), who established a lattice isomorphism between ideals and characteristic sets, i.e., the hereditary (solid) positive cones Σ ⊂ c*o (the collection of monotone sequences decreasing to 0) that are invariant under ampliation: ξ → (ξ1, ξ1, ξ2, ξ2, ξ3, ξ3, …). Given an ideal I, call Σ(I) := {s(X)|X ∈ I} the characteristic set of I where s(X) := 〈sn(X)〉 is the sequence of s-numbers of X, i.e., the eigenvalues of |X| counting multiplicities and arranged in decreasing order with infinitely many zeroes added in case X is finite rank. Conversely, if Σ is a characteristic set, the diagonal operators diag ξ with ξ ∈ Σ generate the (unique) ideal I such that Σ(I) = Σ.

For each ideal I, we denote by [I, B(H)] the commutator space for I (also known as the commutator ideal), i.e., the linear span of all the commutators XB-BX where X ∈ I and B ∈ B(H). Commutator spaces are central to the theory of operator ideals. For instance, they play a key role in defining traces (see the next section). Starting with Halmos (2) and Pearcy and Topping (3), a great deal of effort has been devoted over the years to characterizing commutator spaces for various ideals (see ref. 4 for a comprehensive list of references). The line of research leading to this paper began with a result of one of the authors (5): for the trace class ideal Λ1 with the usual trace Tr, the commutator space [𝔏1, B(H)] is strictly contained in ker Tr = {X ∈ 𝔏1|Tr X = 0}. The key test case was the diagonal operator X = diag (−1, d1, d2, …) where dn ↓ 0 and ∑Inline graphic dn = 1. Then X ∈ [𝔏1, B(H)] if and only if ∑Inline graphic dn log n < ∞. Notice that this condition is equivalent to asking that the arithmetic mean of the sequence λ := (−1, d1, d2, …) be itself summable. Kalton (6) characterized [𝔏1, B(H)] this way in terms of arithmetic means of eigenvalue sequences. For an arbitrary sequence λ = 〈λn〉, denote by λa its arithmetic mean sequence, namely, λa := 〈(1/n) ∑Inline graphic λj〉.

Dykema, Figiel, Weiss and Wodzicki proved the following (see ref. 4, Theorem 5.6, and Introduction formula 2).

Theorem 1.

For any proper ideal I, if X ∈ I is a normal operator with λ its sequence of eigenvalues counting multiplicities and ordered according to decreasing moduli, then X ∈ [I, B(H)] if and only if λa ∈ ∑(I).

This result, along with others in ref. 4, have consequences in the area of operator ideals and traces. Here we explore some of these consequences focusing on a number of questions.

How many traces can an ideal support? We found that for all the ideals in the literature that we considered, the answer is either 0, 1, or ∞; 0 can occur only when diag ω ∈ I (ω := 〈1/n〉 will denote the harmonic sequence), and 1 can occur if diag ω ∉ I. In the latter case, we determined the largest ideal possessing a unique trace. Our analysis here rests partly on the notions of soft-edged and soft-complemented ideals (see Definition 6), which include many of the ideals in the literature.

What are the implications for operator theory? Applications are given to elementary operators: Fuglede–Putnam type results and a question of Shulman.

As seen in Theorem 1 and throughout refs. 4 and 6, the arithmetic mean operation plays a critical role in the theory of commutators and of operator ideals. To make this role more transparent, given an ideal I, the associated arithmetic mean ideal Ia and, respectively, the pre-arithmetic mean ideal aI are defined in ref. 4 as:

graphic file with name M4.gif
graphic file with name M5.gif

So, for instance, a special case of Theorem 1 is that [I, B(H)]+ = (aI)+ where (aI)+ denotes the class of positive operators in the ideal aI. The arithmetic mean (am) closure, respectively, am-interior, of an ideal I are defined in ref. 4 as I := a(Ia) and Io := (aI)a and play an important role in the theory. Indeed, many ideals in the literature are am-closed, i.e., I = I. This motivates us to investigate questions on am-closure, am-closed ideals, and their properties.

One question is whether the sum of am-closed ideals is am-closed. We prove that it is by showing that: (I + J) = I + J. The proof combines weak majorization theory, convexity, and stochastic matrices (extended to infinite sequences and to notions of infinite convexity).

Another set of questions relate to cancellation properties of arithmetic means: for which ideals I does Ja = Ia, JaIa, and JaIa imply, respectively, J = I, JI, and JI? And similarly for aI? We answer these “first order cancellation” questions when I is principal. If X is a generator of I and π = s(X), denote I = (π). Then we prove (Theorem 11) that Ja = (π)a (or aJ = a(π)) implies J = (π) if and only if π is regular, i.e., π ≍ πa, or equivalently, (π) = (π)a. Here the equivalence of two sequences ξ ≍ η, means that both ξ = O(η) and η = O(ξ). Theorem 11 depends on properties of the lattice of principal ideals with regular generators. Harder, even for the principal ideal case, are second order cancellation questions: for which π does Ja2 = (π)a2, Ja2 ⊂ (π)a2, and Ja2 ⊃ (π)a2 imply, respectively, Ja = (π)a, Ja ⊂ (π)a, and Ja ⊃ (π)a? The first and second implications but not the third are true for π regular. Denoting h(π) := πa/π, it turns out that sufficient conditions can be obtained in terms of the sequence h(πa) = πa2a. If h(πa) is equivalent to a monotone sequence, then the second implication holds (Proposition 13). Moreover, if σ(π) := 〈∑Inline graphic πj〉 satisfies an exponential Δ2-condition (see paragraph after Proposition 13) or equivalently, h(πa) ≍ 〈log n〉, then all three cancellations hold (Proposition 14). However, in general, second order cancellation can fail: we construct a pair ξ, π ∈ c*o such that (ξ)a2 = (π)a2 but (ξ)a ≠ (π)a. This settles in the negative a question of M. Wodzicki.

Traces

The natural domain of the usual trace Tr on B(H) is the trace class 𝔏1. However, ideals can support more exotic traces. Traces are unitarily invariant linear functionals on an ideal I. Equivalently, they are linear functionals vanishing on the commutator space [I, B(H)], i.e., elements of the linear dual to the quotient I/[I, B(H)]. In general, they are not assumed to be positive or faithful. A trace that vanishes on the ideal F of finite rank operators (a subspace of all nonzero ideals) is called singular, and nonsingular otherwise. The first example of a (positive) singular trace was given by Dixmier (7). Its natural domain 𝔖Ω (although Dixmier's construction was somewhat more general) is the dual of the Macaev ideal 𝔖ω (8), and is defined as the ideal with characteristic set {ξ ∈ c*o|〈∑Inline graphic ξj〉 = O(log n)}. 𝔖Ω and 𝔖ω are denoted by Connes in ref. 9 by 𝔏(1, ∞) and 𝔏(∞, 1), respectively, and in ref. 4 by M(1/ωa) and 𝔏(log), respectively. In the notation of ref. 4 and of this paper, 𝔖Ω coincides with the am-closure (ω) of the principal ideal (ω) generated by diag ω, i.e., ∑(𝔖Ω) = {ξ ∈ c*oa = O(ωa)}.

The am-closure (π) = a((π)a) of an arbitrary principal ideal (π) plays an important role in the theory of operator ideals. Denoted 𝔖Π by Gohberg and Krein (10), (π) was shown to support the complete norm ∥X∥ := sup (s(X)a)n/(πa)n. Gohberg and Krein noticed that when π is regular, i.e., π ≍ πa, then (π) = (π). Varga (11) proved that an ideal (π) supports a nontrivial positive trace precisely when (π) does, and this holds if and only if (π) ≠ (π) or equivalently, when π is irregular. Clearly, if π is regular then so is πa. As a consequence of Varga's work, it turns out that if πa is regular, so is π. Another proof of this fact is given in ref. 4 (Theorem 3.10). We found a quantitative version of the same result: for every n, there is an m > n (actually we can specify that m ≤ nh(π)n where h(π) = πa/π) such that ½ log h(π)n ≤ h(πa)m, and this inequality is sharp.

For general ideals, by Theorem 1, [I, B(H)]+ = (aI)+ and thus aI is the largest ideal contained in [I, B(H)]. Since I is also the smallest ideal containing [I, B(H)], aI = [I, B(H)] if and only if aI = I. From the chain of inclusions:

graphic file with name M8.gif

we see that aI = I if and only if Ia = I. An ideal I for which I = aI = Ia is called arithmetically mean stable (stable for short). Thus stable ideals are precisely those with no nonzero traces (see ref. 4).

An important consequence of Theorem 1 is that an ideal I supports a nonsingular trace if and only if diag ω ∉ I, which condition is equivalent to [I, B(H)]+ = {0} and which in turn is equivalent to [I, B(H)] ∩ F ⊂ {X ∈ F|Tr X = 0}. This permits one to extend uniquely Tr from F to F + [I, B(H)] and then to I by a Hamel basis argument (nonuniquely when the containment F + [I, B(H)] ⊂ I is proper). Similarly, if I contains the trace class, Tr can be extended to I if and only if diag ω ∉ I. As a further consequence of Theorem 1 we obtain Proposition 2.

Proposition 2.

If diag ω ∉ I, then (𝔏1 + [I, B(H)])+ = 𝔏Inline graphic.

Notice that the converse is not true since [(ω), B(H)]+ = 𝔏Inline graphic.

Applications to Elementary Operators

Trace extensions find natural applications to questions on elementary operators. If Ai, Bi ∈ B(H), then the map B(H) ∋T → Δ(T) := ∑Inline graphic AiTBi is called an elementary operator and the adjoint map is Δ*(T) := ∑Inline graphic A*iTB*i. Elementary operators include commutators and intertwiners and hence their theory is connected to commutator spaces. The Fuglede–Putnam Theorem (12, 13) states that for the case Δ(T) = AT-TB with A, B normal, Δ(T) = 0 implies Δ*(T) = 0. For n = 2, Weiss (14) generalized this to the case where {Ai} and {Bi} are separately commuting families of normal operators by proving that Δ(T) ∈ 𝔏2 implies Δ*(T) ∈ 𝔏2 and that ∥Δ(T)∥𝔏2 = ∥Δ*(T)∥𝔏2. [This is also a consequence of Voiculescu's (15) Theorem 4.2 and Introduction to Section 4.] Shulman (16) proved that for n = 6, Δ(T) = 0 does not imply Δ*(T) ∈ 𝔏2.

If we impose some additional ideal-type conditions on the elementary operator Δ and/or on T, we can extend these implications to arbitrary n past the obstruction found by Shulman and the limitations of ref. 15. Assume there is an ideal I not containing diag ω but containing 𝔏1 such that the product (AiT)(Bi) of the principal ideals (AiT) and (Bi) is contained in I1/2 for all i (resp., (Ai)(TBi) ⊂ I1/2 for all i). This includes, for instance, the cases where for each i, at least one of the operators Ai, Bi, T is in I1/2; or at least two are in I1/4; or all three are in I1/6. The usefulness of these conditions lies in the fact that the ideal I can be “much larger” than 𝔏1. Then by using the general identity [I, J] = [IJ, B(H)] from ref. 4 (Theorem 5.10), we obtain that |Δ*(T)|2 − |Δ(T)|2 ∈ [I, B(H)] (resp., |(Δ*(T))*|2 − |(Δ(T))*|2 ∈ [I, B(H)]). Thus, if Δ(T) ∈ 𝔏2, it follows that |Δ*(T)|2 is in (𝔏1 + [I, B(H)])+ and, by Proposition 2, that Δ*(T) ∈ 𝔏2. Moreover, since diag ω ∉ I, Tr can be extended to I and thus its extension must vanish on [I, B(H)]. Therefore ∥Δ(T)∥𝔏2 = ∥Δ*(T)∥𝔏2 and, in particular, Δ(T) = 0 implies Δ*(T) = 0.

A further application is to a problem considered by Shulman. Here the operators {Ai} and {Bi} are not necessarily commuting nor normal. He showed that Δ*Δ(T) = 0 does not imply Δ(T) = 0 and conjectured that this implication holds under the additional assumption that Δ(T) ∈ 𝔏2. Reasoning as in the previous case, if there is an ideal I not containing diag ω such that (AiT)(Bi) ⊂ I1/2 for all i (resp., (Ai)(TBi) ⊂ I1/2 for all i), then |Δ(T)|2 − T*Δ*Δ(T) ∈ [I, B(H)] (resp., |(Δ(T))*|2 − T(Δ*Δ(T))* ∈ [I, B(H)]). Hence, if Δ*Δ(T) ∈ 𝔏1, we obtain that Δ(T) ∈ 𝔏2 and that ∥Δ(T)∥𝔏Inline graphic = Tr T*Δ*Δ(T). In particular, if Δ*Δ(T) = 0 it follows that Δ(T) = 0.

Uniqueness of Traces

For all 0 ≠ X ∈ 𝔏1, s(X)a ≍ ω. So, for X ∈ 𝔏Inline graphic, instead of the arithmetic mean, the relevant operation is the arithmetic mean at infinity Xa := diag 〈(1/n) ∑Inline graphic sj(X)〉 (see ref. 4, formula 17 and Theorem 5.11). A special case of Theorem 5.11 (iii) is that if I ⊂ 𝔏1, then [I, B(H)] contains all the operators in I with zero trace if and only if I is invariant under the arithmetic mean at infinity. Further using Theorem 1, we obtain Proposition 3.

Proposition 3.

If I is an ideal not containing diag ω, then (F + [I, B(H)])+ = {X ∈ 𝔏Inline graphic|XaI}.

As a consequence, (F + [I, B(H)])+ is always hereditary (solid). Notice that an ideal I not containing diag ω has a unique trace (up to scalar multiplication), i.e., dim I/[I, B(H)] = 1, if and only if I = F + [I, B(H)]. It is easy to verify that X ∈ (F + [𝔏1, B(H)])+, i.e., Xa ∈ 𝔏1, if and only if X ∈ 𝔏(σ(log))+. Here 𝔏(σ(log)) is the Lorentz ideal with characteristic set {ξ ∈ c*o|∑ ξn log n < ∞} and σ(λ) := 〈∑Inline graphic λj〉 denotes the initial partial sum sequence of λ (see ref. 4, 2.25). Similarly, one obtains Xa ∈ 𝔏(σ(logp)) (the Lorentz ideal with characteristic set {ξ ∈ c*o|∑ ξn logpn < ∞} if and only if X ∈ 𝔏(σ(logp+1))+. Notice that from Proposition 3 it follows that 𝔏(σ(log))+ = (F + [𝔏1, B(H)])+. Another useful consequence of Proposition 3 is that if diag ω ∉ I, then I has a unique trace, i.e., I = F + [I, B(H)], if and only if XaI for every X ∈ I+. Consequently all such I are contained in ∩Inline graphic 𝔏(σ(logp)). Thus, we obtain Theorem 4.

Theorem 4.

Inline graphic 𝔏(σ(logp)) is the largest ideal (not containing diag ω) with a unique trace, and that trace is Tr.

In particular, 𝔏1 has no unique trace, not even a unique nonsingular trace. If I is the principal ideal generated by an operator X ∈ 𝔏1, the conditions of Theorem 1 are satisfied if and only if for some c > 0, Xa ≤ c diag s(X). In ref. 18, Corollary 7, Kalton proves that an operator X ∈ 𝔏1 is uniquely traceable, i.e., I supports a unique separately continuous trace (see ref. 18 for the definition) if and only if there is a p > 1 and c > 0 such that sm(X) ≤ c(m/n)−p sn(X). As this condition clearly implies Xa ≤ c′ diag s(X) for some c′ > 0, we see that I supports only one separately continuous trace precisely when it supports only one trace, namely, the usual trace Tr.

Dimension of I/[I, B(H)]

Beyond the question of uniqueness of traces, it is natural to ask “how many” traces are supported by an ideal I or, equivalently, what are the possible values of dim I/[I, B(H)]?

As mentioned in ref. 4 (5.27-Remark 1), Dixmier's method in constructing nonsingular traces can be used to prove that dim(π)/[(π), B(H)] = ∞ whenever π = o(πa). The condition s(Y) = o(s(X)) for X, Y ∈ K(H) (equivalently, Y = KX for some K ∈ K(H)) also plays an important role in Varga's treatment of traces on principal ideals and their am-closures. When s(Y) = o(s(X)), we can interpolate between Y and X any number of operators. This leads to:

Lemma 5.

If there exist X ∈ I and K ∈ K(H) such that 0 ≤ KX ∉ F + [I, B(H)], then I/(F + [I, B(H)]) has uncountable dimension.

Considering for which kind of ideals the existence of a positive X ∉ F + [I, B(H)] guarantees that we can always find a K ∈ K(H) for which we also have 0 ≤ KX ∉ F + [I, B(H)] leads us to the definitions:

Definition 6.

We call an ideal I soft-edged if I = K(H)I and soft-complemented if, for any ideal J, the condition K(H)JI implies JI.

Thus, an ideal I is soft-edged if for every π ∈ ∑(I) there is a ξ ∈ ∑(I) such that π = o(ξ). An ideal I is soft-complemented if for every c*o ∋π ∉ ∑(I) there is a c*o ∋ξ ∉ ∑(I) such that ξ = o(π).

The main ideals in the literature are all either soft-edged or soft-complemented. We prove that countably generated ideals are soft-complemented. They are not necessarily soft-edged. Indeed, if π satisfies the Δ2-condition, i.e., sup πn2n < ∞, then the principal ideal (π) is not soft-edged. Lorentz ideals are both soft-edged and soft-complemented. If an ideal I is soft-complemented, its pre-arithmetic mean ideal aI is also soft-complemented. Thus all Marcinkiewicz ideals (the prearithmetic means of principal ideals) are soft-complemented. If M is a nondecreasing function, the associated Orlicz ideal 𝔏M (respectively, small Orlicz ideal 𝔏Inline graphic) are the ideals with characteristic set {ξ ∈ c*o| ∑n M(tξn) < ∞ for some t > 0} (respectively, {ξ ∈ c*o|∑n M(tξn) < ∞ for all t > 0}) (see ref. 4, 2.37 and 4.7). We show that small Orlicz ideals are soft-edged and Orlicz ideals are soft-complemented. The Gohberg and Krein ideals 𝔖φ generated by symmetric norming functions φ are always soft-complemented and they are soft-edged if and only if φ is mononormalizing (see ref. 10 for the definitions).

Theorem 7.

If I is soft-edged or soft-complemented then dim I/(F + [I, B(H)]) is either 0 or ∞.

When this dimension is 0, dim I/[I, B(H)] is either 1 or 0 according to whether diag ω ∉ I or diag ω ∈ I. A further consequence of Lemma 5 is that if diag ω ∉ I and I ⊄ ∩Inline graphic 𝔏(σ(logp)) (so, in particular, if I ⊄ 𝔏1) then dim I/(F + [I, B(H)]) = ∞. The key fact in this argument is that the ideals 𝔏(σ(logp)) are soft-complemented.

Of course not all ideals are either soft-edged or soft-complemented. For instance, if I is soft-complemented but not soft-edged, then any ideal J strictly between K(H)I and I is neither soft-edged nor soft-complemented. The simplest example of such a situation is when I = (π) is the principal ideal for some π satisfying the Δ2-condition. Then ∑(K(H)I) = o(π) ∩ c*o, ∑(I) = O(π) ∩ c*o, and there are infinitely many ideals lying between K(H)I and I. This example leads us to Definition 8.

Definition 8.

Given an ideal I, let se(I) = K(H)I and let sc(I) be the ideal with characteristic set {ξ ∈ c*o|o(ξ) ∩ c*o ⊂ ∑(I)}.

Then, se(I) is the largest soft-edged ideal contained in I and sc(I) is the smallest soft-complemented ideal containing I or, equivalently, it is the largest ideal J for which K(H)JI.

It follows that sc(se(I)) = sc(I) and se(sc(I)) = se(I). As a consequence, if se(I) ⊂ J ⊂ sc(I), then se(J) = se(I) and sc(J) = sc(I). This leads us to Theorem 9.

Theorem 9.

If either se(I)/[se(I), B(H)] or sc(I)/[sc(I), B(H)] has infinite dimension, then both have infinite dimension. In this case, I/[I, B(H)] has infinite dimension.

In particular, se(I) is stable, i.e., se(I) = [se(I), B(H)], if and only if sc(I) is stable. Applying these ideas to Orlicz ideals, one first shows that se(𝔏M) = 𝔏Inline graphic and that sc(𝔏Inline graphic) = 𝔏M. Then if 𝔏M ≠ 𝔏Inline graphic and if either of the two ideals is not stable, then the other one is not stable (see ref. 4, Theorem 5.26), in which case, for every ideal I between 𝔏Inline graphic and 𝔏M, it follows that dim I/[I, B(H)] = ∞.

Am-closure, Am-Interior, and Related Ideals

We have seen that the notion of am-closure plays a critical role for traces and norms on principal ideals. This notion was studied in ref. 4 for general ideals where it turned out to be relevant also in the analysis of single commutators (see ref. 4, Theorem 7.3 and Corollary 7.10).

The Gohberg and Krein ideals 𝔖φ generated by symmetric norming functions φ are am-closed, and they include many ideals in the literature such as Lorentz ideals for concave functions, Marcinkiewz ideals, and Orlicz ideals for convex functions. (See ref. 4, 4.7 and 4.9.)

Majorization theory is useful in investigating am-closed ideals. By definition, an ideal is am-closed, if and only if for ξ ∈ c*o, ξa ≤ ηa for some η ∈ ∑(I) implies ξ ∈ ∑(I). In other words, the characteristic set ∑(I) of an am-closed ideal I is hereditary under weak majorization (the Hardy–Littlewood–Polya–Schur order). We prove that this is equivalent to the conditions that ∑(I) contains all summable monotone sequences and is invariant under direct sums of block doubly stochastic finite matrices followed by monotonizing. In other words, if ξ ∈ ∑(I) and P = ∑ ⊕ Pk is a direct sum of doubly stochastic finite matrices, i.e., matrices with nonnegative entries with rows and columns summing to 1, then the monotonization (Pξ)* of Pξ must be in ∑(I). This implies but is not equivalent to the conditions that ∑(I) contains all summable monotone sequences and that ∑(I) is invariant under infinite convex combinations of infinite permutation matrices followed by monotonizing.

A useful application of this result is that: (I + J) = I + J for arbitrary pairs of ideals. Since directed unions of am-closed ideals are am-closed, this identity shows that every ideal I contains a largest am-closed ideal which we denote by I. We obtain analogous results for am-open ideals, i.e., that every ideal I is contained in a smallest am-open ideal Ioo and that (I + J)oo = Ioo + Joo. Notice that (I + J)oIo + Jo and (I + J)I + J but both inclusions can be proper.

For a principal ideal I = (π), both Io and Ioo are principal and have generators diag πo and diag πoo, respectively. Here πo is (up to equivalence) the largest average ξa ≤ π, and πoo is the smallest average ξa ≥ π (no equivalence is necessary here). To identify (π), we prove that if ξ ∈ c*o and ζa ≤ ξa for ζ ∈ c*o implies ζ ≤ π, then ξa ≤ π. In other words, (ξ) ⊂ (π) implies (ξ)a ⊂ (π) and hence (ξ)a(π). As a(π) is am-closed, this yields:

Theorem 10.

If I is a principal ideal, then I = aI.

Theorem 10 has several consequences. First of all, it yields a new proof of the fact that a principal ideal is am-closed if and only if it is stable (11) (see also ref. 4, Theorem 5.20). Notice that the am-closure of an ideal is principal if and only if the ideal is principal. This follows from the fact mentioned earlier that for any π ∈ c*o, π is regular if and only if πa is regular.

Further consequences of Theorem 10 are obtained by exploiting lattice properties of ideals, in particular, of some classes of principal ideals. Blass and Weiss (19) proved that K(H) is the sum of two proper ideals (neither of which can be countably generated) and in general, every ideal that properly contains F is the sum of two proper ideals. Here we obtain that with respect to the inclusion order, the lattice of principal ideals has no “gaps”, that is, between any two principal ideals lies another one. Notice this is not true in general, e.g., below every stable principal ideal (π) there is a gap between (π) and a maximal ideal in (π) not containing diag π. Such a maximal ideal must necessarily also be stable but cannot be principal.

A principal ideal has a unique generator up to s-sequence equivalence if and only if any (and hence all) of its generators have their s-sequence satisfying the Δ2-condition, in short, a Δ2-generator. We obtain that between an ideal with a Δ2-generator and another comparable principal ideal (whether contained in it or containing it) lies a principal ideal with a Δ2-generator. The same holds replacing Δ2-generators with regular generators: between two comparable principal ideals, one of which has a regular generator, i.e., is stable, lies another principal stable ideal.

Cancellation Properties for Arithmetic Means-First Order

In studying the arithmetic mean operations on ideals it is natural to consider cancellation properties of the kind: for which ideals I does Ia = Ja imply I = J? And similarly, when does aI = aJ imply I = J? Notice first that Ia = (I)a. So for the first question, a necessary condition is that I be am-closed (though not sufficient since 𝔏1 is am-closed and (𝔏1)a = (F)a). As the examples following Theorem 11 will show, the general question has no simple answer, but we can settle the case when I is principal. The case Ja = (π)a is simpler. As noticed above, a necessary condition is that (π) is am-closed and this requires π to be regular, that is, (π) to be stable. The condition is also sufficient. Indeed, if Ja = (π)a = (π), then J = (π) is principal and hence J too is principal and so it must coincide with (π). The aJ = a(π) case has the same answer but its proof requires the use of lattice properties of principal ideals and Theorem 10. In summary:

Theorem 11.

  (i) Ja = (π)a implies J = (π) if and only if (π) is stable.

(ii) aJ = a(π) implies J = (π) if and only if (π) is stable.

For general ideals, the stability of I is no longer sufficient in either case and we find the counterexamples interesting. For case (i) we construct an ideal L which is not stable but whose arithmetic mean La is stable. L is generated by sequences π(n) chosen so that for each n, ωan ≤ π(n)a ≤ ωa2n, but such that diag ω ∉ L. Then La = ∪(ω)an is the am-stabilizer of (ω) and hence it is stable, but diag ω ∈ LaL so L is not. For case (ii), we take I = ∪(ω)an and set J = I + (π), where π is chosen so that diag π ∉ I and hence JI, but for each n, (ωan) = (ωan + π)o so aJ = aI.

Directly from the definition of am-closure (respectively, am-interior) it follows that I is am-closed (respectively, am-open) precisely when JaIa implies JI. (respectively, aJaI implies JI). The reverse direction is subtler. It turns out that (ω1/2)aIa does not imply that (ω1/2) ⊂ I but only that (ω) ⊂ I. In fact, (ω) is the largest ideal with this property. More generally, if 0 < p < 1 and if 1/p − 1/p′ = 1, then (ωp′) is the largest ideal J such that (ωp) ⊂ Ia implies JI. We can generalize this result to all principal ideals (π). If π is summable then for every proper ideal I, Ia ⊃ (ω) = (π)a. Therefore ∩ {J|Ja ⊃ (π)a} is the ideal F of finite rank operators which is principal and is generated by π := (1, 0, 0, …). If π is nonsummable, set φn := min {k|∑Inline graphic πi ≥ n} and define πInline graphic := (πa)φn. Then we prove that (π)aIa implies (π) ⊂ I and that (π) is the largest ideal with that property, namely:

Proposition 12.

For all π ∈ c*o, (π) = ∩{J|Ja ⊃ (π)a}.

In particular, Ja ⊃ (π)a implies J ⊃ (π) if and only if (π) = (π). We have an example of a regular sequence π satisfying the latter condition, but as mentioned above, for 0 < p < 1, the regular sequences ωp do not.

The situation for the pre-arithmetic mean ideal aI is different: for every π there exists ξ such that a(ξ) ⊂ a(π) but (ξ) ⊄ (π).

Second Order Cancellation

Wodzicki asked whether or not (ξ)a2 = (π)a2 implies (ξ)a = (π)a. If π is regular, then the answer is clearly affirmative. We found that in general the answer is negative and then we investigated the properties of π which guarantee that this cancellation holds. This led to properties of the ratio h(πa) = πa2a. The first step is Proposition 13.

Proposition 13.

Given an ideal I, then Ja2Ia2 implies JaIa if and only if Ia = (Ia)−o. A sufficient condition is that each π ∈ ∑(I) is dominated by some ξ ∈ ∑(I) such that h(ξa) is equivalent to a monotone nondecreasing sequence.

Notice that for all ξ ∈ c*o, 1 ≤ h(ξa) ≤ log and that log − h(ξa) is strictly increasing (to infinity if ξ is nonsummable). So we have two extremal cases: when h(ξa) ≍ 1, i.e., ξa and hence ξ are regular, and when h(ξa) ≍ log. Interestingly, it turns out that the latter case is equivalent to σ(ξ) satisfying the exponential Δ2-condition, i.e., for some c > 0, ∑Inline graphic ξi ≤ c ∑Inline graphic ξi for all n. This condition is also sufficient for second order cancellation for the reverse inclusions.

Proposition 14.

Let I be an ideal such that every π ∈ ∑(I) is dominated by some ξ ∈ ∑(I), such that σ(ξ) satisfies the exponential Δ2-condition. Then Ja2Ia2 implies JaIa.

Notice that this cancellation can fail even for I principal and stable, e.g., for I = (ω1/2). Referring back to Wodzicki's question we see that (ξ)a2 = (π)a2 implies (ξ)a = (π)a in the cases when π is regular or when σ(π) satisfies the exponential Δ2-condition (the two extreme cases). But in general the answer is negative. The counterexample outlined below illustrates some of the features of the theory.

There is an increasing sequence nk and two c*o-sequences η ≥ ξ defined by ξj := e−kηnk for nk < j ≤ nk+1 and ηj := Inline graphic e−kηnk for nk < j ≤ eknk and ηj = ξj for eknk < j ≤ nk+1. The nk are taken sufficiently large to achieve the asymptotics (ξ)nk ∼ (ξa)nk ∼ (ξa2)nk ∼ ηnk ∼ (ηa)nk ∼ (ηa2)nk (a “resetting of the clock” process). The ratio ηaa increases throughout the interval nk < j ≤ eknk, becomes “large” for j ≈ eknk, and then decreases. The ratio ηa2a2 is more “resistant to change.” It increases more slowly but continues to increase past eknk and reaches a maximum on eknk < j ≤ nk+1. Fine-tuning of the growth constants so to make the ratio ηa2a2 close to 1 for j ≈ eknk guarantees that this maximum can be kept uniformly bounded. Consequently, ηa Inline graphic ξa but ηa2 ≍ ξa2.

Footnotes

This paper was submitted directly (Track II) to the PNAS office.

References


Articles from Proceedings of the National Academy of Sciences of the United States of America are provided here courtesy of National Academy of Sciences

RESOURCES