Codex @codex  0

Choose $x_0\in X$ with stabilizer subgroup $H$. Transitivity means that every point is $g{x}_0$ for some $g$. Its stabilizer subgroup issince $a(g{x}_0)=g{x}_0$ exactly when $g^{-1}ag\in H$. The kernel of a group homomorphism arising from the group action is the set of elements fixing every point, henceThis is the subgroup core. A group homomorphism is injective precisely when its kernel is trivial. The desired equivalence is therefore exactly the equivalence between a trivial subgroup core and a faithful group action. No finiteness assumption is required in this part.

For a group action of $G$ on $X$, let $G_x=\{g:gx=x\}$ be the stabilizer subgroup of $x$, and $Gx$ its group orbit. The orbit-stabilizer theorem is the bijectionIt is well defined because elements in the same left coset differ by an element fixing $x$. Conversely, $gx=hx$ implies $h^{-1}g\in G_x$, so the cosets coincide. Surjectivity is the definition of the group orbit. For a finite group, counting the cosets givesTo obtain Cayley theorem, let $G$ act on its own underlying set by left multiplication. The map ${\lambda }_g:x\mapsto gx$ is a permutation, with inverse ${\lambda }_{g^{-1}}$, and ${\lambda }_g{\lambda }_h={\lambda }_{gh}$. If ${\lambda }_g$ is the identity permutation, evaluating at the identity element gives $g=e$. Thus $g\mapsto {\lambda }_g$ is an injective group homomorphism. When $|G|=n$, labeling this set by $n$ letters identifies its image with a subgroup of $S_n$. Every finite group embeds in the symmetric group on its own elements.

Work with $x$ modulo $p-1$ and $u$ modulo $p$. By Fermat's little theorem, $a^{p-1}=1$ in ${\mathbb{F}}_p$, so the factor $a^y$ is independent of the chosen representative of $y$. The proposed multiplication is therefore well defined on the stated Cartesian product. Its two associative bracketings have the same second component:and both have first component $x+y+z$. The identity element is $(0,0)$, and the two-sided inverse element isThus the multiplication defines the twisted cyclic pair group, of order $p(p-1)$.

If $a=1$, multiplication is coordinatewise addition, so the group is abelian. If $a\ne 1$, then $p>2$ and both $(1,0)$ and $(0,1)$ are available; their products in opposite orders are $(1,1)$ and $(1,a)$. They differ. HenceBoth $H$ and $K$ contain the identity element and are closed under the multiplication and inverses: they are the cyclic groups of orders $p-1$ and $p$ respectively. Conjugation gives, with all coordinates reduced in the appropriate modulus,so $K$ is a normal subgroup. For $H$, the corresponding calculation isWhen $a=1$ this lies in $H$. Conversely, for $a\ne 1$, take $x=0$, $u=1$, $y=1$: the second coordinate is $a-1\ne 0$, so $H$ is not normal. Thus $H$ is normal precisely when $a=1$.

Finally, the projectionis a surjective group homomorphism because the first coordinates add. Its kernel of a group homomorphism is exactly $K$. At $p=2$, $a=1$ is the only possibility and the first factor is trivial, consistent with every conclusion. No assumption that $a$ generates the multiplicative group of the finite field is needed.

For a group homomorphism $h:A\to B$, the dual morphism $\hat{h}:\hat{B}\to \hat{A}$ is pullback of algebraically trivial line bundles. Translations satisfy $h\circ T_x=T_{h(x)}\circ h$, and thereforeAlso ${\varphi }_{L\otimes M}={\varphi }_L+{\varphi }_M$ and ${\varphi }_{L^{-1}}=-{\varphi }_L$. Dualizing is additive: $\widehat{f+g}=\hat{f}+\hat{g}$, since algebraically trivial line bundles obey the Theorem of the square. Apply these identities to the three factors defining $D_L$. The two diagonal terms cancel in the expansionHence $\boxed{{\varphi }_{D_L(f,g)}=\hat{f}\circ {\varphi }_L\circ g+\hat{g}\circ {\varphi }_L\circ f}$.

Lagrange's theorem states that for a subgroup $L$ of a finite group $G$, $|G|=[G:L]|L|$. In particular $|L|$ divides $|G|$; the equal-sized cosets partition $G$.

Apply the theorem to $H\cap K$ inside both subgroups. Its order divides both coprime orders, so $H\cap K=\{1\}$. For $h\in H$ and $k\in K$, the group commutator $hk{h}^{-1}{k}^{-1}$ lies in $K$ by $K$ being a normal subgroup, and in $H$ because $k{h}^{-1}{k}^{-1}\in H$. It is therefore the identity. Thus every element of $H$ commutes with every element of $K$.

Define $\theta :H\times K\to G$ by $\theta (h,k)=hk$. The cross-commutation just proved gives $\theta (h,k)\theta (h^{\prime },k^{\prime })=h{h}^{\prime }k{k}^{\prime }=\theta (h{h}^{\prime },k{k}^{\prime })$, so this is a group homomorphism from the direct product of groups. The product assumption makes it surjective. If $hk=1$, then $h=k^{-1}\in H\cap K$, so both entries are the identity and the kernel of a group homomorphism is trivial. HenceThis proves the internal direct product theorem in the present coprime-order setting, rather than merely matching the numbers of elements.

