Codex @codex  0

First prove Simplicity of alternating groups. The $3$-cycles generate $A_n$: express an even permutation as an even number of transpositions and pair them. A pair sharing a point is a $3$-cycle, an identical pair cancels, and a disjoint pair can be written $(ab)(cd)=(acb)(acd)$. All $3$-cycles are conjugate in $A_n$ when $n\ge 5$: a conjugator in $S_n$ can have its parity corrected by a transposition on two points outside the target triple, without changing its effect on that triple.

Let $1\ne N◃A_n$ and choose $1\ne \sigma \in N$. Some $3$-cycle $\tau$ does not commute with $\sigma$. Indeed, commuting with every $3$-cycle would preserve every triple setwise; intersecting all triples containing a given point forces that point to be fixed, so would make $\sigma =1$. The nonidentity group commutator $\sigma \tau {\sigma }^{-1}{\tau }^{-1}\in N$ is supported on at most six points. Its possible nontrivial even cycle types are a $3$-cycle, a double transposition, a $5$-cycle, two disjoint $3$-cycles, or a $4$-cycle times a transposition. Each yields a $3$-cycle in $N$ by explicit group commutators:

For $(ab)(cd)$, use $\tau =(cde)$ with a fifth point $e$; conjugation reverses $\tau$, so the group commutator is ${\tau }^{-2}=\tau$. For $(abcde)$, use $(abc)$: the group commutator is $(bcd)(abc{)}^{-1}=(adb)$. The same calculation works for $(abcd)(ef)$. For $(abc)(def)$, use $(abd)$; its conjugate is $(bce)$, and the product $(bce)(abd{)}^{-1}$ is a $5$-cycle, reducing to the preceding case. Thus $N$ contains a $3$-cycle, hence the whole conjugacy class of $3$-cycles, and hence all of $A_n$. ThereforeFor the exceptional automorphism, a duad is an unordered pair of six points, a syntheme is a partition into three duads, and a pentad is a set of five synthemes covering every duad once. There are fifteen synthemes. To count pentads, fix $12|34|56$, where bars separate duads. A syntheme disjoint from it in duads is one of eight; the union of the two matchings is a six-cycle, so the stabilizer of the fixed syntheme is transitive on these eight choices. For the choice $13|25|46$, the remaining compatible synthemes are $14|26|35$, $15|24|36$, $16|23|45$ and $16|24|35$. The last shares a duad with each of the first three and cannot belong to a completion; the first three form the unique completion. Thus each of the eight choices has a unique completion through the fixed syntheme. Each completion contains four of them, so exactly two pentads contain a fixed syntheme, and there are $15\cdot 2/5=6$ pentads in total.

Here is the complete list, which also defines concrete labels for the induced action:Relabelling points gives a group homomorphism $\Phi :S_6\to S_6$ on these pentads. Direct substitution in the table givesThe restriction to $A_6$ is nontrivial, hence faithful by the simplicity just proved. Therefore the full kernel has order at most two. An order-two normal subgroup would be central, whereas $S_6$ has trivial centre: an element centralizing every transposition fixes every unordered pair and consequently every point. The kernel is trivial, and equal orders make $\Phi$ an automorphism. It preserves $A_6$, because that is the unique index-two subgroup of $S_6$: any nontrivial group homomorphism to $C_2$ sends every conjugate transposition to the nonidentity element, and is therefore the sign map. Its restriction is the pentad construction of the exceptional alternating-group automorphism. It maps a $3$-cycle to two disjoint $3$-cycles, while conjugation in $S_6$ preserves cycle type. Hence this automorphism of $A_6$ is not induced by any element of $S_6$.

