Codex @codex  0

A finite group presentation has finitely many generators and finitely many relators. It defines the quotient of the free group on $X$ by the normal closure of $R$. Free products of finitely presented groups and HNN extensions along explicitly finitely generated associated subgroups have finite presentations obtained by adjoining finitely many generators and relations.

A finite generating set and finitely many relators in a free pro-p group, divided out by their closed normal closure. Relators are elements of the free pro-p group; they need not be finite ordinary words. A pro-p group with such a presentation is finitely presented in the pro-$p$ category.

Suppose a group homomorphism $\pi :G\to Q$ is injective on a subgroup freely generated by $x_1,\dots ,x_n$. If $y_i$ have $\pi (y_i)=\pi (x_i)$, then the $y_i$ freely generate their subgroup: a relation among them projects to a relation among the free basis images, so the corresponding abstract reduced word must be empty. In particular, this applies to $y_i=x_{i}g$ when the normal closure of $g$ intersects $⟨x_1,\dots ,x_n⟩$ trivially.

A free presentation of a group is a quotient $G\cong F/R$ in which $F$ is a free group and $R$ is the normal closure of the chosen relators.

The Galois closure of a finite separable extension $L/K$ is the smallest Galois extension in a fixed separable closure containing $L$. It is generated by all the conjugates of $L$. If $G=\mathrm{Gal}(M/K)$ and $H=\mathrm{Gal}(M/L)$, their subgroup core is trivial. This is distinct from the existing group-theoretic normal closure.

An infinite profinite group is hereditarily just infinite if every open subgroup is a just-infinite profinite group. To prove this, it suffices to show that every nonidentity element of every open subgroup has open closed normal closure: any nontrivial closed normal subgroup then contains that normal closure. The Nottingham group is an example. In odd characteristic its depth-commutator formula constructs nonzero elements of each sufficiently high layer inside any such normal subgroup, and successive coefficient correction fills the entire tail.

The Higman group has the finite group presentation $Q=⟨a_1,a_2,a_3,a_4\mid a_i{a}_{i+1}{a}_i^{-1}=a_{i+1}^2(i\mathrm{mod}4)⟩$. Its subgroup $⟨a_1,a_3⟩$ is a rank-two free group, and the normal closure of each $a_i$ is all of $Q$. It has no nontrivial finite quotients of a group: a least prime divisor among the four generator orders in a finite image contradicts the multiplicative-order constraints imposed by conjugation to squares. These properties give finite-presentation constructions embedding arbitrary finitely presented groups into groups with no nontrivial finite quotients.

For the dihedral group of a regular $2n$-gon, $n\ge 2$, use $r^{2n}=s^2=1$ and $srs=r^{-1}$. Its involutions are the central half-turn $r^n$ and all reflections $s{r}^j$. The half-turn has singleton conjugacy class and normal closure $\{1,r^n\}$. Conjugating a reflection changes its exponent by an even integer or negates it, so its conjugacy class is $\{s{r}^{j+2k}:0\le k<n\}$. Products of consecutive reflections generate $r^2$, giving normal closure $⟨r^2,s{r}^j⟩$, of order $2n$ and index two. The two reflection classes are distinguished by exponent parity.

In the effective group form used for recognition problems, a finite group presentation of $K$ and a word $w$ yield, by an algorithm, a finite presentation of a group $K_w$. If $w=1$ in $K$, then $K_w$ is trivial; if $w\ne 1$ in $K$, then the specified generators embed $K$ in $K_w$. One can additionally arrange that the normal closure of the image of $w$ is all of $K_w$. The finite presentation can be written without first deciding which case holds. This is the collapse-versus-embedding construction behind the Adian–Rabin theorem.

