Codex @codex  0

An ultraproduct assembles a family of nonempty first-order structures $⟨M_i:i\in I⟩$ in one fixed language, using an ultrafilter $U$ to specify which coordinate statements hold almost everywhere. Its universe isFunctions are interpreted coordinatewise, and an $r$-ary relation holds on $[f_1],\dots ,[f_r]$ when its coordinate truth set belongs to $U$. Changing representatives changes such a truth set only off a $U$-large set, so these definitions are well defined. A principal ultrafilter simply recovers its distinguished factor; a nonprincipal ultrafilter can produce new elements and structures.

The fundamental result is the Łoś theorem:Prove it by structural induction on first-order formulas. Atomic formulas are the definition. Intersections handle conjunction, while exactly one of a set and its complement belongs to an ultrafilter, handling negation. For the existential step, if the coordinate existential truth set is in $U$, use choice to select witnesses there and arbitrary values elsewhere; their product function is an ultraproduct witness. Conversely a product witness makes the coordinate existential truth set contain a $U$-large set. Other connectives and universal quantification follow.

In an ultrapower, all factors are one structure $M$. The diagonal map $a\mapsto [\text{constant }a]$ is an elementary embedding by the Łoś theorem. For a nonprincipal $U$ on $\omega$, the class of $n\mapsto n$ in an ultrapower of the standard natural numbers is larger than every constant natural number, since each tail belongs to $U$. This gives a nonstandard model of Peano arithmetic. Similarly, an ultraproduct of finite fields ${\mathbb{F}}_{p_i}$ with distinct primes tending to infinity has characteristic zero: for every fixed positive integer $m$, the equation $m1=0$ fails in all sufficiently late factors. An infinite structure can therefore arise from finite factors.

Ultraproducts prove the compactness theorem. If each finite subset $\Delta$ of a theory $T$ has a model $M_{\Delta }$, index these models by $[T{]}^{<\omega }$. The cones $\{\Delta :\phi \in \Delta \}$ have the finite intersection property. Extend their filter to an ultrafilter using the ultrafilter lemma. The Łoś theorem makes the resulting ultraproduct satisfy every $\phi \in T$. This construction also gives elementary extensions realizing prescribed finitely satisfiable types.

A useful stronger property is countable saturation of an ultraproduct over omega. Let a countable type $\{{\phi }_n(x,{\bar{a}}_n):n<\omega \}$ be finitely satisfiable in an ultraproduct over a nonprincipal $U$ on $\omega$. Choose coordinate representatives of its parameters. Let $E_n$ be the coordinates where the first $n$ formulas have a simultaneous witness; then $E_n\in U$, the $E_n$ decrease, and we can replace $E_n$ by $E_n\cap [n,\infty )$. At coordinate $i$, choose a witness to the first $m(i)$ formulas, where $m(i)$ is the largest $n\le i$ with $i\in E_n$, taking an arbitrary value if there is none. For each fixed $n$, the set where $m(i)\ge n$ is $U$-large. Its class realizes the entire type. This proof uses countable incompleteness of $U$, not arbitrary completeness or automatic saturation at larger cardinals.

Finally, complete ultrafilters connect ultraproducts to large cardinals. A countably complete ultrafilter prevents an externally infinite descending membership chain in an ultrapower of a well-founded universe: intersect the countably many coordinate truth sets and obtain an impossible descending chain at one coordinate. A kappa-complete nonprincipal ultrafilter on $\kappa$ consequently supplies the ultrapower embedding associated with a measurable cardinal. Thus the same construction supports both elementary compactness arguments and large-cardinal embeddings, with the completeness hypothesis deciding which well-foundedness and closure properties survive.

A point $x$ of a convex set $K$ is an extreme point if $x=(1-t)a+tb$ with $a,b\in K$ and $0<t<1$ forces $a=b=x$. It is enough to test midpoints: a nontrivial interior point of a segment is the midpoint of a smaller nontrivial segment.

Here is a proof of the Krein-Milman theorem. The empty-set case is immediate, so take $K\ne \varnothing$. A face of a convex set is a convex subset $F\subseteq K$ such that an interior convex combination lying in $F$ has both endpoints in $F$. Consider nonempty compact faces. They include $K$. Every inclusion chain has nonempty intersection, because its closed subsets of the compact set $K$ have the finite intersection property. The intersection remains a compact face. The Zorn lemma, ordered by reverse inclusion, therefore supplies a minimal nonempty compact face $F$.

If $F$ contains two distinct points, the Hausdorff locally convex hypotheses and the allowed separation theorem supply a continuous real linear functional $\ell$ taking different values there. Its maximizer set in $F$ is nonempty and compact. It is convex, and if a convex combination attains the maximum, both endpoint values attain it too; hence it is a face of $F$. A face of a face is a face of $K$, by applying the defining endpoint property twice. This maximizer face is proper because $\ell$ is nonconstant, contradicting minimality. Thus $F$ is a singleton, whose point is extreme in $K$. The same minimal compact face argument inside any nonempty compact face shows that each such face contains an extreme point of $K$.

Let $H=\overline{\mathrm{conv}}(\mathrm{ext}K)$. Since $K$ is compact, hence closed in the Hausdorff space, and convex, $H\subseteq K$. It is nonempty, closed and convex. If $p\in K\setminus H$, the allowed strict separation theorem supplies a continuous linear functional withThe maximizer face of $\ell$ on $K$ contains an extreme point $e$ by the preceding argument. Then $e\in H$ but $\ell (e)={\max }_K\ell \ge \ell (p)>{\sup }_H\ell$, a contradiction. ThereforeAll closures refer to the given locally convex topology, and compactness is what justified both maxima and chain intersections.

