Richness of arithmetic progression in commutative semigroup
Aninda Chakraborty, Sayan Goswami

TL;DR
This paper extends the understanding of arithmetic progressions in piecewise syndetic sets within commutative semigroups, building on algebraic and combinatorial methods to generalize previous results.
Contribution
It generalizes Beiglboeck's elementary proof to broader settings of commutative semigroups, enhancing the applicability of combinatorial techniques.
Findings
Extended the elementary proof to new types of commutative semigroups
Demonstrated the presence of arithmetic progressions in broader algebraic structures
Provided a unified combinatorial framework for these results
Abstract
Furstenberg and Glasner proved that for an arbitrary k in N, any piecewise syndetic set contains k term arithmetic progressions and such collection is also piecewise syndetic in Z: They used algebraic structure of beta N. The above result was extended for arbitrary semigroups by Bergelson and Hindman, again using the structure of Stone-Cech compactification of general semigroup. Beiglboeck provided an elementary proof of the above result and asked whether the combinatorial argument in his proof can be enhanced in a way which makes it applicable to a more abstract setting. In a recent work the second author of this paper and S.Jana provided an affirmative answer to Beiglboeck's question for countable commutative semigroup. In this work we will extend the result of Beiglboeck in different type of settings.
Peer Reviews
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
TopicsLimits and Structures in Graph Theory · Advanced Topology and Set Theory · semigroups and automata theory
RICHNESS OF ARITHMATIC PROGRESSIONS IN COMMUTATIVE SEMIGROUP
ANINDA CHAKRABORTY AND SAYAN GOSWAMI
Government General Degree College at Chapra/ University of Kalyani
Department of Mathematics, University of Kalyani
Abstract.
Furstenberg and Glasner proved that for an arbitrary , any piecewise syndetic set contains term arithmetic progressions and such collection is also piecewise syndetic in They used algebraic structure of . The above result was extended for arbitrary semigroups by Bergelson and Hindman, again using the structure of Stone-Čech compactification of general semigroup. Beiglboeck provided an elementary proof of the above result and asked whether the combinatorial argument in his proof can be enhanced in a way which makes it applicable to a more abstract setting. In a recent work the second author of this paper and S.Jana provided an affirmative answer to Beiglboeck’s question for countable commutative semigroup. In this work we will extend the result of Beiglboeck in different type of settings.
The second author of the paper is supported by UGC-JRF fellowship.
1. Introduction
A subset of is called syndetic if there exists such that and it is called thick if it contains arbitrary long intervals in it. Sets which can be expressed as intersection of thick and syndetic sets are called piecewise syndetic sets. All these notions have natural generalization for arbitrary semigroups.
One of the famous Ramsey theoretic result is so called Van der Waerden’s Theorem [vdw] which states that atleast one cell of any partition of contains arithmetic progressions of arbitrary length. Since arithmetic progressions are invariant under shifts, it follows that every piecewise syndetic set contains arbitrarily long arithmetic progressions. The following theorem is due to Van der Waerden [vdw]
Theorem 1**.**
Given any , there exists , such that for any partition of , atleast one of the partition contains an length arithmetic progression.
Furstenberg and E. Glasner in [FG] algebraically and Beiglboeck in [Bel] combinatorially proved that if is a piecewise syndetic subset of and then the set of all length progressions contained in is also large. The statement is the following:
Theorem 2**.**
Let and assume that is piecewise syndetic. Then is piecewise syndetic in .
In the recent work [GJ, Theorem 6], authors have extended the technique of Beigelboeck in general commutative semigroup and proved the following:
Theorem 3**.**
Let be a commutative semigroup and be any finite subset of . Then for any piecewise syndetic set , the collection is piecewise syndetic in .
The above theorem involves more general Gallai type progression. But parallely the following problem comes from theorem 2
Problem 4**.**
Let be a countable commutative semigroup and be any piecewise syndetic subset of . Then for any , is it possible that
[TABLE]
is piecewise syndetic in .
In this moment we are unable to give complete answer to this question but we have given proof of a weak version of the theorem for countable commutative semigroup. We will also give an answer of 4 for some special kind of semigroups including divisible semigroups.
2. Proof of our results
The following lemma was proved in [BG, Lemma 4.6( I’)] for general semigroup by using algebraic structure of Stone-Čech compactification of arbitrary semigroup and in [GJ, lemma 8] for commutative semigroup by combinatorially.
Lemma 5**.**
Let and be commutative semigroups, be a homomorphism and . Then if is piecewise syndetic in and is piecewise syndetic in , implies that is piecewise syndetic in
Now we need the following useful lemma,
Lemma 6**.**
If is piecewise syndetic, then for any and ,
[TABLE]
is piecewise syndetic in .
Proof.
Let and consider the following homomorphism by . This map preserves piecewise syndeticity.
As is piecewise syndetic set, there exists a finite subset say of such that is thick and since , the set is thick. So we have is piecewise syndetic.
Now, for any , the semigroup homomorphism defined by by , is thick in and hence piecewise syndetic. So from 5, this map preserves piecewise syndeticity.
∎
The following is a weaker version of problem 4.
Theorem 7**.**
Let be any countable commutative semigroup and be piecewise syndetic in . Then for , there exists such that
[TABLE]
is piecewise syndetic in .
Proof.
Since is piecewise syndetic in , then there exists a finite subset of , such that is thick in .
Let and say and let be the Van der Waerden number.
The set of all possible length arithmetic progressions in is finite as is finite. et be the set of such progressions with (say).
Then, for any , if the set will be partitioned into cells, one of the partition will contain a -length arithmetic progression.
Consider the set It is easy to verify that is thick in .
Of course for any finite set and a translation of the set by an element (say) will be contained in . This gives the required translation of by .
Now the set can be colored in a way that we will give an element of the color if for the least , the set with the least .
Then, as we have partitioned the thick set , one of them will be piecewise syndetic. Let the set
[TABLE]
is piecewise syndetic in
Now, the set is piecewise syndetic by lemma 6 and this proves the theorem.
∎
Since for commutative semigroup it is not necessary that for any , is a piecewise syndetic in ,e.g. take any , isn’t piecewise syndetic in .
Now we are taking as the collection of all those countable commutative semigroups for which is piecewise syndetic in . Clearly includes all the divisible semigroups such as etc. and others like ,, etc. We will say a semigroup is a semigroup of class if .
Lemma 8**.**
Let be a countable commutative semigroup of class and is piecewise syndetic then for any ,
[TABLE]
is piecewise syndetic in .
Proof.
Let and define as . Then preserves piecewise syndeticity as from 5 and the fact that is piecewise syndetic in .
∎
So we have the following result:
Proposition 9**.**
Let be a countable commutative semigroup of class and be piecewise syndetic in . Then for , then
[TABLE]
is piecewise syndetic in .
In this moment we are unable to derive the above proposition for general commutative semigroup which will give an affirmtive answer of problem 4 and leave the question open.
3. Applications
The set is a commutative subsemigroup of . Using a result deduced in [BH, Theorem 3.7 (a)] it is easy to see that for any piecewise syndetic set is piecewise syndetic in . Now as a consequence of proposition 9 we will derive this result not for all but for a large class of semigroups in the following.
Corollary 10**.**
Let be a commutative semigroup then for any piecewise syndetic set , is piecewise syndetic in .
Proof.
Let us take a surjective homomorphism by, .
Then from lemma 5 the map preserves the piecewise syndeticity.
Let and from proposition 9 is piecewise syndetic in .
Now clearly, and from lemma 9 we get our required result.
This proves the claim.
∎
Now we will give a combinatorial proof of proposition 9 replacing the condition of piecewise syndeticity by Quasi-central set which is another notion of largeness and is very close to the famous central set.
A quasi-central set is genarally defined in terms of algebraic structure of . But it has an combinatorial characterisation which will be needed for our purpose, stated below.
Theorem 11**.**
[HMS*, Theorem 3.7]*For a countable semigroup , is said to be Quasi-central iff there is a decreasing sequence of subsets of such that,
* for each and each , there exists with and*
* is piecewise syndetic .*
The following lemma is essential for our result:
Lemma 12**.**
The notion of quasi-central is preserved under surjective semigroup homorphism
Proof.
Let be a surjective semigroup homomorphism. Let be quasi-central in and then the following holds as in property 1 in theorem 11.
[TABLE]
Now in consider the following sequence,
[TABLE]
and due to surjectivity of , and are piecewise syndetic.
Choose for some and then there exists some such that and consider the set . Now as for some , we have for any , and then and so .
Hence and as all are chosen arbitrarily, we have the required proof.
∎
Now we will deduce proposition 9 for quasi-central sets:
Theorem 13**.**
Let be a countable commutative semigroup of class . Then for any quasi-central the collection is quasi-central in .
Proof.
As, is quasi-central, theorem 11 guarantees that there exists a decreasing sequence of piecewise syndetic subsets of , such that property 1 of theorem 11 is satiesfied.
As is piecewise syndetic in the following sequence,
[TABLE]
The set is piecewise syndetic in from proposition 9.
And for is piecewise syndetic proposition 9.
Consider,
[TABLE]
Now choose and , then . Then by property 1 we have
[TABLE]
As for any we have
[TABLE]
and . Therefore . Which implies , showing the property 1 of theorem 11.
This proves the theorem.
∎
The following is an extension of corollary 10.
Corollary 14**.**
Let be a commutative semigroup of class Then for any quasi-central set , is quasi-central in .
Proof.
Let us take a surjective homomorphism by, .
As is quasi central, from property 1 of theorem 11, it satiesfies equation 3.
Now from equation 3,
Where the set and are from previous theorem and it was shown that is quasi central.
Now clearly, for each and from lemma 12 we get our required result.
This proves the claim.
∎
However there are other different type of notion of largeness such as all of those have combinatorial characterizations described in [HS] but we don’t know if it is possible to give an affirmative answer of the problem 4.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[Bel] Mathias Beiglboeck, Arithmetic Progressions In Abundance By Combinatorial Tools
- 2[1]
- 3[2]
- 4[BG] V. Bergelson, D. Glasscock,On the interplay between additive and multiplicative largeness and its combinatorial applications.
- 5[3]
- 6[4]
- 7[BH] V.Bergelson, N.Hindman. Partition regular structures contained in large sets are abundant. J. Combin. Theory ser. A, 93(1): 18-36, 2001
- 8[5]
