11
117 Novi Sad J. Math. Vol. 33, No. 1, 2003, 117–127 MATRIX METHOD APPROACH TO CAFIERO THEOREM Paolo de Lucia 1 , Endre Pap 2 Abstract. We give a simple proof of the Cafiero theorem based on a matrix method approach in the form of Lemma 2.4 in the σ-additive context. Based on a version of Drewnowski lemma for an SCP-ring we obtain an extension of Cafiero theorem for exhaustive finitely additive set functions defined on an SCP-ring. As consequences, the well-known Nikod´ ym and Brooks-Jewett convergence theorems are obtained. AMS Mathematics Subject Classification (2000): 28A33 Key words and phrases: additive set function, exhaustive, matrix method, Nikod´ ym convergence theorem 1. Introduction In a paper of 1952 F. Cafiero [3] has characterized σ-additive set functions defined on a σ-ring that are uniformly additive, see Cafiero [3, 4]. The notion of the uniform additiveness was introduced by R. Caccioppoli [2] and indepen- dently by Dubrovskii [15], and it was utilized by many authors to obtain a Lebesgue type theorem for the convergence of integrals. Since the time when R. Rickart [22] introduced the notion of exhaustivity or s-boundedness for additive set functions defined on a ring it has been clear that for σ-additive set functions the uniform additivity of Caccioppoli and Dubrovskii is equivalent to the uni- form exhaustivity. Therefore the Cafiero lemma was reformulated for the case of the uniform exhaustivity (see d’Andrea, de Lucia [7], H. Weber [25]). In this paper we give a simple proof of the Cafiero theorem based on a matrix method approach (diagonal theorems), as a further extension of sliding hump method, and which was initiated by Mikusi´ nski [18]. Many results in measure theory and functional analysis can be found in Antosik and Swartz [1], Pap [19, 20, 21], Swartz [23] (see also Diestel and Uhl Jr [13], Weber [26]), where the matrix method is used instead of the Baire Category Theorem, which is 1 Universita ”Federico II”, Dipartimento di Matematica, e Applicazioni ”Renato Cacciop- poli”, via Cinthia, 80126 Napoli, Italy, e-mail: [email protected] 2 Institute of Mathematics, University of Novi Sad, Trg D. Obradovi´ ca 4, 21000 Novi Sad, Yugoslavia, e-mail: [email protected]

Matrix method approach to Cafiero theorem

Embed Size (px)

Citation preview

117Novi Sad J. Math.Vol. 33, No. 1, 2003, 117–127

MATRIX METHOD APPROACH TO CAFIEROTHEOREM

Paolo de Lucia1, Endre Pap2

Abstract. We give a simple proof of the Cafiero theorem based on amatrix method approach in the form of Lemma 2.4 in the σ-additivecontext. Based on a version of Drewnowski lemma for an SCP-ring weobtain an extension of Cafiero theorem for exhaustive finitely additiveset functions defined on an SCP-ring. As consequences, the well-knownNikodym and Brooks-Jewett convergence theorems are obtained.

AMS Mathematics Subject Classification (2000): 28A33

Key words and phrases: additive set function, exhaustive, matrix method,Nikodym convergence theorem

1. Introduction

In a paper of 1952 F. Cafiero [3] has characterized σ-additive set functionsdefined on a σ-ring that are uniformly additive, see Cafiero [3, 4]. The notionof the uniform additiveness was introduced by R. Caccioppoli [2] and indepen-dently by Dubrovskii [15], and it was utilized by many authors to obtain aLebesgue type theorem for the convergence of integrals. Since the time when R.Rickart [22] introduced the notion of exhaustivity or s-boundedness for additiveset functions defined on a ring it has been clear that for σ-additive set functionsthe uniform additivity of Caccioppoli and Dubrovskii is equivalent to the uni-form exhaustivity. Therefore the Cafiero lemma was reformulated for the caseof the uniform exhaustivity (see d’Andrea, de Lucia [7], H. Weber [25]).

In this paper we give a simple proof of the Cafiero theorem based on a matrixmethod approach (diagonal theorems), as a further extension of sliding humpmethod, and which was initiated by Mikusinski [18]. Many results in measuretheory and functional analysis can be found in Antosik and Swartz [1], Pap[19, 20, 21], Swartz [23] (see also Diestel and Uhl Jr [13], Weber [26]), wherethe matrix method is used instead of the Baire Category Theorem, which is

