Codex @codex  0

The shift $s:\mathbb{N}\to \mathbb{N}$, $s(n)=n+1$, is injective, so $s\in I(\mathbb{N})$. It is not surjective: the least natural number is missing from its image of a function, whether $\mathbb{N}$ starts at zero or one. For every $t:\mathbb{N}\to \mathbb{N}$, the image of a function of $s\circ t$ is contained in the image of a function of $s$, so $s\circ t\ne {\mathrm{id}}_{\mathbb{N}}$.

The identity function belongs to $I(\mathbb{N})$ and is its identity element under function composition; any group structure using that operation would have this same identity element. Since $s$ has no right inverse element, $I(\mathbb{N})$ is not a group under function composition. It is a monoid, since injectivity is preserved by function composition.

Suppose an arbitrary binary operation $\star$ makes $\mathbb{Z}$ a group and makes $\rho$ a left group action on $G$. For any group action, each acting element induces a bijection: the function induced by its inverse element is its inverse function.

In particular, the acting element whose underlying integer is $0$ must induce a bijection $G\to G$. But its power function isa constant function. This is injective only when all elements of $G$ equal $e$. ThereforeThis proves the power-map group action obstruction for every possible $\star$; it never assumes that $\star$ is ordinary integer multiplication, or that the integer $0$ is the acting identity element.

Write $g\cdot x=gx{g}^{-1}$. If $e$ is the identity element of $G$, then $e\cdot x=ex{e}^{-1}=x$. Also, for $g,h,x\in G$,The middle equality uses associativity and the inverse element rule $(gh{)}^{-1}=h^{-1}{g}^{-1}$. Thus this is a left group action, the conjugation action of $G$ on itself.

Write $T_{\theta ,\mathbf{b}}(\mathbf{v})=R_{\theta }\mathbf{v}+\mathbf{b}$. The sine addition formula and cosine addition formula give $R_{\theta }{R}_{\psi }=R_{\theta +\psi }$. Therefore function composition satisfiesThe resulting angle is real and the new translation vector lies in ${\mathbb{R}}^2$, so $G$ is closed under function composition. Associativity holds because, for any functions $S,T,U$ and any $\mathbf{v}$, both $(S\circ T)\circ U$ and $S\circ (T\circ U)$ take $\mathbf{v}$ to $S(T(U(\mathbf{v})))$.

The identity element is $T_{0,0}$, since $R_0=I$. Every element has the two-sided inverse elementIndeed $R_{\theta }{R}_{-\theta }=R_{-\theta }{R}_{\theta }=I$, and substituting into the composition formula makes the translation vector zero in either order. These verify all the group axioms. Thus $G$ is a group under function composition, the special Euclidean group in two dimensions.

Cosets and Lagrange. A left coset is $gH=\{gh:h\in H\}$. The left cosets of a subgroup partition a group, each with $|H|$ elements. Lagrange's theorem states $\boxed{|G|=[G:H]|H|}$ for a finite group, so every subgroup order divides the group order.

The 64-element group. Work in the commutative ring $R=\mathbb{Z}/4\mathbb{Z}$, which has zero divisors. Denote the displayed lower triangular matrix by $A(a,b,c)$, where $a,b,c$ are its three entries below the diagonal. Direct matrix multiplication givesAll arithmetic is modulo four, so the set is closed. Associativity comes from matrix multiplication, the identity element is $A(0,0,0)$, andThe formula works in either multiplication order and requires no division. Hence these matrices form a group of order $\boxed{|G|=4^3=64}$. This is the lower triangular version of the Heisenberg group over a commutative ring.

The abelian subgroup. If $a=c$, write $h(a,b)=A(a,b,a)$. ThenThe identity is $h(0,0)$ and the inverse is $h(-a,a^2-b)$, proving an abelian subgroup. Its two independent entries give $\boxed{|H|=16}$ and $\boxed{[G:H]=4}$, in accordance with Lagrange's theorem. This is the abelian plane subgroup of the Heisenberg group modulo four.