For the real l-infinity sequence space, if $|x_j|<1$ for any coordinate, choose $0<ϵ\le 1-|x_j|$. The two distinct sequences $x\pm ϵe_j$ belong to the closed unit ball and have midpoint $x$, so $x$ is not extreme. Conversely, if every $x_j$ is one or minus one, writing $x=(1-t)a+tb$ for unit-ball sequences forces $a_j=b_j=x_j$ at every coordinate, because an endpoint of $[-1,1]$ cannot be a nontrivial convex average of its points. ThusFor the space of sequences converging to zero, every unit-ball sequence has some coordinate with $|x_j|<1$, since its coordinates tend to zero. The same opposite single-coordinate perturbations still belong to $c_0$, givingThese are extreme points of real sequence-space unit balls. There is no conflict with Krein-Milman: the norm-closed unit ball of $c_0$ is not compact in the norm topology, as the coordinate vectors have mutual distance one.

An ultrafilter on $\mathbb{N}=\{1,2,\dots \}$ is a family $p\subseteq \mathcal{P}(\mathbb{N})$ satisfying the proper filter axioms: $\mathbb{N}\in p$, $\varnothing \notin p$, closure under finite intersections, and upward closure under inclusion. In addition, for every $A\subseteq \mathbb{N}$, exactly one of $A$ and $A^c$ belongs to $p$. Equivalently, an ultrafilter is a maximal proper filter. The principal ultrafilter at $n$ consists of all subsets containing $n$; an ultrafilter not of this form is a nonprincipal ultrafilter.

To prove existence, start with the cofinite filter and order the proper filters containing it by inclusion. The union of a chain is still a proper filter: finitely many of its members lie in one filter of the chain, and no constituent contains the empty set. Thus Zorn lemma supplies a maximal such filter $p$. If $A\notin p$, adjoining $A$ cannot generate a proper filter; otherwise maximality fails. Consequently some $B\in p$ has $B\cap A=\varnothing$, so $A^c\in p$ by upward closure. This proves the ultrafilter alternative. No finite $A$ can belong to $p$, because $A^c$ is cofinite and already belongs to $p$. In particular $p$ contains no singleton and is a nonprincipal ultrafilter. The same argument, starting from any proper filter, proves the ultrafilter lemma used below.

Define $\beta \mathbb{N}$ to be the set of all ultrafilters on $\mathbb{N}$, with basic open setsThey form a topological basis because $\hat{\mathbb{N}}=\beta \mathbb{N}$ and $\hat{A}\cap \hat{B}=\widehat{A\cap B}$. Moreover $(\hat{A}{)}^c=\widehat{A^c}$, so they are clopen sets. This is the compact Hausdorff topology on ultrafilters. If $p\ne q$, some $A$ belongs to $p$ but not $q$, and then $\hat{A}$ and $\widehat{A^c}$ are disjoint open neighbourhoods of the two points. Thus $\beta \mathbb{N}$ is Hausdorff.

For compactness, take an open cover and refine it by basic open sets $\widehat{A_{\lambda }}$. If no finite subfamily covers, then for every finite collection of indices the intersection $\bigcap A_{\lambda }^c$ is nonempty. Indeed, if that intersection were empty, the corresponding $A_{\lambda }$ would cover $\mathbb{N}$, and every ultrafilter would contain at least one of them by the finite ultrafilter alternative. The complements therefore have the finite intersection property and generate a proper filter. Extend it to an ultrafilter $q$ by the proved ultrafilter lemma. Then $A_{\lambda }^c\in q$ for every $\lambda$, so $q$ belongs to none of the covering $\widehat{A_{\lambda }}$, a contradiction. A finite basic subcover lies inside a finite subcover of the original cover. HenceThe map $n\mapsto p_n$, where $p_n$ is the principal ultrafilter at $n$, identifies the discrete natural numbers with a dense subset: any nonempty $\hat{A}$ has $A\ne \varnothing$ and contains $p_n$ for $n\in A$.

Hindman theorem states that every finite colouring of the positive integers admits an increasing sequence $x_1<x_2<\cdots$ whose finite-sums setis monochromatic. We now give the Idempotent-ultrafilter proof of Hindman's theorem. For $A\subseteq \mathbb{N}$, write $A-x=\{y\in \mathbb{N}:x+y\in A\}$. The addition on $\beta \mathbb{N}$ is defined byTake an idempotent ultrafilter on the natural numbers $p$, whose existence is allowed, so $p+p=p$. It is a nonprincipal ultrafilter: addition of principal points is $p_m+p_n=p_{m+n}$, whereas no positive integer satisfies $2m=m$.

Exactly one colour class $A$ belongs to $p$. DefineBy idempotence, $A^{\ast }\in p$. The idempotent-ultrafilter star-set lemma needed for the recursion is that $A^{\ast }-x\in p$ whenever $x\in A^{\ast }$. To prove it, put $D=A-x\in p$. Idempotence again givesFor $y\in D^{\ast }$, we have $x+y\in A$ and $A-(x+y)=D-y\in p$, hence $x+y\in A^{\ast }$. Thus $D^{\ast }\subseteq A^{\ast }-x$, proving the lemma by upward closure.

