Codex @codex  0

Write $U^{\ast }={\overline{U}}^T$ for the conjugate transpose. Taking determinants in $U^{\ast }AU=A$ gives $|\det U{|}^2\det A=\det A$. Since the Hermitian matrix $A$ is invertible, every such $U$ is invertible and $|\det U|=1$. The identity belongs to $U_A$; if $U,V\in U_A$, then $(UV{)}^{\ast }A(UV)=V^{\ast }AV=A$; and multiplying $U^{\ast }AU=A$ by $(U^{\ast }{)}^{-1}$ and $U^{-1}$ gives $(U^{-1}{)}^{\ast }A{U}^{-1}=A$. Associativity comes from matrix multiplication, so this is a group.

The Hermitian form $h_A(v,w)=v^{\ast }Aw$ obeys $h_A(Uv,Uw)=h_A(v,w)$ precisely when $U\in U_A$. Thus $U_A$ is the group of linear isometries of this nondegenerate Hermitian form; positivity of $A$ is unnecessary.

For $A=I$, $U$ is a unitary matrix. Here is a direct diagonalization of a matrix proof. Over $\mathbb{C}$, its characteristic polynomial has a root, giving a unit eigenvector $v$ with $Uv=\lambda v$. Preservation of the inner product gives $|\lambda |=1$. If $w\perp v$, then $⟨Uw,Uv⟩=⟨w,v⟩=0$, so $v^{\perp }$ is invariant. The restriction is again a unitary matrix. Induction on the dimension supplies an orthonormal basis of eigenvectors. In that basis, $U$ is diagonal, with diagonal entries on the unit circle.

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 counterclockwise planar rotation matrix has the formTo recover this form from preservation of the Euclidean norm, let $\mathbf{u},\mathbf{v}$ be the columns of $R$. Applying the norm condition to the two coordinate unit vectors gives $|\mathbf{u}|=|\mathbf{v}|=1$. Applying it to their sum givesso $\mathbf{u}\cdot \mathbf{v}=0$. The columns are an orthonormal basis, and $R^{T}R=I$: $R$ is an orthogonal matrix.

Write $\mathbf{u}=(\cos \theta ,\sin \theta {)}^T$. There are two perpendicular unit vectors available for $\mathbf{v}$, namely $\pm (-\sin \theta ,\cos \theta {)}^T$. The first gives determinant $1$, the second $-1$. The positive determinant hypothesis selects the first. A norm-preserving planar map with positive determinant is a rotation.

For the commutation condition, writeDirect matrix multiplication givesEquality forces $c=-b$ and $d=a$, so, with $u=a$ and $v=-b$,If $u=v=0$, take $\lambda =0$ and $R=I$. Otherwise set $\lambda =\sqrt{u^2+v^2}>0$ and choose $\cos \theta =u/\lambda$, $\sin \theta =v/\lambda$. ThenThis describes the centralizer of a planar quarter-turn. Its nonzero elements act as a rotation followed by a uniform scaling, just as multiplication by a nonzero complex number does.

An example is the unitriangular group of degree three over F3, consisting ofThis is an upper unitriangular group of order $3^3=27$. Direct matrix multiplication givesThe formula gives closure, identity $M(0,0,0)$, and inverse $M(-a,-b,ab-c)$; associativity follows from matrix multiplication. The two elements $M(1,0,0)$ and $M(0,1,0)$ do not commute: their products have respectively $c=1$ and $c=0$.

Every element has the form $I+N$ with $N^3=0$. Since the finite field ${\mathbb{F}}_3$ has characteristic three, the binomial expansion givesHence every nonidentity element has order exactly three. This is a nonabelian finite group with exponent of a finite group equal to three.

The definition of matrix multiplication givesThe middle equality uses commutativity of scalar multiplication in $\mathbb{R}$ or $\mathbb{C}$, together with interchange of finite sums. Thus the trace is unchanged by cyclically moving the two factors.

Give $V_n$ the action $(g\cdot P)(x,y)=P((x,y)g)$, where $(x,y)$ is a row vector. Substitution preserves homogeneous degree, and composition agrees with matrix multiplication, so this is a complex representation of SU(2) group. The diagonal torus $\mathrm{diag}(z,z^{-1})$ acts on $x^{n-j}{y}^j$ with weight $z^{n-2j}$; these weights are distinct.

A nonzero invariant subspace is invariant under the torus, so finite-dimensional Fourier projection onto its weight spaces supplies a nonzero monomial. Differentiating the group action and complexifying supplies the operators $E=x{\partial }_y$ and $F=y{\partial }_x$. Their repeated application moves between every successive monomial, with nonzero coefficients until an endpoint is reached:The invariant subspace therefore contains the whole monomial basis. ThusFor $n=0$ this is the one-dimensional trivial representation. Torus weight projections are legitimate because an invariant complex subspace is closed in finite dimension.

For a nonzero vector $v\in {\mathbb{R}}^n$, a Householder reflection isIt is immediately symmetric. If $P=v{v}^T/(v^{T}v)$, then $P^2=P$, soHence $H$ is also an orthogonal matrix, with $H^{-1}=H$.

The similarity transformation can be expanded asComputing $v^{T}A$, $Av$, and the scalar $v^{T}Av$ costs $O(n^2)$ arithmetic operations, after which the remaining updates are outer products and scalar multiples, also costing $O(n^2)$. Thus $HA{H}^{-1}$ can be formed in $O(n^2)$ operations rather than by two general $O(n^3)$ matrix multiplications.

If $M_1^{T}J{M}_1=J$ and $M_2^{T}J{M}_2=J$, then matrix multiplication and the transpose rule giveThus the product also satisfies the equation.

The equation and part (i) imply that $M_1$ is invertible. Multiplying
$M_1^{T}J{M}_1=J$ on the left by $(M_1^{-1}{)}^T$ and on the right by $M_1^{-1}$ givesHence the set of solutions is closed under products and matrix inverses.

Write an element of the Integer Heisenberg group as $(x,y,z)$. Matrix multiplication givesThe subgroupis normal and isomorphic to ${\mathbb{Z}}^2$. If $t=(1,0,0)$, thenThus, on the coordinate column $(y,z{)}^T$, conjugation by $t$ is the linear map with matrixEvery element has a unique expression $(0,y,z)t^x$, so

The commutators $[t,(0,y,z)]$ fill the central subgroup of matrices $(0,0,z)$, while the quotient by this subgroup is generated freely and abelianly by the images of $(1,0,0)$ and $(0,1,0)$. Equivalently, $(A-I){\mathbb{Z}}^2$ is the second coordinate axis. Therefore the abelianization is