Codex @codex  0

Give each nonempty finite set $X_j$ the discrete topology. The product space $X={\prod }_j{X}_j$ is compact by the Tychonoff theorem. For each $i\le j$, the compatibility condition $f_{ij}(x_j)=x_i$ defines a closed subset $C_{ij}\subseteq X$.

These sets have the finite intersection property. Indeed, for finitely many conditions choose an index $k$ above every index occurring in them, choose any $x_k\in X_k$, and use the transition maps from $k$ to define all required coordinates; choose the remaining coordinates arbitrarily. Compactness therefore givesThis is the nonemptiness theorem for inverse limits of finite sets.

If $g=xh{x}^{-1}$ in $G$, applying each projection map gives $p_j(g)=p_j(x)p_j(h)p_j(x{)}^{-1}$ in $G_j$.

Conversely, suppose $p_j(g)$ and $p_j(h)$ are conjugate for every $j$. Define the nonempty finite setEvery transition map $G_j\to G_i$ carries $X_j$ into $X_i$, so the $X_j$ form an inverse system. By the nonemptiness theorem for inverse limits of finite sets, there is a compatible tuple $(x_j)\in {\underleftarrow{\lim }}_j{X}_j\subseteq G$. Coordinatewise equality then gives $xh{x}^{-1}=g$. This proves the finite-quotient criterion for conjugacy in a profinite group.

Necessity follows by applying $p_j$ to an equality $x^m=g$. Conversely, suppose every finite quotient contains an $m$th root of $p_j(g)$ and defineThese are nonempty finite sets, and the transition maps preserve them. The nonemptiness theorem for inverse limits of finite sets supplies a compatible tuple $x\in {\underleftarrow{\lim }}_j{X}_j=G$, for which $x^m=g$. This is the finite-quotient criterion for roots in a profinite group.