![MathJax Logo](/templates/jsp/_style2/_tandf/pb2/images/math-jax.gif)
Abstract
We defined group actions on cofinite graphs to characterize a unique way of uniformly topologizing an abstract group with profinite topology, induced by the cofinite graphs, so that the aforesaid action becomes uniformly equicontinuous.
1 Introduction
1.1 Topological graphs
Definition 1.1
Topological Graphs A topological graph Citation[1] is a topological space that is partitioned into two closed subsets
and
together with two continuous functions
and a continuous function
satisfying the following properties: for every
,
(1) |
| ||||
(2) |
|
The elements of are called vertices. An element
is called a (directed) edge with source
and target
; the edge
is called the reverse or inverse of
.
A map of graphs is a function that maps vertices to vertices, edges to edges, and preserves sources, targets, and inverses of edges. Analogously, we will call a map of graphs a graph isomorphism if and only if it is a bijection.
An orientation of a topological graph is a closed subset
consisting of exactly one edge in each pair
. In this situation, setting
we see that
is a disjoint union of the two closed (hence also open) subsets
,
.
Note 1.2
Let be a topological graph. The following are equivalent:
(1) |
| ||||
(2) | there exists a continuous map of graphs from | ||||
(3) | there exists a continuous map of graphs |
Conceivably there are topological graphs that do not admit closed orientations. However such graphs will not concern us. Therefore, unless otherwise stated, by a topological graph we will henceforth mean a topological graph that admits an orientation.
We will be interested in equivalence relations on graphs that are compatible with the graph structure:
Definition 1.3
Compatible Equivalence Relation An equivalence relation on a graph
is compatible if the following properties hold:
(1) |
| ||||
(2) | if | ||||
(3) | for all |
Note 1.4
If is a compatible equivalence relation on
, then there is a unique way to make
into a graph such that the canonical map
is a map of graphs. It is defined by setting
,
, and
.
Conversely, if is a graph and
is a surjective map of graphs, then
is a compatible equivalence relation on
and
induces an isomorphism of graphs such that
.
Note 1.5
If and
are compatible equivalences on
, then so is
.
Theorem 1.6
Let be any cofinite equivalence relation on a topological graph
. Then there exists a compatible cofinite equivalence Citation[2] relation
on
such that
.
Proof
Extend the source and target maps to all of
so that they are both the identity map on
. Then
are continuous maps satisfying the following properties:
• |
| ||||
• |
|
Similarly, extend the edge inversion map to all of
by also letting it be the identity map on
. Then
is a continuous map satisfying the following conditions for all
:
• |
| ||||
• |
| ||||
• |
|
Now define ,
, and
. Then, by the Correspondence Theorem Citation[2],
,
,
are cofinite equivalence relations on
. Let
and observe that
(i) |
| ||||
(ii) | if |
Finally, choose a closed orientation of
and form the restrictions
,
, and
. Then it is easy to check that
is a compatible cofinite equivalence relation on
and
, as required.□
The previous proof actually shows a little more, which is worth noting. Given a closed orientation for
, we say that a compatible equivalence relation
on
is orientation preserving if whenever
and
, then also
. Since the equivalence relation
that we constructed in the proof of Theorem 1.6 is also orientation preserving, we proved the following stronger result.
Corollary 1.7
Let be a topological graph with a specified closed orientation
. Then for any cofinite equivalence relation
on
, there exists a compatible orientation preserving cofinite equivalence relation
on
such that
.
Corollary 1.8
If is a compact Hausdorff totally disconnected topological graph, then its compatible cofinite equivalence relations form a fundamental system of entourages for the unique uniform structure that induces the topology of
Citation[3].
1.2 Cofinite graphs
Definition 1.9
Cofinite Graph A cofinite graph Citation[2] is an abstract graph endowed with a Hausdorff uniformity such that the compatible cofinite entourages Citation[2] of
form a fundamental system of entourages (i.e. every entourage of
contains a compatible cofinite entourage).
A group is said to act uniformly equicontinuously over a cofinite graph
if and only if for each entourage
over
there exists an entourage Citation[2],
over
such that for all
in
, where
and
is the image of
under the group action of
. In this case the group action induces a (Hausdorff) uniformity over
if and only if the aforesaid action is faithful.
Suppose that is a group acting faithfully and uniformly equicontinuously on a cofinite graph
, then the action
is uniformly continuous. Also in that case
, the Citation[4] profinite completion of
, acts on
, the Citation[2] profinite of completion of
, uniformly equicontinuously. Following is an example of uniform equicontinuous group action.
Example 1.10
Let be an abstract graph with
, where
is the set of all integers. Let,
. Let,
be the set of all edges reversing the edges of
, that is
and
. Let
be any prime. Then for any positive integer
, consider
as the cycle of length
. One can say that
, where
is the congruence class of
modulo
and
. Let
be the set of edges reversing the edges in
, that is
and
. Now, consider the map of graphs
as
and
. Let,
. Then
is a compatible equivalence relation over
Citation[2]and since there is a one-one, onto map of graphs from
to
,
. And
is a fundamental system of entourages over
. The corresponding topology induced by
is also Hausdorff, since for any two distinct
, there exists sufficiently large natural number
so that
.Thus
turns to be a cofinite graph. Consider the additive group of integers
and a natural group action
by translation of vertices and edges as follows: For any
and for any
, for any
. For any entourage
over
, as
is a fundamental system of entourage over
, there exists
so that
and for all
. For if
, without loss of generality let us assume that
. So,
which implies
and that implies
. Thus the above action is uniformly equicontinuous.
2 Groups acting on cofinite graphs
Let be a group and
be a cofinite graph. We say that the group
acts over
if and only if
(1) | For all | ||||
(2) | For all | ||||
(3) | For all | ||||
(4) | For all | ||||
(5) | For all | ||||
(6) | There exists a |
Note that the aforesaid group action restricted to {g} can be treated as a well defined map of graphs, taking
.
Definition 2.1
Uniform Equicontinuous Group Action A group is said to act uniformly equicontinuously over a cofinite graph
, if and only if for each entourage
over
there exists an entourage
over
such that for all
in
is a subset of
.
Example 2.2
Let be an abstract graph with
, where
is the set of all integers. Let,
. Let,
be the set of all edges reversing the edges of
, that is
and
. Let
be a separating filter base Citation[2] of finite index normal subgroups of
, the additive group of integers. Then for any subgroup
, consider
as the cycle of length
. One can say that
, where
is the congruence class of
modulo
and
. Let
be the set of edges reversing the edges in
, that is
and
. Now, consider the map of graphs
as
and
. Let,
. Then
is a compatible equivalence relation over
Citation[2] and since there is a one-one, onto map of graphs from
to
,
. And
is a fundamental system of entourages over
. The corresponding topology induced by
is also Hausdorff, since for any two distinct
, there exists sufficiently large natural number
so that
.Thus
turns to be a cofinite graph. Consider the additive group of integers
and a natural group action
by translation of vertices and edges as follows: For any
and for any
, for any
. For any entourage
over
, as
is a fundamental system of entourage over
, there exists
so that
and for all
. For if
, without loss of generality let us assume that
. So,
which implies
and that implies
. Thus the above action is uniformly equicontinuous.
Lemma 2.3
If a group acts uniformly equicontinuously over a cofinite graph
, then there exists a fundamental system of entourages consisting of
-invariant compatible cofinite entourages over
, i.e. for any entourage
over
there exists a compatible cofinite entourage
over
such that for all
.
Proof
Let be any cofinite entourage Citation[2] over
. Then as
acts uniformly equicontinuously over
, there exists a compatible cofinite entourage
over
such that for all
. Choose a
-invariant orientation
of
. Without loss of generality, we can assume that our compatible equivalence relation
on
is orientation preserving i.e. whenever
and
, then also
. Now
. Now if
and
, where
is the smallest unique equivalence relation on
containing
, namely, the intersection of all equivalence relations that contains
. Note that
. Since for all
and
it follows that
is in the transitive closure of
. Let
. Then there exists a finite sequence
such that
, for all
and
. Hence
, for all
, for all
. Thus
, for all
. Hence for all
and our claim that
is a
-invariant cofinite entourage, follows. It remains to check that
is compatible. Let
. If
, then there is
and
such that
. Without loss of generality let
. Then
which implies that
. Now let
. Then there exists a finite sequence
such that
, for all
and
. Hence by the previous argument if
then
, for all
. Thus
. If
then
, for all
, which implies
. Let
. If
, then there is
and
such that
. Then
. So
which equals
is in
so that
. Now let
. Then there exists a finite sequence
such that
and
. Hence by the previous argument
and thus
. Similarly,
and
. Finally, to show that for any
, if possible let
. If
, then there is
and
such that
. Then
which implies that
, so
, a contradiction. Now let
. Then there exists a finite sequence
such that
, for all
and
. Now let there be
and
such that
. Without loss of generality we may assume
. Then
. Hence
, for all
which implies that
, a contradiction. Our claim follows.□
Note that in reference to Example 2.2, is in fact a fundamental system of
-invariant compatible cofinite entourages over
.
Note 2.4
Let be a group and
be a cofinite graph. Let
be an equivalence relation over
then
is the equivalence class of
. Similarly, if
is an equivalence relation on
then
is the equivalence class of
. Let
act on
. Let
be a cofinite entourage. We define
, and
, Citation[4]. In the following lemmas we will show that
is a congruence of
and
is a normal subgroup of
with finite index and we denote it by
.
Lemma 2.5
is a finite index normal subgroup of
and
is isomorphic with
. More generally, if
is a congruence on
, then
is a normal subgroup of
and
.
Proof
Let us first see that for all
-invariant compatible cofinite entourage
over
. Let
. This implies
and hence
. Thus
. This implies
is in
, for all
and so
, for all
. Hence,
is in
and thus
. So,
. For all
, for all
. Hence for all
, hence
is in
. Thus
and
. Hence
. So,
and thus
. Now let us define
from
to
via
. Then,
is equal to
if and only if
if and only if
if and only if
if and only if
if and only if
if and only if
, for all
in
. Thus
is a well defined injection and hence
. Hence
. It follows that
is a group and let us define
via
. Then for
in
if and only if
if and only if
if and only if
if and only if
if and only if
if and only if
equals
. Hence
is a well defined injection. Also for all
in
, there exists
such that
. Thus
is surjective as well. Also for
, we have
and that equals
which equals
. Hence
is a group homomorphism and thus a group isomorphism. Also, both
, are finite discrete topological groups, so
is an isomorphism of cofinite groups as well.□
Lemma 2.6
Let a group act on a cofinite graph
uniformly equicontinuously. Then
acts on
and
acts on
as well, where
is a
-invariant compatible cofinite entourage over
and
is the quotient graph of
with respect to
. If
is a fundamental system of
-invariant compatible cofinite entourages over
, then
forms a fundamental system of cofinite congruences Citation[5] for some uniformity over
.
Proof
Let be a
-invariant compatible cofinite entourage over
. Let us define a group action
via
, for all
, for all
. Now let
so
which implies that
. Then
. Hence the induced group action is well defined.
Let us now consider the group action , defined via
, for all
, for all
. Now let
which implies that
is in
. Then
, as
. So
. Thus
which implies that
equals
. Hence the induced group action is well defined. Let us now show that
is an equivalence relation over
, for all
-invariant compatible cofinite entourage
over
.
(1) | for all | ||||
(2) | Now | ||||
(3) | Let |
Also we now check that is a congruence over
. For, let us take
. Then for all
; for all
and so
and
is in
, since
is
-invariant. Thus
, for all
so that
. Thus our claim follows. Let us now show that
is finite. Furthermore, define
as
maps
into
. Now,
if and only if
. Hence the map
is a well defined injection. Now for all
there exists
such that
equals
. Hence
, where
is the collection of all graph isomorphisms from
, Citation[2]. Now let us define a map
via
. Now
equals
if and only if
if and only if
for all
. Hence
if and only if
if and only if
if and only if
in
. Hence
is a well defined injection. Thus
as
. So, next we would like to show that
forms a fundamental system of cofinite congruences over
.
(1) |
| ||||
(2) | Now for some | ||||
(3) | For all | ||||
(4) | For all |
Hence our claim follows.□
Note 2.7
Let us refer back to Example 2.2 and define a group action as following
, for any
, for any
. Thus for any
, where
is isomorphic to
.
Definition 2.8
We say a group acts on a cofinite graph
faithfully, if for all
in
there exists
in
such that
is not equal to
in
.
Lemma 2.9
The induced uniform topology over as inLemma 2.6 is Hausdorff if and only if
acts faithfully over
.
Proof
Let us first assume that acts faithfully over
. Now let
in
. Then
. So there exists
such that
implying that
. Then there exists a
-invariant compatible cofinite entourage
over
such that
, as
is Hausdorff. Hence
. Thus
is Hausdorff.
Conversely, let us assume that is Hausdorff and let
in
. Then there exists some
-invariant compatible cofinite entourage
over
such that
. Hence there exists
such that
. Hence
so that
. Our claim follows.□
Lemma 2.10
Suppose that is a group acting uniformly equicontinuously on a cofinite graph
and give
the induced uniformity as inLemma 2.6. Then the action
is uniformly continuous.
Proof
Let be a
-invariant cofinite entourage over
. If
is a fundamental system of
-invariant compatible cofinite entourages over
. Then
ia a fundamental system of entourage for a uniform structure over
, Citation[2]. Now let
, i.e.
. Now
in
and
this implies
. We have
and hence
. Thus our claim.□
Let us define a directed order ‘’ on
, a fundamental system of
-invariant entourages on a cofinite graph
as in Lemma 2.6. We say,
in
, then
. Let
. Then
, for all
and hence
, for all
which implies
. Thus
. For all
, in
, let us define
via
. Then
is a well defined uniformly continuous group isomorphism, as each of
is finite discrete groups. If
, then
. And if
, then
. Then
, forms an inverse system of finite discrete groups. Let
and
, where
is the corresponding canonical projection map, Citation[2]. Now if
are two fundamental systems of
-invariant cofinite entourages over
, clearly
will form fundamental systems of cofinite congruences, for two induced uniformities, over
. Now let
be a cofinite congruence over
for some
. Then there exists a
, cofinite entourage over
, such that
and
. Hence
. Now let
be a cofinite congruence over
for some
. Then there exists
, cofinite entourage over
, such that
and
. Hence
. Thus any cofinite congruence corresponding to the directed set
is a cofinite congruence corresponding to the directed set
and vice versa. Thus the two induced uniform structures over
are equivalent and so the completion of
with respect to the induced uniformity, from the cofinite graph
, is unique up to both algebraic and topological isomorphism.
Theorem 2.11
If acts on
, as in Lemma 2.6, faithfully then
acts on
uniformly equicontinuously.
Proof
Let a group act on
uniformly equicontinuously. We fix a
-invariant orientation
of
. By Lemma 2.10 the action is uniformly continuous as well. Let
be this group action. Now since
is topologically embedded in
by the inclusion map, say,
, the map
is a uniformly continuous. Then there exists a unique uniformly continuous map
that extends
. We claim that
is the required group action. We can take
and
, where
runs throughout all
-invariant compatible cofinite entourages of
that are orientation preserving. Then
Citation[6] and we define a group action of
over
coordinatewise as follows
. If possible let,
. So,
equals
and
and
. This implies that
which further ensures that
. Then
and
. Hence
. So, the action is well defined. Let
and
in
,
. Now
which then equals
. Hence the action is associative. Now
. Furthermore for all vertex
and for all
one can say that
as each
. Similarly, for all
in
and for all
in
,
in
. For all
in
, for all
in
, we have
and so
equals
and that equals
. Hence the properties
and
follow similarly. Finally, let
consist of all the edges
, where
. Since each
is orientation preserving, it follows that
is an orientation of
. Since
is
-invariant, we see that
is
-invariant. Hence this is a well defined group action. Also for all
, and
,
equals
which equals
in
, (please see Citation[6], for any further clarification on how to embed
in
and
in
. We use the notations
and
to refer to the
th coordinates of
and
in
and
, respectively). Thus the restriction of this group action agrees with the group action
. Now
is a fundamental system of cofinite entourages over
, and
is a fundamental system of cofinite congruences over
. Hence
is a fundamental system of cofinite entourages over
and
is a fundamental system of cofinite congruences over
respectively, where
is the topological closure of
in
. Let us now see that the aforesaid group action is uniformly continuous. For let us consider the group action
defined via
, which is uniformly continuous as both
and
are finite discrete uniform topological spaces. Hence the group action,
is uniformly continuous. Thus the aforesaid group action is our choice of
, by the uniqueness of
, Citation[2]. So the restriction of the aforesaid action
is a uniformly continuous map of graphs, for all
. We check that for all
and for all
the ordered pair
. For, let
and for
. Now
. So,
. This implies
is a subset of
. Thus for all
we observe that
is a subset of
which is a subset of
. Hence
is
invariant.□
Thus and
form fundamental systems of cofinite congruences over
. Let
be the topologies induced by
respectively.
Theorem 2.12
The uniformities on obtained by
and
are equivalent.
Proof
Let us first show that . For, let
. Then for all
. Now let
. Then
which implies that
. Thus,
. Again, if
belongs to
, then for all
, and so
and this implies
. Our claim follows. Then as uniform subgroups
, both algebraically and topologically, their corresponding completions
, both algebraically and topologically. Since for all
,
is a uniform continuous group homomorphism and
is discrete, there exists a unique uniform continuous extension of
, namely,
. Let us define
via
, where
, Citation[6]. Now let
be such that
which implies that
and hence
is well defined. Now let
. First of all
. So,
. Hence
which implies that
, so
. Thus
is a subset of
. Hence
is uniformly continuous. Now for all
and for all
. Thus
is a well defined uniformly continuous group homomorphism that extends
. Then by the uniqueness of the extension,
. Now
is a closed subspace of
, then
which implies that
is a subset of
which equals
. Let us define
from
to
as
takes
into
, where
. Now
in
will imply
is in
and this implies for all
in
the ordered pair
is in
which is eventually equal to
. Thus
. Then
which is equal to
and that equals
. Hence
is well defined. On the other hand let
,
be such that
equals
. Thus
implies that
. Hence
. So,
is injective as well. Also for all
there exists
such that
. So
is surjective. Finally,
equals
and that equals
which is
and finally that equals
. So
is a well defined group isomorphism, both algebraically and topologically. Hence
which implies that
is equal to
. But since
one obtains
and thus
equals
. Hence
which implies that
and thus
as each of them is congruences. Thus our claim.□
Note 2.13
Thus referring back to Example 2.2, the action has a unique uniform equicontinuous extension from
, where
are the respective profinite completions of
and
.
References
- SerreJ.-P., Trees1980Springer VerlagBerlin, Heidelberg, New York
- AcharyyaA.CorsonJ.DasB., Cofinite graphs and their profinite completions Electro. J. Graph theory Appl. 5 2 2017 347–373
- BourbakiN., General topology Elements of Mathematics1966Addison-WesleyReading Mass
- HartleyB., Profinite and residually finite groups Rocky Mountain J. Math. 71977 193–217
- StallingsJ.R., Topology of finite graphs Invent. Math. 711983 551–565
- WilsonJ., Profinite Groups1998Oxford University PressOxford