1Universita ”Federico II”, Dipartimento di Matematica, e Applicazioni ”Renato Cacciop-poli”, via Cinthia, 80126 Napoli, Italy, e-mail: [email protected]

2Institute of Mathematics, University of Novi Sad, Trg D. Obradovica 4, 21000 Novi Sad,Yugoslavia, e-mail: [email protected]

118 P. de Lucia, E. Pap

unsuitable for obtaining more general results. We start with a matrix methodlemma, Lemma 2.4, which we use in the proof of Cafiero theorem 2.5 in theσ-additive context. After that, by a version of Drewnowski lemma 3.3 for anSCP-ring, we arrive at an extension of the Cafiero theorem 3.4 for exhaustivefinitely additive set functions defined on a SCP-ring. Finally, in section 4 weobtain immediately, by the Cafiero theorem 3.4, the well known Nikodym andBrooks-Jewett convergence theorems.

For more information on Cafiero theorem see d’Andrea, de Lucia [8], deLucia [9], de Lucia, Salvati [11], de Lucia, Traynor [12], Traynor [24], Weber[25].

2. Cafiero uniform exhaustivity theorem

Let R be a ring and M a family of finitely additive set functions defined onR. A finitely additive set function m : R → R is exhaustive (strongly additive orstrongly bounded) if limj→∞ m(Ej) = 0 for every sequence {Ej}j∈N of pairwisedisjoint elements from R. A family M of additive set functions is uniformly ex-haustive if limj→∞ m(Ej) = 0 uniformly in m ∈ M for every sequence {Ej}j∈N

of pairwise disjoint elements from R. It is obvious that a finite measure on aσ-ring is exhaustive.

The following propositions are well known (see de Lucia, Pap [10]).

Proposition 2.1. Let M be a family of finite additive exhaustive set functionson R. The following statements are equivalent

(i) M is uniformly exhaustive,

(ii) for every increasing sequence {Ei}i∈N the sequence {m(Ei)}i∈N is a con-vergent sequence, uniformly for m ∈ M

(iii) for every disjoint sequence {Ei}i∈N of R the series∑

i m(Ei) is convergentuniformly for m ∈ M.

Proposition 2.2. Let M be a family of finite additive exhaustive set functionson R. Then

(i) M is uniformly exhaustive,

implies

(ii) for every decreasing sequence {Ei}i∈N the sequence {m(Ei)}i∈N is a con-vergent sequence uniformly for m ∈ M.

If R is an algebra then (i) and (ii) are equivalent.

Matrix method approach to Cafiero theorem 119

Let Σ be a σ-algebra and M family of σ-additive set functions defined on Σ.A family M of countable additive measures µ : Σ → R is uniformly countableadditive if

limn→∞

∞∑j=n

µ(Ej) = 0

uniformly in µ ∈ M for every sequence {Ej}j∈N of pairwise disjoint elementsfrom Σ. We have by Propositions 2.1 and 2.2

Proposition 2.3. Let Σ be a σ-algebra and M family of σ-additive set func-tions defined on Σ. The following statements are equivalent

(i) M is uniformly exhaustive,

(ii) M is uniformly countable additive,

(iii) for every decreasing sequence {Ei}i∈N of Σ the sequence {µ(Ei)}i∈N is aconvergent sequence uniformly for µ ∈ M.

First we shall give an elementary matrix type lemma.

Lemma 2.4. Let [xni]n,i∈N be an infinite matrix of real numbers such that

1) for every n ∈ N and every subset I of N there exists∑

i∈I xni;

2) for every sequence {Ik}k∈N of pairwise disjoint subsets of N and for everyε > 0 there exists k ∈ N and n0 ∈ N such that∣∣∣∣∣∣

∑i∈Ik

xni

∣∣∣∣∣∣ < ε for every n > n0.

Thenlim

i→∞xni = 0 uniformly in n ∈ N.

Proof. We note that if the matrix [xni]n,i∈N has the properties 1) and 2) thenalso every its submatrix has the same properties. By 1) we have

limi→∞

xni = 0 (n ∈ N).(1)

Then we need to prove that: for every ε > 0 there exist k,m ∈ N such that| xni |< ε for every i > k and every n > m. Suppose that this is not true.Then there exists σ > 0 such that for every k,m ∈ N there exist i > k and n >m such that | xni |≥ σ. By induction we can then construct two strictly increas-ing sequences {ik}k∈N and {nk}k∈N of natural numbers such that | xnkik