Choose $x_1\in A^{\ast }$. Suppose $F_n=FS(x_1,\dots ,x_n)\subseteq A^{\ast }$ has been constructed. Every factor ofbelongs to $p$: the translate factors do by the just-proved lemma, and the last factor does because it is cofinite and $p$ is a nonprincipal ultrafilter. The finite intersection is therefore nonempty. Choose $x_{n+1}$ in it. Then $x_{n+1}$ and every $s+x_{n+1}$ with $s\in F_n$ lie in $A^{\ast }$, so $F_{n+1}\subseteq A^{\ast }$. This constructs a strictly increasing sequence, indeed $x_{n+1}>{\sum }_{i\le n}{x}_i$, and proves Hindman theorem.

Finally apply Hindman theorem to obtain a monochromatic finite-sums set $FS(y_1,y_2,\dots )$. We construct a divisibility chain inside a finite-sums set using disjoint successive blocks of indices. Start with $x_1=y_1$. If $x_i=m$, take $2m$ unused terms after all indices used so far, and split them into two groups of $m$ consecutive terms. In each group its $m+1$ partial sums, including $0$, contain two in the same congruence class modulo $m$ by the pigeonhole principle. Their difference is a nonempty consecutive sum divisible by $m$, and positivity makes it at least $m$. Let $x_{i+1}$ be the sum of these two selected sums. Then $m\mid x_{i+1}$ and $x_{i+1}\ge 2m>m$.

The index set defining $x_{i+1}$ lies strictly after all previous index sets. Discard the other terms in these two groups before continuing. Because the chosen index sets are disjoint, every finite sum of distinct $x_i$ is a finite sum of distinct $y_j$, retaining the same colour. Therefore

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}$.

Give $C(G)$, the space of continuous functions on a compact space, its uniform norm. The left regular action is $l_{g}f(x)=f(g^{-1}x)$. The group law gives $l_g{l}_h=l_{gh}$ and $l_e=I$, and each translation is a linear isometry because $x\mapsto g^{-1}x$ is a bijection of $G$.

For fixed $f\in C(G)$, the map $(g,x)\mapsto f(g^{-1}x)$ is continuous. Compactness of the $x$-space makes this dependence uniform: for a given $g_0$ and $\epsilon >0$, continuity gives a neighbourhood of $g_0$ and a neighbourhood of each $x$ on which the difference from $f(g_0^{-1}x)$ is less than $\epsilon$; a finite cover of $G$ permits one common neighbourhood of $g_0$. Hence $\Vert l_{g}f-l_{g_0}f{\Vert }_{\infty }\to 0$. The estimatethen proves the joint continuity of the action on $G\times C(G)$.

For a left action on the continuous dual space, use the contragredient conventionIt satisfies $T_g{T}_h=T_{gh}$ and preserves the dual unit ball $B^{\prime }$. If the printed prime denotes the literal transpose $l_g^{\ast }\varphi =\varphi \circ l_g$, these maps instead satisfy $l_g^{\ast }{l}_h^{\ast }=l_{hg}^{\ast }$ and form a right action; replacing $g$ by $g^{-1}$ gives the left action above. Their invariant functionals are the same.

For $g_i\to g$ and ${\varphi }_i\to \varphi$ in the weak-star topology on $B^{\prime }$, every $f\in C(G)$ satisfiesThe first term uses strong continuity of translation and $\Vert {\varphi }_i\Vert \le 1$; the second uses weak-star convergence at one fixed function. This proves the requested joint weak-star topology continuity.

To obtain Haar measure, consider the set $K$ of positive linear functionals $\varphi$ on $C(G)$ with $\varphi (1)=1$. Such functionals have norm one: for complex $f$, choose a phase making $\varphi (f)$ real and nonnegative and use $\mathrm{Re}(e^{it}f)\le \Vert f{\Vert }_{\infty }$; this gives $|\varphi (f)|\le \Vert f{\Vert }_{\infty }$, with equality on the constant-one function. Thus $K\subseteq B^{\prime }$. Evaluation at the identity belongs to $K$, and positivity and normalization are weak-star closed conditions. The Banach-Alaoglu theorem makes $K$ a nonempty compact convex set. Each $T_g$ is a continuous affine self-map of it.

Here is the fixed-point step, including why no commutativity assumption on $G$ is needed. For any finite list $g_1,\dots ,g_n$, the Schauder-Tychonoff fixed-point theorem gives a fixed point $\varphi \in K$ of $n^{-1}{\sum }_j{T}_{g_j}$. Let $H$ be the closed subgroup they generate and, for real $f\in C(G)$, set $h(x)=\varphi (l_{x}f)$ on $H$. It is continuous and satisfiesAt a maximum point $x_0$, every summand must have the same maximum value. Iteration gives that value at all inverse-generator words times $x_0$. The closure of their positive-word monoid is a closed subsemigroup of a compact group, hence is the entire generated subgroup $H$. Density and continuity make $h$ constant on $H$. Therefore $\varphi$ is fixed by each of $T_{g_1},\dots ,T_{g_n}$, first on real functions and then on complex functions by linearity. The closed fixed-point sets consequently have the finite intersection property in $K$, so compactness gives a common fixed functional for every $g\in G$.

