Codex @codex  0

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 satisfies $\phi (g_1{g}_2)=\phi (g_1)\phi (g_2)$; a bijective one is a group isomorphism. Its kernel of a group homomorphism is $K=\{g:\phi (g)=1_H\}$. It is a subgroup, and for $k\in K$, $g\in G$,Thus $gK{g}^{-1}\subseteq K$, and applying the same argument to $g^{-1}$ gives equality. Therefore $K$ is a normal subgroup.

Write $B_n=\left(\begin{array}{cc}1& n\\ 0& 1\end{array}\right)$. Direct matrix multiplication gives $B_n{B}_m=B_{n+m}$, $B_0=I$ and $B_n^{-1}=B_{-n}$. Consequently these matrices form the integer shear group, a subgroup of $GL(2,\mathbb{R})$. It is an infinite cyclic group, generated by $B_1$, since $B_1^n=B_n$ and no nonzero integer power is the identity.

The map $n\mapsto B_n$ is a bijective group homomorphism from the additive group of integers, proving the required group isomorphism. There are proper subgroups: for example $\{B_{2n}:n\in \mathbb{Z}\}$ omits $B_1$. In fact every subgroup is $\{B_{mn}:n\in \mathbb{Z}\}$ for an integer $m\ge 0$, by the classification of subgroups of an infinite cyclic group; $m=0$ gives the trivial subgroup and $m=1$ the whole group.

A group homomorphism $D:G_1\to G_2$ satisfies $D(gh)=D(g)D(h)$ for all $g,h\in G_1$. Its group kernel is

For the matrices, put $X=R(x)$, $Y=R(y)$ and $z=e^{2\pi i/3}$. Since $z^3=1$, $z\ne 1$ and $1+z+z^2=0$, direct matrix multiplication givesThese verify the listed matrices and the defining relations, with $R(e)=I_2$. To check every product explicitly through a single calculation, write elements in the unique form $x^{ϵ}{y}^j$, with $ϵ=0,1$ and $j=0,1,2$. The relations giveThe displayed matrices obey $Y^{j}X=X{Y}^{-j}$, so their product has exactly the same form:All exponents are reduced modulo two or three respectively. Thus this verifies all 36 products, and $R$ is a two-dimensional complex group representation. It is given to be an irreducible representation.

For a one-dimensional complex group representation $U$, let $u=U(x)$ and $v=U(y)$, which are nonzero complex numbers. The relations requireSince scalar multiplication commutes and $u\ne 0$, the last relation gives $v=v^2$, hence $v=1$. Then $u=\pm 1$. The choice $u=1$ is the trivial representation; the unique nontrivial choice is the sign representation:Its group kernel isA faithful representation is injective and has trivial kernel. Here the kernel has three elements, so $U$ is not faithful.

Both one-dimensional representations are irreducible representations, and they are inequivalent to each other and to the given two-dimensional one. The sum of squares of irreducible representation dimensions givesThese exhaust all complex irreducible representations. Their number equals the number of conjugacy classes, so there are three conjugacy classes. Explicitly they areThe last two sets consist of the 3-cycles and transpositions respectively.

Denote a matrix by $A(x,y,z)$, with $y$ the upper-right entry. Direct matrix multiplication givesThis proves closure. Associativity is inherited from matrix multiplication. The identity is $A(0,0,0)$, and the inverse isBoth products with this matrix are the identity. Thus these real matrices form the Heisenberg group, in the coordinate convention with central coordinate $y$.

Let $N=\{A(0,b,0):b\in \mathbb{R}\}$. Its multiplication adds $b$, its identity is $b=0$ and its inverse negates $b$, so it is a subgroup. MoreoverThus every element of $N$ is central, and $gN{g}^{-1}=N$. Therefore $N$ is a normal subgroup. In fact it is the full center of a group, as described by the center quotient of the real Heisenberg group.

The four displayed matrices fail closure: for example ${\sigma }_x{\sigma }_y=i{\sigma }_z$ is not one of them. Thus they do not form a group by themselves.

Let ${\sigma }_0=I$ and ${\mu }_4=\{1,-1,i,-i\}$. The enlarged set is the single-qubit Pauli groupThere are 16 distinct matrices: $I,{\sigma }_x,{\sigma }_y,{\sigma }_z$ are linearly independent, so two different ones cannot be scalar multiples, and the four phases are distinct for each nonzero matrix.

The Pauli matrices satisfyHere $\delta$ is the Kronecker delta and $ϵ$ the Levi-Civita symbol. Thus any product of two Pauli matrices is another Pauli matrix or the identity times a phase in ${\mu }_4$. Multiplying by the two original phases preserves membership in ${\mu }_4$, proving closure of all 16 matrices.

Associativity is inherited from matrix multiplication, the identity is $I$, andThis proves every group axiom. The resulting group is non-Abelian, since reversing ${\sigma }_x{\sigma }_y$ changes its sign.

Put $Y_p=D(Y)$. Direct matrix multiplication givesfor every real $p$. Since $D(X)=-I_2$ commutes with all matrices and $D(Z)=-Y_p$, the remaining relations also hold:All matrices are invertible, and the relations reproduce the multiplication table of the Klein four-group. ThereforeA representation need not be an orthogonal representation; imposing orthogonality on the displayed matrices would be an extra condition.