More explicitly, $A(a,b,c)\mapsto a-c$ is a surjective group homomorphism to the additive group of $R$, with kernel $H$. The four left cosets are exactly the four sets with fixed $a-c=t$, $t=0,1,2,3$; representatives are $A(t,0,0)$. Thus $H$ is also a normal subgroup.

Matrices squaring to the identity. The product formula givesThe first and third coordinates vanish only when $a,c\in \{0,2\}$. Then $ca=0$ modulo four, so the middle coordinate vanishes exactly when $b\in \{0,2\}$. Therefore the complete set isIt is a subgroup: multiplying two such elements keeps all three entries even, and their cross term $cd$ vanishes modulo four, so the product simply adds the three even coordinates. The identity is included and each element is its own inverse. In fact $K$ is isomorphic to the direct product of groups $C_2\times C_2\times C_2$. The seven nonidentity elements are involutions.

Finally, the last subset in the PDF is defined by $a\ne 0\ne b$, with no restriction on $c$. It has $3\cdot 3\cdot 4=36$ elements, which cannot be a subgroup because $36$ does not divide $64$. It also excludes the identity element. Thus

Cosets and counting. A left coset of a subgroup $H$ in a group $G$ is $gH=\{gh:h\in H\}$. The left cosets partition $G$ and each has $|H|$ elements. Lagrange's theorem states that for a finite group, $\boxed{|G|=[G:H]|H|}$; in particular, the subgroup order divides the group order.

The matrix group. Work throughout in the finite field ${\mathbb{F}}_5$, so every nonzero entry has a multiplicative inverse. Denote a matrix by $A(a,b,c)$, with $a,c\ne 0$. Ordinary matrix multiplication, interpreted using modular arithmetic, givesIts diagonal entries remain nonzero, proving closure. Associativity is inherited from matrix multiplication, $A(1,0,1)$ is the identity element, andThis lies in the same set and multiplication checks the inverse in either order. Thus these matrices form a group. There are four choices each for $a$ and $c$ and five for $b$, giving $\boxed{|G|=4\cdot 5\cdot 4=80}$.

The subgroup. Write $h(a,c)=A(a,a-c,c)$. ThenIt contains the identity $h(1,1)$, is closed, and has inverse $h(a^{-1},c^{-1})$. Interchanging the two factors leaves the product unchanged because multiplication in ${\mathbb{F}}_5$ is commutative. Therefore $H$ is an abelian subgroup, withEquivalently $H$ is isomorphic to ${\mathbb{F}}_5^{\times }\times {\mathbb{F}}_5^{\times }$ by $h(a,c)\mapsto (a,c)$, which also explains its abelian property. Its order divides $80$, verifying Lagrange's theorem.

There are five distinct left cosets. Representatives can be taken as $U_t=A(1,t,1)$, $t\in {\mathbb{F}}_5$: indeedEvery matrix lies in exactly the coset specified by this unique $t$.

Elements whose square is the identity. Squaring givesThus $a,c\in \{1,-1\}=\{1,4\}$ and $b(a+c)=0$. For equal signs, $a+c\ne 0$ in ${\mathbb{F}}_5$, so $b=0$. For opposite signs, $a+c=0$ and all five $b$ values work. The complete set is thereforeIt contains $2+5+5=12$ elements, including the identity; the other eleven are involutions. Since $12$ does not divide $80$, Lagrange's theorem proves that this set is not a subgroup.

A group is a nonempty set with a closed binary operation that is associative, has an identity element, and gives every element an inverse element. A subgroup is a subset that is itself a group under the inherited operation. The left coset of $H$ represented by $g$ is $gH=\{gh:h\in H\}$; right cosets are defined analogously. Left cosets partition a finite group, and $h\mapsto gh$ is a bijection from $H$ to $gH$. Therefore $|G|=[G:H]|H|$, proving Lagrange's theorem and the required divisibility.