The Riesz-Markov-Kakutani representation theorem converts this positive functional into a regular Borel probability measure ${\mu }_l$ with $\varphi (f)=\int fd{\mu }_l$. Its invariance gives left translation invariance of the measure. It has full support: if a nonempty open set had measure zero, a finite collection of its left translates would cover the compact group and force ${\mu }_l(G)=0$, contradicting normalization. Thus it is a normalized left Haar measure. The right translation action gives a normalized right Haar measure ${\mu }_r$ by the same argument.

For uniqueness and equality, take any $f\in C(G)$ and apply the Fubini theorem toFor fixed $y$, left invariance of ${\mu }_l$ makes the inner integral $\int fd{\mu }_l$. Reversing the order, for fixed $x$, right invariance of ${\mu }_r$ makes the inner integral $\int fd{\mu }_r$. Since both total masses are one,Uniqueness in the Riesz-Markov-Kakutani representation theorem gives $\boxed{{\mu }_l={\mu }_r}$. Comparing any normalized left Haar measure to this fixed right Haar measure proves uniqueness as well. The conclusion is uniqueness of normalized Haar measure. Without normalization, the printed uniqueness claim is false: even on the one-point group, ${\delta }_e$ and $2{\delta }_e$ are distinct Haar measures. In general the result is uniqueness up to a positive scalar, and left and right probability normalizations coincide.

A topological group is a group equipped with a topology for which multiplication $G\times G\to G$ and inversion $G\to G$ are continuous maps. The product uses the product topology. Translation and inversion are therefore homeomorphisms. Hausdorffness is sometimes included in the definition; the two open-subgroup arguments below do not require it.

For the inverse system, take a directed set $I$, topological spaces $X_i$, and continuous maps $f_{ij}:X_j\to X_i$ for $i\le j$, with $f_{ii}=\mathrm{id}$ and $f_{ik}=f_{ij}{f}_{jk}$. An inverse limit is a space $X$ with compatible continuous maps ${\pi }_i:X\to X_i$ such that every compatible family $q_i:Y\to X_i$ factors uniquely as $q_i={\pi }_{i}q$ through a continuous map $q:Y\to X$. Existence follows from the concrete constructionwith the subspace topology of the product topology. The only possible map $q$ is $q(y)=(q_i(y){)}_i$. Compatibility puts its image in $X$, and coordinatewise continuity makes it continuous. This proves the universal property of an inverse limit, even when $X$ is empty. Given two inverse limits, their universal properties supply maps each way; the composites have the same coordinates as the identity, so uniqueness makes them identities. The inverse limit exists and is unique up to the unique homeomorphism respecting its projections.

A profinite group can be defined as an inverse limit of finite discrete groups, or as a compact Hausdorff space that is a totally disconnected space, equipped with continuous group operations. For the first implication, use the Tychonoff theorem. The compatibility equalities define a closed subgroup of the compact Hausdorff product. Two distinct points are distinguished by a finite discrete coordinate, so no connected subset contains both. Consequently the inverse limit is a compact Hausdorff totally disconnected topological group.

For the converse, use the topological result that a compact Hausdorff totally disconnected space has a basis of clopen sets. Choose a clopen set $U$ containing $1$ inside any specified identity neighbourhood. For each $u\in U$, continuity gives an identity neighbourhood $V_u$ and an open neighbourhood $W_u$ of $u$ with $V_u{W}_u\subseteq U$. Finitely many $W_u$ cover the compact set $U$. Intersect their $V_u$ and its inverse to obtain a symmetric identity neighbourhood $V$ with $VU\subseteq U$. Symmetry also gives $V^{-1}U\subseteq U$, and hence $vU=U$ for every $v\in V$. The setis a subgroup containing $V$, so it is open. It is contained in $U$, since $1\in U$ and $h=h\cdot 1\in hU=U$. By part (ii), $H$ has finite index. Its normal core of a subgroup is a finite intersection of conjugates of $H$, hence an open normal subgroup $N$ contained in $U$. This proves the open normal subgroup basis of a profinite group.

The natural group homomorphismis injective because the intersection of these $N$ is $\{1\}$. For a compatible family of cosets, any finitely many have nonempty intersection: their intersection subgroup is another indexing subgroup, and its prescribed coset lies in each. The finite intersection property and compactness give a point belonging to all the cosets, proving surjectivity. Finally a continuous bijection from a compact space to a Hausdorff space is a homeomorphism. The two definitions of profinite group are equivalent.

For a profinite group, its profinite Frattini subgroup isUse $G$ for an empty intersection. This is a closed normal subgroup, invariant under continuous group automorphisms, since these automorphisms permute the maximal open subgroups. Let $H=\overline{⟨X⟩}$. If $H=G$, its image certainly topologically generates $G/\Phi (G)$. Conversely, suppose $H\ne G$. For $g\notin H$, the open normal subgroup basis of a profinite group gives $N{⊴}_{o}G$ with $g\notin HN$: choose a sufficiently small neighbourhood $gN$ disjoint from the closed subgroup $H$. The proper subgroup $HN/N$ of the finite group $G/N$ lies in a maximal proper subgroup. Its preimage $M$ is a maximal proper open subgroup of $G$, contains $H$, and contains $\Phi (G)$. Since $H\Phi (G)$ is compact and therefore closed, density of the image of $X$ in $G/\Phi (G)$ would force $H\Phi (G)=G$, contradicting $H\Phi (G)\le M<G$. Generation can therefore be tested modulo the profinite Frattini subgroup.