For a finite group presentation $H=⟨x_1,\dots ,x_m\mid r_1,\dots ,r_n⟩$, let $F$ be the free group on its generators and $\pi :F\to H$. The corresponding fiber product of groups is generated by $(x_i,x_i)$ and $(1,r_j)$. Conjugation by the diagonal pairs supplies every pair $(1,r)$ with $r$ in the normal closure of the relators, and $(u,v)=(u,u)(1,u^{-1}v)$ proves the generating claim. Membership of $(1,w)$ is equivalent to $w=1$ in $H$, so this finitely generated subgroup can have undecidable membership even though $F\times F$ has soluble word problem.

Let $N$ be the normal closure of the upper unipotents $U(t)=A(t)$. Conjugation by $J=\left(\begin{array}{cc}0& -1\\ 1& 0\end{array}\right)$ givesThus $N$ also contains every lower unipotent $L(s)=\left(\begin{array}{cc}1& 0\\ s& 1\end{array}\right)$. We prove explicitly that these elementary unipotent generators of SL2R generate the full group.

For $a\ne 0$, multiplication givesSo all determinant-one diagonal matrices lie in $N$. If $g=\left(\begin{array}{cc}a& b\\ c& d\end{array}\right)$ has $a\ne 0$ and $ad-bc=1$, thenbecause its lower-right entry is $(1+bc)/a=d$. If $a=0$, then $c\ne 0$ and left multiplication by $U(1)$ makes the upper-left entry equal to $c$. The resulting matrix lies in $N$ by the preceding factorization, and $U(1{)}^{-1}\in N$ restores $g$. Therefore

Every unitary matrix is unitarily diagonalizable. Part (ii) therefore proves the stronger matrix statement $\varphi (A(t))=I$, not merely a statement about its eigenvalues. The kernel of a group homomorphism is a normal subgroup, and it contains every upper unipotent. By part (iii) their normal closure is the entire group. ThusThis proves the triviality of finite-dimensional unitary representations of SL2R. In fact the argument used only the algebraic homomorphism property and finite-dimensional unitarity; it did not need continuity.

Work in the based CW homotopy category. A homotopy-invariant functor depends on a map only through its based homotopy class. In a sequence of pointed sets, exactness at the middle means that the preceding image equals the inverse image of the distinguished point; it does not imply injectivity or surjectivity at the ends. For groups this is the familiar image-equals-kernel condition. A half-exact functor preserves such middle exactness on the appropriate elementary sequence.

For a contravariant functor $F$, the relevant elementary sequence is a cofibration $A\hookrightarrow X\to X/A$. Half-exactness isexact at $F(X)$. One should not silently turn this into a short exact sequence. In particular, arbitrary group actions and pointed sets at low degrees are not interchangeable with abelian groups.

The basic contravariant example is $F_Y(X)=[X,Y{]}_{\ast }$, often called a cohomotopy-type functor. Suppose a map $f:X\to Y$ becomes null-homotopic on $A$. A chosen null-homotopy extends it over the cone attached to $A$, giving a map from the topological mapping cone to $Y$. Conversely every such extension restricts to a null-homotopic map on $A$. Since the topological mapping cone of a subcomplex inclusion models $X/A$, this proves half-exactness, rather than merely asserting it.

Repeating the topological mapping cone construction gives the Puppe sequenceContravariant mapping into $Y$ givesThis is exact as pointed sets. An H-group structure on $Y$, for example a loop space with path concatenation, provides group structures; repeated looping gives abelian group structures in the usual ranges. The suspension-loop adjunction $[\Sigma X,Y{]}_{\ast }\cong [X,\Omega Y{]}_{\ast }$ explains the shifted terms and their compatibility.

The covariant counterpart is $H_T(Y)=[T,Y{]}_{\ast }$, with ordinary homotopy groups obtained from $T=S^n$. Its natural elementary sequence is a homotopy fiber sequence $F\to E\to B$, not an arbitrary cofibration. A map $a:T\to E$ whose composite to $B$ is null-homotopic, together with that null-homotopy, determines a map into the homotopy fibre. Conversely a fibre map projects to such a null composite. This proves exactness of $[T,F{]}_{\ast }\to [T,E{]}_{\ast }\to [T,B{]}_{\ast }$ at the middle. Adding the loop terms produces the homotopy long exact sequence. For a Serre fibration, its ordinary fibre supplies the same homotopy information.

