Table of Contents
Fetching ...

Fractal dimensions and profinite groups

Elvira Mayordomo, Andre Nies

Abstract

Let $T$ be a finitely branching rooted tree such that any node has at least two successors. The path space $[T]$ is an ultrametric space: for distinct paths $f,g$ let $d(f,g)= 1/|T_n|$, where $T_n$ denotes the $n$-th level of the tree, and $n$ is largest such that $f(n)= g(n)$. Let $S$ be a subtree of $T$ without leaves that is level-wise uniformly branching, in the sense that the number of successors of a node only depends on its level. We~show that the Hausdorff and lower box dimensions coincide for~$[S]$, and the packing and upper box dimensions also coincide. We give geometric proofs, as well as proofs based on the point-to-set principles. We use the first result to reprove a theorem of Barnea and Shalev on the Hausdorff dimension of closed subgroups of a profinite group $G$, referring only on the geometric structure of the closed subgroup in the canonical path space given by an inverse system for $G$. We obtain an analogous theorem for the packing dimension.

Fractal dimensions and profinite groups

Abstract

Let be a finitely branching rooted tree such that any node has at least two successors. The path space is an ultrametric space: for distinct paths let , where denotes the -th level of the tree, and is largest such that . Let be a subtree of without leaves that is level-wise uniformly branching, in the sense that the number of successors of a node only depends on its level. We~show that the Hausdorff and lower box dimensions coincide for~, and the packing and upper box dimensions also coincide. We give geometric proofs, as well as proofs based on the point-to-set principles. We use the first result to reprove a theorem of Barnea and Shalev on the Hausdorff dimension of closed subgroups of a profinite group , referring only on the geometric structure of the closed subgroup in the canonical path space given by an inverse system for . We obtain an analogous theorem for the packing dimension.

Paper Structure

This paper contains 9 sections, 6 theorems, 26 equations.

Key Result

Theorem 2.1

Let $S\subseteq T$ be trees such that each node on $T$ has at least two successors. Suppose that $S$ is level-wise uniformly branching. Then in the metric space $[T]$ we have

Theorems & Definitions (22)

  • Definition 1.1
  • Example 1.2
  • Theorem 2.1
  • proof
  • Claim 2.2
  • Example 2.3
  • Theorem 3.1: Barnea.Shalev:97, Thm. 2.4 for the first line of equations
  • proof
  • Example 3.2: essentially Barnea.Shalev:97, Lemma 4.1
  • proof
  • ...and 12 more