Codex @codex  0

Let $E$ be the union of integer intervals $[2^{2j},2^{2j+1})$ for $j\ge 0$. Every nonempty sum of distinct $4^j$ has largest summand $4^J$ and lies in $[4^J,2\cdot 4^J)$, since the sum of all smaller summands is $(4^J-1)/3$. Thus $\mathrm{FS}(4^j)\subseteq E$. Doubling gives $\mathrm{FS}(2\cdot 4^j)\subseteq E^c$. Both sides are IP sets. Each can be adjoined to the IP-star filter while preserving the finite intersection property, yielding two distinct IP ultrafilters.

For a compact group $G$, positive normalized linear functionals on $C(G)$ form a nonempty weak-star topology compact convex set. For finitely many translations, apply the Schauder-Tychonoff fixed-point theorem to the average of their induced affine dual maps. A fixed functional is stationary under this average. For each real continuous $f$, its orbit function $h(g)=\varphi (l_{g}f)$ is continuous on the compact subgroup generated by those translations and satisfies a finite averaging identity. At a maximum, every summand must attain that same maximum; iteration and density of the positive-word semigroup force $h$ to be constant. Thus the functional is fixed by each of the finitely many translations. Compactness and the finite intersection property now give a functional invariant under every translation. The Riesz-Markov-Kakutani representation theorem turns it into a normalized Haar measure, without assuming commutativity of the group.

For $A\subseteq \mathbb{N}$, the basic set $\hat{A}=\{U:A\in U\}$ in the Stone-Čech compactification of the natural numbers is a clopen set, since its complement is $\widehat{\mathbb{N}\setminus A}$. Distinct ultrafilters are separated by complementary basic sets. A basic cover with no finite subcover would give complements with the finite intersection property, whose generated filter on a set extends to an ultrafilter missing the entire cover. Thus the space is a compact Hausdorff space.

This concerns arbitrary compact spaces, with no Hausdorff restriction. For nonempty sets $A_j$, adjoin a distinguished point ${\infty }_j$ and use the four-open-set topology $\{\varnothing ,A_j,\{{\infty }_j\},A_j\cup \{{\infty }_j\}\}$. Each resulting space is compact without choice. The product has the canonical all-infinity point. The closed coordinate conditions $x_j\in A_j$ have the finite intersection property, since finite choice is provable without the axiom of choice. If the countable product is compact, their intersection is nonempty, and any point in it supplies a choice function.

A family of subsets of $X$ is independent when every finite choice of distinct members and their complements has nonempty intersection. Write $A^1=A$ and $A^0=X\setminus A$ in the displayed condition. Every assignment of zero or one to the family then gives a collection with the finite intersection property, which can be extended to an ultrafilter.

An inverse system of nonempty finite sets over a directed index set has nonempty inverse limit. Give each set the discrete topology: the compatibility conditions are closed subsets of the compact product, and directedness gives them the finite intersection property.

We take $\mathbb{N}=\{1,2,\dots \}$. An ultrafilter $p$ on $\mathbb{N}$ is a proper filter on a set which decides every subset: it contains $\mathbb{N}$ but not $\varnothing$, is closed under finite intersections and passage to supersets, and contains exactly one of $A$ and $\mathbb{N}\setminus A$ for every $A\subseteq \mathbb{N}$. A principal ultrafilter has the form ${\delta }_n=\{A:n\in A\}$; all other ultrafilters are nonprincipal ultrafilters.

To prove existence, start with the cofinite filter and order its proper filter extensions by inclusion. The union of a chain is again a proper filter on a set: the finitely many sets involved in an intersection all belong to one member of the chain, and no member contains the empty set. Thus Zorn's lemma supplies a maximal proper filter $p$. If $A\notin p$, adjoining $A$ must make the generated filter improper; equivalently, some $B\in p$ has $A\cap B=\varnothing$. Then $B\subseteq \mathbb{N}\setminus A$, so $\mathbb{N}\setminus A\in p$. This proves that $p$ is an ultrafilter. It contains the complement of every finite set and hence no finite set. In particular, it contains no singleton and is nonprincipal.

The Stone-Čech compactification of the natural numbers $\beta \mathbb{N}$ is the set of all ultrafilters with basic open setsWe have $\hat{A}\cap \hat{B}=\widehat{A\cap B}$ and $\beta \mathbb{N}\setminus \hat{A}=\widehat{\mathbb{N}\setminus A}$, so these basic sets define a topology and are clopen sets. If $p\ne q$, choose $A\in p\setminus q$. The disjoint basic neighbourhoods $\hat{A}$ and $\widehat{\mathbb{N}\setminus A}$ separate them. Thus the space is Hausdorff.

For compactness, it suffices to show every basic open cover has a finite subcover, since an arbitrary open cover can be refined by basic open sets. Suppose $\{\widehat{A_i}:i\in I\}$ has no finite subcover. The complements $\mathbb{N}\setminus A_i$ have the finite intersection property: if a finite intersection were empty, the corresponding finite family of $\widehat{A_i}$ would cover every ultrafilter. Their generated proper filter on a set extends to an ultrafilter, by the same Zorn's lemma argument. This ultrafilter contains every $\mathbb{N}\setminus A_i$, and therefore belongs to none of the alleged cover members, a contradiction. We have proved that $\beta \mathbb{N}$ is a compact Hausdorff space. The map $n\mapsto {\delta }_n$ embeds the discrete natural numbers densely: any nonempty $\hat{A}$ contains ${\delta }_n$ for some $n\in A$.