For a finite p-group, every maximal proper subgroup is normal and has index $p$. One proof uses the normalizer condition for finite p-groups: maximality forces its normalizer to be the whole group, and its simple $p$-group quotient has order $p$. Therefore every such maximal subgroup contains powers and group commutators. Conversely, the quotient by the algebraic $G^p[G,G]$ is an elementary abelian p-group; its nonzero elements are separated by linear maps to ${\mathbb{F}}_p$. Their kernels give maximal subgroups. This proves the finite Frattini subgroup formula.

Now take a pro-p group and put $D=\overline{G^p[G,G]}$, retaining the closure of the algebraically generated subgroups. A maximal open subgroup is the preimage of a maximal subgroup of a finite $p$-group quotient, so it contains $D$. If $g\notin D$, some finite quotient of the profinite group $G/D$ detects $gD$. That quotient is elementary abelian, and a linear functional nonzero at $gD$ gives a continuous group homomorphism $G\to {\mathbb{F}}_p$ whose kernel is a maximal open subgroup missing $g$. HenceThe closure bar is present in the original PDF; the converted TeX fraction is an extraction error.

For the finite-index assertion, first pass from the arbitrary abstract subgroup $K$ to its normal core of a subgroup $C$. The action on the finitely many cosets of $K$ shows $[G:C]<\infty$, without assuming that $K$ or $C$ is closed. Write $m=[G:C]=p^{r}q$ with $(p,q)=1$, and let $X_m=\{h^m:h\in G\}$. By Lagrange theorem, $X_m\subseteq C$. For $N{⊴}_{o}G$, the quotient $G/N$ is a finite p-group of order, say, $p^s$. Choose an integer $a$ with $aq\equiv 1(\mathrm{mod}{p}^s)$. Thenso $g^{p^r}\in X_{m}N$ for every such $N$. The set $X_m$ is the continuous image of the compact space $G$, hence is closed. Consequently $g^{p^r}\in {\bigcap }_N{X}_{m}N=X_m\subseteq C$. Every element of the abstract finite quotient $G/C$ thus has order dividing $p^r$. By Cauchy theorem for groups, no prime other than $p$ divides its order. Therefore $[G:C]$, and its divisor $[G:K]$, are powers of $p$. This proof does not assume continuity of the finite quotient map.

To prove openness under finite generation, first establish commutator collection with fixed generators in nilpotent groups. If a nilpotent group $P$ is generated by $a_1,\dots ,a_d$, every element of $P\prime$ isInduct on the nilpotency class $c$. The assertion is trivial for $c=1$. Apply the induction hypothesis in $P/{\gamma }_c(P)$; the remaining error lies in the central subgroup ${\gamma }_c(P)=[{\gamma }_{c-1}(P),P]$. Since commutators in this last layer are central, collecting against words in the $a_i$ expresses the error as ${\prod }_i[y_i,a_i]$ with $y_i\in {\gamma }_{c-1}(P)$. Also $[P\prime ,{\gamma }_{c-1}(P)]\le {\gamma }_{c+1}(P)=1$. Thus replacing each $x_i$ by $x_i{y}_i$ multiplies the desired product by precisely that central error, proving the formula.

Let $a_1,\dots ,a_d$ now topologically generate $G$. Every finite continuous quotient is a nilpotent group, so the formula holds there with these fixed generators. For $z\in \overline{[G,G]}$, the sets of tuples $(x_1,\dots ,x_d)\in G^d$ solving $z\equiv {\prod }_i[x_i,a_i](\mathrm{mod}N)$ are nonempty closed subsets of a compact space. They have the finite intersection property, by replacing finitely many $N$ by their intersection. A common tuple solves the equality in $G$. It follows that the algebraic commutator subgroup is the compact image of $G^d$ under this product map, and is closed.

Its quotient $A=G/[G,G]$ is a topologically finitely generated abelian pro-p group. The continuous map ${\mathbb{Z}}_p^d\to A$ taking $({\lambda }_i)$ to ${\prod }_i{\bar{a}}_i^{{\lambda }_i}$ is onto, because its compact image contains a dense generating subgroup. Therefore $A/pA$ is generated as an elementary abelian group by at most $d$ elements, and $pA$ is compact. The preimage $G^p[G,G]$ of $pA$ is closed of finite index, hence open: its complement is a finite union of closed cosets. The finite-index result and the maximal-subgroup property of finite p-groups show that any abstract index-$p$ subgroup of $G$ is normal. It contains this open subgroup, so is itself open.

Finally, a finite-index normal subgroup $C$ has finite $p$-group quotient. If $[G:C]>1$, choose a normal index-$p$ subgroup in that quotient and call its preimage $H$. The preceding argument makes $H$ open. An open subgroup of a finitely generated pro-p group is finitely generated: intersect a finitely generated dense abstract subgroup with $H$, use the Schreier lemma, and observe that the intersection is dense in the open subgroup $H$. Induction on $[G:C]$ now makes $C$ open in $H$, hence in $G$. Returning to the normal core of a subgroup, $K$ is a union of open cosets of $C$. Every finite-index subgroup of a finitely generated pro-p group is open.