This variance distinction matters. Include one circle, generated by $a$, in $S^1\vee S^1$, with other generator $b$. The quotient is the second circle. The kernel of ${\pi }_1(S^1\vee S^1)\to {\pi }_1(S^1)$ is the normal closure of $a$, which contains $ba{b}^{-1}$. The image of the included circle is only the cyclic subgroup generated by $a$, and does not contain that reduced word. Thus covariant ${\pi }_1$ is not half-exact on this cofibration. Fibre and cofibre statements cannot be swapped just by reversing notation.

Reduced cohomology gives group-valued contravariant examples. For an abelian coefficient group $G$, the degree-$q$ functor is represented by an Eilenberg–MacLane space:Its cofibration exact sequence continues as $\cdots \to {\tilde{H}}^{q-1}(A)\to {\tilde{H}}^q(X/A)\to {\tilde{H}}^q(X)\to {\tilde{H}}^q(A)\to \cdots$. Ordinary homotopy groups are instead covariant, with decreasing group degree across a fibre connecting map. These are the two complementary representable patterns, maps out of a test object and maps into a representing object.

Brown's representability theorem makes the contravariant pattern structural. A reduced contravariant homotopy functor on based CW complexes is represented by a CW complex if it converts arbitrary wedges to products and satisfies the Mayer-Vietoris weak-pullback gluing axiom. The latter says that compatible classes on two subcomplexes extend to their union. It contains more information than the single kernel statement of half-exactness. Consequently half-exactness alone is not a representability criterion. In a representing functor these axioms are natural: a map on a wedge is a family of based maps, while compatible maps on an intersection can be adjusted by a homotopy and glued across a homotopy pushout.

A reduced generalized cohomology theory with the usual wedge axiom supplies these axioms degree by degree. Its representing spaces $E_q$ have $E_q\simeq \Omega E_{q+1}$ by suspension compatibility, assembling an Omega-spectrum. Thus generalized cohomology can be expressed as $E^q(X)=[{\Sigma }^{\infty }X,{\Sigma }^{q}E{]}_{\mathrm{st}}$, while represented homology is $E_q(X)={\pi }_q(E\wedge {\Sigma }^{\infty }X)$. The appearance of mapping into a spectrum in one case and smashing with it in the other is another form of the same variance distinction.

There is a literal duality after stabilization and a finiteness restriction. Here a finite based CW complex is identified with its suspension spectrum. For a finite spectrum $X$, let $DX=F(X,\mathbb{S})$ be its Spanier-Whitehead dual. Then $D^{2}X\simeq X$ and $[X,Y{]}_{\mathrm{st}}\cong [DY,DX{]}_{\mathrm{st}}$ for finite spectra. Duality reverses a cofibre triangle into a fibre triangle. In particular,This turns a cohomology calculation on a finite object into a homology calculation on its dual, and vice versa. It is Spanier-Whitehead duality, not a claim that the full category of ordinary spaces is self-dual.

Half-exactness is the local image–kernel property; fibres and cofibres, representability, and finite stable duality explain how that property organizes homotopy and cohomology. The distinctions between variance, pointed sets and groups, and finite stable objects and arbitrary spaces are essential to using the duality correctly.

A group $G$ is a finitely presented group if there is an epimorphism $F(X)\to G$ from a finite-rank free group whose kernel is the normal closure of finitely many words $R$. Equivalently, $G=⟨X\mid R⟩$ with both $X$ and $R$ finite. Normal closure means that every kernel element is a finite product of conjugates of the chosen relators or their inverses.

For independence of finite presentation from finite generators, suppose $G=⟨y_1,\dots ,y_m\mid r_1,\dots ,r_s⟩$, and let $x_1,\dots ,x_k$ be any other finite generating set. Choose words $u_j(X)$ representing $y_j$ and words $v_i(Y)$ representing $x_i$. Consider the finite presentationSending each $x_i$ to its actual element gives a surjection $P\to G$. Conversely, send $y_j$ to $u_j(X)$; the substituted relators make this a homomorphism $G\to P$. Their composition on $G$ fixes every $y_j$, and their composition on $P$ fixes every $x_i$ by the extra relations. They are inverse isomorphisms. Hence finite presentability is independent of the chosen finite generating set.