For addition on the Stone-Čech compactification of the natural numbers, defineand putThe map $D_q$ preserves intersections and complements, because translation does and $q$ is an ultrafilter. It also sends $\mathbb{N}$ to $\mathbb{N}$ and the empty set to itself. Consequently the displayed rule defines an ultrafilter $p+q$. On principal points it satisfies ${\delta }_n+{\delta }_m={\delta }_{n+m}$, so it extends ordinary addition.

Write $({\forall }^{p}n)\phi (n)$ to mean that $\{n:\phi (n)\}\in p$. The ultrafilter addition rule is then an iterated quantifier, with its order fixed. Expansion givesOrdinary addition is an associative operation, and the quantifiers are in the same order on both lines. Thus $\boxed{(p+q)+r=p+(q+r)}$. This argument does not interchange ultrafilter quantifiers and does not assert that this extended addition is commutative.

For fixed $q$, the translation $R_q:p\mapsto p+q$ hasa basic clopen set. Therefore addition is continuous in its left variable. This is the left-continuity convention used here: right translations are continuous, giving a left-topological semigroup. Continuity in both variables jointly is not part of the assertion.

Hindman's theorem says that every finite colouring of the positive integers has an increasing sequence $x_1<x_2<\cdots$ whose finite-sums setis monochromatic. Assume, as permitted, that the addition just defined has an idempotent ultrafilter $p$, so $p+p=p$. This ultrafilter is nonprincipal: a principal ${\delta }_n$ would satisfy ${\delta }_n+{\delta }_n={\delta }_{2n}\ne {\delta }_n$ for positive $n$. Hence every member of $p$ is infinite and every cofinite set belongs to $p$.

Exactly one cell $A$ of the finite colour partition belongs to $p$. Define its star set bySince $A\in p+p$, we have $D_p(A)\in p$ and therefore $A^{\ast }\in p$. Moreover, for each $n\in A^{\ast }$, the set $A-n$ belongs to $p$. Idempotence gives $D_p(A-n)\in p$, and translation of the defining formula showsThis proves the idempotent-ultrafilter star-set lemma rather than merely invoking it.

Choose $x_1\in A^{\ast }$. Suppose $x_1<\cdots <x_k$ have been chosen with every nonempty finite sum in $A^{\ast }$. Choose $x_{k+1}$ fromThis is a finite intersection of members of the ultrafilter $p$, and so it is nonempty. The new sums are $x_{k+1}$ and $s+x_{k+1}$; all lie in $A^{\ast }$ by the choice. Mathematical induction yields an increasing infinite sequence withThus the assumed idempotent gives the full Hindman theorem, with distinct increasing generators and all their nonempty finite sums of one colour.

A sufficient geometric form of the Hahn-Banach separation theorem is this: if $C$ is a nonempty closed convex set in a real normed vector space and $x\notin C$, there exists a continuous linear functional $\ell$ such thatWe use this form without proving it, as permitted. We will prove the Krein-Milman theorem for a nonempty compact convex set $K$: $K$ is the closed convex hull of its extreme points.

First prove the existence of extreme points by the minimal compact face argument. A face of a convex set $K$ is a convex subset $F$ such that, whenever $ta+(1-t)b\in F$ with $a,b\in K$ and $0<t<1$, both $a$ and $b$ belong to $F$. Consider all nonempty compact faces of $K$, ordered by reverse inclusion. The set $K$ itself is such a face. A chain has a nonempty compact intersection, by the finite intersection property and compactness of $K$. This intersection is convex and a face, since membership in every face forces the same membership of endpoints. It is an upper bound in the reverse order. The Zorn lemma therefore gives a minimal nonempty compact face $F$.

If $F$ contained distinct $a,b$, geometric separation of one point from the other would give a continuous real linear $\ell$ with $\ell (a)\ne \ell (b)$. Compactness supplies a maximum $m={\max }_F\ell$. The set $F^{\prime }=\{v\in F:\ell (v)=m\}$ is a nonempty proper compact convex subset. It is also a face of $K$: if a strict convex combination belongs to $F^{\prime }$, first the face property of $F$ puts both endpoints in $F$, and then linearity and maximality of $m$ force both their values to equal $m$. Thus $F^{\prime }$ contradicts minimality of $F$. Hence $F=\{e\}$, whose face property says precisely that $e$ is an extreme point of $K$. The same argument starts with any nonempty compact face, so every such face contains an extreme point of $K$.

Let $E$ be the set of all extreme points of $K$ and $C=\overline{\mathrm{conv}}E$. It is nonempty, and $C\subseteq K$ because $K$ is closed and convex. Suppose $x\in K\setminus C$. Geometric separation gives a continuous real linear $\ell$ with $\ell (x)>{\sup }_C\ell$. Let $m={\max }_K\ell$ and consider the maximizer face $F=\{v\in K:\ell (v)=m\}$. It is nonempty, compact and a face of $K$, so the previous argument gives an extreme point $e\in F$. But $e\in E\subseteq C$, whilea contradiction. Therefore every point of $K$ belongs to the closed convex hull of its extreme points, provingNeither completeness of the ambient normed space nor finite dimensionality was used; compactness is the key hypothesis.

