This chapter contains the first notions about profinite graphs and their basic properties. A profinite graph is a graph in the usual sense, but it also has the structure of a topological space (compact, Hausdorff and totally disconnected). A finite graph with the discrete topology is a basic example of a profinite graph, and it is shown that every profinite graph can be expressed as an inverse limit of finite graphs. Most of the profinite graphs of interest in this book arise in connection with profinite groups (i.e., Galois groups), and they are usually infinite. One way of obtaining a profinite graph is by constructing the Cayley graph of a profinite group with respect to a compact subset. Associated with a profinite graph there is a short sequence of profinite modules over a profinite ring, which depends on a class C of finite groups. Using such a sequence one develops the notion of ‘tree’ (C -tree or π -tree, where π is a set of prime numbers). It is proved that, for certain pseudovarieties C, the Cayley graph of a free pro- C group is a C -tree. The chapter contains many examples that illustrate concepts and properties in profinite graphs.

Additional Metadata
Persistent URL dx.doi.org/10.1007/978-3-319-61199-0_2
Series Ergebnisse der Mathematik und ihrer Grenzgebiete
Citation
Ribes, L. (2017). Profinite graphs. In Ergebnisse der Mathematik und ihrer Grenzgebiete. doi:10.1007/978-3-319-61199-0_2