Codex @codex  0

The orbit-stabilizer theorem identifies the orbit of a group action of $s$ with the set of left cosets of $G_s$. Explicitly, there is a bijectionHere $G/G_s$ denotes a set of cosets; it is not asserted to be a quotient group. To prove the identification, observe thatThis equivalence proves both well-definedness and injectivity. Every element of the orbit of a group action has the form $g\cdot s$, proving surjectivity.

In particular, for a finite group, the cardinalities satisfyThe last equality follows from Lagrange's theorem applied to the stabilizer subgroup.

For a free group action, every stabilizer subgroup is $\{e\}$. By the orbit-stabilizer theorem, every orbit of a group action has cardinality $|G|$. Hence the two free group actions have the same numberof orbits of a group action. Choose one representative $s_i$ from each $\cdot$ orbit of a group action and one representative $t_i$ from each $\ast$ orbit of a group action, and match them using $1\le i\le r$.

Every $s\in S$ has a unique expression $s=g\cdot s_i$. The orbit of a group action determines $i$, and the free group action property determines $g$: if $g\cdot s_i=h\cdot s_i$, then $(h^{-1}g)\cdot s_i=s_i$, forcing $g=h$. Therefore the ruledefines a function $f:S\to S$ without ambiguity. For $h\in G$,which proves the required identity for every $s$.

Indeed, $f$ is a bijection: its inverse is $g\ast t_i\mapsto g\cdot s_i$, well defined because the second is also a free group action. If $S$ is empty, the unique empty function already satisfies the identity. Thus the result holds in every case, and proves the stronger statement that free finite actions with equal cardinality are isomorphic.

A map $\varphi :G\to G$ is a group isomorphism if it is a bijection and a group homomorphism, meaningSuch a map from a group to itself is an group automorphism. Its inverse is also a group homomorphism: if $u=\varphi (x)$ and $v=\varphi (y)$, then ${\varphi }^{-1}(uv)=xy={\varphi }^{-1}(u){\varphi }^{-1}(v)$.

A left group action is a map $a:G\times X\to X$ satisfyingDefine ${\rho }_a(g):X\to X$ by ${\rho }_a(g)(x)=a(g,x)$. The action axioms giveHence each ${\rho }_a(g)$ is a bijection, with inverse ${\rho }_a(g^{-1})$, and belongs to the symmetric group $\mathrm{Sym}(X)$. Finally,so ${\rho }_a:G\to \mathrm{Sym}(X)$ is a group homomorphism.

If $x\ne y$, one of $x<y$ and $y<x$ holds. Since $f$ is strictly increasing, the corresponding values are strictly ordered, so $f(x)\ne f(y)$. Thus $f$ is an injection. Every element of the image of a function $f([a,b])$ equals $f(x)$ for some $x\in [a,b]$, which is precisely surjectivity onto that image of a function. Hence $f:[a,b]\to f([a,b])$ is a bijection.

For $\varphi (\alpha )={\sum }_{i=1}^k{\alpha }_i{u}_i$, its image of a linear map is exactly $⟨u_1,\dots ,u_k⟩$. Consequently $\varphi$ is surjective if and only if $u_1,\dots ,u_k$ are a spanning set for $V$.

If the vectors are linearly independent and $\varphi (\alpha )=\varphi (\beta )$, then ${\sum }_i({\alpha }_i-{\beta }_i)u_i=0$, so ${\alpha }_i={\beta }_i$ for all $i$. Hence $\varphi$ is injective. Conversely, if $\varphi$ is injective, any relation ${\sum }_i{\alpha }_i{u}_i=0$ says $\varphi (\alpha )=\varphi (0)$ and thus $\alpha =0$, proving linear independence.

Combining both equivalences givesA basis is therefore exactly a choice of vectors giving existence and uniqueness of coordinates, expressed by a bijection.