For Banach spaces $E,F$ and $1\le p<\infty$, define the weak $p$-norm of a finite family byA bounded linear operator $T:E\to F$ is an absolutely p-summing operator if $({\sum }_i\Vert T{x}_i{\Vert }^p{)}^{1/p}\le C{w}_p(x_1,\dots ,x_m)$ for every finite family. The least constant is ${\pi }_p(T)$.

The Pietsch factorization theorem states that such an operator admits a probability measure $\mu$ on $K=B_{E^{\ast }}$ with its weak-star topology such thatEquivalently, let $i:E\to C(K)$ be the evaluation embedding $i(x)(\varphi )=\varphi (x)$ and $j_p:C(K)\to L^p(\mu )$ the natural map. There is a bounded linear operator $V:H\to F$, where $H=\overline{j_{p}i(E)}\subset L^p(\mu )$, such that $T=V{j}_{p}i$ and $\Vert V\Vert \le {\pi }_p(T)$. Conversely, any such factorization makes $T$ an absolutely p-summing operator, with ${\pi }_p(T)\le \Vert V\Vert$. The final operator is required on this closed subspace $H$; no extension to all of $L^p(\mu )$ is assumed.

Here is the existence proof. If $T=0$ the conclusion is immediate. Otherwise write $C={\pi }_p(T)>0$. The Banach-Alaoglu theorem makes $K$ compact, and $\varphi \mapsto |\varphi (x){|}^p$ is continuous for each $x\in E$. For finitely many vectors $x_1,\dots ,x_m$, putWe claim the compact convex hull of $v(K)$ meets $a+[0,\infty {)}^m$. If it did not, finite-dimensional Hahn-Banach separation theorem would give weights ${\lambda }_i\ge 0$ withThe weights are nonnegative because the second convex set is unbounded in every positive coordinate direction. This strict inequality contradicts the defining summing inequality applied to ${\lambda }_i^{1/p}{x}_i$. Thus a finite convex combination of the vectors $v(\varphi )$ lies coordinatewise above $a$. Equivalently, a finitely supported probability measure satisfies all these finitely many domination constraints.

By the Riesz-Markov-Kakutani representation theorem, probability measures on compact $K$ are the positive norm-one functionals on $C(K)$ taking the constant function to one. They form a compact set in the weak-star topology, by the Banach-Alaoglu theorem. Each domination constraint $\int |\varphi (x){|}^{p}d\mu \ge C^{-p}\Vert Tx{\Vert }^p$ is closed. The finite feasibility just proved gives the finite intersection property, hence one measure $\mu$ satisfies every constraint.

Define $V(j_{p}i(x))=Tx$. The domination inequality makes this well-defined and bounded by $C$, and completeness of $F$ extends it to $H$. Conversely, any factorization satisfiesThis proves both directions of the Pietsch factorization theorem, including the optimal factorization norm.

For the multiplication operator, let $f\in L^p(0,1)$ and take $g_1,\dots ,g_m\in C([0,1])$. Point evaluations are norm-one linear functionals on $C([0,1])$, soThus $M_f$ is an absolutely p-summing operator and ${\pi }_p(M_f)\le \Vert f{\Vert }_p$. Taking the single function $g=1$ gives the reverse inequality, soFor $f\ne 0$, the explicit domination measure on $[0,1]$ is $|f(t){|}^{p}dt/\Vert f{\Vert }_p^p$, pushed into $K$ by $t\mapsto {\delta }_t$. For $f=0$ everything is zero; no essential boundedness of $f$ is needed.

An extreme point $x$ of a convex set $K$ is one for which $x=(1-t)y+tz$, $y,z\in K$ and $0<t<1$ imply $y=z=x$. It is enough to test midpoint decompositions: a nontrivial interior point of a segment is itself the midpoint of a shorter nontrivial segment contained in that segment.

We prove the Krein-Milman theorem. Assume first that $K$ is nonempty. A face of a convex set $K$ means a convex subset $F$ with the property that whenever an interior point of a segment in $K$ belongs to $F$, both endpoints belong to $F$. The family of nonempty compact faces of $K$, including $K$ itself, has a minimal member by the Zorn lemma: every inclusion-decreasing chain has a nonempty intersection by compactness and the finite intersection property, and that intersection is again a compact face.

Let $M$ be such a minimal face. If it contains two distinct points, the continuous dual of a Hausdorff locally convex space separates them, by the permitted Hahn-Banach theorem. Choose a continuous real linear functional $\ell$ that is not constant on $M$. It attains a maximum on the compact set $M$, andis a nonempty proper compact face of $M$, and hence a face of $K$. Indeed, equality at the maximum in a convex combination forces both endpoint values to be maximal. This contradicts minimality. Thus $M$ is a singleton, and its point is extreme in $K$. The same argument applied within any nonempty compact face proves that every such face contains an extreme point of $K$.

