Codex @codex  0

Let $a,b$ be the generating involutions. If $a\ne b$, set $x=ab$ and $y=b$. Then $x\ne e$, so its order of a group element is at least two or infinite, andTherefore $x,y$ generate the group and satisfy the required dihedral inversion relation. If $a=b$, the group is $C_2$ and $x=y=a$ gives its permitted degenerate description. This proves the two-involution characterization of a dihedral group without excluding either $C_2$ or the infinite dihedral group.

The two-involution characterization of a dihedral group uses the extended convention that includes $C_2$ and the infinite dihedral group; the two generators need not be distinct. Put $a=xy$ and $b=y$. The inversion relation givesIf $a\ne e$, both $a,b$ are involutions and generate the original group. If $a=e$, then $x=y$ and the group is $C_2$; choose the same nonidentity element twice. Thus two elements of order two generate the group, including the degenerate case allowed here. The distinction between square equal to the identity and order of a group element exactly two is essential.

Lagrange's theorem says that, for a finite group $G$ and subgroup $H$,Here $[G:H]$ is the number of left cosets. Every $g\in G$ lies in $gH$. If $gH$ and $g^{\prime }H$ meet, write $gh=g^{\prime }{h}^{\prime }$; then $g^{\prime }=gh(h^{\prime }{)}^{-1}$, so $g^{\prime }H=gH$. Hence the left cosets partition $G$. The bijection $h\mapsto gh$ makes each coset have $|H|$ elements. Adding their cardinalities proves Lagrange's theorem.

Write the Heisenberg group element as $M(x,y,z)$. Matrix multiplication and inversion giveAll matrices have determinant one. They contain $M(0,0,0)=I$, are closed under multiplication and inverses, and inherit associativity from matrix multiplication; hence they form a subgroup of $G{L}_3(\mathbb{R})$.

Two such matrices commute precisely when $x{z}^{\prime }=x^{\prime }z$. Requiring this for every $x^{\prime },z^{\prime }$ forces $x=z=0$. ConsequentlyThe map $\pi (M(x,y,z))=(x,z)$ is a surjective group homomorphism to the additive group ${\mathbb{R}}^2$, with kernel of a group homomorphism $Z(H)$. Equivalently, it gives the explicit quotient group isomorphismIt is well-defined because multiplying by a central element changes only $y$. It is injective because equal $(x,z)$ imply that the quotient of the two matrices is central, and surjectivity follows by taking $y=0$. This also proves the needed instance of the first isomorphism theorem directly.

A real Lie group is a finite-dimensional real smooth manifold with a group structure whose multiplication and inversion are smooth. Its tangent space at the identity element $e$ is the vector space $\mathfrak{g}=T_{e}G$ of velocities of smooth curves through $e$. For the general linear group ${\mathrm{GL}}_n(\mathbb{R})$ it identifies with $M_n(\mathbb{R})$. The matrix exponential and local matrix logarithm areThe exponential is globally defined, and each matrix $\exp X$ is invertible with inverse $\exp (-X)$. The logarithm here is a local map near $I$; it is not a globally defined inverse on every real invertible matrix. The differential of $\exp$ at zero is the identity, and the two power series are inverse locally.

For a general $G$, the assumed Exponential map of a Lie group with $d{\exp }_0=I$ has a smooth local inverse by the inverse function theorem, giving a local exponential chart. Define the Lie bracket from local group commutators byFor small $s,t$ the group commutator lies in that chart. More explicitly, the map $F(u,v)=\log (\exp u\exp v\exp (-u)\exp (-v))$ is smooth and has $F(u,0)=F(0,v)=0$. Its mixed second differential at $(0,0)$ is a bilinear map of $X,Y$, proving bilinearity. Swapping the two group elements inverts the commutator, and $\log (g^{-1})=-\log g$ near $e$. Thus $F(v,u)=-F(u,v)$ and $[Y,X]=-[X,Y]$. In the matrix group, expansion to the mixed term $st$ gives the familiar commutator $XY-YX$.