For the other degrees, recover the points from $3$-cycles. An element of order three has type $3^k{1}^{n-3k}$. Its centralizer in $S_n$ has order $3^{k}k!(n-3k)!$. That centralizer contains an odd permutation: either swap two fixed points, or, when $k\ge 2$, swap two three-cycles by three transpositions. ThusFor $n=5$, only $k=1$ is possible. For $n\ge 7$, the $k=1$ value is strictly largest. For $k=2$ equality first occurs at $n=6$, and the ratio increases strictly with $n$. For $k\ge 3$, already at $n=3k$ one has $(3k-3)!>3^{k-1}k!$: it holds at $k=3$, and the inductive ratio is $(3k)(3k-1)(3k-2)>3(k+1)$. Increasing $n$ again increases the ratio. Consequently every automorphism preserves the set of $3$-cycles when $n\ne 6$.

Each cyclic subgroup generated by a $3$-cycle corresponds to its three-point support. Two distinct such subgroups commute exactly when the supports are disjoint. If they meet in one point, products of their nonidentity generators have order five. If they meet in two points, those products have order two or three. These intrinsic tests recover adjacency in the Johnson graph $J(n,3)$, so the automorphism acts on its vertices.

We can reconstruct the underlying points without an additional group-theoretic bound. The maximal cliques of a Johnson graph in $J(n,3)$ are the $n-2$ triples containing a fixed pair, and the four triples contained in a fixed four-set. To verify the classification, take adjacent triples $D\cup \{a\}$ and $D\cup \{b\}$ with $|D|=2$. Any common adjacent triple either contains $D$ or lies in $D\cup \{a,b\}$. A triple of the first kind outside that four-set is not adjacent to a triple of the second kind omitting a point of $D$, so a clique cannot mix the two alternatives. Extending a clique therefore gives exactly one of the two listed families.

For $n\ge 5$, $n\ne 6$, their sizes distinguish the pair-containing cliques. Their intersections reconstruct the pair graph $J(n,2)$: two such cliques intersect precisely when their defining pairs meet in one point. In this graph the maximal cliques are stars of $n-1$ pairs through a point and triangles of three pairs within a triple. These sizes are different for $n\ge 5$, so its automorphisms permute the stars and hence the points. Every pair is the intersection of its two point stars, and every triple is determined by its three pairs. Thus the original graph action comes from some $\pi \in S_n$.

Undo conjugation by $\pi$. The remaining group automorphism $\beta$ fixes each cyclic $3$-subgroup, so it fixes or inverts each generator. For adjacent supports, inverting exactly one generator changes the order of their product between two and three; inverting both preserves that order. Hence the two inversion choices must agree. The triple-support graph is connected, since one can replace differing points one at a time, so the choice is uniform. Inverting every $3$-cycle is impossible: take $c=(123)$, $d=(142)$, whose product is the $3$-cycle $(143)$. Then $\beta (cd)=(cd{)}^{-1}=d^{-1}{c}^{-1}$, whereas the group homomorphism property would give $c^{-1}{d}^{-1}$; these are unequal because $c,d$ do not commute. Therefore $\beta$ fixes every $3$-cycle and is the identity. Conversely, conjugation by $S_n$ acts faithfully on $A_n$, since centralizing all $3$-cycles fixes every triple and every point. The automorphisms of alternating groups from triple supports are exactly

A subnormal series of a finite group is a chain $1=G_0◃G_1◃\cdots ◃G_r=G$. A normal series of a group requires every $G_i$ normal in the whole group. This distinction matters: a composition series is a subnormal series with nontrivial simple factors, whereas a chief series is a strict, unrefinable normal series of a group, whose factors are minimal normal subgroups of the appropriate ambient quotients. Both exist in a finite group, by successively choosing maximal proper normal subgroups or a maximal chain of ambient-normal subgroups. The direct-product result proved above shows that chief factors are powers of isomorphic simple groups, rather than necessarily simple themselves.

The Jordan–Hölder theorem says that any two composition series have the same multiset of simple factors, up to isomorphism and order. Here is an induction proof. The assertion is trivial for the identity group. Let $A,B$ be the penultimate terms of two series for $G$; they are maximal proper normal subgroups. If $A=B$, apply induction there. Otherwise $AB=G$, since its image is a nontrivial normal subgroup in each simple quotient. Put $C=A\cap B$. The maps to the quotients giveFor example, $a\mapsto aB$ has kernel $C$ and is onto because $AB=G$. Take a composition series of $C$ and append $A$, obtaining a composition series of $A$ because $A/C$ is simple; do the same with $B$. Induction inside these smaller groups shows that the factors in the two original series are, in both cases, the factors of $C$ together with $G/A$ and $G/B$. This proves the theorem and justifies the phrase Jordan–Hölder factors independently of a chosen series.

