Jump to ContentJump to Main Navigation
Show Summary Details
More options …

Open Mathematics

formerly Central European Journal of Mathematics

Editor-in-Chief: Vespri, Vincenzo / Marano, Salvatore Angelo

IMPACT FACTOR 2018: 0.726
5-year IMPACT FACTOR: 0.869

CiteScore 2018: 0.90

SCImago Journal Rank (SJR) 2018: 0.323
Source Normalized Impact per Paper (SNIP) 2018: 0.821

Mathematical Citation Quotient (MCQ) 2018: 0.34

ICV 2018: 152.31

Open Access
See all formats and pricing
More options …
Volume 15, Issue 1


Volume 13 (2015)

Some new facts about group 𝒢 generated by the family of convergent permutations

Roman Wituła / Edyta Hetmaniok
  • Corresponding author
  • Institute of Mathematics, Silesian University of Technology, Kaszubska 23, Gliwice 44-100, Poland
  • Email
  • Other articles by this author:
  • De Gruyter OnlineGoogle Scholar
/ Damian Słota
Published Online: 2017-05-06 | DOI: https://doi.org/10.1515/math-2017-0048


The aim of this paper is to present some new and essential facts about group 𝒢 generated by the family of convergent permutations, i.e. the permutations on ℕ preserving the convergence of series of real terms. We prove that there exist permutations preserving the sum of series which do not belong to 𝒢. Additionally, we show that there exists a family G (possessing the cardinality equal to continuum) of groups of permutations on ℕ such that each one of these groups is different than 𝒢 and is composed only from the permutations preserving the sum of series. This result substantially strengthens some old Pleasants’ result.

Keywords: Convergent permutations; Divergent permutations; b-connected permutations

MSC 2010: 40A05; 05A99

1 Introduction

The family of all permutations on ℕ will be denoted by 𝔓. A permutation p∊ 𝔓 is called a convergent permutation if for every convergent series ∑ an of real terms the p-rearranged series ∑ ap(n) is convergent as well. A family of all convergent permutations will be denoted by ℭ. If we replace in the definition of convergent permutation p series ∑ an of real terms by series ∑ vn of vector terms, and even by series of normed abelian semigroup terms, the respective set of all convergent permutations will be the same as in the real series case. As Stoller [1] observed for some normed abelian groups (e.g. the p-adics) the set of permutations preserving convergence is larger than ℭ. Permutations belonging to the family 𝔇 :=𝔓\ℭ will be called the divergent permutations. A group of permutations generated by ℭ will be denoted by 𝒢. We know that 𝒢≠𝔓 (Pleasants [2, 3], see also Corollary 4.2 in Section 4).

Let A, B ∊ 𝔓. Then the following family of permutations of ℕ {pP:pAandp1B} will be denoted by A B. After Kronrod [4] and Wituła we call

  1. elements of ℭℭ–the two-sided convergent permutations,

  2. elements of ℭ𝔇–the one-sided convergent permutations,

  3. elements of 𝔇ℭ–the one-sided divergent permutations,

  4. elements of 𝔇𝔇–the two-sided divergent permutations.

The symbol ∘ denotes here the composition of subsets of 𝔓, i.e. BA={qp():=q(p()):qBandpA} for any nonempty subsets A, B of 𝔓. We say that a set A ⊂ 𝔓 is algebraically big if AA = 𝔓. For example, the family 𝔇𝔇 is only the double-sided family of permutations defined in a)–d), which is algebraically big. Moreover, we note that (see [5, 6]): GDD,G=CDDCDCCDDCCDDCCDDC=DCCDCDDCCDDCCDDCCD and CCCDDCCDDCDCCDDCCDDCCDDCCCCDDCDCCDCDDCCDDCCDDCCD We think that all these inclusions are really strict. We are working now on some details of the proof of this conjecture.

For the shortness of notation we will write qp (qp(n), respectively) instead of qp(qp(n), respectively).