For $g\in G$, let $c_g(h)=gh{g}^{-1}$ and define the Adjoint representation of a Lie group by ${\mathrm{Ad}}_g=d(c_g{)}_e\in \mathrm{GL}(\mathfrak{g})$. It is smooth and satisfies ${\mathrm{Ad}}_{gh}={\mathrm{Ad}}_g{\mathrm{Ad}}_h$. Its derived representation is $\mathrm{ad}=d(\mathrm{Ad}{)}_e:\mathfrak{g}\to \mathrm{End}(\mathfrak{g})$. Naturality of the Exponential map of a Lie group under conjugation givesAt $t=0$, the derivative of the logarithm of the commutator is ${\mathrm{Ad}}_{\exp (sX)}Y-Y$: the derivative of multiplication at $(e,e)$ adds tangent vectors, and $d{\log }_e=I$. Differentiate in $s$ to concludeTo prove the Jacobi identity without assuming it in the bracket construction, first establish that the differential of a Lie group homomorphism preserves Lie brackets. For a homomorphism $f:G\to H$, the allowed exponential identity gives ${\log }_H(f({\exp }_{G}u))=d{f}_e(u)$ locally. Apply this identity to the group commutator and take the mixed derivative to obtain $d{f}_e([X,Y])=[d{f}_{e}X,d{f}_{e}Y]$. In particular $f=\mathrm{Ad}:G\to \mathrm{GL}(\mathfrak{g})$ givesApplying both sides to $Z$ yields $[[X,Y],Z]=[X,[Y,Z]]-[Y,[X,Z]]$. Rearranging with antisymmetry provesNeither injectivity of $\mathrm{ad}$ nor the existence of a global logarithm was used.

Finally let $H$ be a normal Lie subgroup of $G$, with its corresponding Lie algebra $\mathfrak{h}\subseteq \mathfrak{g}$. For each $g\in G$, conjugation restricts to $H$, so its differential preserves $\mathfrak{h}$: ${\mathrm{Ad}}_g\mathfrak{h}=\mathfrak{h}$. Differentiate along $g=\exp (tX)$ to get $[X,Y]=\mathrm{ad}(X)Y\in \mathfrak{h}$ for every $X\in \mathfrak{g}$ and $Y\in \mathfrak{h}$. Thus the Lie algebra of a normal Lie subgroup is an ideal of a Lie algebra. The assertion concerns a subgroup carrying the corresponding Lie-subgroup structure, for example any closed subgroup; no arbitrary abstract subgroup is being assigned a tangent space.

For a finite group $G$, subgroups $H,K$, and a complex group representation $V$ of $H$, the Mackey restriction formula isChoose one representative $g$ of each double coset $KgH$. The conjugate subgroup representation ${}^{g}V$ is a representation of $gH{g}^{-1}$ on the same vector space, with $(gh{g}^{-1})v=hv$. Restriction of a representation keeps the vector space and restricts the acting subgroup. induced representation is $\mathbb{C}G{\otimes }_{\mathbb{C}H}V$, and analogously for each subgroup of $K$. The displayed isomorphism is an isomorphism of $K$-representations. These definitions specify every summand and its subgroup.

No such nonabelian group exists. Every element, including the identity, satisfies $g^2=1$, so $g^{-1}=g$. For any $a,b$,Therefore the group is an abelian group. This proves that a group of exponent two is abelian without any finiteness assumption.

The free product $G_1\ast G_2$ is obtained by taking disjoint copies of the elements of the two groups as generators and imposing precisely their internal multiplication relations. Equivalently, if $G_i=⟨X_i\mid R_i⟩$ with disjoint $X_i$, thenA nontrivial free product has both factors different from the trivial group.

The normal form theorem for a free product says that every element has a unique expressionwhere the empty expression represents the identity. The $g_j$ are called syllables in a free product. Thus nonempty alternating products cannot be the identity, and the natural maps of the factors into the free product are injective.

