Skip to main content

The Birkhoff-Kakutani Theorem

  • Sourced from these notes on locally compact groups by Linus Kramer.
  • Let $G$ be a Hausdorff topological group. The following are equivalent.
    • The topology on $G$ is metrisable by a left-invariant metric.
    • The topology on $G$ is metrisable.
    • The identity element has a countable neighbourhood basis, i.e., the group is first countable.
  • Proof. We will first prove the following
    • Lemma. Let $G$ be a topological group. Suppose that $\left(K_{n}\right)_{n\in\mathbb{Z}}$ is a family of symmetric identity neighbourhoods with the property that $K_{n}K_{n}K_{n}\subseteq K_{n+1}$ holds for all $n\in\mathbb{Z}$, and with $\langle\bigcup_{n\in\mathbb{Z}}K_{n}\rangle=G$. For $g\in G$ we put $$\ell(g)=\inf\mathinner{\lbrace t\geq0:\text{there is some }k\geq1\text{ and }n_1,\dots,n_{k}\in\mathbb{Z}\text{ with }t=2^{n_1}+\cdots+2^{n_{k}}\text{ and }g\in K_{n_1}\cdots K_{n_{k}}\rbrace}.$$ Then $\ell$ is a continuous length function. Moreover, $\{g\in G:\ell(g)\le 2^{n}\}\subseteq K_n$ and therefore $\bigcap_{n\in\mathbb{Z}}K_{n}=\mathinner{\lbrace g\in G:\ell(g)=0\rbrace.}$
      • Proof of Lemma. Since $K_n$'s are symmetric and generate $G$, every element is a finite product of elements in $K_n$'s, implying that $\ell$ is well-defined. Triangle inequality, symmetry, and the fact that $\ell(e)=0$ are all easily proved, showing that $\ell$ is a length function.
        • Now we prove the continuity of this length function. First note that if $g\in K_n$, then $\ell(g)\leq 2^n$. Fix $g\in G$ and $\varepsilon>0$. Choose $n\in\mathbb{Z}$ such that $2^n\leq\varepsilon$. We claim that $\lvert\ell(g)-\ell(h)\rvert\leq\varepsilon$ holds for all $h\in gK_n$. Since $K_n$ is symmetric, both $g^{-1}h$ and $h^{-1}g$ are contained in it. Applying triangle inequality twice, we obtain $\ell(g)=\ell(hh^{-1}g)\leq\ell(h)+2^n$ and $\ell(h)=\ell(gg^{-1}h)\leq\ell(g)+2^n$, thus implying $\lvert\ell(g)-\ell(h)\rvert\leq 2^n\leq\varepsilon$ for all $h\in gK_n$.
        • We come to the final part of the claim. Suppose $g\in G$ is such that $\ell(g)<2^n$. We wish to show that $g\in K_n$. We already have $n_1,\dots,n_k\in\mathbb{Z}$ such that $g\in K_{n_1}\cdots K_{n_k}$ with $2^{n_1}+\cdots +2^{n_k}<2^n$. We now prove the following
          • Claim. Suppose that $2^{n_1}+\cdots+2^{n_k}<2^n$. Then $K_{n_1}\cdots K_{n_k}\subseteq K_n$.
            • Proof of Claim. Clearly $n_{j}, so $K_{n_1}\cdots K_{n_k}\subseteq K_{n-1}\cdots K_{n-1}$ (since $K_n\subseteq K_nK_nK_n\subseteq K_{n+1}$ for all $n\in\mathbb{Z}$, the $K_n$'s inherit the order from $\mathbb{Z}$). This proves the claim for $k=1,2,3$.
            • For $k\geq 4$, we split into the following cases, inducting on $k$:
              • If $2^{n_1}+\cdots +2^{n_k}<2^{n-1}$, then $K_{n_1}\cdots K_{n_{k-1}}\subseteq K_{n-1}$ by the inductive hypothesis, and $K_{n_k}\subseteq K_{n-1}$, implying $K_{n_1}\cdots K_{n_k}\subseteq K_{n-1}K_{n-1}\subseteq K_n$.
              • If $2^{n-1}\leq 2^{n_1}+\cdots +2^{n_k}<2^n$, we choose the smallest $1\leq r\leq k$ such that $2^{n-1}\leq 2^{n_1}+\cdots +2^{n_r}$. Then $2^{n_1}+\cdots +2^{n_{r-1}}<2^{n-1}$, so again by our inductive hypothesis we get $K_{n_1}\cdots K_{n_{r-1}}\subseteq K_{n-1}$. On the other hand, $2^{n_{r+1}}+\cdots+2^{n_k}<2^{n-1}$ as well, implying $K_{n_{r+1}}\cdots K_{n_k}\subseteq K_{n-1}$ as well. Thus, $K_{n_1}\cdots K_{n_k}\subseteq K_{n-1}K_{n_r}K_{n-1}\subseteq K_n$.
    • Proof of Theorem. The forward implications are trivial, so we show that the third statement implies the first.
      • Step 1: Choosing $K_n$'s. let $(V_n)_{n\in\mathbb{N}}$ be a neighbourhood basis of the identity. Set $K_n=G$ for $n\geq 1$. For $n\leq 0$, we inductively choose symmetric identity neighbourhoods with $K_n\subseteq V_{-n}$ such that $K_{n-1}K_{n-1}K_{n-1}\subseteq K_n$. This can be done since the map $\widetilde{m}:G\times G\times G\longrightarrow G$, $(x,y,z)\mapsto xyz$ is continuous and preserves the identity. For example, once a symmetric neighbourhood $K_0$ in $V_0$ has been chosen, choose a basic open set $A\times B\times C\in\widetilde{m}^{-1}(K_0\cap V_1)$, and set $K_1=(A\cap B\cap C)\cap (A^{-1}\cap B^{-1}\cap C^{-1})$.
      • Step 2: Non-degeneracy of $\ell$. the length function $\ell$ with the family $(K_n)$ above is non-degenerate, i.e., $\ell(g)=0$ iff $g=e$ since $e\in\bigcap_{n\in\mathbb{Z}}K_{n}\subseteq\bigcap_{n\geq0}V_{n}=\mathinner{\lbrace e\rbrace}$, where the last equality is a consequence of Hausdorffness of the group.
      • Step 3: Definition of the Metric. Set $d(g,h)=\ell(g^{-1}h)$. This is a continuous, left-invariant metric on $G$ by the Lemma above.
      • Step 4: $d$ generates the topology. For any open $U\subseteq G$ and $g\in U$, there is $n\in\mathbb{N}$ such that $gV_n\subseteq U$. Thus, $B_{2^{-n}}(g)\subseteq gK_{-n}\subseteq gV_n\subseteq U$, proving the theorem.
Here is some intuition behind the proof. Dyadic approximation of a chosen number on the real line involves choosing largest possible powers of two (still smaller than the number) and adding them to get closer to it. One may make a suboptimal approximation by overshooting. A good approximation can be found by simply taking the infimum over these dyadic sums. The functionally important detail for us is the existence of these "dyadic scales" that can be translated around from the origin. First countability, as adapted in the proof, supplies us with these fine scales to define our metric.

Popular posts from this blog

The Poincaré Recurrence Theorem

Recurrence in phenomena, physical or otherwise, has piqued the curiosity of humans for a long time. Without going into a historical detour on the study of periodic phenomena (of which the author is painfully ignorant), we cut to the chase and introduce one of the foundational results of ergodic theory: the Poincaré Recurrence Theorem. The theorem essentially states that under certain transformations of a space (to be made precise shortly), the system will almost return to its initial state under repeated iterations of the transformation. Preliminaries In order to state the theorem, we recall the definition of a probability space and a measure-preserving transformation here. Definition. [Probability Space] A probability space $(X,\mathcal{B},\mu)$ is a nonempty set $X$, a $\sigma$-algebra $\mathcal{B}$ on $X$, and a measure $\mu$ on $(X,\mathcal{B})$ with $\mu(X)=1$. Assume further that the space $(X,\mathcal{B},\mu)$ is complete, in the sense that all subsets of measurable subs...

Maths Teachers Orientation Camp: Some Reflections on Maths Education in India

Last week, IISER-Mohali hosted the Mathematics Teachers Orientation Camp (MTOC) sponsored by Homi Bhabha Centre for Science Education (HBCSE), TIFR. The objective of this camp (and similar camps conducted by HBCSE elsewhere in the country) is to introduce and expose high school mathematics teachers and educators to fresh perspectives on their subject through interactive talks and problem-solving sessions. This is not strictly bound to the school curriculum, but the topics centre around things that can be assumed to be reasonably accessible for someone out of touch with (under)graduate level mathematics for years. As a volunteer for this camp (primarily engaged in hospitality for the educators arriving on the campus), I got to interact with many of these educators who hailed from Uttarakhand and Punjab (teachers from other regions, especially J&K, Himachal, and Haryana, had to back out due to the approaching final exams). While I missed out on the opportunity to hear about the exper...

गणित क्यूं?

यह लेख एम. ए. सोफी के "ग्रेटर कश्मीर" में प्रकाशित "Public Perception of Mathematics" से प्रेरित है। सोफी उस अपेक्षित प्रश्न का उत्तर देने का प्रयास करते हैं जिससे हर (भारतीय) गणितज्ञ अपने जीवनकाल में निरंतर जूझते हैं - "आख़िर गणित में शोध होता क्या है"? अक़्सर अगली टिपण्णी गणित के "समाप्त" हो जाने की दिशा में होती है (इस सवाल से मेरी पहली मुलाक़ात बारहवीं कक्षा में ही हो गई थी)। इस लेख के माध्यम से मैं गणित के इतिहास और विकास के चुनिंदा पहलुओं से परिचय करवाना चाहूंगा। साथ ही, मैं गणित में शोध की प्राकृतिक पृष्ठभूमि पर प्रकाश डालने का प्रयत्न करूंगा।  यह कहना पूर्णतः गलत नहीं होगा कि गणित का प्राचीन काल में निर्माण काफ़ी हद तक मानव सभ्यता की आवश्यकताओं के कारण हुआ था। लगभग अलग-अलग सभ्यताओं (भारत, चीन, मिस्र, मेसोपोटामिया, ग्रीस, इत्यादि) में अंकगणित और ज्यामिति का विकास हिसाब-किताब, संसाधनों के उचित बंटवारे, और विभिन्न निर्माण कार्यों में उपजने वाली समस्याओं के साथ तालमेल में हुआ। जमा, गुना, घटा, भाग, अनुपात, अथवा ज़मीन और निर्माण से संबंधित परिम...