By 𝔖 we denote the family of all permutations on ℕ preserving the sum of series, it means permutations p ∊ 𝔓 such that if ∑ an is the convergent series with real terms and the p-rearranged series ∑ ap(n) is also convergent then ∑ an = ∑ ap(n), i.e. the sums of both series are the same1.

The set 𝔖 is also algebraically big (Stoller [1]). More precisely Stoller proved that the set D(1):={pP:p({1,2,,n})={1,2,,n} for infinitely many nN} is algebraically big and we have 𝔇(1) ⊂ 𝔖[6]. It will be proven in Section 4 that there exists the family G (possessing the cardinality equal to continuum) of groups of permutations on ℕ such that for every GG we have G ⊂ 𝔖 and G \ 𝒢 ≠ ∅.

All subsets of family 𝔓, introduced here, are nonempty. Some basic algebraic type properties of all these and some others subsets of 𝔓 are discussed in papers [510].

2 Technical notations and auxiliary results

Let A be a nonempty subset of ℕ, let {an} denote the increasing sequence of all elements of A. Subset I of A is said to be an interval of A, providing that it has the form {an,an+1,,an+m} for some m∊ ℕ ∪ {0} and n ∊ ℕ. So, only the nonempty intervals are discussed here.

We say that two intervals I and J of the given nonempty subset A of ℕ are separated if the set IJ is not an interval of A.

Let A be a nonempty subset of ℕ and let B be a nonempty subset of A. Then the notation set B is a union of n (or of at most n, or of at least n, respectively) MSI(A) means that there exists a family 𝔍 of n (or of at most n, or of at least n, respectively) intervals of set A such that each two intervals are separated. In short we say that the family 𝔍 form n (or of at most n, or of at least n, respectively) mutually separated intervals of A.

For the given nonempty set A ⊆ ℕ we will denote by S(A) the set of all permutations of set A. Certainly we have 𝔓 = S(ℕ). In particular, Sn := S({1,2,…,n}) denotes the symmetric group of degree n for every n ∊ ℕ.

Next, for every p ∊ 𝔓 and an infinite set A ⊂ ℕ by c(p|A) we denote sup{nN: there exists an interval B of A such that the set p(B) is a union of nMSI(p(A))}.(1) Instead of c(p|) we will write c(p) for every p ∊ 𝔓. We know (see [11, 12]) that permutation p ∊ 𝔓 is a convergent permutation if and only if c(p) ∊ ℕ (for the other characterizations of convergent permutations on ℕ see also [13]).

Furthermore, if A ⊂ ℕ and both sets A and its complement are infinite then for every p ∊ 𝔓 such that p(A) = A we get that p is a convergent permutation on A (which by definition means that if the given real series ∑nA an is convergent then also the respective p-rearranged series ∑nA ap(n) is convergent) if and only if c(p |A) ∊ ℕ (the value of c(p|A) is defined by (1)). The family of all convergent permutations p ∊ 𝔓 on A such that p(A) = A will be denoted by ℭ(A). The complement of ℭ(A) to the set {p ∊ 𝔓 : p(A) = A} will be denoted by 𝔇(A).

The symbol ∑(p) denotes the convergence class of permutation p, i.e. the family of all convergent real series ∑ an for which the p-rearranged series ∑ ap(n) is also convergent. We note that the following fundamental results hold true.

Theorem 2.1

(Fundamental Theorem for Inclusion Relation Between the Convergence Classes). Let p, q ∊ 𝔓. If ∑(p) ⊂ ∑(q) then for every infinite set A ⊆ ℕ we have ifc(p|p1(A))<thenc(q|q1(A))<. If equality ∑(p) = ∑(q) holds then for every infinite set A ⊆ ℕ the following relations are satisfied:

either c(p|p−1(A))<∞ and c(q|q−1(A))<∞,

