This paper investigates the properties of achievement sets of conditionally convergent series in the plane, focusing on how these sets vary with the number of Levy vectors, building on the Levy-Steinitz theorem.
Contribution
It extends the understanding of achievement sets for series with the entire plane as their sum range, analyzing their dependence on Levy vectors.
Findings
01
Achievement sets vary with the number of Levy vectors.
02
Sum range of these series is the entire plane.
03
Properties of achievement sets are characterized based on Levy vectors.
Abstract
Levy-Steinitz theorem characterize sum range of conditionally convergent series, that is a set of all its convergent rearrangements; in finitely dimensional spaces -- it is an affine subspace. An achievement of a series is a set of all its subsums. We study the properties of achievement sets of series whose sum range is the whole plane. It turns out that it varies on the number of Levy vectors of a series.
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMathematical Dynamics and Fractals · Advanced Topology and Set Theory · advanced mathematical theories
Full text
Levy-Steinitz theorem and achievement sets of conditionally convergent series on the real plane
Szymon Gła̧b
Institute of Mathematics, Łódź University of Technology,
Wólczańska 215, 93-005 Łódź, Poland
Levy-Steinitz theorem characterize sum range of conditionally convergent series, that is a set of all its convergent rearrangements; in finitely dimensional spaces – it is an affine subspace. An achievement of a series is a set of all its subsums. We study the properties of achievement sets of series whose sum range is the whole plane. It turns out that it varies on the number of Levy vectors of a series.
Key words and phrases:
achievement set, set of subsums, conditionally convergent series, sum range
2010 Mathematics Subject Classification:
Primary: 40A05 ; Secondary: 11K31
The second author has been supported by the National Science Centre Poland Grant no. DEC-2012/07/D/ST1/02087.
1. Introduction
The old result due to Riemann states that for any a∈R and for any conditionally convergent series ∑n=1∞xn of real numbers there is a permutation σ of natural numbers such that the rearrangement ∑n=1∞xσ(n) is convergent to a. This fact can be generalized to finitely dimensional spaces as follows. By SR(xn) denote the sum range of the series, that is the set of sums of all convergent rearrangements of the series ∑n=1∞xn. If ∑n=1∞xn is conditionally convergent in Rm, then the classical Levy-Steinitz Theorem states that SR(xn) is an affine subset of the underlying space. More precisely, SR(xn)=∑n=1∞xn+Γ⊥ where Γ⊥ is a subspace orthogonal to the set Γ={f∈(Rm)∗:∑n=1∞∣f(xn)∣<∞} of all functionals of series convergence. The theory of rearrangements of conditionally convergent series in Banach spaces, and further in topological vector spaces, has been developed and deeply investigated by many authors; we refer the reader to the monograph [10] for details.
An important tool to study sum range SR(xn) is a so-called Levy vector. A vector u∈R2, ∥u∥=1 is called the Levy vector of a series ∑n=1∞vn if for every ε>0 we have ∑vn∈Sε(u)∥vn∥=∞, where Sε(u)={v:⟨u,v⟩≥(1−ε)∥u∥∥v∥}. Absolutely convergent series has no Levy vectors. If ∑n=1∞xn, xn∈Rm, is conditionally convergent, then the set L(xn) of all its Levy vectors is non-empty and each closed half-sphere contains a Levy vector of ∑n=1∞xn. Moreover, the linear subspace −∑n=1∞xn+SR(xn) of Rm contains a linear space spanned by L(xn). However in general span(L(xn)) not need to be equal to −∑n=1∞xn+SR(xn); for example if xn=(n(−1)n,n(−1)n), then L(xn)={(0,1),(0,−1)} but SR(xn)=R2. From the sum range point of view there are only two types of conditionally convergent series ∑n=1∞xn on the plane R2 – those for which SR(xn) is a line and those for which SR(xn)=R2. There is the other set which can be naturally attained to a series and which can distinguish series within these two classes – the achievement set.
For a sequence (xn) in Banach space, we call the set A(xn)={∑n=1∞εnxn:(εn)∈{0,1}N}the set of subsums or the achievement set. This notion was mostly studied for absolutely summable sequences on the real line. Probably the first paper where topological properties of the achievement sets were investigated is that of Kakeya [11]. He proved that such sets can be finite sets, finite unions of compact intervals or homeomorphic to the Cantor set. His conjecture that the achievement set can be only one of these three forms was disproved by Weinstein and Shapiro [19], Ferens [6] and Guthrie and Nymann [7]. It is worth to mention that the motivation of Ferens’ paper [6] came from measure theory; namely, the Author construct purely atomic probabilistic measure the range of which is neither finite union of intervals nor homeomorphic to the Cantor sets. Topological classification of achievement sets on the real line was given by Guthrie, Nymann and Saenz [7, 16] who proved that they can be a finite set, a finite union of intervals, homeomorphic to the Cantor set or it can be a so called Cantorval (see also [4]). A Cantorval is a set homeomorphic to the union of the Cantor set and sets which are removed from the unite segment by even steps of the Cantor set construction. If underlying sequence is regular, for example multigeometric, then achievement sets are fractals. Fractal geometry of achievement sets were studied in [1, 2, 5, 13, 14, 15].
The achievement sets of conditionally convergent series of real numbers is the whole real line [4, 8, 17, 18]. Studies of achievement sets of conditionally convergent series in multidimensional spaces were initiated by us in [3]. In that paper we focused mostly on the case when ∑n=1∞xn is conditionally convergent on R2 and SR(xn) is a line. We made also a general observation that SR(xn)=Rm if and only if the closure of A(xn) equals Rm as well. There is also an example of series on the plane such that SR(xn)=R2 and A(xn) is dense and null. This paper is devoted to answer the following question. What need to be assumed on the series ∑n=1∞xn with SR(xn)=R2 to obtain A(xn)=R2? The answer depends firstly on the number of Levy vectors.
In Section 2 we show that if a series has more than two Levy vectors, then A(xn)=SR(xn)=R2. We are able to prove even more: for any a∈R2 there is an increasing sequence (nk) of indexes such that ∑k=1∞xnk is absolutely convergent to a. In symbols Aabs(xn)=R2 where Aabs(xn)={∑n=1∞εnxn:∑n=1∞εn∥xn∥<∞,εn∈{0,1}for eachn∈N}. Note that always Aabs(xn)⊂A(xn). In Section 3 we discuss the case when there are exactly two Levy vectors. We find a necessary condition for A(xn)=R2 for series ∑n=1∞xn with ∣L(xn)∣=2. We give an example of series ∑n=1∞xn with two Levy vectors and such that Aabs(xn)=A(xn)=R2. Finally in Section 4 we give an example of series such that SR(xn)=R2, ∣L(xn)∣=2 and A(xn) is a graph of a partial function, more precisely all its vertical sections have got at most one element.
The idea of using Levy vectors to analyze conditionally convergent series come to us from Klinga’s paper [12] who in turn used the ideas from Halperin’s paper [9]. Klinga used Levy vectors to study ideal version of Levy-Steinitz theorem and in the proof of the main result of [12] he distinguish between situation when a series has two Levy vectors or more than two. We found this distinction crucial in our consideration.
2. Series with more than two Levy vectors
We start this section with a simple observation.
Lemma 2.1**.**
Let (an) be a sequence of positive real numbers such that an→0 and ∑n=1∞an=∞. Let x,ε>0 and N∈N. There exists finite set of indexes F such that x−ε<∑n∈Fan<x and N<n for every n∈F.
The notion of Levy vectors was investigated by Halperin in [9] who proved the following auxiliary result.
Proposition 2.2**.**
Let ∑n=1∞vn be a conditionally convergent series on the plane.
(i)
If SR(vn)=R2, then in every closed half unite circle there is a Levy vector.
(ii)
L(vn)* is a closed subset of the unit circle.*
(iii)
u* is a Levy vector of a series ∑n=1∞vn if and only if there exists a subsequence (kn) such that vkn=αnu+wn, where (αn) is a sequence of positive real numbers tending to zero such that ∑n=1∞αn=∞ and ∑n=1∞∥wn∥<∞.*
Let us give a couple of examples to illustrate the notion of Levy vectors.
•
The series ∑n=1∞(n(−1)n,0) and ∑n=1∞(n(−1)n,n(−1)n) have one-dimensional sum ranges and therefore each of them has exactly two Levy vectors.
•
The sum range of the series ∑n=1∞(n(−1)n,n(−1)n) is the whole plane, while it has only two Levy vectors.
•
Let z∈C be a complex number such that ∣z∣=1, which is not a root of unity, that is zn=1 for every n∈N. Then ∑n=1∞nzn is a conditionally convergent series. Moreover the set of all Levy vectors of ∑n=1∞nzn is the whole unit circle.
•
Let x2n−1=(0,n(−1)n), x2n=(n(−1)n,0) for every n∈N. Then L(xn)={(0,−1),(−1,0),(0,1),(1,0)}.
•
Let x3n−2=(−3n−21,−3n−21), x3n−1=(3n−11,0), x3n=(0,3n1) for every n∈N. Then L(xn)={(−1,−1),(1,0),(0,1)}.
•
Let x3n−2=(−3n−21,−3n−21), x3n−1=(3n−11,0), x3n=(0,3n1) for every n∈N. Then L(xn)={(0,−1),(1,0),(0,1)}. Note that L(xn) is disjoint with open half space {(x,y):x<0}.
We say that H is a central open half space if H is a rotation of {(x,y):x>0}. The last example shows that the set L(xn) of Levy vectors can be disjoint with some central open half space even when the sum range of the underlying series is the whole plane.
Let v1,v2 be vectors on the plane. Put span+(v1,v2):={av1+bv2:a,b>0}. If v1,v2 are colinear, then span+(v1,v2) is the line or halfline; If v1,v2 are non-colinear, then span+(v1,v2) is the interior of the cone consisting of the points laying between half-lines {cv1:c>0} and {cv2:c>0}. From Proposition 2.2 we immediately obtain the following.
Corollary 2.3**.**
Assume that a series ∑n=1∞vn has at least three Levy vectors. Then there exists a central open half space H and u,v,w∈L(vn) such that H⊂span+(u,v)∪span+(v,w)∪L, where L is a halfline {av:a>0}.
Lemma 2.4**.**
Let ∑n=1∞xn be a conditionally convergent series with Levy vectors u,v and x∈span+(u,v).
There are δ>0, (cn) of positive numbers and a sequence of finite, pairwise disjoint sets of indexes (Pn) such that
(i)
cn<2nδ* and 21cn<cn+1<cn;*
(ii)
minPn+1>maxPn;
(iii)
∥∑k=1nyk−(1−2n1)x∥<cn* where yk=∑i∈Pkxi;*
(iv)
∑k∈Pn+1∥xk∥≤21(cn+1−2cn)+21(an+bn), where an,bn are such that x−∑k=1nyk=anu+bnv.
Proof.
Fix x∈span+(u,v), x=a0u+b0v for a0,b0>0. Let δ=min{d(x,U),d(x,V)}, where U={cu:c>0}, V={cv:c>0} and d(x,X) is a distance between a point x and a set X. We define (cn) by simple induction. Find 4δ<c1<2δ. Then take 2c1<c2<4δ and so on. Let xkn=αknuu+wknu and xmn=αmnvv+wmnv for n∈N satisfy the assertion of Proposition 2.2(iii). Moreover assume that (kn) and (mn) are disjoint. Using Lemma 2.1 we find finite sets of indexes A1⊂{kn:n∈N} and B1⊂{mn:n∈N} such that 2a0−4c1<∑n∈A1αnu<2a0, ∑n∈A1∥wnu∥<4c1, 2b0−4c1<∑n∈B1αnv<2b0 and ∑n∈B1∥wnv∥<4c1.
Observe that
[TABLE]
[TABLE]
[TABLE]
Put P1:=A1∪B1. Thus ∥y1−2x∥<c1.
Assume that we have constructed (Pk)k=1t for some t∈N. We know that ∥∑k=1tyk−(1−2t1)x∥<ct, so ∥(x−∑k=1tyk)−2t1x∥<ct<2tδ. It easy to see that min{d(2tx,U),d(2tx,V)}=2tδ, so x−∑k=1tyk∈B(2t1x,2tδ), which implies x−∑k=1tyk∈span+(u,v). Let x−∑k=1tyk=atu+btv. Let At+1⊂{kn>maxPt:n∈N} and Bt+1⊂{mn>maxPt:n∈N} be finite sets such that ∑n∈At+1∥wnu∥<4εt, ∑n∈Bt+1∥wnv∥<4εt, 2at−4εt<∑n∈At+1αnu<2at and 2bt−4εt<∑n∈Bt+1αnv<2bt where εt:=ct+1−21ct. Put Pt+1=At+1∪Bt+1. Thus
[TABLE]
[TABLE]
[TABLE]
Hence
[TABLE]
Moreover for any t∈N we have
[TABLE]
[TABLE]
∎
Theorem 2.5**.**
Let ∑n=1∞xn be a conditionally convergent series with two non-colinear Levy vectors u,v. Then span+(u,v)⊂Aabs(xn).
Proof.
Let x∈span+(u,v). Let (Pt) be the sequence of sets of indexes from the assertion of Lemma 2.4. We need to show ∑l∈⋃t=1∞Pt∥xl∥ is convergent. Note that
[TABLE]
Moreover, if α∈(0,π) is such that cos(α)=∣⟨u,v⟩∣, then for each t∈N we have
∥atu+btv∥≥∥atu−atcos(α)v∥≥at∥u−cos(α)v∥. Therefore by Lemma 2.4(iii) we obtain
[TABLE]
and consequently
[TABLE]
In similar way one can show that ∑t=1∞bt<∞. Thus by Lemma 2.4(iv)
[TABLE]
Since P1 is a finite set we have ∑l∈⋃t=1∞Pt∥xl∥<∞. Hence ∑l∈⋃t=1∞Ptxl is convergent. By Lemma 2.4(i) we know that cn→0, so by Lemma 2.4(iii) we obtain that x=∑l∈⋃t=1∞Ptxl.
∎
We show that there is a strict connection between geometry of the set of Levy vectors and geometry of Aabs(xn).
Theorem 2.6**.**
Let ∑n=1∞xn be a conditionally convergent series on the real plane. If any open half circle contains at least one Levy vector of the series, then Aabs(xn)=R2.
Proof.
Since every open half circle contains at least one Levy vector we can find three Levy vectors u,v,w of the series ∑n=1∞xn, which satisfies span(u)=span(v)=span(w)=span(u) and
[TABLE]
where span+(z)={az:a>0}. By Theorem 2.5 we have R2∖(span+(u)∪span+(v)∪span+(w))⊂Aabs(xn). Fix x∈span+(u). There exists y∈span+(u,v) such that x−y∈span+(u,w). Hence by Theorem 2.5 one can find E⊂N such that y=∑n∈Exn, where ∑n∈E∥xn∥<∞. Since an absolutely convergent series does not affect Levy vectors, we have A((xn)n∈N∖E)⊃span+(u,v)∪span+(v,w)∪span+(w,u), especially x−y=∑n∈Fxn and ∑n∈F∥xn∥<∞ for some F⊂N∖E. Hence ∑n∈E∪Fxn=∑n∈Exn+∑n∈Fxn=y+x−y=x, so x∈Aabs(xn). If x∈span+(v) or x∈span+(w) then the proof is analogous. Hence Aabs(xn)=R2.
∎
Theorem 2.7**.**
Let ∑n=1∞xn be a conditionally convergent series on the real plane with more than two Levy vectors. Then Aabs(xn)=R2.
Proof.
By Theorem 2.6 it is enough to show that for a series with L(xn)={u,−u,v}, where v∈/span(u), we have Aabs(xn)=R2. Without losing generality we may assume u=(0,1) and v∈H={(x,y):x>0}. By Theorem 2.5 and by using method of the proof of Theorem 2.6 we get inclusion H⊂Aabs(xn).
Fix x∈/H. Since A(xn)=SR(xn)=R2 one can find finite set E⊂N such that x−∑n∈Exn∈H. We have L((xn)n∈N∖E)={u,−u,v}, so Aabs((xn)n∈N∖E)⊃H. Let F⊂N∖E be such that ∑n∈Fxn=x−∑n∈Exn and ∑n∈F∥xn∥<∞. Hence ∑n∈E∪Fxn=x.
∎
3. Series with two Levy vectors
In this section we give the sufficient condition for series ∑n=1∞vn with two Levy vectors for A(vn)=R2. We call this condition as reduction property. We say that a series ∑n=1∞(xn,yn) has a reduction property if limn→∞∣xn∣∣yn∣=∞ and for every ε>0, x∈(−ε,ε), N∈N there exists a finite set of indices A={k1<k2<…<km} with k1≥N such that ∣∑n∈Axn−x∣<2ε and max1≤j≤m∣∑n=1jxkn∣<ε and max1≤j≤m∣∑n=1jykn∣<ε.
Proposition 3.1**.**
Let ∑n=1∞(xn,yn) be a series, which has the reduction property. If ∑n=1∞(xn,yn) is a conditionally convergent series, then its sum range is the whole plane, in symbols SR(xn,yn)=R2.
Proof.
Observe that ∑n=1∞xn can not be absolutely convergent, namely we get ∑n=1∞∣xn∣=∞. Indeed fix ε>0, x=43ε. Then one can find a family of pairwise disjoint finite sets of indices (At)t=1∞ with minAt+1>maxAt such that ∣∑n∈Atxn−x∣<2ε for every t∈N. We have ∑n∈At∣xn∣≥∣∑n∈Atxn∣≥x−∣∑n∈Atxn−x∣>4ε for each t∈N. Hence ∑n=1∞∣xn∣≥∑t=1∞∑n∈At∣xn∣≥∑t=1∞4ε=∞.
Since limn→∞∣xn∣∣yn∣=∞, we have ∑n=1∞∣yn∣=∞. Let f∈(R2)∗ be a convergence functional for a series ∑n=1∞(xn,yn), that is f(x,y)=ax+by for some a,b∈R and ∑n=1∞∣f(xn,yn)∣<∞. Clearly any of two cases, a=0,b=0 or a=0,b=0, leads to the contradiction. Suppose that a=0 and b=0. Let M be a natural number such that ∣xn∣∣yn∣>b2a for every n≥M. Thus ∑n=1∞∣axn+byn∣≥∑n=M∞∣axn+byn∣≥a∑n=M∞(ab∣yn∣−∣xn∣)≥a∑n=M∞∣xn∣=∞. It means that the series has only one (trivial) convergence functional, so SR(xn,yn)=R2.
∎
Theorem 3.2**.**
Assume that ∑n=1∞(xn,yn) is a conditionally convergent series, which has the reduction property. Then L(xn,yn)={(0,1),(0,−1)}.
Proof.
Suppose that (a2+b2a,a2+b2b) for some a=0, b∈R is a Levy vector of a series ∑n=1∞(xn,yn). By Proposition 2.2(iii) there exists a subseries ∑n=1∞(xkn,ykn) with limn→∞xknykn=ab. Since limn→∞∣xn∣∣yn∣=∞, we have limn→∞∣xkn∣∣ykn∣=∞, which gives us contradiction. By Proposition 2.2(i) we get L(xn,yn)={(0,1),(0,−1)}.
∎
Theorem 3.3**.**
Assume that ∑n=1∞(xn,yn) is a conditionally convergent series, which has the reduction property. Then A(xn,yn)=R2.
Proof.
Fix (a,b)∈R2 and ε>0. We will define inductively a sequence (Ai)i=0∞ of finite sets of indices Ai={k1i<k2i<…<kmii} for i∈N0 such that for every p≥1
(i)
minAp+1>maxAp;
(ii)
∣∑n∈⋃i=02p−1Aixn−a∣<2p1 and ∣∑n∈⋃i=02p−1Aiyn−b∣<2p4;
(iii)
∣∑n∈⋃i=02pAixn−a∣<2p1 and ∣∑n∈⋃i=02pAiyn−b∣<2p1 (this case holds also for p=0);
(iv)
[TABLE]
(v)
[TABLE]
By Proposition 3.1 we know that A(xn,yn)=R2, so one can find a finite set of indices A0 such that max{∣∑n∈A0xn−a∣,∣∑n∈A0yn−b∣}<1, so we get property (iii) for p=0. Assume that for some p∈N0 we have defined sets A0,A1,…,A2p satisfying properties (i)-(v).
By the reduction property applied to x=a−∑n∈∪i=02pAixn, N=maxA2p+1 there exists A2p+1={k12p+1<k22p+1<…<km2p+12p+1}⊂{N,N+1,…} such that ∣∑n∈A2p+1xn−x∣<2p+11 and max1≤j≤m2p+1∣∑n=1jxkn2p+1∣<2p1 and max1≤j≤m2p+1∣∑n=1jykn2p+1∣<2p1. We have
[TABLE]
and
[TABLE]
Moreover
[TABLE]
In simillar way we prove max1≤j≤m2p+1∣∑n∈∪i=02pAiyn+∑n=1jykn2p+1−b∣<2p+14. We have already checked (ii) and (iv).
Denote δ=∣a−∑n∈∪i=02p+1Aixn∣<2p+11 and let M=min{n>maxA2p+1:∣yk∣>1−δ2p+15∣xk∣for eachk≥n}. Since limn→∞∣xn∣∣yn∣=∞, the inequality ∣yk∣>1−δ2p+15∣xk∣ holds for all but finitely many k, so M is well defined. Observe that by Proposition 3.1 both series ∑n=1∞xn, ∑n=1∞yn are conditionally convergent. Hence ∑n=M∞yn is conditionally convergent, so one can find A2p+2={k12p+2<k22p+2<…<km2p+22p+2} with k12p+2>M such that ∣∑n∈∪i=02p+2Aiyn−b∣<2p+11 and yn for n∈A2p+2 have the same sign and
[TABLE]
for every i,j∈{0,1,…,m2p+2}, i<j. Hence
[TABLE]
and
[TABLE]
Thus
[TABLE]
and consequently
[TABLE]
which finishes the proof of properties (iii) and (v). From the construction we also obtain (i).
Conditions (ii), (iii) allows us to construct inductively the sequence (Ai)i=0∞ of finite sets with given properties. Denote ⋃i=1∞Ai={r1<r2<…}. By (iv) and (v) we get ∑n=1∞(xrn,yrn)=(a,b) and by (i) we have (a,b)∈A(xn,yn). Hence A(xn,yn)=R2.
∎
The previous theorem helps us to construct a conditionally convergent series on the plane with two Levy vectors, which achievemet set is R2. A wide class of such series can be constructed as follows.
Proposition 3.4**.**
Let (xn),(yn) be nonincreasing seqeuences of positive numbers tending to [math] such that ∑n=1∞xn=∑n=1∞yn=∞ and n→∞lim∣xn∣∣yn∣=∞.
Let v4n−3=(−x2n−1,−y2n−1),v4n−2=(−x2n−1,y2n−1),v4n−1=(x2n,y2n),v4n=(x2n,−y2n) for every n∈N. Then A(vn)=R2.
Proof.
Let ε>0, x∈(0,ε), N∈N. Let k=min{n:yn<ε} and p=max{k,N}. Since ∑n=p∞xn=∞ one can find A={k1<k2<…<km} which is a subset of (4N−1∪4N)∩[p,∞) with the property 4n−1∈A if and only if 4n∈A for every n∈N and such that 0<x−∑n∈Axn<2ε.
Recall that max1≤j≤m∣∑n=1jxkn∣=∑n∈Axn<x<ε. Moreover for each r∈N if 2r≤m then ∑n=12rykn=0 and if 2r+1≤m then ∑n=12r+1ykn=y2r+1. Hence max1≤j≤m∣∑n=1jykn∣<ε.
If x∈(−ε,0) then we take A which is a subset of (4N−3∪4N−2)∩[p,∞) with the property 4n−3∈A if and only if 4n−2∈A for every n∈N and such that 0<∑n∈Axn−x<2ε and get the same results. Hence ∑n=1∞vn has the reduction property and consequently by Theorem 3.3 we get A(vn)=R2.
∎
Example 3.5**.**
Let v2n−1=(x2n−1,y2n−1)=(n(−1)n,n(−1)n), v2n=(x2n,y2n)=(n(−1)n,n(−1)n+1) for every n∈N. Thus L(vn)={(0,1),(0,−1)}. By Proposition 3.4 we have A(vn)=R2.***
In the previous section we have given sufficient condition for a conditionally convergent series ∑n=1∞vn to have Aabs(vn)=R2, namely it needs to have three or more Levy vectors. Since Aabs(vn)⊂A(vn), we also had A(vn)=R2. Now we consider series with two Levy vectors and show that Aabs(vn) can be a strict subset of the achievement set.
Proposition 3.6**.**
Let ∑n=1∞yn be a conditionally convergent series and ∑n=1∞xn be an absolutely convergent series of positive terms. Define vn=(xn,yn), then L(vn)={(0,1),(0,−1)} and Aabs(vn)=A(vn).
Proof.
Obviously {(0,1),(0,−1)}⊂L(vn). Let ∥v∥=1 and (0,−1)=v=(0,1). Suppose that v is a Levy vector for a series ∑n=1∞vn. Hence the series ∑n=1∞∣xn∣ diverges as a sequence of projections into horizontal line of (vn), which contradicts with absolute convergence of ∑n=1∞xn.
Let ∑n=1∞vn=(x,y). Then (x,y)∈A(vn) as a limit of the series for which it is enough to take εn=1 for each n∈N. On the other hand if x=∑n=1∞εnxn then εn=1 for each n∈N is a unique representation, because all of terms of (xn) are positive. Hence ∑n=1∞εn∣yn∣=∑n=1∞∣yn∣=∞, so (x,y)∈/Aabs(vn).
∎
Below we give a simply example of a series being a mix of absolutely and conditionally convergent series.
Example 3.7**.**
Let vn=(2n1,n(−1)n) for n∈N. Then (1,−ln2)∈A(vn)∖Aabs(vn).***
It shows that it may happen that Aabs(vn)=A(vn). For a given example it easy to see that A(vn)⊂[0,1]×R. If a series ∑n=1∞vn has at least three Levy vectors, then by Theorem 2.7, A(vn)=Aabs(vn)=R2. The next example shows that A(vn)=R2 does not imply that Aabs(vn)=R2 – clearly by Theorem 2.7 the constructed example has to have exactly two Levy vectors.
Example 3.8**.**
Let n0=0, nk=4k2+nk−1 for k∈N. Let xn=4k21, yn=2k1 for n∈(nk−1,nk]. We construct (vn)=(vnx,vny) in the same way as in Proposition 3.4. Hence A(vn)=R2. We will show that Aabs(vn)=R2, more precisely Aabs(vn)∩{31}×R=∅.
Suppose to the contrary that there exists A⊂N such that ∑n∈Avnx=31 and ∑n∈A∣vny∣<∞. Then there exists k∈N such that for each m≥k set A consists of less then 2m elements vn for which ∣vnx∣=4m21 and ∣vny∣=2m1. Hence*
[TABLE]
We will prove inductively that ∑m=n+1∞4m22m<8⋅4n21 for n∈N. Note that ∑m=1∞4m22m<∑m=1∞4m2m=1. Assume that ∑m=n∞4m22m<4(n−1)21 for some n∈N. We will show that ∑m=n+1∞4m22m<8⋅4n21<4n21. We have
[TABLE]
Thus by the inductive assumption we obtain
[TABLE]
In particular we have
[TABLE]
Since ∑n∈Avnx=31, then ∣∑n∈A,∣vnx∣≥4k21vnx−31∣<8⋅4k21. Note that ∑n∈A,∣vnx∣≥4k21vnx=4k2p for some p∈Z. We have
[TABLE]
Thus min{∣4k2a−31∣:a∈Z}=3⋅4m21. Hence 3⋅4k21≤∣4k2p−31∣<8⋅4k21 which yields a contradiction.**
4. Extreme example and open problems
As we have mentioned in the Introduction this section is devoted to the construction of a series in the plane such each vertical section of its achievement set has at most one element.
We define positive real numbers x1≥x2≥…, natural numbers 0=N0<N1<N2,… inductively as follows.
First we define x1=1 and N1=1. Define δ1=1. Let n be such that 41+32nδ1=1. Put N2=N1+2n and xN1+i=2⋅42δ1+22n+i1 for i=1,…,2n. Put δ2:=min{∣∑i=N1+1N2ξixi∣:ξi∈{−1,0,1} and ξi=0 for some i}=22⋅2n1=42n1. Suppose that we have already defined N1<N2<⋯<Nk and xi for i≤Nk such that (1)–(3) hold. Let n be such that 4k+32nδk=1. Put Nk+1=Nk+2n and xNk+i=2⋅4k+1δk+22n+i1 for i=1,…,2n. Put δk+1:=min{∣∑i=Nk+1Nk+1ξixi∣:ξi∈{−1,0,1} and ξi=0 for some i}=22⋅2n1=42n1. Note that δk+1<⋅4k+2δk, ∑i=Nk−1+1Nkxi≥1 and xi<4k+1δk for i=Nk+1,…,Nk+1.
Lemma 4.1**.**
Let (εi),(εi′)∈{0,1}N be distinct and such that ∑i=1∞(−1)iεixi=∑i=1∞(−1)iεi′xi. Then
[TABLE]
for infinitely many k. Moreover, for infinitely many k
[TABLE]
Proof.
We start from proving the following.
**Claim. **Let j,k∈N be such that εj=εj′ and Nk<j≤Nk+1. Then
[TABLE]
We have
[TABLE]
where u stands for \big{|}\{i\in(N_{k},N_{k+1}]\cap 2\mathbb{N}:\varepsilon_{i}=1\}\big{|}. Similarly
[TABLE]
[TABLE]
[TABLE]
where u=\big{|}\{i\in(N_{k},N_{k+1}]\cap 2\mathbb{N}:\varepsilon_{i}^{\prime}=1\}\big{|}, w=\big{|}\{i\in(N_{k},N_{k+1}]\cap 2\mathbb{N}-1:\varepsilon_{i}=1\}\big{|} and w^{\prime}=\big{|}\{i\in(N_{k},N_{k+1}]\cap 2\mathbb{N}-1:\varepsilon^{\prime}_{i}=1\}\big{|}. Let ξi=(−1)i(εi−εi′)∈{−1,0,1}. Note that ξj=0. Thus
[TABLE]
where t is an integer and 0<δk+1=4Nk+1−Nk1≤Rk<2Nk+1−Nk1. If t=0, then
[TABLE]
If t=0, then
[TABLE]
This finishes the proof of the Claim.
Suppose on the contrary that for all but finitely many k we have
[TABLE]
Note that there is k such that
[TABLE]
for all l≥k. Indeed, if (1) holds for every l, then by the assumption there is j with εj=εj′. Let k be such that Nk<j≤Nk+1. Then by the Claim we obtain (2). If (1) holds for all but finitely many l, then find k such that (1) holds for every l≥k and
[TABLE]
Then
[TABLE]
[TABLE]
A contradiction.
The moreover part of the assertion follows from the fact that xi<4k+1δk for i∈(Nk,Nk+1].
∎
Let yi=2k1 for i∈(Nk,Nk+1]. Consider a series ∑i=1∞((−1)ixi,(−1)iyi).
Lemma 4.2**.**
Let (εi)∈{0,1}N be such that ∑i=1∞εi((−1)ixi,(−1)iyi) is convergent. Then for every (εi′)∈{0,1}N such that (εi′)=(εi) and ∑i=1∞εi(−1)ixi=∑i=1∞εi′(−1)ixi a series ∑i=1∞εi′((−1)ixi,(−1)iyi) is divergent.
Proof.
By the moreover part of Lemma 4.1 there are infinitely many k such that
[TABLE]
That means that for infinitely many k
[TABLE]
By the Cauchy condition for ∑i=1∞εi((−1)ixi,(−1)iyi) for almost all k
[TABLE]
Therefore for infinitely many k
[TABLE]
This shows that the series ∑i=1∞εi′((−1)ixi,(−1)iyi) does not fulfill the Cauchy condition.
∎
By Lemma 4.2 the series ∑i=1∞((−1)ixi,(−1)iyi) has the desired property that each vertical section of A((−1)ixi,(−1)iyi) has at most one element.
We would like to end the paper with the list of open questions.
Problem 4.3**.**
Let ∑n=1∞(xn,yn) be a conditionally convergent series on the plane with SR(xn,yn)=R2. Is the reduction property necessary for A(xn,yn)=R2?
It is sometimes hard to check the reduction property. In particular we do not know the answer for the following.
Problem 4.4**.**
Does A(n(−1)n,n(−1)n)=R2?
We have constructed two series with SR(xn)=R2 and A(xn)=R2 – the first in [3] and the second in this section. Both of them are small subset of the plane. We would like to know if this is the general phenomena.
Problem 4.5**.**
Let ∑n=1∞xn be a conditionally convergent series on the plane with SR(xn)=R2. Is it true that if A(xn)=R2, then A(xn) is a set of Lebesgue measure zero or of the first Baire category?
Suppose that ∑n=1∞xn is a series with SR(xn)=R2 and A(xn)=R2. Take a∈R2∖A(xn). Since SR(xn)=R2, there is a permutation σ of natural numbers such that ∑n=1∞xσ(n)=a. Therefore a∈A(xσ(n)). This shows that the achievement set of conditionally convergent series is not invariant under taking rearrangements. On the other hand a rearrangement does not affect Levy vectors. Therefore if ∑n=1∞xn has at least three Levy vectors, then A(xσ(n))=R2 for any permutation σ. We do not know what happens if the series has only two Levy vectors.
Problem 4.6**.**
Let ∑n=1∞xn be a conditionally convergent series on the plane such that SR(xn)=R2, A(xn)=R2 and ∣L(xn)∣=2. Is it true that A(xσ(n))=R2 for any permutation σ?
Bibliography19
The reference list from the paper itself. Each links out to its DOI / PubMed record.
1[1] T. Banakh, A. Bartoszewicz, M. Filipczak, E. Szymonik, Topological and measure properties of some self-similar sets, Topol. Methods Nonlinear Anal., 46(2) (2015), 1013–1028
2[2] A. Bartoszewicz, S. Gła̧b, Achievement sets on the plane – perturbations of geometric and multigeometric series, Chaos Solitons Fractals 77 (2015) 84–93.
3[3] A. Bartoszewicz, S. Gła̧b, J. Marchwicki, Achievement sets of conditionally convergent series, ar Xiv:1604.07575
4[4] A. Bartoszewicz, M. Filipczak, F. Prus-Wiśniowski, Topological and algebraic aspects of subsums of series. Traditional and present-day topics in real analysis, 345–366, Faculty of Mathematics and Computer Science. University of Łódź, Łódź, 2013.
5[5] A. Bartoszewicz, M. Filipczak, E. Szymonik, Multigeometric sequences and Cantorvals, Cent. Eur. J. Math. 12(7) (2014), 1000–1007.
6[6] C. Ferens, On the range of purely atomic probability measures, Studia Math. 77 (1984), 261–263.
7[7] J.A. Guthrie, J.E. Neymann, The topological structure of the set of subsums of an infinite series, Colloq. Math. 55:2 (1988), 323–327.
8[8] R. Jones, Achievement sets of sequences, Am. Math. Mon. 118:6 (2011), 508–521.