The derived series is $G^{(0)}=G$, $G^{(i+1)}=[G^{(i)},G^{(i)}]$. Its terms are characteristic subgroups, hence normal. A group is soluble if this series reaches the identity. Equivalently it admits a subnormal series with abelian factors. One direction uses the derived series itself. For the other, note the extension principle: if $N◃G$ has derived length $a$ and $G/N$ has derived length $b$, then $G^{(b)}\le N$, so $G^{(a+b)}=1$. Applying this principle along an abelian-factor series proves solubility.

Subgroups and quotients of a soluble group are soluble: $H^{(i)}\le G^{(i)}$ for a subgroup, and the commutator subgroup of a quotient is the image of the commutator subgroup. A finite soluble simple group is abelian, since its commutator subgroup is normal and cannot equal the whole group if the derived series terminates. An abelian simple finite group is cyclic of prime order. Therefore a finite group is soluble exactly when all its Jordan–Hölder factors are cyclic of prime order: necessity follows from the subgroup/quotient property, and sufficiency follows from the extension principle. Its chief factors are elementary abelian, by the minimal-normal-subgroup result.

For nilpotence, the lower central series is ${\gamma }_1(G)=G$, ${\gamma }_{i+1}(G)=[{\gamma }_i(G),G]$. A group is nilpotent if ${\gamma }_{c+1}=1$ for some $c$. An ascending central series $1=N_0\le \cdots \le N_c=G$ satisfies $[N_{i+1},G]\le N_i$. Reversing a terminating lower central series gives such a central series. Conversely, induction gives ${\gamma }_i(G)\le N_{c-i+1}$, so any such central series forces ${\gamma }_{c+1}=1$. The upper central series $Z_0=1$, $Z_{i+1}/Z_i=Z(G/Z_i)$ contains every ascending central series term by term, and thus reaches $G$ exactly in the nilpotent case. Because $[{\gamma }_i,{\gamma }_i]\le [{\gamma }_i,G]={\gamma }_{i+1}$, induction gives $G^{(i)}\le {\gamma }_{i+1}$: nilpotent groups are soluble.

For finite groups there is the stronger structural characterization: a finite group is nilpotent exactly when it is the direct product of groups formed from its Sylow subgroups. To prove the forward direction, the upper central series gives the normalizer condition. If $H<G$, choose its first term $Z_i$ not contained in $H$, with $Z_{i-1}\le H$. An element of $Z_i\setminus H$ has all group commutators with $H$ in $Z_{i-1}$, so normalizes $H$. Hence $H<N_G(H)$.

For a Sylow subgroup $P$, its normalizer is self-normalizing. Indeed, if $x$ normalizes $N_G(P)$, the two Sylow subgroups $P^x,P$ of that normalizer are conjugate there; adjusting $x$ by an element of $N_G(P)$ puts it in $N_G(P)$ already. Applying the strict normalizer condition to $N_G(P)$ shows that it cannot be proper, so $P$ is normal. Normal Sylow subgroups of distinct primes commute, since their group commutators lie in their trivial intersection. Their product has cardinality $|G|$ and is direct.

Conversely, a nontrivial finite $p$-group has nontrivial centre: in the class equation every noncentral conjugacy class has size divisible by $p$, so $p$ divides the centre's order. Induct on its order through the quotient by its centre to obtain an upper central series. Thus every finite $p$-group is nilpotent, and a finite direct product of groups of them is nilpotent because its upper central series is obtained componentwise.