or both values c(p|p−1(A)) and c(q|q−1(A)) are simultaneously infinite.

If A⊂ ℕ and both sets A and its complement are infinite, and p(A) = q(A) = A, p ∊ 𝔇(A), q ∊ ℭ(A), then either ∑(p) ⊆∑(q) or ∑(p)\∑(q)≠∅ and ∑(q)\∑(p)≠∅ (we say in this case that p and q are incomparable). Moreover, the respective permutations p, q could be always chosen to be incomparable.

At last, if there exist two disjoint infinite sets A, B ⊂ ℕ such that c(p|p1(A))<,c(q|q1(A))=,c(p|p1(B))=andc(q|q1(B))< then the permutations p and q are incomparable.

If additionally we suppose that there exist a partition {In}n=1 of ℕ, created from the successive intervals of ℕ, such that p(In)=q(In)=In for every n ∊ ℕ (which implies that p and q belong to 𝔇(1)) and if there exists an infinite set A ⊆ ℕ such that pDnAIn,qCnAIn, and sup{k:thereexistsanintervalIofnFAInsuchthateachofthesetsp(I)q(I)andq(I)p(I)isaunionofatmostkMSI}<,(2) then ∑(p) ⊂ ∑(q) (the strict inclusion holds here).

Detailed proof of Theorem 2.1 will be omitted here since it can be easily deduced from the definitions of concepts used in here.

We would like to make one more remark. The Reader can feel a great deficiency about the sufficient conditions given in the last part of Theorem 2.1, which implies that inclusion ∑(p) ⊂ ∑(q) can be satisfied (however these conditions are very useful in analysis of permutations presented in other places of the paper). We will additionally respond to these doubts in such a way that it is impossible to obtain this inclusion under very general assumptions, because in paper [15] we will present the example of set A ⊂ ℕ such that this set and its complement are both infinite and of the respective permutations p, q ∊ 𝔇 such that c(p|p1(A))<,c(q|q1(A))=,c(p|p1(NA))< and c(q|q1(NA))<. Nevertheless, permutations p and q are incomparable.

Definition 2.2

The family S, having the power of continuum, of increasing sequences of positive integers will be called the Sierpiński family if for any a, bS, a={an}n=1,b={bn}n=1, the sets of values of a and b are almost disjoint, i.e. there exists k ∊ ℕ such that ambn for all m, n ∊ ℕ, m, nk, whenever ab.

Definition 2.3

Let b, n ∊ ℕ. We say that a permutation ρ, belonging to Sn, is b-connected if for each interval I ⊆ [1, n] the image ρ(I) is the union of at most b MSI.

Definition 2.4

By the symbol Sn(k, b), for b, n, k ∊ ℕ, we will denote the family of all permutations pSn which can be presented in the form of composition of k permutations belonging to Sn, it means in the form p = qk qk−1q1, where qjSn, i = 1, 2, k, and, simultaneously, qiandqj1arethebconnectedpermutations either for any indices i ∊ 2ℕ and j ∊ (2ℕ−1) or for any indices i ∊ (2ℕ−1) and j ∊ 2ℕ, such that i, jk.

The following lemma, coming from paper [2], gives an estimation of the number of b-connected permutations belonging to group Sn.

Lemma 2.5

The number of b-connected permutations belonging to group Sn is majorized by (8b In n)2bn. In the sequel we obtain card Sn(k,b)2(8blnn)2bnk.

3 Some algebraic facts on the family 𝔓 \ 𝒢

Let us start with two results of technical character.

Lemma 3.1

Let G ⊂ 𝔓 be a group of permutations. If q, p, pn ∊ 𝔓 \ G for some n ∊ ℕ, n ≥ 2, then for every k ∊ ℕ, k < n, we have either pk q ∊ 𝔓 \ G or pnk q ∊ 𝔓 \ G.