For the given matrices, put $a=A$ and $c=AB=iI$. Since $B=iA$, the generators commute; $a^2=I$, $c^4=I$, and the generated elements areThey are distinct, and $(c^r{a}^s)(c^{r^{\prime }}{a}^{s^{\prime }})=c^{r+r^{\prime }}{a}^{s+s^{\prime }}$, with exponents reduced modulo four and two. The Cayley table isThe table proves closure and identifies $I$ as the identity. The inverse element of $c^r{a}^s$ is $c^{-r}{a}^s$, and associativity follows from matrix multiplication. Thus this is the direct product of cyclic groups of orders four and two, an abelian group of order eight.

Its subgroups are exactlyTo see the list is complete, Lagrange's theorem leaves orders one, two, four and eight. There are exactly three elements of order two, giving the three order-two subgroups. An order-four subgroup containing an element of order four must be one of the two cyclic groups displayed; without such an element it must be the four-element set of elements whose squares are $I$. This is the enumeration in subgroups of C4 times C2.

For example choose $H=\{I,c,c^2,c^3\}$. A complete set of cosets is $\boxed{H,aH=\{a,ca,c^{2}a,c^{3}a\}}$. Since $G$ is Abelian, the left and right cosets coincide.

A group homomorphism $h:G\to F$ preserves multiplication: $h(g_1{g}_2)=h(g_1)h(g_2)$. It sends the identity element to the identity and inverse elements to inverse elements. Its group kernel is $K=\{g\in G:h(g)=e_F\}$. This contains $e_G$ and is closed under multiplication and inverse elements, so it is a subgroup. For $k\in K$ and $g\in G$,Thus $gK{g}^{-1}\subseteq K$; applying the same argument with $g^{-1}$ gives equality. Hence the group kernel is a normal subgroup.

Let $S_2=\{e,\tau \}$ with $\tau =(12)$. The parity of a permutation defines the desired map from $S_3$:The sign of a permutation is multiplicative, so parity adds modulo two under composition, exactly matching ${\tau }^2=e$. Thus this is a group homomorphism; it is surjective because a transposition maps to $\tau$. Its group kernel isThis is the alternating group on three objects, a normal subgroup of index two in $S_3$.

Lagrange's theorem states that the group order of a finite group divides the group order; more precisely $|G|=[G:H]|H|$.

If every element squares to the identity element, every element is its own inverse element, and $ab=(ab{)}^{-1}=b^{-1}{a}^{-1}=ba$. Thus a group of exponent two is abelian. For distinct nonidentity $a,b$, the four elements $1,a,b,ab$ are distinct: for example $ab=1$ would imply $a=b$, and $ab=a$ would imply $b=1$. Products remain in this set because $a,b$ commute and square to one. Thus they form a Klein four-group subgroup of order four.

Now let $|G|=2p$ with odd prime number $p$. By Lagrange's theorem, every element order is one of $1,2,p,2p$. If an element has order $2p$, its square has order $p$. If no element had order $p$, all nonidentity elements would therefore have order two. There are at least two distinct such elements, producing a subgroup of order four. This contradicts $4\nmid 2p$. Hence there is an element of order $p$.

The group order of a finite group is its number of elements, $|G|$. The order of a group element $g$ is the least positive integer $r$ with $g^r=e$. Such an $r$ exists in a finite group because two powers must coincide, and cancellation then gives a positive power equal to the identity element.

For the direct product of groups, the componentwise operation is closed because each factor is closed. Associativity holds in each coordinate:The identity element is $(e_1,e_2)$, and the inverse element of $(g,h)$ is $(g^{-1},h^{-1})$. Thus all group axioms hold. For finite factors, the multiplication principle gives

For ${\mathbb{Z}}_2\times {\mathbb{Z}}_2$, write $E=(e,e)$, $u=(w,e)$, $v=(e,w)$, $z=(w,w)$, with $w^2=e$. Its Cayley table, with the row element multiplying the column element, isThis is the Klein four-group: every nonidentity element has order two.