Assume the finite-generator identity holds whenever there is no common zero. Let $\phi \in {\Phi }_A$. For every finite family $f_1,\dots ,f_n\in \ker \phi$, their zero sets must have nonempty intersection: otherwise an identity $\sum f_j{g}_j=1$ would give $0=\phi (1)=1$. These zero sets are closed in compact $K$. The finite intersection property therefore supplies $x\in K$ at which every member of $\ker \phi$ vanishes. For any $f\in A$, the element $f-\phi (f)1$ is in that kernel, so $f(x)=\phi (f)$. Thus $\phi ={\delta }_x$, proving

For $C(K)$, the identity is explicit. If the $f_j$ have no common zero, the continuous function $q={\sum }_j|f_j{|}^2$ is strictly positive on compact $K$. SetThen $\sum f_j{g}_j=1$. The equivalence just proved shows that $C(K)$ is natural.

Next consider the disc algebra $A(\overline{\mathbb{D}})$, the continuous functions on the closed unit disk that are holomorphic in its interior. We show directly that each algebra character is evaluation. Polynomials are uniformly dense in this algebra: for $0<r<1$, $f_r(z)=f(rz)$ tends uniformly to $f$ as $r\uparrow 1$, by uniform continuity. The function $f_r$ is holomorphic on $|z|<1/r$, so its Taylor polynomials converge uniformly on $|z|\le 1$.

Every algebra character of a unital Banach algebra is bounded, with $|\phi (f)|\le \Vert f\Vert$: if $f-\phi (f)1$ were invertible, applying $\phi$ would contradict invertibility, so $\phi (f)$ belongs to the spectrum of an element, which is contained in the disk of radius $\Vert f\Vert$ by the Neumann series. For the coordinate function $z$, put $\lambda =\phi (z)$; then $|\lambda |\le 1$. Multiplicativity gives $\phi (p)=p(\lambda )$ for every polynomial. By polynomial density and continuity, $\phi (f)=f(\lambda )$ for every member of the disc algebra. Hence

Finally consider the algebra $C$ in the last request. For each $f\in C$, its holomorphic extension $g$ from the boundary is unique by the maximum modulus principle. Define $T(f)=g\in A(\overline{\mathbb{D}})$. This is a surjective unital algebra homomorphism, since it restricts to the identity on the disc algebra. AlsoThe algebra $C$ is closed: if $f_n\to f$ uniformly, the associated $T(f_n)$ are uniformly Cauchy by this bound, so their limit belongs to the closed disc algebra and agrees with $f$ on the boundary. Constants and the coordinate function belong to $C$, so it is itself a uniform algebra on the disk. Its idealis contained in $C$, and $C/I$ is the disc algebra.

If a algebra character $\chi$ on $C$ vanishes on $I$, it factors through $T$ and the preceding result givesIf $\chi$ does not vanish on $I$, choose $h\in I$ with $\chi (h)\ne 0$. For $F\in C(\overline{\mathbb{D}})$, defineThe product $hF$ is in $I$, so this is well defined. It is unital and linear, andshows multiplicativity. Since $C(\overline{\mathbb{D}})$ is natural, $\tilde{\chi }$ is evaluation at a point $x$ of the closed disk. The equality $h(x)=\tilde{\chi }(h)=\chi (h)\ne 0$ places $x$ in the open disk. On $C$, $\tilde{\chi }(f)=\chi (f)$, so $\chi$ itself is evaluation at that interior point.

We therefore obtain two families: actual evaluations $f\mapsto f(x)$ on one closed disk, and analytic-extension evaluations $f\mapsto T(f)(\lambda )$ on a second closed disk. They agree on the boundary. They are distinct at interior points: functions in $I$ distinguish actual interior evaluations from every analytic-extension evaluation, and the coordinate function distinguishes points within each family. ThusThis is also a topological identification. Each disk family is continuous in the Gelfand topology, and they agree along their boundary, giving a continuous bijection from the glued disks to ${\Phi }_C$. The glued disks form a compact space, explicitly homeomorphic to the sphere by sending $(x,y)$ in the two copies to $(x,y,\pm \sqrt{1-x^2-y^2})$. Since the character space is Hausdorff, the continuous bijection is a homeomorphism. This boundary-analytic disk algebra with doubled character space has more algebra characters than evaluations on its original disk.

Call $A\subseteq \mathbb{N}$ an IP set when it contains an infinite finite-sums set $\mathrm{FS}(x_1,x_2,\dots )$ with all $x_i>0$. We first need the relative consequence of the Hindman theorem: a finite union can be an IP set only if one of its constituents is an IP set. This does not follow by simply applying the theorem to a coloring of all integers, because its monochromatic finite-sums set might lie outside the given set.

Here is a reduction that proves the partition regularity of IP sets. Suppose $\mathrm{FS}(x_i)\subseteq A$ and $A$ is finitely colored. Index the generators by $i\ge 0$. For $n>0$, let $S(n)$ be the set of positions of the nonzero digits in its binary expansion, and color $n$ by the color of ${\sum }_{i\in S(n)}{x}_i$. By the Hindman theorem, there are $w_1,w_2,\dots >0$ with $\mathrm{FS}(w_i)$ monochromatic in this new finite coloring.