Suppose that for some k < n we have pkqGandpnkqG. Hence, also pn = (pnk q)(q−1pk) = (pnkq)(pkq)−1G which is impossible. □

Lemma 3.2

Let G ⊂ 𝔓 be a group of permutations. Then the following relations hold true

  1. (PG)1=PG,

  2. {g}(PG)=(PG){g}=PG for every gG,

  3. G(PG)(PG).

  4. If there exists g ∊ 𝔓 \ G such that also g2 ∊ 𝔓 \ G, then 𝔓 \ G is the algebraically big subset of 𝔓. Moreover, for any φ, ψ ∊ 𝔓 \ G at least one of the compositions gφ, ψg or ψφ also belongs to 𝔓 \ G. Furthermore, either gφ∊ 𝔓 \ G or g−1 φ∊ 𝔓 \ G, and either φg ∊ 𝔓 \ G or φg−1 ∊ 𝔓 \ G.


Since G is a group, therefore relations i) and ii) are obvious. Let yG, g∊ 𝔓 \ G. Then also g−1 ∊ 𝔓 \ G which implies that γ = (γg)g−1 ∊(𝔓 \ G)∘(𝔓 \ G), i.e. relation iii) holds. If φ∊ 𝔓 \ G and additionally g2 ∊ 𝔓 \ G, then by Lemma 3.1 either φg ∊ 𝔓 \ G or φg−1 ∊ 𝔓 \ G which implies φ = (φg)g−1 = (φg−1)g ∊ (𝔓 \ G)∘(𝔓 \ G), i.e. 𝔓 \ G⊂(𝔓 \ G)∘(𝔓 \ G) and by iii) relation 𝔓 = (𝔓 \ G) ∘(𝔓 \ G) holds.

Suppose that , ψg and ψφ all belong to G. Then also g2=gφ(ψφ)1ψgG, which gives the contradiction.  □

Corollary 3.3

All three relations i) - iii) hold for the group 𝒢.

We prove that by item iv) of Lemma 3.2 the set 𝔓 \ 𝒢 is the algebraically big subset of 𝔓. To this aim we need a special case (k = 3) of the following intriguing result.

Theorem 3.4

For every k ∈ ℕ, k > 1, equation pk = id possesses the solution p ∈ 𝔓∖ 𝒢 such that pi ∈ 𝔓 ∖ 𝒢 for every i = 1, 2, …k – 1.


From Lemma 2.5 and the Stirling formula [14] we get that there exists an increasing sequence of natural numbers {n(u) : u ∈ ℕ} such that Sn(u)Sn(u)(u, u) ≠ ∅ for every u ∈ ℕ. Let p~u(Sn(u)Sn(u)(u,u)) for every u ∈ ℕ.

Let us fix k ∈ ℕ, k > 1, and let {Iu} be the increasing sequence of intervals (which means that i < j for any iIu, jIu + 1, u ∈ ℕ) forming a partition of ℕ and satisfying condition card Iu = kn(u), for every u ∈ ℕ. Let us put Ju=[(k2)n(u)+minIu,(k1)n(u)+minIu] for u ∈ ℕ.

The expected permutation p is defined in the following way p(in(u)+j+minIu)=(i+1)n(u)+j+minIu,p((k2)n(u)+j+minIu)=(k1)n(u)+p~u(j+1)1+minIu,p((k1)n(u)+j+minIu)=p~u1(j+1)1+minIu, for i = 0, 1, …, k – 3 and j = 0, 1,…, n(u) − 1.

The verification of condition pk = id is trivial, whereas the fact that pi ∈ (𝔓 ∖ G) for every i = 1, 2, …,k − 1 is a consequence of the fact that composition of the following three mappings: the increasing mapping of interval [1, n(u)] onto interval Ju, the restriction of p to interval Ju and the increasing mapping of interval [(k − 1)n(u) + min Iu, max Iu] onto interval [1, n(u)], is equal to p~u for every u ∈ ℕ.