|≥ σ

120 P. de Lucia, E. Pap

for every k ∈ N. Therefore there exists a submatrix of the starting matrix, whichwe denote by the same symbol [xni]n,i∈N, such that it satisfies 1), 2) and forsome σ > 0

3) | xkk |≥ σ for every k ∈ N.

Let {σr}r∈N be a decreasing sequence of real numbers such that∑r∈N

σr <σ

2,

from 2) we have that for every r ∈ N there exist ir and mr such that

| xnir|< σr

for every n ≥ mr. We can suppose that the sequences {ir} and {mr} are strictlyincreasing and so to construct a new submatrix of [xni], which we denote by thesame symbol [xni]n,i∈N, such that it satisfies 1), 2), 3) and

for every i ∈ N, | xni |< σi for all n ≥ mi.(2)

Now we construct by induction two strictly increasing sequences {ρn}n∈N and{rn}n∈N of natural numbers with the property

ρn > rn > max{ρn−1,mrn−1} for every n ∈ N,

where ρ0 = m0 = 0, such that we have for every n ∈ N,

| xrki |< σrnfor every i > ρn and k = 1, . . . , n.(3)

Suppose that r1, . . . , rn−1, ; ρ1, . . . , ρn−1 are determined and let be rn an elementof N such that

rn > max{ρn−1,mrn−1},by (1) we can find ρn such that ρn > rn and (3) is true.

Consider now the submatrix [xrnri]n,i∈N, for n ∈ N and i = 1, . . . , n − 1, we

have rn > mriand then, by (2)

| xrnri|< σri

,

and for i ≥ n + 1 it results

ri > ρi−1, n ≤ i − 1

and then, by (3)| xrnri

|< σri−1 .

Matrix method approach to Cafiero theorem 121

Hence for an infinite subset I of N and n ∈ I we have by 3)∣∣∣∣∣∑i∈I

xrnri

∣∣∣∣∣ ≥ | xrnrn| −

∑i∈I,i �=n

| xrnri|

≥ σ −∑i∈N

σi

2.

If {Ik}k∈N is a disjoint sequence of infinite subsets of N we have for every k ∈ N∣∣∣∣∣∑i∈Ik

xrnri

∣∣∣∣∣ >σ

2for all n ∈ Ik

and this contradicts 2). �

Theorem 2.5. [Cafiero] Let Σ be a σ-algebra. A sequence {µn}n∈N of countableadditive real measures defined on Σ is uniformly exhaustive if and only if thefollowing condition holdsα) for every sequence {En}n∈N of pairwise disjoint elements of Σ and everyε > 0 there exist k, n0 ∈ N such that

|µn(Ek)| < ε for every n ≥ n0.

Proof. Let {En}n∈N be a sequence of pairwise disjoint elements of Σ. Then(µn(Ei))n,i∈N is an infinite matrix of real numbers. By countable additivity ofevery µn we have that for every n ∈ N and I ⊂ N there exists

∑i∈I µn(Ei). If

{Ik}k∈N is a sequence of pairwise disjoint subsets of N, then {∪i∈IkEi}k∈N is a

sequence of pairwise disjoint elements of Σ and then by α) for every ε > 0 thereexist k, n0 ∈ N such that∣∣∣∣∣∣µn

i∈Ik

Ei

∣∣∣∣∣∣ =

∣∣∣∣∣∣∑i∈Ik

µn(Ei)

∣∣∣∣∣∣ < ε for every n ≥ n0.

Therefore the conditions 1) and 2) of Lemma 2.4 are satisfied and we have that

limi→∞

µn(Ei) = 0 uniformly in n ∈ N.

3. Cafiero theorem for additive set functions and SCP

To extend the previous results to the finitely additive case we will provea generalization of a very useful lemma obtained by Drewnowski [14] for a σ-ring, now for the case of an SCP-ring. We have the following definition byConstantinescu [5, 6] and Haydon [17], see also Freniche [16] and H. Weber [25].

122 P. de Lucia, E. Pap

Definition 3.1. A ring R has the Sequential Completeness Property, and willbe called SCP-ring, if each disjoint sequence {En}n∈N from R has a subsequence{Enj

}j∈N, whose union is in R.