The characters are their traces, independent of $p$:In terms of part (b), $\chi ={\chi }_{-+}+{\chi }_{--}$, so the representation is reducible. For an explicit change of basis, takeThen $S^{-1}D(Y)S=\mathrm{diag}(-1,1)$ and $S^{-1}D(Z)S=\mathrm{diag}(1,-1)$, while $D(X)$ remains $-I_2$. These are the equivalent sheared representations of the Klein four-group; the parameter changes the basis, not the two irreducible constituents.

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

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.

Write $M(a,b)=\left(\begin{array}{cc}a& b\\ 0& 1\end{array}\right)$. Direct matrix multiplication givesSince $a,c\ne 0$, the product is again in $G$. Associativity is inherited from matrix multiplication, the identity element is $M(1,0)$, andlies in $G$. These verify all group axioms. This is the Affine group of the complex line, acting by $z\mapsto az+b$.

For the diagonal subset, $M(a,0)M(c,0)=M(ac,0)$, it contains $M(1,0)$, and $M(a,0{)}^{-1}=M(a^{-1},0)$. Thus $G^{\prime }$ is a subgroup. Finally,so $f:G\to G^{\prime }$ is a surjective group homomorphism.

Direct matrix multiplication givesFor example, the diagonal entries of ${\tau }_2^2$ are $(-i)i=i(-i)=1$, and its off-diagonal entries vanish. Associativity now reduces every positive integer power to its integer parity:These are the standard Pauli matrices, each a Hermitian matrix and an involution.

Write $B(x)$ for the displayed matrix. The hyperbolic addition identities giveThus matrix multiplication is closed in $G$. It is associative because ordinary matrix multiplication is associative. The identity is $B(0)=I$, and $B(x)B(-x)=I$ gives the inverse $B(x{)}^{-1}=B(-x)$. Hence $\boxed{G\text{ is a group}}$.

Moreover, $x\mapsto B(x)$ is an injective homomorphism from the additive real numbers, since $\sinh x$ determines $x$. Therefore $\boxed{G\cong (\mathbb{R},+)}$; in particular it is abelian. These matrices are the connected boost subgroup relevant to the component quotient of the real Lorentz group in two dimensions.

The explicit matrices areDirect matrix multiplication givesThe reverse products have the opposite signs: $YX=\hat{Z}$, $ZY=\hat{X}$, $XZ=\hat{Y}$. Since $W$ is the identity matrix and $X^2=Y^2=Z^2=-W$,These are the usual quaternion multiplication relations in the complex matrix representation of quaternions.

The products in (a), together with $(-A)B=A(-B)=-(AB)$ and $(-A)(-B)=AB$, give closure of the eight-element set. Associativity is inherited from matrix multiplication, $W$ is the identity element, and the inverses from (a), with $(-A{)}^{-1}=-A^{-1}$, remain in the set. Thus the group axioms hold. This is the quaternion group $Q_8$.

In the element order specified in the question, the multiplication table isInterpreting “character of the group” as the character of a representation specified by these matrices, take the trace of each matrix:A character belongs to a representation; the underlying abstract group can have other characters.

Write a matrix in the set as $M(a,b)$. The zero matrix $M(0,0)$ has no multiplicative inverse matrix, so $S$ is not a group. Its determinant iswhich vanishes only at that zero matrix. It is therefore the only element that needs to be removed.

For closure, direct matrix multiplication givesThe product of nonzero determinants is nonzero, so two nonzero elements never multiply to zero. The identity matrix is $M(1,0)$, associativity is inherited from matrix multiplication, andThus $\boxed{S\setminus \{0_{2\times 2}\}\text{ is a group}}$. It is the multiplicative group of nonzero quaternions in the complex matrix representation of quaternions.

The conjugate transpose reverses the order of matrix multiplication. Since $A$ and $B$ are Hermitian matrices,Consequently $\boxed{AB\text{ is Hermitian}⟺AB=BA}$: the condition is exactly that the two matrices commute.

For a real square matrix, a QR factorization writes $B=QR$ with $Q$ an orthogonal matrix, $Q^{T}Q=I$, and $R$ an upper triangular matrix. If $B$ is invertible, so is $R$, andCompute $Q^{T}b$ and use back substitution; no matrix inverse needs to be formed.

Apply the Gram-Schmidt process to the columns $b_1,b_2,b_3$. The first column has Euclidean norm two, giving $q_1=(1,0,0{)}^T$ and $r_{11}=2$. For the second column,For the third column,This residual already has Euclidean norm one. Set $q_3=(0,-3/5,4/5{)}^T$ and $r_{33}=1$. ThusThe columns of $Q$ are orthonormal, and matrix multiplication verifies $QR=B$.

Using precisely this QR factorization, transform the right-hand side:Back substitution in $Rx=Q^{T}b$ givesTherefore

The two columns are orthogonal, with lengths one and two; equivalently $A^{T}A=\mathrm{diag}(1,4)$. Ordering the singular values decreasingly requires swapping the right coordinate directions. One full singular value decomposition isBoth $U$ and $V$ are orthogonal matrices, and direct matrix multiplication gives $U\Sigma V^T=A$. Hence

Since $A{p}_1=(5,2{)}^T$, an A-conjugate direction $p_2=(a,b{)}^T$ must satisfy $5a+2b=0$. One nonzero choice isDirect matrix multiplication gives $A{p}_2=(3,-3{)}^T$, and $p_1^{T}A{p}_2=0$. All nonzero scalar multiples of this vector also qualify.