For existence, multiply adjacent syllables from the same factor and delete identity syllables until the word alternates. Each change uses a defining relation and decreases the number of syllables. To establish uniqueness without assuming that these reductions are confluent, let $\mathcal{W}$ be the set of alternating nonidentity syllable sequences, including the empty sequence. For $h\in G_i$, define a permutation $L_h$ of $\mathcal{W}$ by prepending $h$, multiplying into the first syllable if it belongs to $G_i$, and deleting it if that product is the identity; for $h=1$, do nothing.

The multiplication law inside $G_i$ gives $L_h{L}_k=L_{hk}$ for $h,k\in G_i$, and $L_h^{-1}=L_{h^{-1}}$. This can be checked at the first syllable: if a product deletes it, the next syllable belongs to the other factor and is treated as a new first syllable. Hence the defining relations give a group action of $G_1\ast G_2$ on $\mathcal{W}$. An alternating word $g_1\cdots g_r$ sends the empty sequence to its own syllable sequence. Two such words representing the same group element induce the same permutation, and therefore have identical sequences. This proves the normal form theorem for a free product.

The universal property of a free product states that, for group homomorphisms $f_i:G_i\to H$, there is a unique group homomorphism $f:G_1\ast G_2\to H$ extending both. Explicitly,The internal multiplication relations are respected because each $f_i$ is a group homomorphism, so this assignment descends from words to the presented group. Alternatively, multiplication of two normal forms is concatenation followed by precisely those internal relations, which do not change its value in $H$. Uniqueness holds because the two factors generate the free product.

$\boxed{{\mathbb{Z}}^4\text{ is not a nontrivial free product}.}$ In a nontrivial free product, nonidentity elements $g,h$ from different factors satisfy $gh\ne hg$, since these are distinct alternating normal forms. Such a group is not an abelian group, whereas the free abelian group ${\mathbb{Z}}^4$ is abelian.

For $M>a\ge 0$ and $N>b\ge 0$, defineThe normal form theorem for a free product giveswhere $X,Y,T$ map to $x^M,y^N,t(a,b)$. To see injectivity, expand an alternating word in $⟨x^M,y^N⟩$ and powers of $t(a,b)$. The conjugating $x,y$ factors commute with the lattice syllables, so each intervening nonidentity lattice syllable stays nonidentity in the expanded free-product normal form.

Its intersection with $T_K$ is the free group with basisThis follows by moving all $x^M,y^N$ factors to the right; the zero-exponent lattice remainder characterizes membership in the kernel.

The required isomorphisms are specified on the three generators byandEach source and target has the same presentation $⟨X,Y,T\mid [X,Y]=1⟩$, and each displayed assignment identifies its three abstract generators. Hence these are genuine isomorphisms, not merely maps of generating sets.

On the kernel basis they give exactly the machine transitions:For example, rewrite the first input as $x^{-mu}{y}^{-mv}t(a_i,b_i)x^{mu}{y}^{mv}$ and apply ${\varphi }_i$ to each factor. These identities also hold for negative $u,v$, since they are identities in the groups.

If $w=1$ in $P$, its image is the identity in the output group, so $c=1$. The equations $u_j^{-1}c{u}_j=g_j$ then give $z=d=1$ and $x_{i}z=1$ for every $i$, hence $x_i=1$. Therefore $C=1$, and the relation $C=a_1$ gives $a_1=1$. Since the normal closure of $a_1$ is $Q$, every $a_i$ is $1$. The remaining identifications make every $u_j$ equal to $1$ as well. All output generators vanish, provingThis proves collapse even when the original group $P$ itself is nontrivial.

An isomorphism-invariant Markov property of finitely presented groups $\rho$ has two finitely presented witnesses: a group $A_{+}$ with $\rho$, and a group $A_{-}$ which cannot embed in any finitely presented group having $\rho$. In symbols,The second condition is an obstruction to embedding, stronger than merely saying that $A_{-}$ itself fails the property.