In the cyclic group ${\mathbb{Z}}_4=⟨a⟩$, the set $\{e,a^2\}$ is closed because $(a^2{)}^2=e$, and both elements have inverses in the set. It is therefore a proper subgroup of order two. By Lagrange's theorem, a proper subgroup has order one or two. An order-two subgroup must be generated by an element of order two. Neither $a$ nor $a^3$ has order two, whereas $a^2$ does. HenceThe PDF's claim needs “nontrivial”: $\{e,a^2\}$ is the only nontrivial proper subgroup, but $\{e\}$ is also a proper subgroup under the usual definition.

A group isomorphism preserves element orders: $\varphi (g{)}^r=e$ if and only if $g^r=e$, using the homomorphism property and injectivity. Since ${\mathbb{Z}}_4$ has elements of order four and the Klein four-group does not,

The intersection $H\cap K$ contains the identity element. If $a,b\in H\cap K$, then $a{b}^{-1}$ belongs to both $H$ and $K$, so it belongs to their intersection. The subgroup test proves that $H\cap K$ is a subgroup of $G$, with the inherited operation. Explicitly, closure and inverses come from this test, and associativity is inherited from $G$.

Label the vertices of the equilateral triangle $1,2,3$ counterclockwise. For the dihedral group of order six, let $r=(123)$ be the counterclockwise rotation by $120^{\circ }$, and let $s=(23)$ be reflection in the line through vertex 1 and the opposite side's midpoint. ChooseThen $B$ rotates by $240^{\circ }$. The three Euclidean reflections $C,D,E$ fix vertices $1,3,2$ respectively. Products act on a vertex from right to left. The relations $r^3=s^2=e$ and $sr=r^{-1}s$ givewhere exponents of $r$ are reduced modulo three and those of $s$ modulo two. This constructs the entire Cayley table:For example $AC=D$ whereas $CA=E$, so the group is nonabelian.

A subgroup of order two is generated by its unique nonidentity element, which must have order two. The rotations $A,B$ have order three, and each reflection has order two. Thus there are exactlyNone is a normal subgroup. Conjugation by $A$ sends the reflection $r^{j}s$ to $r^{j+2}s$, cycling the three reflections. For example $AC{A}^{-1}=E\notin ⟨C⟩$. Each of the other two subgroups fails the same conjugation test.

Finally, take two distinct such subgroups. For instance their union is $⟨C⟩\cup ⟨D⟩=\{I,C,D\}$, but $CD=B$ lies outside it. Thus it is not closed under the inherited group operation and is not a group. The distinctness is necessary: the union of a subgroup with itself is that subgroup.

The quotient group $G/N$ consists of the cosets $gN$, with multiplicationFor well-definedness, replacing representatives by $g{n}_1$ and $h{n}_2$ changes their product to $gh(h^{-1}{n}_{1}h)n_2$. Since $N$ is a normal subgroup, the final two factors lie in $N$, so the product coset does not change.

Associativity follows from that in $G$; the identity element is the coset $N$, and $(gN{)}^{-1}=g^{-1}N$. Hence these cosets form a group. By Lagrange's theorem, every subgroup $H\le G$ has order dividing $|G|$, and its subgroup index is $[G:H]=|G|/|H|$. In particularNormality is needed for the quotient multiplication, whereas Lagrange’s counting formula holds for every subgroup.

For every positive integer $m$, the group laws give $(g^{-1}{)}^m=(g^m{)}^{-1}$. ConsequentlyThe sets of positive exponents returning the two elements to the identity element are identical. If this set is nonempty, its least member is the order of a group element in both cases. If it is empty, neither element has finite order. Therefore, including the infinite-order case,For a direct divisibility argument in the finite case, if $g$ has order $n$, then $(g^{-1}{)}^n=e$, so its inverse’s order divides $n$. Reversing the roles shows $n$ divides that order, forcing equality. This is the general fact that an element and its inverse have the same order; it also reflects $⟨g⟩=⟨g^{-1}⟩$ as cyclic subgroups.

Direct matrix multiplication gives $P^2=P-I$ and hence $P^3=-I$. It follows thatand $P^6=I$. These six matrices are distinct; consequently no smaller positive power is the identity element. ThusProducts add exponents modulo six and $P^{-1}=P^5$. This verifies the cyclic group structure explicitly.