Lemma 3.2. [Drewnowski lemma with SCP] Let R be an SCP-ring. If m :R → R is an exhaustive monotone set function with m(∅) = 0 and {En}n∈N

is a sequence of pairwise disjoint sets from R, then there exist a subsequence{Ekn

}n∈N of {En}n∈N and a SCP-ring R′ with SCP such that R′ ⊆ R, Ekn∈

R′ for every n ∈ N, and m is order continuous on the ring R′.

Proof. Let {Ji}i∈N be a sequence of pairwise disjoint infinite subsets of N. Thenfor every i ∈ N there exists an infinite subset J ′

i of Ji such that {∪k∈J′iEk}i∈N

is a sequence of pairwise disjoint subsets of R. By the exhaustivity of m it ispossible to find an infinite subset N1 of N such that

m

( ⋃k∈N1

Ek

)<

12.

In the same way, if {Ji}i∈N is a sequence of pairwise disjoint infinite subsets ofN1 \ {min N1}, it is possible to find an infinite subset N2 of N1 \ {min N1} suchthat

m

( ⋃k∈N2

Ek

)<

122

.

In this way, we construct, by induction, a decreasing sequence {Ni}i∈N of infinitesubsets of N such that

Ni+1 ⊆ Ni \ {min Ni}, m

( ⋃k∈Ni

Ek

)<

12i

for every i ∈ N.

Let ki = min Ni and let R′ be the set{X ∈ R : there exists I ⊆ N such that X =

⋃i∈I

Eki

}.(4)

We claim that R′ is a ring with the SCP. It is clear that the supremum oftwo elements of R′ belongs to R′. Let X1,X2 be two elements of R′ such thatX2 ⊆ X2. Then there exist I1 and I2 subsets of N such that

Xp =⋃

j∈Ip

Ekjfor every p ∈ N.

Then we haveX1 \ X2 =

⋃j∈I1\I2

Ekj∈ R,

Matrix method approach to Cafiero theorem 123

i.e., X1 \ X2 ∈ R′. Therefore R′ is a ring. Let {Xp}p∈N be a disjoint sequenceof elements of R′, then there exists a disjoint sequence {Ip}p∈N of subsets of N

such thatXp =

⋃j∈Ip

Ekj.

By the property of SCP of R there exists a subsequence {Xpr}r∈N of {Xp}p∈N

such that ⋃r∈N

Xpr=

⋃j∈∪r∈NIpr

Ekj

belongs to R and then also to R′ that the restriction of m to R′ is ordercontinuous is proved in the same way as it was proved in the case of the σ-ring,see de Lucia, Pap (2002). �

We shall call the ring R′ defined by (4) the SCP-ring generated by {Ekn}.

Lemma 3.3. [Drewnowski lemma for additive set functions] Let R be a SCP-ring. If µi : R → R is a sequence of exhaustive additive set functions and {En}is a sequence of pairwise disjoint sets from R, then there exists a subsequence{Ekn

}n∈N of {En}n∈N such that µi is countable additive on the SCP-ring R′

generated by {Ekn}n∈N.

Proof. Let for every n ∈ N denote by |µn| the total variation of µn. We introducethe set function m : R → R by

m =∑n∈N

12n

|µn|1 + Mn

,

where Mn = sup{|µn|(A) : A ∈ R}. Since the function m satisfies the conditionsof Drewnowski lemma 3.2 there exists a SCP-ring R′ generated by a subsequence{Ekn

}n∈N of {En}n∈N such that the restriction of m to R′ is order continuous.Then it easily follows that the restrictions of |µn| to R′ are order continuousand therefore every µn is countable additive on R′. �

We will generalize Theorem 2.5 to the additive case.

Theorem 3.4. [Cafiero theorem for additive set functions] Let R be an SCP-ring. A sequence {µn}n∈N of finite additive bounded set functions defined on Ris uniformly exhaustive if and only if the following condition holdsα) for every sequence {En}n∈N of pairwise disjoint elements of R and everyε > 0 there exist k, n0 ∈ N such that

|µn(Ek)| < ε for every n ≥ n0.

Proof. Suppose that the {µn}n∈N are not uniformly exhaustive. Then thereexists a disjoint sequence {Ei}i∈N of R such that limn→∞ µn(Ei) = 0 but not

124 P. de Lucia, E. Pap