A finite supersolvable group has a normal series of a group with cyclic prime-order factors. It is soluble, but the ambient-normal condition is stronger than the condition on a composition series. Finite nilpotent groups are supersolvable: a $p$-group has a central subgroup of order $p$, and induction in its quotient builds an ambient-normal prime-factor series; direct products of groups of the Sylow factors combine these series. The converses fail. The group $S_3$ is supersolvable via $1<C_3<S_3$, but is not nilpotent because its Sylow $2$-subgroups are not normal. The group $A_4$ is soluble via $1<V_4<A_4$, but is not supersolvable: no subgroup of order two is normal, since the three involutions are conjugate, and no subgroup of order three is normal, since there are four such subgroups. In this example $1<C_2<V_4<A_4$ is a composition series whose first $C_2$ is not normal in $A_4$, while $1<V_4<A_4$ is a chief series with a nonsimple chief factor $V_4$.

Finally, a perfect group satisfies $G^{\prime }=G$. In any finite group, the derived series eventually stabilizes at a perfect characteristic subgroup, because a descending sequence of finite subgroup orders eventually stops decreasing. It is trivial exactly when the group is soluble. A nonabelian simple group is perfect: its nontrivial commutator subgroup is normal and must be the whole group. Thus series distinguish successively stronger notions, summarize the building blocks through Jordan–Hölder factors, and separate soluble behaviour from a persistent perfect part.

For a set of primes $\pi$, a Hall $\pi$-subgroup $H$ of a finite group is a subgroup whose order uses only primes in $\pi$ and whose subgroup index uses only primes outside $\pi$. Equivalently, $|H|$ is the full $\pi$-part of $|G|$. A Hall subgroup is a Hall $\pi$-subgroup for some $\pi$. The theorem of P. Hall for finite soluble groups states: Hall $\pi$-subgroups exist for every $\pi$, any two are conjugate, and every $\pi$-subgroup is contained in a Hall $\pi$-subgroup.

For the existence proof, first give the explicit coprime splitting calculation needed in the induction. Let $N$ be elementary abelian of field characteristic $r$, normal in $E$, with $r\nmid |E/N|$. Write $Q=E/N$ and use additive notation on $N$. A normalized section $s:Q\to E$ gives an action $x\cdot n=s(x)ns(x{)}^{-1}$ independent of its choice, since $N$ is abelian. Write $s(x)s(y)=f(x,y)s(xy)$. Associativity givesSum over $z\in Q$, put $S(x)={\sum }_{z}f(x,z)$, and divide by $|Q|$ in the vector space $N$. This is legitimate because $r\nmid |Q|$. With $b(x)=|Q{|}^{-1}S(x)$ one obtainsThe new section $s^{\prime }(x)=(-b(x))s(x)$ therefore has zero multiplication defect and is a group homomorphism. Its image is a complement to $N$.

We will also need a single conjugation carrying one complement to the other. If two homomorphic sections differ by $d(x)$, their difference satisfies $d(xy)=d(x)+x\cdot d(y)$. Summing over $y$ gives $d(x)=c-x\cdot c$, where $c=|Q{|}^{-1}{\sum }_{y}d(y)$. Thus the second section is $cs(x)c^{-1}$. This proves, by explicit averaging, both coprime splitting over an elementary abelian normal subgroup and the existence of such a conjugation by an element of $N$.

Now induct on $|G|$ for Hall subgroup existence in soluble groups. A minimal normal subgroup $N$ of a finite soluble group is elementary abelian of some field characteristic $r$. Indeed, $N^{\prime }$ is a characteristic subgroup of $N$ and normal in $G$; it cannot equal $N$ because $N$ is soluble, so it is trivial. In this abelian group, a nontrivial primary component is a characteristic subgroup, forcing a single prime, and the characteristic subgroup annihilated by that prime forces exponent $r$.

By induction $G/N$ has a Hall $\pi$-subgroup $\overline{H}$, with preimage $M$. If $M<G$, induction in $M$ supplies a Hall $\pi$-subgroup of $M$, which is also Hall in $G$ because $[G:M]$ is prime to all primes in $\pi$. If $M=G$, the quotient is a $\pi$-group. When $r\in \pi$, $G$ itself is a $\pi$-group. When $r\notin \pi$, the averaging construction splits off $N$, and its complement has order $|G/N|$ and is the required Hall $\pi$-subgroup. This completes the existence proof, including the identity group and empty prime set.