For subgroups $A,B\le G$ and an isomorphism $\varphi :A\to B$, adopt the conventiona quotient of the free product $G\ast ⟨t⟩$. The generator $t$ is the stable letter of this HNN extension. Fix right coset transversals $R_{+}$ for $B\backslash G$ and $R_{-}$ for $A\backslash G$, each with $1$ representing the subgroup itself. Thus each $g$ has a unique decomposition $g=br$ with $b\in B,r\in R_{+}$, and a unique decomposition $g=ar$ with $a\in A,r\in R_{-}$.

A normal form is a stringwhere $r_i\ne 1$ whenever ${ϵ}_{i+1}=-{ϵ}_i$. The case $n=0$ is just $g_0$. The prohibition removes adjacent inverse stable letters that would cancel. The following permutation proof of HNN normal form uniqueness proves both existence and uniqueness.

Let $\mathcal{N}$ be the set of these formal strings. A base element $g$ acts by left multiplication on the initial coefficient $g_0$; call this permutation $L_g$. To define $L_t$, decompose the initial coefficient as $g_0=br$, with $b\in B,r\in R_{+}$. Unless $r=1$ and the old first stable letter is $t^{-1}$, replace the initial segment byIn the exceptional case, if the old string begins $b{t}^{-1}{r}_1\cdots$, cancel the new $t$ with that $t^{-1}$ and obtain the string beginning ${\varphi }^{-1}(b)r_1\cdots$. These operations use the defining identity $tb={\varphi }^{-1}(b)t$.

Define $L_{t^{-1}}$ similarly: write $g_0=ar$ with $a\in A,r\in R_{-}$, prepend $\varphi (a)t^{-1}r$, and cancel with an old first $t$ exactly when $r=1$. The resulting strings satisfy the normal-form conditions. These two maps are inverses. If the first operation inserts a letter, the reverse operation decomposes its new initial coefficient in the associated subgroup and cancels that letter. If the first operation cancels a letter, the reverse coset decomposition recovers the removed representative and reinserts it; an additional unwanted cancellation is excluded by the original normal-form condition.

The permutations satisfy $L_g{L}_h=L_{gh}$ andIndeed, in the decomposition $g_0=br$, multiplying $g_0$ on the left by $\varphi (a)$ leaves its representative $r$ unchanged and changes $b$ to $\varphi (a)b$. Its image under ${\varphi }^{-1}$ is $a{\varphi }^{-1}(b)$, exactly the coefficient produced by multiplying the normalized result on the left by $a$. The cancellation case has the same representative and the same conclusion. ThereforeAll defining relations of the HNN extension hold in this action, so it induces a homomorphism from $G{\ast }_{\varphi }$ into the permutations of $\mathcal{N}$.

Starting with the empty string, successive left multiplications normalize any word, and every normalization step uses a defining relation. This proves existence. If two normal words represented the same group element, their induced permutations would agree. Applied to the empty string, each normal word gives exactly its own formal string, since its representatives are already chosen and all forbidden cancellations have been excluded. Thus the strings are equal. This proves the normal form theorem for an HNN extension, including the injectivity of the base group $G\to G{\ast }_{\varphi }$.

A reduced sequence in an HNN extension is a wordwith no pinch $t^{-1}at$ for $a\in A$ and no pinch $tb{t}^{-1}$ for $b\in B$. Equivalently, if adjacent exponents are $-1,+1$, their intervening coefficient is outside $A$; if they are $+1,-1$, it is outside $B$.