uniformly in n. Then there exists ε > 0 such that we can construct a subsequenceof {Ei}i∈N and a subsequence of {µn}n∈N, that for simplicity, we will denoteyet by the same symbols so that

| µn(En) |> ε for every n ∈ N.(5)

By Drewnowski lemma 3.3 there exists a subsequence {Eik}k∈N of {Ei}i∈N such

that if R′ is a SCP-ring generated by {Eik}k∈N the restriction of µn to R′ are

σ-additive. From Theorem 3.4 it follows that these restrictions are uniformlyexhaustive but by (5) we have

| µik(Eik

) |> ε for every k ∈ N.

A contradiction. �

4. Applications

4.1. Nikodym convergence theorem

Theorem 4.1. [Nikodym convergence theorem] Let R be an SCP-ring. Let{µn}n∈N be a pointwise convergent sequence of countable additive measures de-fined on R, i.e.,

limn→∞µn(E) = µ(E), E ∈ Σ,(6)

then

(i) {µn}n∈N converges to a countable additive measure µ,

(ii) {µn}n∈N is uniformly σ-additive.

Proof. We consider first a special case. If {µn}n∈N is pointwise convergent tozero then condition α) in Theorem 2.5 is satisfied. Then {µn}n∈N is uniformlyexhaustive and, by Proposition 2.3, it is uniformly σ-additive.

The general case for (ii), i.e., under the condition (6), it easily follows bythe fact that by (6) {µn(E)}n∈N is a Cauchy sequence. Namely, suppose that(ii) does not hold for {µn}n∈N, i.e., that there is a sequence of pairwise disjointsets {En}n∈N from Σ, a subsequence {µkn

}n∈N of {µn}n∈N and ε > 0 such that| µkn

(Ekn) |≥ 2ε. By exhaustivity of µkn

there exists a subsequence {pn}n∈N

of {kn}n∈N such that | µpn(Epn+1) |≤ ε. Taking mn = µpn+1 − µpn

we ob-tain a sequence {mn}n∈N of countable additive set functions which is pointwiseconvergent to zero and therefore by the previously proved part it is uniformlycountable additive, but this is in contradiction with

| mn(Epn+1) | ≥ | µpn+1(Epn+1) | − | µpn(Epn+1) | ≥ ε

Matrix method approach to Cafiero theorem 125

for all n ∈ N.

To prove (i), we have to use (ii). Namely, by (ii) we have

µ

∞⋃

j=1

Ej

= lim

i→∞µi

∞⋃

j=1

Ej

= limi→∞

limn→∞

n∑j=1

µi(Ej)

= limn→∞µ

n⋃

j=1

Ej

=∞∑

j=1

µ(Ej).

4.2. Brooks-Jewett theorem and related results

A generalization of the Nikodym convergence theorem was obtained byBrooks and Jewett.

Theorem 4.2. [Brooks-Jewett] Let R be an SCP-ring. A pointwise conver-gent sequence {mn}n∈N of finitely additive scalar and exhaustive set functions(strongly additive) defined on an R, i.e., limn→∞ mn(E) = m(E), E ∈ R,

(i) converges to an additive and exhaustive set function m,

(ii) {mn}n∈N is uniformly exhaustive.

Proof. If {mn}n∈N is pointwise convergent to 0 then the condition α) of Theorem3.4 is verified and so in this special case (ii) is true. The general case for (ii)follows in the same manner as in the proof of Nikodym theorem.

Then (i) follows by (ii)

limj→∞

m(Ej) = limj→∞

limi→∞

mi(Ej)

= limi→∞

limj→∞

mi(Ej)

= 0. �

Theorem 4.3. [Nikodym boundedness theorem for additive case] Let R be anSCP-ring. A family M of finitely additive bounded set functions m, defined on

126 P. de Lucia, E. Pap

an R, which is pointwise bounded, i.e., for each E ∈ R there exists ME > 0such that

|m(E)| < ME (m ∈ M),

is uniformly bounded, i.e., there exist M > 0 such that

|m(E)| < M (m ∈ M, E ∈ R)

The proof is the same as the proof of Nikodym boundedness theorem, onlyusing Brooks-Jewett theorem 4.2 instead of Nikodym convergence theorem (seede Lucia, Pap [10]). �

Acknowledgement. The second author wants to acknowledge partial financialsupport of the Project MNTRS-1866.

References