Now, let us suppose that there exist permutations pi ∈ 𝔓, i = 1, 2, …, n, such that p=pnpn1p1 and eitherpiCorpi1C, for every i = 1, 2, …,n.

Let J be an interval of natural numbers. We denote by pJ and pi,J the restrictions of permutations p and pi, respectively, to sets J and pi1pi2p1p0(J), respectively, for each i = 1, 2, …,n, where p0 := id. Then the following decomposition holds qn,Jpjq1,J1=(qn,Jpn,Jqn1,J1)(qn1,Jpn1,Jqn2,J1)(q2,Jp2,Jq1,J1)(q1,Jp1,Jq0,J1),(3) where qi,J, 1 ≤ in, is the increasing mapping of set pipi − 1p1(J) onto interval [1, card (J)] and q0,J := id.

Let us notice that for each i = 1, 2, …,n we have qi,J pi,J qi1,J1Scard(J) and this is the b–connected permutation for b = c(pi) or b = c( pi1), depending on the fact whether pi ∈ ℭ or pi1 ∈ ℭ. Justification is needed only for the last property.

So let us suppose that there exists 1 ≤ in such that pi ∈ ℭ and simultaneously ξ = qi,Jpi,J qi1,J1 is not the b–connected permutation. Then there exists subinterval Λ of interval [1, card (J)] such that the set ξ(Λ) is a union of at least (b + 1) MSI. Let 𝔍 be the family of mutually separated intervals of natural numbers forming the decomposition of set ξ(Λ) . Auxiliarly we take α=minqi1,J1(Λ)andβ=maxqi1,J1(Λ).

Then from the fact that qi1,J1 is the increasing mapping we get the following relations α=qi1,J1(minΛ)andβ=qi1,J1(maxΛ)(4) and [α,β]qi1,J1([1,card(J)])=qi1,J1(Λ).(5)

Let us notice one more property. For any Θ, Ξ ∈ 𝔍, Θ ≠ Ξ, ifqi,J1(Θ)<qi,J1(Ξ) then the following relation holds(maxqi,J1(Θ),minqi,J1(Ξ))piqi,J1([1,card(J)]).(6)

From the relations (4), (5) and (6) we are able to deduce that the set pi([α, β]), as well as the set ξ(Λ), is the union of at least (b + 1)MSI, since the numbers from the set pi([α, β] ∖ qi1,J1(Λ)) “do not fill” completely all the“holes” between sets qi,J1(Θ) and qi,J1(Ξ) for any Θ, Ξ ∈ 𝔍, Θ ≠ Ξ. Thereby we get the contradiction with definition of number b and, in consequence, with the assumption that ξ is not the b–connected permutation.

Thus, if we assume that v>n+max1in{c(qi):qi=pi if piC,qi=pi1otherwise} then pu = qn,J pJ q1,J1Sn(u)(u, u) for J = Ju and for every u ∈ ℕ, u > v, which contradicts the assumption.□

Corollary 3.5

The set 𝔓 ∖ 𝒢 is algebraically big.

Referring to Theorem 3.4, as well as to item iv) of Lemma 3.2, we present one more important result.

Theorem 3.6

Let p ∈ 𝔓 ∖ 𝒢. If also p2 ∈ 𝔓 ∖ 𝒢, then there exists a familyp ⊂ 𝔓 ∖ 𝒢 such that card ℬp = 𝔠 and for every q ∈ ℬp we have pqCandqpC.

The proof of this result is based on the following unexpected result, a proof of which will be presented in paper [16], since we have received this result exactly in the course of preparing this paper. Thus, the proof of Theorem 3.6 is the next point of its application.

Theorem 3.7

For every p ∈ 𝔇 there exist a family 𝒜p ⊂ ℭ × ℭ satisfying the following conditions:

  1. card 𝒜p = 𝔠,

  2. for every (σ, δ) ∈ 𝒜p we have σ p = pδ ∈ 𝔇,

  3. if (σ, δ), (φ, ψ) ∈ 𝒜p and (σ, δ) ≠ (φ, ψ), then σφ and δψ.