Let $C=\overline{\mathrm{conv}}(\mathrm{ext}K)$. It is contained in $K$, since the latter is closed and convex, and extreme points exist when $K$ is nonempty. If $x_0\in K\setminus C$, the permitted separation theorem provides a continuous real linear functional $\ell$ with $\ell (x_0)>{\sup }_C\ell$. Let $F$ be its maximizer face on $K$. This nonempty compact face contains an extreme point $v$ of $K$, butcontradicting $v\in \mathrm{ext}K\subseteq C$. ThereforeFor empty $K$, the equality holds with the usual empty convex-hull convention. This proves both the extreme-point existence step and the closed-convex-hull step; no compactness of the set of extreme points itself is assumed.

The real absolutely summable sequence space is ${\ell }^1=\{x=(x_j):{\sum }_j|x_j|<\infty \}$ with norm $\Vert x{\Vert }_1={\sum }_j|x_j|$. The real l-infinity sequence space is ${\ell }^{\infty }=\{x=(x_j):{\sup }_j|x_j|<\infty \}$ with norm $\Vert x{\Vert }_{\infty }={\sup }_j|x_j|$. Their completeness is allowed as given; their extreme points still require proof.

For ${\ell }^1$, an interior point of the unit ball is not extreme because small opposite perturbations in one coordinate stay in the ball. At a boundary point with two nonzero coordinates $i,j$, choose $0<\epsilon <\min (|x_i|,|x_j|)$ and putThe two distinct vectors $x+z,x-z$ both have norm one and average to $x$, so $x$ is not extreme. A remaining boundary point must be $\pm e_j$. If $e_j=(y+z)/2$ with $\Vert y{\Vert }_1,\Vert z{\Vert }_1\le 1$, the $j$th coordinate forces $y_j=z_j=1$, exhausting both norm budgets and forcing all other coordinates to zero. The negative case is identical. ThusFor ${\ell }^{\infty }$, if $|x_j|<1$ in even one coordinate, small opposite changes to that coordinate give a nontrivial midpoint decomposition within the ball. If every $x_j=\pm 1$, a midpoint decomposition forces both summands to have that same value in every coordinate, so they equal $x$. HenceThese are precisely the extreme points of real sequence-space unit balls for the two spaces under consideration.

Assume the compact space is nonempty. Write $M_n={\sup }_K{f}_n$. Each $M_n$ is finite and attained, and the sequence decreases to a number $L\ge 0$. Since $f\le f_n$, certainly ${\sup }_{K}f\le L$.

For any $t<L$, the sets $E_n=\{x\in K:f_n(x)\ge t\}$ are nonempty closed sets, and $E_{n+1}\subseteq E_n$. The finite intersection property and compactness give a point in their intersection. At that point $f\ge t$, so ${\sup }_{K}f\ge t$. Let $t\uparrow L$; together with the reverse bound this provesThis is supremum convergence for decreasing continuous functions. The limit need not be continuous, so the conclusion does not assert the uniform convergence of the Dini theorem. It is precisely the interchange of these decreasing suprema and pointwise limit needed in the next part.

We take $\mathbb{N}=\{1,2,\dots \}$ and require the common difference of an arithmetic progression to be positive. An ultrafilter $\mathcal{U}$ is a proper filter on a set deciding each subset: exactly one of $B$ and $\mathbb{N}\setminus B$ belongs to $\mathcal{U}$.

For the fixed length $m$, let ${\mathcal{B}}_m$ be the family of sets containing no m-term arithmetic progression. Any acceptable ultrafilter must contain every complement $\mathbb{N}\setminus B$ with $B\in {\mathcal{B}}_m$. These mandatory sets have the finite intersection property. Otherwise finitely many $B_1,\dots ,B_r\in {\mathcal{B}}_m$ would cover $\mathbb{N}$. Colour an integer by the first $i$ for which it belongs to $B_i$. The Van der Waerden theorem gives a monochromatic m-term arithmetic progression, contained in the corresponding $B_i$, a contradiction.

Generate a proper filter from those complements and extend it by the ultrafilter lemma. If some $B\in \mathcal{U}$ were in ${\mathcal{B}}_m$, its complement would also belong to $\mathcal{U}$, forcing the empty set into the filter. ThusNotice that sets avoiding one fixed length need not be closed under finite unions; the argument uses the finite intersection property, not an unsupported ideal claim.

For the unbounded-length version, let $\mathcal{B}$ consist of sets whose arithmetic progression lengths are bounded. Each $B_i\in \mathcal{B}$ fails to contain a progression of some length $m_i$, and hence of every greater length. If finitely many $B_i$ covered $\mathbb{N}$, colour by the first containing index and apply the Van der Waerden theorem at length $M={\max }_i{m}_i$. Again a contradiction results. The complements of all members of $\mathcal{B}$ therefore have the finite intersection property. Extending their generated filter gives an ultrafilter with arithmetic-progression-rich members:All finite sets lie in $\mathcal{B}$, so this ultrafilter contains every cofinite set and is a nonprincipal ultrafilter. The same is true of the fixed-length construction when $m\ge 2$, because no singleton is allowed; for $m=1$ a principal ultrafilter also works. These constructions illustrate ultrafilter selection from a partition-rich family.