A Sylow basis is a family $\{P_p:p\mid |G|\}$ containing one Sylow subgroup for each prime, with $P_p{P}_q=P_q{P}_p$ for each pair. This is permutability of subgroups, not commutation of all their elements. The product of any subfamily is a subgroup: commuting the factors as sets proves closure and closure under inversion. Inductively its order is the product of the prime-power orders, since the newly adjoined factor has trivial intersection with the earlier product. It is thus the corresponding Hall subgroup.

Prove existence of a Sylow basis by induction on $|G|$, again using elementary abelian $N$ of field characteristic $r$. Choose a basis $\{{\overline{P}}_p\}$ of $G/N$, taking ${\overline{P}}_r=1$ if $r$ does not divide that quotient's order. The product $\overline{H}={\prod }_{p\ne r}{\overline{P}}_p$ is its Hall $r^{\prime }$-subgroup. In its full preimage $T$, the averaging lemma supplies a complement $H$ to $N$, mapping isomorphically to $\overline{H}$. For $p\ne r$, let $P_p$ be the inverse image of ${\overline{P}}_p$ under this isomorphism within $H$. Let $P_r$ be the full preimage of ${\overline{P}}_r$ in $G$. These are Sylow subgroups of $G$. The other-prime pairs permute because they do so in $\overline{H}$. For $P_r$ and $P_p$, their product is contained in the full preimage of the subgroup ${\overline{P}}_r{\overline{P}}_p$ and has exactly that preimage's order $|N||{\overline{P}}_r||{\overline{P}}_p|$. Equality follows, so the product is a subgroup and these two factors permute as well. This constructs a basis.

To obtain a simultaneous conjugation of two bases, take two bases. Their images in $G/N$ are bases: $N$ lies in every Sylow $r$-subgroup, and the other-prime Sylow subgroups project injectively. By induction, conjugate one basis so that all corresponding images agree. The products of their non-$r$ factors are then two complements to $N$ in the same preimage $T$ of their common Hall $r^{\prime }$-subgroup. The averaging lemma for complements supplies a single element of $N$ conjugating these complements. In the resulting common complement each corresponding Sylow subgroup is the unique lift of its agreed quotient subgroup, so all non-$r$ factors agree. The $r$-factors already equal the full preimage of their common quotient factor and are preserved by conjugation from $N$. Thus all Sylow bases of a finite soluble group are conjugate.

In $S_4$ there are three Sylow $2$-subgroups of order eight: the action on the three pair-partitions of four points has kernel $V_4$, and these subgroups are the preimages of the three order-two subgroups of $S_3$. There are four Sylow $3$-subgroups, one for each three-point support. Every choice $P_2,P_3$ has trivial intersection and product of cardinality $8\cdot 3=24$, so $P_2{P}_3=S_4=P_3{P}_2$. ThereforeFor $E=V⋊S_4$, $V={\mathbb{F}}_5^4$, the Sylow $5$-subgroup is uniquely $V$. In a Sylow basis the product $P_2{P}_3$ is a Hall $5^{\prime }$-subgroup, hence a complement to $V$. Conversely, a basis of any complement together with $V$ is a basis of $E$, because $V$ is normal. The averaging lemma makes all complements conjugate by $V$. The stabilizer of the standard complement $S_4$ under this conjugation is $C_V(S_4)$: if a vector normalizes it, its group commutator with each complement element lies in both $V$ and that complement, hence is trivial. The fixed vectors under the natural coordinate permutation action are exactly $(a,a,a,a)$, so $|C_V(S_4)|=5$. There are consequently $5^4/5=125$ complements, and each has twelve bases. The complement is uniquely recovered from its basis as $P_2{P}_3$, so no basis is counted twice. The counting Sylow bases in a coprime elementary abelian extension formula yields