We can take disjoint, successively later finite blocks of the $w_i$ whose sums $v_1,v_2,\dots$ have separated binary expansion supports. Start with $v_1=w_1$. Having chosen finitely many blocks, take $K$ larger than every binary position used in their sums. On a fresh tail of the $w_i$, consider $2^K+1$ partial sums, including the zero partial sum. Two have the same residue class modulo $2^K$, by the pigeonhole principle. Their positive difference is a consecutive block sum $v_{j+1}$ divisible by $2^K$. Discard all indices up to that block's end and repeat. Thus every bit of $v_{j+1}$ is above every bit in the preceding block sums.

There are no carries in a sum of distinct $v_j$, soAlso $\mathrm{FS}(v_j)\subseteq \mathrm{FS}(w_i)$, since the underlying blocks are disjoint. Consequentlysatisfies $\mathrm{FS}(y_j)\subseteq \mathrm{FS}(x_i)\subseteq A$, with all these sums the same original color. This proves the relative assertion. In particular, if $A_1\cup \cdots \cup A_r$ contains an infinite finite-sums set, color its points by the first constituent containing them and apply this argument; one $A_j$ is an IP set.

Let $\mathcal{I}$ be the family of sets that are not IP sets. It is closed under subsets and, by the preceding argument, under finite unions. It contains every finite set, since positive successive partial sums of an infinite sequence are unbounded. It does not contain $\mathbb{N}$. Thereforeis a proper filter on a set: it contains $\mathbb{N}$, excludes the empty set, is upward closed, and is closed under finite intersections. Its members are exactly the IP-star sets, the sets meeting every IP set. Indeed, failure to meet an IP set is equivalent to having an IP complement. This identifies the sets that must belong to the required ultrafilter.

Apply the ultrafilter lemma to extend the IP-star filter $\mathcal{F}$ to an ultrafilter $\mathcal{U}$. For completeness, Zorn lemma applies to its proper filter extensions ordered by inclusion, because the union of a chain is still a proper filter on a set. A maximal extension decides every set $A$: if $A$ cannot be adjoined while keeping the filter proper, some filter member is disjoint from $A$, forcing $A^c$ into the filter. This is the defining ultrafilter property.

If $A\in \mathcal{U}$ were not an IP set, then $A^c\in \mathcal{F}\subseteq \mathcal{U}$, contradicting properness. Hence every member of $\mathcal{U}$ contains an infinite finite-sums set. Conversely, any ultrafilter with finite-sums members must contain every IP-star set, since it cannot contain such a set's non-IP complement. Thus this construction captures precisely the forced filter, without making an unnecessary claim about idempotence.

To prove nonuniqueness, putFor a nonempty finite set of exponents with largest exponent $J$, the associated sum of distinct powers of four satisfiesThus $\mathrm{FS}(4^j:j\ge 0)\subseteq E$. Doubling the inequality givesso $\mathrm{FS}(2\cdot 4^j:j\ge 0)\subseteq E^c$. These alternating dyadic intervals contain disjoint IP sets.

Every member of $\mathcal{F}$ meets $E$ and also $E^c$, because it meets every IP set. A finite intersection of members of $\mathcal{F}$ is again a member, so both $\mathcal{F}\cup \{E\}$ and $\mathcal{F}\cup \{E^c\}$ have the finite intersection property. Extend the proper filters they generate to ultrafilters ${\mathcal{U}}_0$ and ${\mathcal{U}}_1$. Each extends $\mathcal{F}$, so the previous argument makes each an ultrafilter with finite-sums members. But $E\in {\mathcal{U}}_0$ and $E^c\in {\mathcal{U}}_1$, so

Put $\kappa =|X|$, an infinite cardinal number. The original PDF has the double exponent $2^{2^{|X|}}$; the single-exponent expression in the TeX aid is a transcription error.

We explicitly construct an independent family of subsets with $2^{\kappa }$ members on a set of size $\kappa$. LetFor each finite $s$ there are finitely many possibilities for $H$. The collection of finite subsets of an infinite cardinal has size $\kappa$, so $|D|\le \kappa$; the points $(\{\xi \},\varnothing )$ give the reverse bound. Thus $|D|=\kappa$.

For every $B\subseteq \kappa$ defineTo verify independence, take distinct $B_1,\dots ,B_n$ and bits ${\epsilon }_1,\dots ,{\epsilon }_n$. For each pair $i<j$, choose a point of $B_i△B_j$ and let $s$ contain all these finitely many points. The traces $B_i\cap s$ are pairwise distinct. SetThen $(s,H)\in A_{B_i}$ exactly for those $i$ with ${\epsilon }_i=1$. Every finite Boolean pattern is therefore realized. The cases $n=0,1$ work by the same definition, allowing $s=\varnothing$. In particular the sets $A_B$ are all distinct, so the finite-trace independent family construction gives exactly $2^{\kappa }$ independent members.

For each function $\epsilon :\mathcal{P}(\kappa )\to \{0,1\}$, prescribe $A_B$ when $\epsilon (B)=1$ and $D\setminus A_B$ when $\epsilon (B)=0$. Independence gives the finite intersection property. Their finite intersections generate a proper filter on a set: its members are the subsets of $D$ containing one of those intersections.

To extend this to an ultrafilter, order its proper filter extensions by inclusion. The union of a chain is again a proper filter, so Zorn's lemma supplies a maximal one, $U_{\epsilon }$. If neither a subset $Y$ nor its complement belonged to this filter, adjoining $Y$ would still generate a proper filter: otherwise some existing member would be disjoint from $Y$ and force its complement into the filter already. Maximality therefore gives the ultrafilter dichotomy. Using the ambient axiom of choice, choose such an extension for every $\epsilon$.