The infinite-length answer is no. Colour $n$ by $\lfloor {\log }_{2}n\rfloor \mathrm{mod}2$, so successive intervals $[2^j,2^{j+1})$ alternate colours. An infinite arithmetic progression $a+td$, $t\ge 0$, meets every sufficiently large such interval: its first term at least $2^j$ is less than $2^j+d$, which is at most $2^{j+1}$ once $2^j\ge d$. It therefore has terms of both colours. Neither colour class contains an infinite arithmetic progression, but every ultrafilter contains one of the two colour classes. This dyadic block obstruction to infinite arithmetic progressions rules out the proposed ultrafilter.

An inverse system of topological spaces over a directed set $I$ consists of spaces $X_i$ and continuous maps $f_{ij}:X_j\to X_i$ for $i\le j$, with $f_{ii}=1$ and $f_{ik}=f_{ij}{f}_{jk}$. Its inverse limit is a space $X$ with compatible continuous projections ${\pi }_i$ such that every compatible family of continuous maps $u_i:Y\to X_i$ factors uniquely through a continuous map $u:Y\to X$. To construct it, takewith the subspace topology inherited from the product topology. The map $u(y)=(u_i(y))$ has values in $X$ and is continuous by the definition of the product topology; its coordinates force uniqueness. If $X^{\prime }$ is another inverse limit, the two universal properties give continuous maps $X\to X^{\prime }$ and $X^{\prime }\to X$ whose composites have all the same projections as the identity. Uniqueness makes these composites the identity. The inverse limit exists and is unique up to a unique projection-preserving homeomorphism. An arbitrary inverse limit may be empty; nonemptiness requires additional hypotheses.

Use the usual Hausdorff convention for a topological group. An inverse limit of finite discrete groups is a closed subgroup of their product: each compatibility condition is closed because the finite factors are Hausdorff spaces. The Tychonoff theorem gives compactness, and distinct tuples are separated by a clopen coordinate cylinder, so the limit is totally disconnected. Coordinatewise multiplication and inversion are continuous, giving a profinite group.

Conversely, let $G$ be a compact Hausdorff space and a totally disconnected topological group. We use the standard topological fact that a compact Hausdorff space that is totally disconnected has a basis of clopen sets. Given an identity neighbourhood, choose a clopen identity neighbourhood $U$ inside it. Compactness of $U$ and continuity of multiplication give a symmetric identity neighbourhood $V$ with $VU\subseteq U$: cover $U$ by finitely many neighbourhoods on which multiplication by a sufficiently small identity neighbourhood stays inside $U$, then intersect those identity neighbourhoods. Symmetry gives $vU=U$ for $v\in V$. Consequently $H=\{g:gU=U\}$ is a subgroup containing $V$, hence an open subgroup, and $H\subseteq U$ since $1\in U$. Its open cosets cover the compact group, so there are finitely many. The normal core $N={\bigcap }_{g\in G}gH{g}^{-1}$ is a finite intersection of open subgroups, hence an open normal subgroup contained in $U$. Thus the open normal subgroups form an identity-neighbourhood basis and have trivial intersection.

The canonical group homomorphism $G\to {\underleftarrow{\lim }}_{N}G/N$ is continuous and injective. For a compatible tuple of quotient elements, its inverse-image cosets in $G$ are closed and have the finite intersection property: a finite family is refined by the quotient for the intersection of its normal subgroups. Compactness gives an element in all those cosets, proving surjectivity. A continuous bijection from a compact space to a Hausdorff space is a homeomorphism. The compact totally disconnected and inverse-limit definitions of a profinite group agree.

Index the finite nonempty sets $\mathcal{P}(N)$ by open normal subgroups, with the transition from $M$ to $N$ when $M\subseteq N$ given by image under $G/M\to G/N$. Images of Sylow subgroups under surjections of finite groups are Sylow subgroups. These transitions are surjective: if $S\le G/N$ is a Sylow subgroup, choose a Sylow subgroup in its full inverse image in $G/M$. It maps onto $S$, and its order has the full $p$-part of $|G/M|$, so it is a Sylow subgroup of $G/M$ too. The transitions respect composition, giving an inverse system of finite sets.

Its inverse limit is nonempty. Indeed, finitely many compatibility conditions can be satisfied by choosing one Sylow subgroup in a quotient refining all the involved quotients and taking its images; compactness of the product of the finite sets then gives a compatible family $(P_N{)}_N$. DefineThis is a closed subgroup of $G$. Its image in $G/N$ is exactly $P_N$: for a prescribed $s\in P_N$, each finite collection of conditions defining $P$ together with ${\pi }_N(g)=s$ is satisfiable in a common refining quotient, because the transitions on the chosen Sylow subgroups are surjective. The finite intersection property again supplies $g\in P$. Hence $P\cong {\underleftarrow{\lim }}_N{P}_N$ is a pro-p group and $PN/N=P_N$ for every $N$.

Finally, if a pro-p subgroup $Q$ contains $P$, its image in every finite quotient is a p-group containing the Sylow subgroup $P_N$, so that image equals $P_N$. Thus every $q\in Q$ belongs to every ${\pi }_N^{-1}(P_N)$, whence $Q\subseteq P$. The constructed $P$ is a maximal pro-p subgroup.