A plane crystallographic group is a discrete subgroup of the Euclidean plane's isometry group with compact quotient; equivalently a compact set has translates covering the plane. We prove the crystallographic restriction theorem without assuming its conclusion. The orientation-preserving subgroup $G^{+}$ has index at most two and still has a cocompact group action. Its subgroup $T$ of translations is discrete as an additive subgroup of ${\mathbb{R}}^2$.

Suppose $T$ were trivial. Linear parts of orientation-preserving plane isometries commute, so every group commutator in $G^{+}$ is a translation. Thus $G^{+}$ would be an abelian group. Every member would then commute with the given nontrivial rotation $g$ and preserve its unique fixed point. A discrete subgroup of the compact rotation group about that point is finite. Then $G$ would be finite, contradicting cocompactness on the unbounded plane. Hence $T$ contains a nonzero vector $v$.

If $g$ is a half-turn its order is already two. Otherwise its linear part $R$ rotates $v$ to a linearly independent vector $Rv$, and conjugating translations shows that $Rv\in T$. Thus $T$ spans the plane and is a euclidean lattice. A discrete additive subgroup meets every bounded closed set in finitely many points: an accumulating sequence would give nonzero differences tending to zero, contradicting isolation of the identity. To see the euclidean lattice assertion directly, choose a shortest nonzero translation $v$. Translations on its line are integer multiples of $v$. Reducing all parallel components modulo $v$ shows that nonzero perpendicular components are bounded away from zero, since otherwise infinitely many translation vectors would accumulate in a compact rectangle. Choose a vector $w$ with the smallest positive perpendicular component; reducing by $w$ and then $v$ proves $T=\mathbb{Z}v+\mathbb{Z}w$.

Conjugation by $g$ preserves this euclidean lattice. In its euclidean lattice basis, $R$ is therefore an invertible integer matrix with determinant one. Its trace is an integer and is also $2\cos \theta$, where $\theta$ is the rotation angle. Since $g$ is nontrivial,These values give angles of order $2,3,4,6$ respectively. Hence

A topological group is a group with a topology for which multiplication $G\times G\to G$ and inversion $G\to G$ are continuous. A profinite group has either of the following equivalent descriptions: a compact Hausdorff totally disconnected topological group, or an inverse limit of finite discrete groups. Totally disconnected means that every connected component is a singleton.

For clarity, an inverse system over a directed set $I$ consists of groups $G_i$ and maps ${\varphi }_{ij}:G_j\to G_i$ for $i\le j$, with ${\varphi }_{ii}=1$ and ${\varphi }_{ik}={\varphi }_{ij}{\varphi }_{jk}$. Its inverse limit iswith coordinatewise multiplication and the subspace topology. Equivalently, it is a group with compatible continuous projections such that every other compatible family of maps into the $G_i$ factors uniquely through it.

The displayed limit is a closed subgroup of the compact Hausdorff product of the finite groups, and is totally disconnected, since two different tuples are separated by a clopen coordinate condition. Conversely a compact Hausdorff totally disconnected group has a neighbourhood basis of open normal subgroups. One way to see the group part of this standard clopen-basis fact is to choose a clopen identity neighbourhood $U$ inside a prescribed neighbourhood. Compactness of $U$ and continuity give a symmetric identity neighbourhood $V$ with $VU\subseteq U$. The stabilizer $H=\{g:gU=U\}$ contains $V$, is open, and is contained in $U$ because $1\in U$. Its index is finite by part (ii); its normal core is the intersection of finitely many conjugates and is open and normal. The canonical mapis injective because these $N$ separate points, and surjective because compatible cosets have the finite intersection property and $G$ is compact. It is a homeomorphism by compactness and the Hausdorff property. This explains the equivalence of the two definitions.