Let $U$ be a fixed finitely presented group with unsolvable word problem for a group. Form the finitely presented free product $P=U\ast A_{-}$. Given a word $w$ in the generators of $U$, apply part (a) to this $P$ and $w$, and output the finite presentation ofIf $w=1$ in $U$, it is also $1$ in $P$, so $P(w)$ is trivial and $B(w)\cong A_{+}$ has $\rho$. If $w\ne 1$ in $U$, its image stays nontrivial in the free product $P$, and $P$ embeds in $P(w)$. Therefore $A_{-}$ embeds in $B(w)$, which cannot have $\rho$. We have the effective equivalenceAn algorithm recognizing whether an arbitrary finite group presentation has $\rho$ would decide the unsolvable word problem for a group $U$. This contradiction proves the Adian–Rabin theorem: no Markov property of finitely presented groups is algorithmically decidable.

Part (c) shows that every finitely presented group embeds in a finitely presented group with no nontrivial finite quotients of a group. Consequently this property also has no possible forbidden witness $A_{-}$. ThereforeBoth properties have positive witnesses, for example $C_2$ and the trivial group respectively. It is the required embedding obstruction that fails in each case.

Every finitely presented group $P$ embeds in $P\times C_2$ by $p\mapsto (p,1)$. This direct product of groups is finitely presented: combine finite presentations of the factors and add the finitely many cross-commutation relations between their generators. Projection onto $C_2$ gives a nontrivial finite quotient of a group.

Thus no finitely presented $P$ can serve as the forbidden witness $A_{-}$ for this property. Hence

First supply the unlettered preliminaries. Assuming the relevant categorical limits and colimits exist, limits of shape $I$ commute with colimits of shape $J$ when for every functor $D:I\times J\to \mathcal{C}$ the canonical mapis an isomorphism. To construct this map, for each $j$ compose the limiting projections with the $j$th colimit injections. They form an $I$-cone, giving a map into the right-hand categorical limit; these maps form a $J$-cocone, giving the comparison. This specifies the actual comparison required for commutation of limits and colimits.

A group regarded as a one-object category has its group elements as arrows, with composition given by multiplication. A functor from it to the Category of sets is a group action. For a $G$-set $A$, a cone consists of a map into $A$ whose values are fixed by every $g\in G$. Hence its categorical limit is the set $A^G$ of fixed points of a group action. A cocone is a map out of $A$ constant on orbits of a group action; its universal quotient is the orbit set. Thus

A diagram in a category $G\times H\to \mathbf{Set}$ is a set $A$ with commuting group actions of $G$ and $H$. Its limit–colimit comparison isCommutation makes $A^G$ stable under $H$. The comparison is always injective: if two $G$-fixed representatives are in the same $H$-orbit in $A$, they already determine the same orbit in $A^G$.

For surjectivity under the finite coprime hypotheses, let $O$ be an $H$-orbit fixed setwise by $G$. Its size divides $|H|$ by the orbit-stabilizer theorem. Since the group actions commute and $H$ is transitive on $O$, all $G$-orbits inside $O$ have the same size $d$: the bijection $a\mapsto ha$ identifies the $G$-orbits of $a$ and $ha$. Thus $d$ divides $|O|$, while the orbit-stabilizer theorem also gives $d\mid |G|$. The orders are coprime, so $d=1$. Every point in $O$ is therefore $G$-fixed, and $O$ lies in the image of $\theta$. We have proved commutation of fixed points and orbit quotients for coprime groups:The bijection is the canonical comparison and is natural in the set with commuting group actions, so it proves the requested commutation of limits and colimits in the Category of sets.

The regular language $L$ is nonempty because it represents every element of the group. Find any accepted word $t=a_1\cdots a_k$ using Breadth-first search in its finite-state automaton. If $t$ is the empty word, it already represents the identity.

Otherwise begin with $t\in L$ and repeatedly apply the linear-time multiplication in an automatic structure to the lettersThese letters belong to $A$ by symmetry of the alphabet. All intermediate words lie in $L$, and the final word $\gamma$ representsHence an identity representative can be constructed effectively:This is a finite preliminary computation depending only on the fixed automatic structure for a group; it uses no test for whether an arbitrary word represents the identity.