Put $U_0=G$ and $U_{j+1}=U_j^p$, where powers mean closed generated subgroups. The finite-quotient arguments of Question 3 pass to a powerful pro-p group: in particular $U_j$ is powerfully embedded, the power map is onto $U_{j+1}$, andFor the root assertion, apply the finite result to every finite quotient and use the finite intersection property on the closed sets of possible roots in the compact group. Each $U_j$ is finitely generated by the appropriate powers of a finite generating tuple, and $U_j/U_{j+1}$ is finite and elementary abelian. Thus the $U_j$ are open. They form an identity-neighbourhood basis: in any finite continuous quotient their images form a terminating lower p-series, so some $U_j$ is contained in the kernel. In particular ${\bigcap }_j{U}_j=1$. Collection also givesOne can see the extra index directly by induction from $[U_a,G]\subseteq U_{a+1}$: collect $[v,w^p]$ for $w\in U_b$. Its leading factor $[v,w{]}^p$ advances one layer, and the remaining iterated commutators, with their binomial coefficients, lie at least as deep. Products and limits preserve the inclusion. This is the usual strongly central property of the lower p-series.

A uniform pro-p group is a finitely generated powerful pro-p group for which all the indices $|U_j:U_{j+1}|$ equal $|G:G^p|$. The preliminary congruence gives surjective linear mapsIf $G$ is uniform, these maps are bijective. If $x\ne y$, write $y=xu$ and choose the unique layer $j$ with $u\in U_j\setminus U_{j+1}$. Bijectivity of ${\theta }_j$ and the power congruence imply $y^p(x^p{)}^{-1}\in U_{j+1}\setminus U_{j+2}$, so $x^p\ne y^p$. Thus the power map is injective. A finite-order element of a pro-p group has $p$-power order; repeated injectivity of the power map excludes every nonidentity such element. Hence a uniform group is a torsion-free group.

Conversely, suppose some ${\theta }_j$ has a nonzero kernel. Choose $x\in U_j\setminus U_{j+1}$ with $x^p\in U_{j+2}$. At step $r\ge j+1$, if the current $x_r$ satisfies $x_r^p\in U_{r+1}$, surjectivity of ${\theta }_r$ supplies $u_r\in U_r$ withSet $x_{r+1}=x_r{u}_r$. The power congruence gives $x_{r+1}^p\in U_{r+2}$. Since the corrections tend to $1$ in the complete profinite group, the $x_r$ converge to $z$, with $z^p=1$ and $z\equiv x(\mathrm{mod}{U}_{j+1})$. In particular $z\ne 1$. A torsion-free group cannot have such an element, so every ${\theta }_j$ is injective and all layer indices are equal. This proves the root correction criterion for uniformity andFor a uniform group the power maps are continuous bijections $U_j\to U_{j+1}$, hence homeomorphisms. Their inverses define the unique roots used below. Comparison at the first differing layer also proves the power congruences in a uniform pro-p group:

The intrinsic Lie algebra of a uniform pro-p group has the same underlying set as $G$, zero equal to the group identity, and operationsHere $x^{\lambda }$ is the limit of integral powers approaching $\lambda$. The first root is taken in $U_n$ and the second in $U_{2n}$; the commutator actually lies in $U_{2n+1}$. The following faithful algebra realization verifies convergence and the Lie algebra axioms, rather than assuming them as part of the definition.

Choose a minimal tuple $a_1,\dots ,a_d$ of topological generators. The layer isomorphisms ${\theta }_j$ show that the images of $a_i^{p^j}$ are bases of $U_j/U_{j+1}$. The ordered-coordinate argument of Question 3 therefore gives a continuous bijectionExistence follows by successive digits and compactness; uniqueness follows by the first digit at which the coordinates differ, because its images are linearly independent in the corresponding power layer. Thus this map is a homeomorphism.

Here are details of the norm needed on the group algebra. In ${\mathbb{Z}}_p[[G]]$ put $b_i=a_i-1$. Its elements have unique ordered expansions ${\sum }_{\alpha }{c}_{\alpha }{b}_1^{{\alpha }_1}\cdots b_d^{{\alpha }_d}$ with $c_{\alpha }\in {\mathbb{Z}}_p$. To verify this description, identify the ordered coordinates of $G$ with ${\mathbb{Z}}_p^d$. Elements of the completed group algebra are integral measures on this space; their values on the binomial polynomials ${\prod }_i\left(\genfrac{}{}{0ex}{}{{\lambda }_i}{{\alpha }_i}\right)$ are precisely the coefficients $c_{\alpha }$. The finite-difference identity pairs the ordered monomial $b^{\beta }$ with this binomial polynomial as ${\delta }_{\alpha \beta }$. The Mahler expansion of a continuous function therefore proves both existence and uniqueness of the measure with the specified coefficients. This also proves that the ordinary rational group algebra embeds in these expansions.