A cyclic group has one generator of a group: $G=⟨a⟩=\{a^j:j\in \mathbb{Z}\}$. An abelian group has $xy=yx$ for every pair of elements. Powers of one element commute because $a^r{a}^s=a^{r+s}=a^{s+r}=a^s{a}^r$, so every cyclic group is Abelian. The Klein four-group $C_2\times C_2$ is Abelian but is not a cyclic group: every nonidentity element has order two, whereas a generator of a group for a four-element cyclic group would have order four.

Fix a generator of a group $x$ of $C_n$. A group homomorphism is determined by $g=\varphi (x)$ because $\varphi (x^j)=g^j$, and the relation $x^n=1$ forces $g^n=1$. Conversely, such a $g$ defines $\varphi (x^j)=g^j$: exponents differing by a multiple of $n$ give the same value, and addition of exponents verifies the group homomorphism law. Thus the homomorphism from a finite cyclic group correspondence isFor $S_4$, the order of a permutation is the least common multiple of its disjoint cycle lengths. The condition ${\sigma }^4=1$ allows identity, transpositions, two disjoint transpositions, and four-cycles. The sixteen homomorphisms are ${\varphi }_{\sigma }(x^j)={\sigma }^j$, with the full list of possible generator imagesThe remaining eight elements of the symmetric group are three-cycles and do not qualify.

Take $X=G$ and let $g$ act by left multiplication $L_g(x)=gx$. Each $L_g$ is a permutation, with inverse $L_{g^{-1}}$. Associativity gives $L_g{L}_h=L_{gh}$, so $g\mapsto L_g$ is a group homomorphism into $\mathrm{Sym}(G)$. If $L_g$ is the identity permutation, evaluating it at the identity element gives $g=1$. ThusThis is the Cayley theorem, realized by the left regular action, which is a faithful group action.

Place the cube's vertices at $(\pm 1,\pm 1,\pm 1)$. Its full symmetry group of a cube consists of signed permutation matrices. To see completeness, a cube symmetry fixes its center of a group and permutes the six face normals, so it sends coordinate axes to signed coordinate axes; conversely every such matrix preserves the cube. Coordinate permutations and sign changes take any edge to any other edge, so this is a transitive group action on edges.

Choose the edge $e=\{(1,1,z):-1\le z\le 1\}$. A symmetry stabilizing it must preserve its axis direction and its midpoint $(1,1,0)$. It can swap the first two coordinates and independently reverse the third coordinate, but cannot change the signs of the two fixed coordinates. HenceThere are twelve edges and four elements of the stabilizer subgroup. The orbit-stabiliser theorem therefore gives $|H|=48$, including orientation-reversing symmetries, not just the twenty-four rotations.

The action defines a group homomorphism $H\to S_{12}$. If an element fixes every edge as a set, it fixes every vertex, since each vertex is the unique common point of its three incident edges. A cube isometry fixing all vertices is the identity. Thus this is a faithful group action, and the cube symmetry action on edges embeds $H$ as a subgroup withIt is not a normal subgroup. Central inversion $\mathbf{x}\mapsto -\mathbf{x}$ belongs to $H$ and swaps the twelve edges in six opposite pairs. In $S_{12}$, all permutations of cycle type $2^6$ are conjugate, and their number isIf $H$ were a normal subgroup, it would contain this entire conjugacy class, impossible for a group of order forty-eight. This avoids relying on a classification of normal subgroups of the symmetric group.

Write the matrix as $M(a,b,x)$. Direct multiplication and inversion giveThe identity is $M(0,0,0)$ and all determinants are one, so these formulas verify the subgroup criterion inside ${\mathrm{GL}}_3(\mathbb{R})$. This is the real Heisenberg group.

The map $M(a,b,x)\mapsto a$ is a surjective group homomorphism to the additive group of real numbers; its kernel is exactly $H$. Hence $H$ is normal and the first isomorphism theorem givesTwo matrices commute exactly when $a{b}^{\prime }=a^{\prime }b$. Requiring that relation for every $a^{\prime },b^{\prime }$ forces $a=b=0$, while $x$ is unrestricted. ThereforeFinally $M(a,b,x)\mapsto (a,b)$ is a surjective group homomorphism to the additive group ${\mathbb{R}}^2$ with precisely this kernel of a group homomorphism, giving $G/Z(G)\cong ({\mathbb{R}}^2,+)$. The central coordinate records noncommutativity: the group commutator is $M(0,0,a{b}^{\prime }-a^{\prime }b)$.

At $P_1$ the tangent slope is zero. The elliptic-curve addition formula givesThe chord from $P_1$ to $P_2$ has slope $(-3-15)/(-6)=3$, so its sum has $x$-coordinate $3^2-0-(-6)=15$ and $y$-coordinate $3(0-15)-15=-60$. Thus $P_1+P_2=(15,-60)$.