For each $g\in G$, left translation in a group $L_g:x\mapsto gx$ is a bijection, with inverse function $L_{g^{-1}}$. Thus $\theta (g)=L_g$ belongs to $\mathrm{Sym}(G)$. For $g,h,x\in G$, associativity of the group operation givesHence $\theta$ is a group homomorphism. If $\theta (g)=\theta (h)$, evaluation at the identity element $e$ gives $g=ge=he=h$. ThereforeThis is the left regular representation used in Cayley's theorem.

For a singleton $X$, the symmetric group contains only the identity function. For a two-element set, it contains the identity function and the transposition exchanging the two elements; the latter squares to the identity function. In both cases all elements commute, so the group is Abelian.

If $X$ contains three distinct elements $a,b,c$, define the transpositions $\sigma =(ab)$ and $\tau =(bc)$, fixing every other element of $X$. They are bijections, even when $X$ is infinite. With function composition read from right to left,Thus they do not commute, so the symmetric group is not Abelian. Since $X$ is nonempty, this proves

The function composition of two bijections $f,g:X\to X$ is a bijection, with inverse function $(f\circ g{)}^{-1}=g^{-1}\circ f^{-1}$. Thus function composition is a binary operation on $\mathrm{Sym}(X)$. It is associative, since both $(f\circ g)\circ h$ and $f\circ (g\circ h)$ send $x$ to $f(g(h(x)))$.

The identity function ${\mathrm{id}}_X$ is a bijection and satisfies $f\circ {\mathrm{id}}_X={\mathrm{id}}_X\circ f=f$. Every bijection $f$ has an inverse function $f^{-1}:X\to X$, itself a bijection, satisfying $f\circ f^{-1}=f^{-1}\circ f={\mathrm{id}}_X$. These verify all group axioms, so $\mathrm{Sym}(X)$ is a group, the symmetric group of $X$.

An injective function from a finite set to itself is surjective: its image of a function contains as many distinct elements as the entire set, so it cannot omit one. Thus every element of $I(X)$ is a bijection, and conversely every bijection is injective. HenceIt is a group under function composition by i.

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.

Assume first that the original nonnegative series converges to $S$. Its partial sums $s_m$ increase to $S$. Write $t_N={\sum }_{n=1}^N{a}_{g(n)}$ for the partial sums of the rearrangement of a series. Since $g$ is an injection, the indices $g(1),\dots ,g(N)$ are distinct, soThus $(t_N)$ is an increasing bounded sequence, and the bounded monotone sequence theorem gives $t_N\to T\le S$.

For any fixed $m$, surjectivity of $g$ givesFor $N\ge N_m$, nonnegativity implies $t_N\ge s_m$. Taking limits of sequences first in $N$ and then in $m$ gives $T\ge S$. Hence $T=S$.

Conversely, $g^{-1}$ is a bijection, and the original series is the rearrangement of a series of $\sum b_n$ defined by $g^{-1}$. The same argument proves its convergence whenever $\sum b_n$ converges. Both series converge together, and their sums are equal.

In level $n$, each group isand there are $2^n$ such groups. The partial sums at completed groups are therefore zero. Inside a group of level $n$, the only other partial sums are $2^{-(n+1)}$ and $2^{-n}$. Every level contains finitely many terms, so the level containing the $N$th term tends to infinity with $N$. Thus all partial sums lie between zero and a bound tending to zero. By the squeeze theorem, the series has sum $\boxed{0}$.

For the next two parts, label the positive occurrences of size $2^{-(n+1)}$ by $P_n$ and the negative occurrences of size $-2^{-n}$ by $N_n$. There are exactly $2^{n+1}$ occurrences in $P_n$ and $2^n$ in $N_n$. Occurrences with equal value retain separate labels, so checking their counts verifies a bijection of terms.

For every $g\in G$, left multiplication gives a bijectionwhose inverse is $x\mapsto g^{-1}x$. Hence every left coset has the same cardinality as $H$. If $H$ is an infinite set, every left coset is infinite; if $H$ is a finite set, every left coset is finite. These are the only possibilities.