Proof of Theorem 3.6

By item i) of Lemma 3.2 we have p– 1 ∈ 𝔓 ∖ 𝒢. Thus, from Theorem 3.7 there exists a family 𝒜p – 1 ⊂ ℭ × ℭ possessing the respective properties i) –iii) given above. In the sequel, if (σ, δ) ∈ 𝒜p – 1 then σ p– 1 = p– 1δ ∈ 𝔓 ∖ 𝒢, because of item ii) of Lemma 3.2 and p(p1δ)=δCand(σp1)p=σC.

It is sufficient to set Bp:={σp1:(σ,δ)Ap1}.

We get card ℬp = 𝔠 because of the condition iii) of Theorem 3.7. □

Let us finish this section with one more result concerning the semigroups with one generator.

Proposition 3.8

Let GS ⊂ 𝔓. Let us suppose that G is a group of permutations and S is a semigroup of permutations such that (SG)– 1S = ∅. Then for any two p, qSG the relation pqSG is true as well.

In the sequel, we obtain {pn : n ∈ ℕ} ⊂ SG and {pn : n ∈ ℕ} ⊂ 𝔓 ∖ S.


Let p, qSG. If pqG then p– 1 = q(pq)– 1S which is impossible. Similarly, if pnS for some n ∈ ℕ then also p– 1 = pn − 1(pn) ∈ S which again contradicts the assumptions. □

Corollary 3.9

Proposition 3.8 holds for the following examples of pairs (G, S) : G=CCandS=C,G=JCCandS=JC,G=JGandS=G,G=FinandS=CCS=C, where symbol Fin denotes the family of all almost everywhere identical permutations p ∈ 𝔓, whereas 𝔍 (see[7]) denotes the family of all permutations p ∈ 𝔓 for which there exists a finite partition N1, N2, …,Nk of setsuch that all restrictions p|Ni, i = 1, 2, …, k are the increasing mappings. We note that ℭ ∩ (𝔓 ∖ 𝔍) ≠ ∅, i.e., 𝒢 ∩ (𝔓 ∖ 𝔍) ≠ ∅ (the respective example can be easily created).

4 Decomposition of the family 𝔇(1) and generalization of Pleasants’ result

Let {nk}k=1 be an increasing sequence of positive integers such that limsupk(nk+1nk)= and n1 = 1. Then we denote by G( {nk}k=1) the family of all permutations p ∈ 𝔓 defined in the following way p|[nk,nk+1)Snk+1nk, for every k ∈ ℕ, which by definition means that p([nk,nk+1))=[nk,nk+1) and qkSnk+1nk, where qk(i) := p(nk + i − 1) for every i = 1, 2, …,nk + 1nk and k ∈ ℕ.

We note the following facts.

Theorem 4.1

The family G:=G({nk}k=1) is the group of permutations onsatisfying the following conditions

  1. G ∩ 𝔇 = G ∩ 𝔇(1) and G ∖ 𝔇(1) ⊂ ℭ,

  2. G ⊂ 𝔖,

  3. G ∩ ℭℭ ≠ ∅, G ∩ ℭ𝔇 ≠ ∅, G ∩ 𝔇ℭ ≠ ∅ and G ∩ 𝔇𝔇 ≠ ∅,

  4. G ∖ 𝒢 ≠ ∅.

Corollary 4.2

(P.A.B. Pleasants [2]). We have𝒢 ≠ 𝔓.

Corollary 4.3

We have 𝔖 ≠ 𝒢.

Remark 4.4

Corollary 4.3 results also from two following facts: Stollers result saying that 𝔇(1) is algebraically big which implies that 𝔖 is algebraically big andfrom Corollary 4.2 (𝒢 is a group, so 𝒢∘𝒢 = 𝒢).