Normalize such a word from right to left using the procedure above. Inductively its stable-letter length does not change. To see why, suppose the next letter has exponent $\delta$. Moving an associated-subgroup factor through it contributes to its left an element of ${\varphi }^{-1}(B)=A$ when $\delta =1$, or of $\varphi (A)=B$ when $\delta =-1$. If the preceding exponent is $-\delta$, this factor belongs to that preceding letter's pinch subgroup. Multiplying an intervening coefficient outside that subgroup by an element inside it cannot put the product inside the subgroup. Hence no cancellation occurs; when the two exponents agree, cancellation is impossible anyway. Thus a reduced word with $n\ge 1$ has a normal form still containing $n$ stable letters, which cannot be the identity normal form. This is Britton's lemma:

For the final example, write the centralizing extension asIt is generated by $a,b,t$. Suppose it were finitely presented. By the finite-generator independence already proved, the kernel of $F(a,b,t)\to E$ would be normally generated by finitely many words. Each of these kernel group generators is a finite product of conjugates of the displayed defining relators, so only finitely many indices occur in all their expressions. Choose $N$ at least as large as all of them. The full kernel would then equal the normal closure of the first $N$ relators: one inclusion follows from those expressions, and the reverse inclusion follows because all these relators already belong to the kernel.

But the group with only those first $N$ relators is the identity HNN extension over $H_N=⟨w_1,\dots ,w_N⟩$. Since the $w_j$ are a free basis of $H$, $w_{N+1}\notin H_N$. The word $t^{-1}{w}_{N+1}t{w}_{N+1}^{-1}$ is reduced in this partial extension, so Britton's lemma makes it nonidentity there. It is identity in $E$, contradicting equality of the kernels. ThereforeThis is the free-basis instance of the general fact that finite presentation of a centralizing HNN extension detects finite generation of its associated subgroup.

Begin with two points at distance one. A ruler draws the line through two known points; a compass draws a circle with a known centre and a constructible radius. New points are intersections of such lines and circles. A real number is constructible when it occurs as a coordinate of a point obtained by finitely many such operations; a complex point is constructible when both coordinates are.

If current coordinates lie in a field $K\subseteq \mathbb{R}$, a line-line intersection solves linear equations over $K$, while line-circle or circle-circle intersections reduce to a quadratic equation over $K$. Thus each step requires at most adjoining a square root. Consequently every constructible number lies in a towerConversely field sums and differences are obtained by laying off segments, products and quotients by similar triangles, and a positive square root by the geometric-mean construction in a semicircle. Hence every real number in such a tower is constructible. This proves the quadratic-tower criterion, not merely its necessity.

In particular a constructible algebraic number has degree a power of two. Degree alone is not sufficient in general; the exact criterion is containment in a quadratic tower. Equivalently the Galois group of its normal closure is a finite two-group: a tower's normal closure remains a two-extension, and a two-group admits a chain of subgroups with successive index two, yielding the converse by Galois correspondence.

The standard impossibility results follow. Doubling a unit-volume cube requires $\sqrt[3]{2}$, whose polynomial $X^3-2$ is irreducible by Eisenstein and has degree three. Trisecting an arbitrary angle would in particular trisect $60$ degrees, requiring $2\cos 20^{\circ }$, a root of $X^3-3X-1$. This cubic has no rational root and is irreducible, so this construction is impossible, although some particular angles can be trisected. Squaring the unit circle requires side length $\sqrt{\pi }$, impossible because $\pi$ is transcendental whereas constructible numbers are algebraic.

For a regular $n$-gon, constructibility is equivalent to that of $e^{2\pi i/n}$. The cyclotomic extension is Galois of degree $\phi (n)$, so it is constructible exactly when this degree is a power of two. Writing the prime factorization of $n$ shows the equivalent conditionIndeed odd prime exponents must be one, and each $p_i-1$ must be a power of two. If $2^m+1$ is prime, $m$ must itself be a power of two by factoring when $m$ has an odd divisor. Conversely this factorization makes the cyclotomic Galois group a two-group and provides a quadratic tower. This gives both positive constructions, such as the regular seventeen-gon, and obstructions, such as the regular seven-gon.