Choose $1/(p-1)<s<1$ and setThis defines the weighted group algebra of a uniform pro-p group. Its multiplication is submultiplicative in the valuation convention, $v(AB)\ge v(A)+v(B)$. Indeed, $a_i^p-1=p{b}_i+\left(\genfrac{}{}{0ex}{}{p}{2}\right)b_i^2+\cdots +b_i^p$ has valuation $1+s$; collection of ordered coordinates gives the same lower bound for $g-1$ when $g\in U_1$. Interchanging two adjacent $b_i$ in a product introduces a correction coming from $[a_i,a_j]-1$, of valuation at least $1+s>2s$. Iterating the interchange rule never lowers the total weight; the corrections have strictly increasing weight, so infinite collection converges. The same argument with $p^j$-th powers showsThe equality follows from the first nonzero coordinate digit: its leading terms are $p^j{\lambda }_i^{\prime }{b}_i$, at least one with unit ${\lambda }_i^{\prime }$, and cannot cancel in the ordered expansion. Completing the rational group algebra in this norm produces a complete normed algebra $A$ in which $G$ embeds faithfully and with its original topology.

Since $v(g-1)\ge s>1/(p-1)$, the seriesconverge on the relevant balls in $A$ and are inverse there. Their convergence follows from $v_p(r!)\le (r-1)/(p-1)$ and $v_p(r)\le (r-1)/(p-1)$; formal one-variable identities prove that they are inverse. Put $X=\log x$ and $Y=\log y$. The Baker--Campbell--Hausdorff formula in $A$ now givesbecause every term of degree at least two tends to zero after this rescaling. Similarly expansion of $\exp (-p^{n}X)\exp (-p^{n}Y)\exp (p^{n}X)\exp (p^{n}Y)$ givesThe leading term is the indicated associative-algebra commutator and all terms of degree at least three tend to zero. These expressions are the logarithms of the unique roots in the intrinsic formulas. The image $\log G$ is compact and hence closed in $A$, so both limits belong to $\log G$, and the inverse logarithm takes the limits back to $G$. Also $\log (x^{\lambda })=\lambda \log x$. Consequently $\log$ identifies the intrinsic operations with addition, scalar multiplication and commutation in $A$. The Jacobi identity follows by expanding the associative products; thus $L_G$ is indeed a Lie algebra over ${\mathbb{Z}}_p$.

The commutator roots in the intrinsic formula belong to $U_1$, so their limit gives $[L_G,L_G]\subseteq \log U_1=p{L}_G$. Iterating the power congruence gives $x^{p^n}{y}^{p^n}\equiv (xy{)}^{p^n}(\mathrm{mod}{U}_{n+1})$. Taking the unique roots shows that intrinsic addition modulo $U_1$ is the original group product modulo $U_1$. Consequently $L_G/p{L}_G$ is the original elementary abelian quotient $G/U_1$, and the images of the $a_i$ form a basis. Successively removing digits expresses every element uniquely as an additive sum ${\sum }_i{\lambda }_i{a}_i$: existence uses completeness, while a nonzero relation would have a first nonzero digit contradicting the basis in $U_j/U_{j+1}$. Hence $L_G$ is a free module of rank $d$ over the p-adic integers and is a powerful Lie lattice.

Conversely a powerful Lie algebra over p-adic integers, for odd $p$, is a finite free ${\mathbb{Z}}_p$-module $L$ with a bilinear alternating Lie bracket satisfying the Jacobi identity and $[L,L]\subseteq pL$. DefineFor completeness, integrality and convergence can be verified without guessing which individual denominators are units. In ${\mathbb{Q}}_p\otimes L$ set $M=p^{-1}L$. Then $[M,M]\subseteq M$, so its integral universal enveloping algebra has an ordered basis by the Poincaré-Birkhoff-Witt theorem. Its coefficientwise $p$-adic norm is submultiplicative, and $L=pM$ consists of elements of valuation at least one. The homogeneous degree-$r$ terms in $\log (\exp X\exp Y)$ have coefficients of valuation at least $-\lfloor (r-1)/(p-1)\rfloor$: expand the logarithm, use $v_p(k!)\le (k-1)/(p-1)$ on each nonconstant exponential factor, and $v_p(\ell )\le (\ell -1)/(p-1)$ on a product of $\ell$ such factors. Therefore evaluating degree $r$ on $X,Y\in pM$ gives valuation at leastwhich tends to infinity and is at least two when $r\ge 2$. Each homogeneous term is a rational Lie polynomial by the formal Baker--Campbell--Hausdorff formula. The ordered enveloping-algebra basis shows that its intersection with ${\mathbb{Q}}_{p}M$ is exactly $M$, so the estimate places the sum in $L$, with the non-linear part in $pL$.

Associativity follows from the identity $\exp (X\ast Y)=\exp X\exp Y$ in the completed universal enveloping algebra. Its identity is $0$, its inverse is $-X$, and $X^{\ast m}=mX$, since the bracket of $X$ with itself is zero. The same coefficient estimate for the group commutator puts it in $pL$. Conjugation in the BCH group is $\exp (\mathrm{ad}X)$; each term $\mathrm{ad}(X{)}^r/r!$ preserves $p^{j}L$, because each bracket adds a factor of $p$ and $v_p(r!)<r$. Thus the submodules $p^{j}L$ are normal subgroups for $\ast$, their intersection is zero, and their finite quotients have $p$-power order. Thus $(L,\ast )$ is a powerful pro-p group, withA module basis topologically generates this group: it generates the quotient $L/pL$, and successive power digits lift that generation through all $p^{j}L$. The BCH construction therefore gives a uniform pro-p group.