Proof of Theorem 4.1

  1. The first equality follows from the fact that p([1,nk))=[1,nk), for every k ∈ ℕ.

  2. This inclusion is obvious (see [6]).

  3. First we note that idG ∩ ℭℭ. Next let us choose the infinite set K ⊂ ℕ of indices such that limKk(nk+1nk)=(7) and nk+1nk3, for every kK.

    Let us set p| = id, where I:=kNK[nk,nk+1) and p(nk1+i)=nk1+2i, for every i = 1, 2, …,⌊(nk + 1nk + 1)/2⌋, and p is the increasing mapping of interval (⌊(nk + 1nk + 1)/2⌋, nk + 1) onto set (nk+1,nk]p([nk,nk1+(nk+1nk+1)/2]) for every kK. From (7) it follows that p ∈ ℭ𝔇 ∩ G. Certainly we have p– 1 ∈ 𝔇ℭ ∩ G.

    Let K1 and K2 form a partition of the set K such that both of them are infinite. Now if we put q(i)=p(i)fori[nk,nk+1)andkK1,p1(i)fori[nk,nk+1)andkK2, where p is defined as above and q(j) = j for j ∈ ℐ, then we get q ∈ 𝔇𝔇 ∩ G.

  4. Let us fix the increasing sequence {kn}n=1 of positive integers such that SnSn(u,u),(8) for every u = 1, 2, …, where n := nku + 1nku. Let us also fix PuSnSn(u,u), for every u = 1, 2, …, and define p(i)=pu(i) for every i ∈ [nku, nku + 1) and u = 1, 2, …, Further, we set p = idN where N:=NuN[nku,nku+1). Certainly pG. We intend to prove that p ∉ 𝒢. Condition (8) implies that p is not a composition of the form q11q2qu(1)u, either q1q21qu(1)u1, of permutations qi ∈ ℭ such that c(qi) ≤ u for i = 1, 2, …, u for each u ∈ ℕ, which in view of definition of the group generated by the given set of generators means that p∉ 𝒢.

The following last result of this paper could be deduced from the proof of Theorem 4.1 on the basis of its proof.

Theorem 4.5

There exists a family {Gx : x ∈ ℝ} of subgroups of 𝔓 satisfying conditions i) – iv) of Theorem 4.1. Moreover, for every pair x, y ∈ ℝ, xy, there exist the subsets GxGx and GyGy, both having the power of continuum and such that any two permutations pGx and qGy are incomparable which means that the following relations hold (p)(q)and(q)(p).(9)


First we fix a Sierpiński’s family S of increasing sequences of positive integers. We can also suppose that if {nk}k=1S then limk(nk+1nk)=.

Next, with each {nk}k=1S we connect a family G({nk}k=1)G({nk}k=1) defined in the following way. Firstly, for every divergent permutation p on ℕ we set q(nk)=np(k),kN, and q|I=idI,whereI=N{nk}k=1.

Secondly, let us define G′ to be the family of all permutations q defined in this way. Certainly we have q|{nk}k=1D({nk}k=1) for every {nk}k=1S and permutation p ∈ 𝔇, and since any two different sequences {nk}k=1 and {ml}l=1 from S are almost disjoint we get the relations (φ)(q)and(q)(φ) which hold for any two qG({nk}k=1) and φG({ml}l=1). Both these families G′ possess the power of continuum since card 𝔇 = 𝔠.

The above relations from the Theorem 2.1 can be deduced. □

Reflection about Theorem 4.5