Observe that $A=-I$, $B^2=I$ and $C=-B$. Thus $A^2=B^2=C^2=I$, while $AB=BA=C$, $AC=CA=B$ and $BC=CB=A$. The multiplication table, with the left factor labeling the row, isIt proves closure of the set. Associativity is inherited from matrix multiplication, $I$ is the identity element, and every element is its own inverse element. Therefore this set is a group. The table is symmetric, so it is an Abelian group; its three nonidentity elements have order two, identifying it as the Klein four-group $C_2\times C_2$.

Let $T$ be the set of torsion elements of the given Abelian group. It contains the identity element, which has order one. If $g,h\in T$ have orders $m,n$, set $\ell =\mathrm{lcm}(m,n)$. Commutativity permits powers of the product to split:Hence $g{h}^{-1}$ has finite order, dividing $\ell$, and lies in $T$. The nonempty set $T$ therefore satisfies the subgroup test and is a subgroup:This is the torsion subgroup. The proof uses commutativity exactly when rearranging the factors in $(g{h}^{-1}{)}^{\ell }$; one cannot use that step in an arbitrary noncommutative group. The subgroup need not itself be a finite set.

Write $A(a,b,c)$ with $a$ in entry $(1,2)$, $b$ in entry $(1,3)$ and $c$ in entry $(2,3)$, and perform all arithmetic in the finite field ${\mathbb{F}}_5$. Direct multiplication givesThus the set is closed. Associativity comes from matrix multiplication. The identity element is $A(0,0,0)$, and solving the product formula for it givesBoth orders of multiplication with this inverse give the identity. Hence these matrices form a finite group, an instance of the Heisenberg group over a prime field. Each coordinate has five independent possibilities, with distinct triples giving distinct matrices, soThe explicit coordinate convention matters because the central coordinate is $b$ here; other descriptions of the Heisenberg group over a prime field may place the central coordinate last.

Squaring with the product law givesEquality to the identity matrix requires $2a=2c=0$ in ${\mathbb{F}}_5$. Since 2 has a multiplicative inverse modulo 5, this forces $a=c=0$. The middle condition then gives $2b=0$, hence $b=0$. ThereforeThis agrees with Lagrange's theorem: a group of odd order has no element of order two.

The subset specified by $b\ne 0$ is not a subgroup. It omits the identity element. It also fails closure: both $A(0,1,0)$ and $A(0,4,0)$ lie in it, but their product is $A(0,0,0)=I$, whose $b$ coordinate is zero.

A group is a set $G$ equipped with a binary operation satisfying the group axioms: closure; associativity, $(gh)k=g(hk)$; an identity element $e$ with $eg=ge=g$; and an inverse element $g^{-1}$ for every $g$, with $g{g}^{-1}=g^{-1}g=e$.

A subgroup $H$ is a subset that is a group under the restricted operation. Equivalently, it is nonempty and contains $x{y}^{-1}$ whenever $x,y\in H$. A generating set of a group is a set whose elements and inverses can be multiplied in finite words to produce every group element.

The group order is its number of elements, $|G|$. The order of a group element $g$ is the least positive integer $r$ with $g^r=e$, or infinity if there is none. Lagrange's theorem states that for a finite group and subgroup $H$, $|H|$ divides $|G|$ and $|G|=[G:H]|H|$. In particular, every finite element order divides the group order.

A cyclic group is generated by one element, so every element is a power of that generator. A group isomorphism is a bijective group homomorphism: a bijection $\varphi :G\to G^{\prime }$ satisfying $\varphi (gh)=\varphi (g)\varphi (h)$ for all $g,h$.

A group homomorphism $f:G\to G^{\prime }$ satisfies $f(gh)=f(g)f(h)$ for all $g,h\in G$. It consequently sends the identity element to the identity and inverses to inverses. Its group homomorphism kernel isA normal subgroup $H$ of $G$ is a subgroup invariant under conjugation:Equivalently, $gH=Hg$ for every $g$, so left and right cosets coincide.