The profinite Frattini subgroup is $\Phi (G)=\bigcap M$, where $M$ ranges over all maximal proper open subgroups; for the trivial group the empty intersection is $G$. For a pro-p group,Here powers and group commutators mean generated subgroups and the bar supplies closure. Every maximal open subgroup in a pro-p group is normal of index $p$, as follows by passing to the finite p-group quotient by its normal core. Such a subgroup therefore contains all powers and group commutators. Conversely the quotient by $D=\overline{G^p[G,G]}$ is an abelian pro-p group of exponent $p$. If an element of this quotient is nontrivial, some finite elementary abelian quotient detects it; a linear functional to ${\mathbb{F}}_p$ then detects it as well. Its group homomorphism kernel pulls back to a maximal open subgroup of $G$. Thus the intersection of these kernels is exactly $D$.

We also use the topological generation criterion: a subset generates $G$ topologically if and only if its image generates $G/\Phi (G)$ topologically. To prove the nontrivial direction, a proper closed generated subgroup $K$ lies in a proper open subgroup $KN$ for a suitably small open normal $N$, and hence in a maximal open subgroup obtained from the finite quotient $G/N$. Since that maximal subgroup contains $\Phi (G)$, the image of $K$ cannot generate the Frattini quotient.

Now suppose $G$ is a nontrivial procyclic pro-p group. If it had distinct maximal open subgroups $M_1,M_2$, the homomorphism to $C_p\times C_p$ induced by the two quotient maps would be onto: its projections are onto, and a proper such subgroup would be a one-dimensional graph, forcing the two kernels to coincide. Hence $G/(M_1\cap M_2)\cong C_p^2$, contradicting procyclicity. Thus there is exactly one maximal open subgroup $M$, and $\Phi (G)=M$. Any $g\notin M$ generates $G/\Phi (G)\cong C_p$, so the criterion givesFor the trivial group use its identity as generator. The additive group ${\mathbb{Z}}_p$ is an infinite example, topologically generated by $1$: its finite continuous quotients are cyclic $\mathbb{Z}/p^n\mathbb{Z}$.

Put $a=x^{p^{n-1}}$ and $b=y^{p^{n-1}}$, both in $U_{n-1}$. The collection formula givesIndeed the weight-two group commutator lies in $[U_{n-1},U_{n-1}]\le U_{2n-1}$, and its coefficient $\left(\genfrac{}{}{0ex}{}{p}{2}\right)$ is divisible by $p$ since $p$ is odd, moving it into $U_{2n}$. A group commutator of weight $j\ge 3$ in $a,b$ lies in $U_{jn-1}\le U_{2n}$; all higher terms are therefore harmless as well. This also covers $n=1$.

Let $v=x{+}_{n-1}y$ and $u=x{+}_{n}y$. Their powers satisfy $v^{p^n}=(ab{)}^p$ and $u^{p^n}=a^p{b}^p$. Taking $p^n$th roots of the collected congruence gives $u\equiv v(\mathrm{mod}{U}_n)$. Since $U_n=P_{n+1}\le P_n$, this proves the requested, slightly weaker, resultFor $n=1$ the definition ${+}_0=$ ordinary multiplication makes the comparison meaningful.

The uniform group commutator estimate givesThus $x^{p^n}{y}^{p^n}$ and $y^{p^n}{x}^{p^n}$ are congruent modulo $U_{2n+1}$. Taking their unique $p^n$th roots and using the power-congruence property moves the error layer back by $n$, giving

For a pro-p group, the lower p-series is the descending sequence of closed characteristic subgroupsThe bar means closure of the subgroup generated by the displayed powers and group commutators. Throughout this question $p$ is odd. For a finitely generated powerful pro-p group, group commutator collection gives $P_i(G)=G^{p^{i-1}}$, each $P_i$ is powerful, and $\Phi (P_i)=P_{i+1}$. All these subgroups are open. A uniform pro-p group is such a group with all subgroup indices $[P_i:P_{i+1}]$ equal to $[G:P_2]$. We use the standard powerful-group torsion criterion: a finitely generated powerful pro-p group is uniform exactly when it is a torsion-free group. For a uniform group of generator number $d$, the indices are $p^d$, and $x\mapsto x^{p^a}$ is a homeomorphism from $G$ onto $G^{p^a}$.