[1] Antosik, P., Swartz, C., Matrix Methods in Analysis. Vol. 67 of Lecture Notes inMath. 1113, pp. 1294–1298, Springer Verlag, Heidelberg, 1985.

[2] Cacciopoli, R., Integrali improprii di Stieltjes. Estensione del teorema di Vitali.Rend. Acc. Sc. Fis. Mat. Napoli 35(4) (1928), 34–40.

[3] Cafiero, F., Sulle famiglie di funzioni additive d’insieme uniformemente continue.Rend. Accad. Lincei., 12(8) (1952), 155–162.

[4] Cafiero, F., Sull’ uniforme additivita. Symposia Mathematica, 2 (1968), 265–280.

[5] Constantinescu, C., Duality in Measure Theory. Lecture Notes in Math. 796,Springer Verlag, 1980.

[6] Constantinescu, C., On Nikodym’s boundedness theorem. Libertas Math., 1(1981), 51–73.

[7] d’Andrea, A. B., de Lucia, P., Su passaggio al limite sotto il segno di integraleper funzioni a valori in un gruppo topologico. Le Matematiche, 14 (1979), 56–73.

[8] d’Andrea, A. B., de Lucia, P., The Brooks-Jewett Theorem on an OrthomodularLattice. J. Math. Anal. and Appl., 154 (1991), 507–522.

[9] de Lucia, P., Funzioni finitamente additive a valori in un gruppo topologico.Pitagora Editrice, Bologna, 1985.

[10] de Lucia, P., Pap, E., Convergence Theorems for Set Functions. In: Handbookof Measure Theory (eds. E. Pap), pp. 125–178, North-Holland, 2002.

[11] de Lucia, P., Salvati, S., A Cafiero characterization of uniform s-boundedness.Rend. del Circolo Mat. di Palermo, Sup II 40 (1996), 121–128.

[12] de Lucia, P., Traynor, T., Non-commutative group valued measures on an ortho-modular poset. Math. Japonica 40 (1994), 309–315.

Matrix method approach to Cafiero theorem 127

[13] Diestel, J. J., Uhl, J. J., Vector measures. Math. Surveys 15, Amer. Math. Soc.(Providence R.I.), 1977.

[14] Drewnowski, L., Equivalence of Brooks-Jelwett, Vitali-Hahn-Saks and NikodymTheorems. Bull. Acad. Polon. Ser. Sci. Math. Astronom. Phys., 20 (1972), 725–731.

[15] Dubrovskii (Doubrovsky), V.M., On some properties of completely additive setfunctions and their applications to generalization of a theorem of Lebesgue (Rus-sian). Math. Sbornik (N.S.) 20(62) (1947), 327–329.

[16] Freniche, F.J., The Vitali-Hahn-Saks theorem for Boolean algebras with the sub-sequential interpolation property. Proc. Amer. Math. Soc., 92 (1984), 262–266.

[17] Haydon, R., A non-reflexive Grothendick space that does not contain �∞. IsraelMath. J., 40 (1981), 65–73.

[18] Mikusinski, J., A theorem on vector matrices and its applications in measuretheory and functional analysis. Bull. Acad Polon. Sci. Ser. Math., 18 (1970),193–196.

[19] Pap, E., A generalization of the Diagonal theorem on a block-matrix. Mat. Ves.,11(26) (1974), 66–71.

[20] Pap, E., Functional Analysis (Sequential convergences. Some principles of func-tional analysis) (with Summary in English), Novi Sad, 1982.

[21] Pap, E., Null-Additive Set Functions. Kluwer Academic Publishers, Dordrechtand Ister Science, Bratislava, 1995.

[22] Rickart, C.E., Integration in a convex linear topological space. Trans. Amer.Math. Soc., 52 (1942), 498–521.

[23] Swartz, C., Infinite matrices and the gliding hump. World Scientific PublishingCo., Inc., River Edge, NJ, 1996.

[24] Traynor, T., A diagonal theorem in non-commutative groups and its conse-quences. Ricerche di Mat., 41(1) (1992), 77–87.

[25] Weber, H., Compactness in spaces of group valued contents, the Vitali-Hahn-Saks theorem and Nikodym’s boundedness theorem. Rocky Mountain J. Math.,16 (1986), 253–275.

[26] Weber, H., A diagonal theorem. Answer to a question of Antosik. Bull. Acad.Polon. Sci., 41 (1993), 95–102.

Received by the editors December 12, 2002