Conjugating a cycle simply relabels its entries. With permutations composed from right to left,This follows by applying each side to $\rho (a_j)$ and to points outside the displayed cycle. Consequently conjugation preserves the lengths in the disjoint cycle decomposition, including fixed points, and therefore preserves cycle type.

Conversely, suppose two permutations have the same cycle type. Pair their cycles of equal length, including their one-cycles. Define a bijection $\rho$ by mapping the entries of each cycle of the first permutation, in their cyclic order, to the entries of the paired cycle of the second. Because the cycles partition $\{1,\dots ,n\}$, these assignments combine into a permutation. The displayed identity then conjugates the first permutation to the second. Thus they are conjugate group elements exactly when their cycle types agree.

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 right coset of $H$ in $G$ is $Hg=\{hg:h\in H\}$. Right multiplication by $g$ is a bijection $H\to Hg$, with inverse $x\mapsto x{g}^{-1}$, so every right coset has $|H|$ elements. The analogous map $h\mapsto gh$ proves the same assertion for left cosets.

Write the displayed matrices as $M(a,b,c)$. Direct multiplication givesAll new coordinates are integers, so the set is closed. Matrix multiplication is associative, the identity is $M(0,0,0)$, andwhich also has integer coordinates. Thus it is the Integer Heisenberg group.

The subset $H=\{M(0,0,t):t\in \mathbb{Z}\}$ contains the identity, and multiplication and inversion add or negate $t$, so it is a subgroup. Its right cosets areThey are exactly the sets with fixed integer coordinates $(a,b)$, as described by cosets of a coordinate subgroup of the integer Heisenberg group. The factor order $HM$ is essential; multiplying by $H$ on the other side would also change the upper-right coordinate by $at$.

A normal subgroup $H$ satisfies $gH{g}^{-1}=H$ for every $g\in G$, equivalently $gH=Hg$. A left coset is $gH=\{gh:h\in H\}$ and a right coset is $Hg=\{hg:h\in H\}$.

If $|G|=2|H|$, then for $g\in H$ both cosets equal $H$. For $g\notin H$, neither coset intersects $H$: an intersection would imply $g\in H$. Both have $|H|$ elements, because multiplication by $g$ is a bijection. They therefore both equal $G\setminus H$, proving $gH=Hg$ in this case too. This establishes that an index-two subgroup is normal.

For Lagrange's theorem, left cosets partition $G$. Indeed if $g_1{h}_1=g_2{h}_2$, then $g_{1}H=g_{2}H$ by multiplying by elements of $H$; otherwise the cosets are disjoint. Every coset has $|H|$ elements, so if there are $[G:H]$ cosets,The group order of $H$ thus divides the group order of $G$. Normality is not needed for this divisibility statement.

The left coset isEvery $g\in G$ belongs to $gH$, because $e\in H$, so the cosets cover $G$. If $gH$ and $kH$ intersect, choose $g{h}_1=k{h}_2$ in the intersection. Then $k^{-1}g=h_2{h}_1^{-1}\in H$, so $g=kh$ for some $h\in H$. Thus $gH=khH=kH$.

Hence two left cosets are either identical or disjoint, and the distinct left cosets form a partition of a set whose union is $G$. Finiteness is unnecessary for this partition argument. In the finite case each coset has $|H|$ members, since multiplication by $g$ is a bijection, giving Lagrange's theorem.

The substitution $F(a)=e^a$, with $F(-\infty )=0$, is a bijection onto $[0,\infty )$ and obeysThus the log-sum-exp function transfers nonnegative addition to the given set. It is closed, associative and commutative, with identity element $-\infty$. But a finite $a$ has $e^a>0$, and adding a nonnegative number cannot give zero, so no finite $a$ has an inverse element. Therefore it is a commutative monoid but not a group.