Why this result is so important to us? Because in our considerations we do not want to get away from the roots of our research. We succeeded in this theorem to give the analytical weight to the distinguished subgroups of group 𝔓 differentiating these subgroups. It is certainly the incomparability relation of permutations related to their convergence classes. We think that this phenomenon is valuable because the excessive algebraization of this research may deprive it of the natural power and inquisitiveness resulting from its connection with the theory of series.


  • [1]

    Stoller G.S, The convergence – preserving rearrangements of real infinite series, Pacific J. Math., 1977, 73, 227–231 CrossrefGoogle Scholar

  • [2]

    Pleasants P.A.B., Rearrangements that preserve convergence, J. Lond. Math. Soc., II. Ser., 1977, 15, 134–142 Google Scholar

  • [3]

    Pleasants P.A.B., Addendum: Rearrangements that preserve convergence, J. Lond. Math. Soc., II. Ser., 1978, 18, 576 Google Scholar

  • [4]

    Kronrod A.S., On permutation of terms of numerical series, Mat. Sbornik 18, 1946, 60, no 2, 237–280 (in Russian) Google Scholar

  • [5]

    Wituła R., Algebraic and set-theoretical properties of some subsets of families of convergent and divergent permutations, Tatra Mt. Math. Publ., 2013, 55, 27–36 Google Scholar

  • [6]

    Wituła R., Permutation preserving the sum of rearranged real series, Centr. Eur. J. Math., 2013, 11, 956–965 Google Scholar

  • [7]

    Wituła R., The family 𝔉 of permutations of ℕ, Math. Slovaca, 2015, 65, no 6, 1457–1474 Google Scholar

  • [8]

    Wituła R., New properties of the families of convergent and divergent permutations - Part II, in: Modern Real Analysis, J. Hejduk, S. Kowalczyk, R.J. Pawlak, M. Turowska (Eds), Łódź Univ. Press, Łódź, 2015, 213–224Google Scholar

  • [9]

    Wituła R., Decompositions of permutations of ℕ with respect to the divergent permutations, in: Traditional and Present-day Topics in Real Analysis (dedicated to Professor Jan Stanisław Lipiński), M. Filipczak, E. Wagner-Bojakowska (Eds), Łódź Univ. Press, Łódź, 2013, 473–490Google Scholar

  • [10]

    Wituła R., Hetmaniok E., Słota D., New properties of the families of convergent and divergent permutations - Part I, in: Modern Real Analysis, J. Hejduk, S. Kowalczyk, R.J. Pawlak, M. Turowska (Eds), Łódź Univ. Press, Łódź, 2015, 193–211 Google Scholar

  • [11]

    Agnew R.P., Permutations preserving convergence of series, Proc. Amer. Math. Soc., 1955, 6, 563–564 CrossrefGoogle Scholar

  • [12]

    Bourbaki N., Topologie générale, Hermann, Paris, 1951 Google Scholar

  • [13]

    Levi F.W., Rearrangement of convergent series, Duke Math. J., 1946, 13, 579–585 CrossrefGoogle Scholar

  • [14]

    Rabsztyn S., Słota D., Wituła R., Gamma and beta functions, Part 1, Silesian University of Technology Press, Gliwice 2012 (in Polish) Google Scholar

  • [15]

    Wituła R., Hetmaniok E., Słota D., Examples of convergent and divergent permutations completing, finishing or opening the discussion on some problems concerning the subject of convergent and divergent permutations, in preparation Google Scholar

  • [16]

    Wituła R., The sets of permutations of ℕ determining convergence of compositions and preserving divergence of compositions, in preparation Google Scholar


  • 1

    Symbol an, depending on the context of considerations, denotes either the respective series, i.e. the sequence of partial sums k=1nakn=1, or the sum of this series if it is convergent 

About the article

Received: 2014-10-27

Accepted: 2015-11-09

Published Online: 2017-05-06

Citation Information: Open Mathematics, Volume 15, Issue 1, Pages 568–577, ISSN (Online) 2391-5455, DOI: https://doi.org/10.1515/math-2017-0048.

Export Citation

© 2017 Wituła et al.. This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License. BY-NC-ND 3.0

Comments (0)

Please log in or register to comment.
Log in