Distinct functions differ at some $B$. Their ultrafilters respectively contain $A_B$ and its complement, and cannot be equal. There are $2^{2^{\kappa }}$ such functions. Transporting the ultrafilters along a bijection $D\to X$ proves the lower bound. The upper bound is immediate because every ultrafilter is a subset of $\mathcal{P}(X)$:Thus the number of ultrafilters on an infinite set is

A proper filter on a set $\mathcal{F}$ on $\mathbb{N}$ contains $\mathbb{N}$, excludes the empty set, is closed under finite intersections and is upward closed under inclusion. An ultrafilter is a maximal proper filter. Equivalently, for every $A\subseteq \mathbb{N}$ it contains exactly one of $A,A^c$. To see maximality implies this dichotomy, if $A$ is absent then adjoining it must make the generated filter improper; hence some filter member is disjoint from $A$, forcing $A^c$ into the filter. Conversely, a filter with this dichotomy cannot be properly enlarged without acquiring disjoint members.

Extend the cofinite filter to a maximal proper filter using Zorn's lemma. Every chain of proper extensions has its union as a proper filter upper bound: any finite collection of its members lies in one member of the chain, and the empty set never enters. The resulting ultrafilter contains no finite set, because it already contains that set's cofinite complement. It is therefore a free ultrafilter, or nonprincipal ultrafilter. This proves the required existence with the usual choice principle explicit.

Define the Stone-Čech compactification of the natural numbers as the set of all ultrafilters, with basic open setsThey form a basis because $\hat{\mathbb{N}}$ is the whole space and $\hat{A}\cap \hat{B}=\widehat{A\cap B}$. Also $(\hat{A}{)}^c=\widehat{A^c}$, so each basic set is clopen. Distinct ultrafilters disagree on some $A$, putting them in the disjoint open sets $\hat{A}$ and $\widehat{A^c}$. Thus this space is Hausdorff.

To prove compactness, suppose an open cover has no finite subcover and refine it by basic sets $\widehat{A_i}$. Their complements $B_i=\mathbb{N}\setminus A_i$ have the finite intersection property: otherwise finitely many $\widehat{A_i}$ would cover every ultrafilter. Here a nonempty finite intersection of the $B_i$ has a principal ultrafilter containing it, whereas an empty intersection cannot belong to any proper filter. The $B_i$ therefore generate a proper filter, which extends to an ultrafilter by the same Zorn argument. That ultrafilter lies outside every $\widehat{A_i}$, contradicting the cover. Hence $\beta \mathbb{N}$ is compact and Hausdorff. Natural number $n$ is identified with its principal ultrafilter.

Hindman's theorem asserts that every finite colouring of the positive integers has an increasing sequence $x_1<x_2<\cdots$ for which all nonempty finite sums of distinct terms have one colour. Let $\mathcal{U}+\mathcal{U}=\mathcal{U}$ be the given idempotent ultrafilter. Since $\mathbb{N}$ is positive, a principal ultrafilter cannot be idempotent: its sum with itself is principal at $2n$, not $n$. Thus $\mathcal{U}$ is nonprincipal and contains every cofinite tail. In a convention including zero, one instead uses an idempotent in the nonprincipal part, excluding the trivial principal idempotent at zero.

For $A\subseteq \mathbb{N}$ define $A-n=\{m:n+m\in A\}$. Addition on the Stone-Čech compactification of the natural numbers is characterized byOne cell $A$ of the finite colour partition belongs to $\mathcal{U}$. PutIdempotence makes $A^{\ast }\in \mathcal{U}$. Moreover, if $n\in A^{\ast }$, then $A^{\ast }-n\in \mathcal{U}$. Indeed, write $B=\{y:A-y\in \mathcal{U}\}$ so $A^{\ast }=A\cap B$. We have $A-n\in \mathcal{U}$, and idempotence applied to that set givesTheir intersection is $A^{\ast }-n$. This is the idempotent-ultrafilter star-set lemma.

Choose $x_1\in A^{\ast }$. If the finite-sums set $F_k$ of the first $k$ choices lies in $A^{\ast }$, selectEvery factor belongs to $\mathcal{U}$, so this finite intersection is nonempty. Its choice preserves $F_{k+1}\subseteq A^{\ast }$. ThereforeThis proves the requested Idempotent-ultrafilter proof of Hindman's theorem, without assuming an idempotent-existence proof.

Finally, for the first logical assertion put $P=\{x:p(x)\}$ and $Q=\{x:q(x)\}$. A proper filter contains $P\cap Q$ if and only if it contains both $P$ and $Q$: one direction is finite-intersection closure and the other is upward closure. Thus (i) is always true. This is the conjunction law for filter quantifiers.

The Stone topology on a type space has basic open setswhere $\phi$ ranges over formulas with parameters in $A$ and $n$ free variables. Here points are complete types consistent with $T_A=\mathrm{Th}(\mathcal{M},a{)}_{a\in A}$. Arbitrary open sets are unions of these basic sets.

The identitiesshow that the basic sets are clopen sets and form a basis. Distinct complete types contain opposite choices for some formula, so this topology is Hausdorff. The compactness theorem gives compactness: a family of basic closed sets with the finite intersection property determines a consistent set of formulas, which extends to a complete type. Thus logical formulas provide a basis of clopen tests for distinguishing points of the type space.