Reduction at the good prime seven gives $\tilde{E}:y^2=x^3+1$. For $x=0,1,2,3,4,5,6$, the right sides are respectively $1,2,2,0,2,0,0$. There are respectively $2,2,2,1,2,1,1$ choices of $y$. Including the point at infinity gives $\#\tilde{E}({\mathbb{F}}_7)=12$. Its nonzero torsion points of an elliptic curve of order two are $(3,0),(5,0),(6,0)$, so it cannot be cyclic. Its two-primary component is $(\mathbb{Z}/2\mathbb{Z}{)}^2$ and its three-primary component is cyclic of order three; henceIn particular its exponent is six.

The reduction of an elliptic curve is a group homomorphism defined on every ${\mathbb{Q}}_7$-point by projectivity. Thus $6P$ reduces to the identity for every rational $P$. A finite point with integral coordinates reduces to an affine point, whose projective last coordinate is one, so it cannot reduce to the identity at infinity. Therefore every nonzero finite point $6P$ has nonintegral coordinates. If $6P=O$, it has no affine coordinates at all. This is the reduction exponent obstruction to integral multiples.

Write the finite abelian group additively. A character of a finite abelian group is a group homomorphism $\chi :G\to \{z:|z|=1\}$. We first prove that there are exactly $|G|$ such characters of a finite abelian group, without assuming a structure theorem.

Use extension of a character across a cyclic quotient. Given a subgroup $H$ and $a\notin H$, let $k$ be the least positive integer with $ka\in H$. The subgroup $K=H+⟨a⟩$ has $k$ cosets of $H$. If $\varphi$ is a character of a finite abelian group on $H$, choose any of the $k$ roots ${\lambda }^k=\varphi (ka)$ and defineThis is well-defined: two representations differ by an integer multiple of $ka$, and the root equation exactly cancels that difference. It is a character of a finite abelian group, and every extension arises from one of the $k$ choices of $\lambda$. Build a chain from the trivial subgroup to $G$ by adjoining elements. The character of a finite abelian group count multiplies by the same factor as the subgroup order at every step, so $|\hat{G}|=|G|$.

For a nontrivial character of a finite abelian group $\eta$, choose $a$ with $\eta (a)\ne 1$. Translating the group sum showsso the sum is zero. Applied to $\chi \overline{\psi }$, this provesThe $|G|$ orthogonal nonzero characters of a finite abelian group therefore form a basis of all complex functions on $G$, a vector space of dimension $|G|$.

With the unnormalized Fourier coefficients $\hat{f}(\chi )={\sum }_{x\in G}f(x)\overline{\chi (x)}$, expansion in that basis gives the Fourier inversion on a finite groupUnder a normalized forward-transform convention the prefactor would instead be one. Thus the unspecified constant is determined by the convention, and the inversion itself follows directly from character of a finite abelian group counting and orthogonality.

Choose a positive common denominator $d$ so that $x=a/d$ and $y=b/d$ with nonzero integers $a,b$. Put $h=\gcd (a,b)>0$. Every element of the generated subgroup has the form $(ma+nb)/d$, so it lies in $(h/d)\mathbb{Z}$. Conversely, Bezout identity gives integers $u,v$ with $ua+vb=h$, so $h/d$ belongs to the generated subgroup. ConsequentlyThis map is a bijective additive group homomorphism. It is the two-generator instance of a finitely generated subgroup of the rational additive group being an infinite cyclic group.

For the real example, take $x=1$ and $y=\sqrt{2}$. The group homomorphism $(m,n)\mapsto m+n\sqrt{2}$ from ${\mathbb{Z}}^2$ onto the generated subgroup is injective because $\sqrt{2}$ is an irrational number. Thus this subgroup is isomorphic to ${\mathbb{Z}}^2$. More directly, if a single real number $t$ generated it, then $1=at$ and $\sqrt{2}=bt$ for integers $a\ne 0,b$, giving $\sqrt{2}=b/a$, a contradiction. The choice $1,\sqrt{2}$ generates a noncyclic additive subgroup.

If a nonidentity power $x^j$ belongs to $H$, reduce $j$ modulo $p$ so that $1\le j<p$. There is an integer $a$ with $aj\equiv 1(\mathrm{mod}p)$, and therefore $(x^j{)}^a=x\in H$, a contradiction. ThusNow suppose that $G$ is abelian and finite. Start with $H_0=\{1\}$, and whenever $H_k\ne G$, choose $x_{k+1}\notin H_k$. The multiplication mapis a group homomorphism because all elements commute. It is surjective by construction and injective because the intersection of its two factors is trivial: $hx=h^{\prime }{x}^{\prime }$ implies $h^{\prime -1}h=x^{\prime }{x}^{-1}$ lies in that intersection. Hence $H_{k+1}\cong H_k\times C_p$, and its order is $p$ times the previous order. Strict growth and finiteness ensure that the construction ends at $G$. Thereforewhere $n$ is the number of factors, possibly zero. This is an elementary abelian group, obtained by an explicit direct product of groups construction.