We record explicitly the collection facts used for the operations below. With $U_b=G^{p^b}=P_{b+1}$, one hasThe second statement is the power-congruence property: the $p$th-power map is an isomorphism on adjacent uniform layers, and collection gives $(yu{)}^p\equiv y^p{u}^p(\mathrm{mod}{U}_{b+2})$ for $u\in U_b$. Thus the first nonzero layer of a difference moves down exactly one step under a $p$th power. Iterating gives the asserted equivalence and also justifies taking roots of congruences. These facts follow from powerful-group group commutator collection, using divisibility by $p$ of $\left(\genfrac{}{}{0ex}{}{p}{2}\right)$ and the successive-layer power isomorphisms; they are the uniform-group structure results being used here.

The transported addition on a uniform pro-p group isThe product is in $U_n$ and has a unique $p^n$th root in $G$. For the comparison at $n=1$ define $x{+}_{0}y=xy$. The numbered proofs below establish associativity, approximate commutativity and compatibility of these operations.

The intrinsic Lie algebra of a uniform pro-p group has underlying set $G$, zero equal to the group identity, additive inverse $x^{-1}$, and operationsHere the group commutator is $[x,y]=x^{-1}{y}^{-1}xy$. For $\lambda \in {\mathbb{Z}}_p$, $x^{\lambda }$ is the limit of $x^{m_j}$ for integers $m_j\to \lambda$; the pro-$p$ topology makes it well defined. The addition sequence is Cauchy by the compatibility proved below. The group commutator estimate puts $[x^{p^n},y^{p^n}]$ in $U_{2n+1}$, so its displayed root exists and lies in $U_1$. Collection of group commutators shows that successive bracket approximants differ in layers tending to the identity, giving the other limit. The group commutator identities give additivity of the limiting bracket, and the Hall-Witt identity gives its Jacobi identity. Approximate commutativity makes limiting addition commutative. The resulting lattice $L_G$ is a free module over ${\mathbb{Z}}_p$ of rank $d(G)$, and $[L_G,L_G]\le p{L}_G$.

A powerful Lie algebra over p-adic integers, in the convention relevant here, is a Lie algebra $L$ whose underlying module is finite free over ${\mathbb{Z}}_p$ and whose bracket satisfies $[L,L]\le pL$. For $p=2$ the condition is instead $[L,L]\le 4L$. For odd $p$, define multiplication on its underlying set by the convergent Baker--Campbell--Hausdorff formulaAn iterated bracket of degree $m$ lies in $p^{m-1}L$. The BCH coefficient bound loses at most $\lfloor (m-1)/(p-1)\rfloor$ powers of $p$, so all higher-degree terms are integral, and their valuations tend to infinity. This explains both convergence and why multiplying a lattice with small bracket stays inside the lattice. Formal associativity of BCH passes to the convergent series, the identity is $0$, the inverse is $-x$, and every group power satisfies $x^{\ast m}=mx$. The quotients by $p^{a}L$ are finite p-groups. Hence the resulting compact group is a finitely generated torsion-free group and a pro-p group, and its group commutator lies in $pL$. Thus $(L,\ast )$ is a uniform pro-p group, with $P_i(L,\ast )=p^{i-1}L$ and successive index $p^{{\mathrm{rank}}_{{\mathbb{Z}}_p}L}$.

The standard uniform-group/Lie-lattice correspondence identifies these constructions as mutually inverse: $L_{(L,\ast )}\cong L$ and $(L_G,\ast )\cong G$. To see why the inverse limits recover the lattice operations, the addition approximant for a BCH group is $p^{-n}\mathrm{BCH}(p^{n}x,p^{n}y)$: its linear term is $x+y$ and every higher term tends to zero. Similarly its group commutator approximant has limiting term $[x,y]$. In the other direction, a local logarithm in the complete normed group algebra identifies the intrinsic operations with algebra addition and commutator and identifies group multiplication with BCH; the uniform power maps extend the identification from a sufficiently small power subgroup to all of $G$. Continuous group homomorphisms respect powers, unique roots and limits, while Lie algebra homomorphisms respect every BCH term, so the equivalence also preserves morphisms.