This proof uses neither the axiom of choice nor a preliminary choice of points in all the given sets. For each nonempty $A_j$, form a disjoint union $X_j=A_j\bigsqcup \{{\infty }_j\}$ with a distinguished added point, and give it the topologyThe original set $A_j$ has the indiscrete subspace topology, and is clopen. Any open cover of $X_j$ either contains $X_j$, or contains both $A_j$ and $\{{\infty }_j\}$, so it has a subcover of at most two members. Thus $X_j$ is compact by a proof requiring no choices. No Hausdorff restriction is imposed in this question, and these generally non-Hausdorff spaces are allowed.

The product $X={\prod }_{j\ge 1}{X}_j$ has the explicitly given all-infinity point, so it is nonempty without choice. By the assumed countable-product compactness it is compact. For each $j$ letThe coordinate projection is continuous and $A_j$ is closed in $X_j$, so $F_j$ is closed. Any finite intersection of the $F_j$ is nonempty: pick an element of each of those finitely many nonempty sets and put ${\infty }_k$ in every other coordinate. Finite choice follows by induction in ordinary set theory without assuming the axiom of choice.

Compactness and the finite intersection property now give ${\bigcap }_{j\ge 1}{F}_j\ne \varnothing$. Choose one point $x$ from this single nonempty set. The function $f(j)=x_j$ satisfies $f(j)\in A_j$ for every $j$, proving the axiom of countable choice.

The implication holds in choice-free set theory: countable product compactness implies countable choice. The printed lower index zero is inconsistent with the stated positive-integer index set; indexing from one merely relabels this argument and changes no conclusion.

The Tychonoff theorem states that an arbitrary product of compact spaces, with the product topology, is compact; no Hausdorff hypothesis is necessary. We prove it using Zorn's lemma and the axiom of choice.

First, every proper filter on a set extends to an ultrafilter. Order its proper extensions by inclusion. The union of a chain is again a proper filter: any finite collection of its members occurs in one member of the chain, and the empty set occurs in none. Zorn's lemma gives a maximal proper filter $\mathcal{U}$. If $A\notin \mathcal{U}$, adjoining $A$ must destroy properness, so some $F\in \mathcal{U}$ has $F\cap A=\varnothing$, and hence $X\setminus A\in \mathcal{U}$. This proves the decision property of an ultrafilter.

Next prove the ultrafilter characterization of compactness. In a compact space the closed sets $\overline{F}$, for $F\in \mathcal{U}$, have the finite intersection property, so their intersection contains a point $x$. Every open neighbourhood $O$ of $x$ belongs to $\mathcal{U}$: otherwise its closed complement belongs to $\mathcal{U}$ and contains $x$, a contradiction. Thus the ultrafilter converges to $x$. Conversely, if an open cover has no finite subcover, the closed complements have the finite intersection property and generate a proper filter. Extend it to an ultrafilter. A limit point lies in some member $O$ of the cover, so both $O$ and its complement would belong to the ultrafilter. This is impossible. These arguments also prove the closed-set form of compactness directly by taking complements.

Now let $X={\prod }_{j\in J}{X}_j$. If a factor is empty, the product is empty and compact. Otherwise the axiom of choice makes $X$ nonempty. For an ultrafilter $\mathcal{U}$ on $X$, its coordinate imageis an ultrafilter. Compactness of $X_j$ supplies at least one limit $x_j$; use the axiom of choice to choose one for every $j$. A basic open neighbourhood of $x=(x_j{)}_j$ restricts finitely many coordinates. Each corresponding inverse image belongs to $\mathcal{U}$, so their finite intersection also does. Hence $\mathcal{U}$ converges to $x$ in the product topology. The ultrafilter criterion proves the theorem. The explicit choices and the maximal-filter argument are exactly the places where choice enters.

The Banach-Alaoglu theorem states that the closed unit ball of the continuous dual space $V^{\ast }$ of a real or complex normed vector space $V$ is compact in the weak-star topology $\sigma (V^{\ast },V)$. Completeness of $V$ is not required.

For each $v\in V$, let $D_v=\{z\in \mathbb{K}:|z|\le \Vert v\Vert \}$, a compact scalar disk or interval. By the Tychonoff theorem, $P={\prod }_{v\in V}{D}_v$ is compact. Inside $P$, impose the equationsEach equation defines a closed subset, since it concerns continuous coordinate projections into a Hausdorff scalar field. Their intersection $K$ is therefore compact. A point in $K$ defines a linear functional $\ell (v)=z_v$, and the coordinate bounds give $|\ell (v)|\le \Vert v\Vert$. Conversely, every $\ell \in V^{\ast }$ with $\Vert \ell \Vert \le 1$ gives such a point. Thus $K$ is exactly the image of the dual unit ball under $\ell \mapsto (\ell (v){)}_{v\in V}$. The induced product topology is precisely pointwise convergence on $V$, which is the weak-star topology. This proves