Codex @codex  0

For a finite group $G$ and a subgroup $H$, Lagrange's theorem statesIn particular $|H|$ divides $|G|$: the left cosets partition $G$, and multiplication by a representative is a bijection from $H$ to each coset. Apply this to the cyclic subgroup $⟨g⟩$. Its size is the order of a group element $g$, so every element order divides $|G|$.

Under the square condition, every group element is its own inverse element. Consequentlyfor all $g,h$. This proves that a group of exponent two is abelian, including the trivial group.

For the fourth-power condition a counterexample to commutativity is the quaternion groupHere $i^2=j^2=k^2=-1$ and $ij=k=-ji$. Thus its six elements outside $\{\pm 1\}$ have order of a group element four, while $1$ and $-1$ have orders one and two. All fourth powers are the identity, yet $ij\ne ji$.

A permutation cycle $(a_1{a}_2\cdots a_p)$ sends $a_1$ to $a_2$, each successive listed point to the next, and $a_p$ to $a_1$, fixing every unlisted point. Its length is $p$. For any permutation $h$,Thus conjugate group elements in the symmetric group have the same cycle length. Conversely, two cycles of the same length are conjugate: send their entries, in cyclic order, to one another and extend this bijection arbitrarily to the unused points. Length-one cycles represent the identity and cause no exception to this conclusion.

An odd-length permutation cycle is an even permutation, since its sign is $(-1{)}^{p-1}$. Let $c,d$ be such cycles on $p+2$ points and choose $h\in S_{p+2}$ with $hc{h}^{-1}=d$. If $h$ is odd, let $t$ be the transposition of the two points unused by the listed cycle $c$. Then $tc=ct$, and $ht$ is even withHence all the $p$-cycles are conjugate within $A_{p+2}$. The two spare letters supply the parity correction; they are the reason the same argument need not work with only one spare letter.

In $A_4$ the answer is no. For example, $(123)$ and $(132)$ are conjugated by the odd transposition $(23)$ in $S_4$. The centralizer of $(123)$ in $S_4$ is exactly its order-three cyclic subgroup: a commuting permutation fixes the unique fixed point $4$ and acts as a power of the cycle on the other three points. All these centralizing elements are even. Every other conjugating element differs from $(23)$ by a centralizing element, so it is also odd. There is no conjugator in $A_4$. Equivalently, the eight three-cycles split into two conjugacy classes of size $12/3=4$, illustrating the alternating conjugacy class splitting criterion.

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.

Take $fg=f\circ g$. The assertion can fail on an infinite set. On $X={\mathbb{N}}_0$, set $g(n)=n+1$, $f(0)=0$, and $f(n)=n-1$ for $n\ge 1$. Then $f(g(n))=n$ for every $n$, but $g(f(0))=1\ne 0$. Thus a right inverse need not be a left inverse.

On a finite set it is always true. From $fg={\mathrm{id}}_X$, $g$ is an injection: equality of two $g$-values gives equality after applying $f$. An injective self-map of a finite set is a bijection. Composing $fg={\mathrm{id}}_X$ with $g^{-1}$ shows $f=g^{-1}$, and hence $gf={\mathrm{id}}_X$. This includes the empty set.

The final property concerns a pointwise periodic self-map. Such a map is a bijection: each point has a predecessor in its finite cycle, giving surjectivity; if $f(x)=f(y)$, choose a common multiple $N$ of periods of $x,y$ and apply $f^{N-1}$ to get $x=y$. Its finite cycles are therefore disjoint.

If $X$ is finite, choose the least common multiple of the finitely many cycle lengths. This positive integer $N$ gives $f^N={\mathrm{id}}_X$. The empty set satisfies the property with $N=1$.

Conversely, in the usual set theory with choice, every infinite $X$ contains a countably infinite set. Divide such a subset into disjoint finite blocks $B_j$ of sizes $j+1$, $j\ge 1$, make $f$ a cyclic permutation on each block, and fix every other point. Every point returns to itself, but an identity iterate would have to be divisible by every block length $j+1$. No positive integer has that property: take a block longer than that integer. Thus the uniform period criterion for pointwise periodic maps givesThe axiom of choice assumption is stated here because extracting a countably infinite subset of an arbitrary infinite set is not an unrestricted theorem in set theory without choice.

Consider two finite assemblies of the same number $n$ of congruent bounded Euclidean tiles. Label their matching faces so the same prescribed face identifications are used in both assemblies. For each face type $c$, encode the first assembly by a symmetric involution $A_c$: a paired face exchanges its two tile indices, an exterior Dirichlet boundary condition contributes diagonal $-1$, and an exterior Neumann boundary condition contributes diagonal $+1$. Let $B_c$ encode the second assembly. Face coordinates are pulled back to the same reference face; if identifications have additional face isometries, these pullbacks must be included in the intertwining operators.

The transplantation theorem says that a constant matrix $C$ with $C{A}_c=B_{c}C$ for every face type sends the vector of tile restrictions of a Laplacian eigenfunction on the first assembly to one on the second, by $g=Cf$. If $C$ is invertible, it is a bijection of each eigenspace and the assemblies are isospectral with multiplicities.

To prove it, each component solves the same interior equation $\Delta f_j=\lambda f_j$, and a constant linear combination solves that equation too. On a face, let $u$ be the vector of boundary values and $v$ the vector of outward normal derivatives. All matching and exterior conditions are exactlyFor an internal face these equations say that values agree and the two outward derivatives sum to zero. For diagonal $-1$ they impose zero value, and for diagonal $+1$ zero normal derivative. The intertwining identity gives $B_c(Cu)=Cu$ and $B_c(Cv)=-Cv$, so the transplanted functions match and satisfy the correct boundary conditions. Applying $C^{-1}$ proves the eigenspace bijection. At corners the same reasoning is interpreted in the finite-energy weak domain: no value jump and cancellation of normal flux prevent an extra distributional source. It gives the usual self-adjoint Dirichlet/mixed Laplacians on polygonal assemblies.

Here is an explicit transplantation by reflection parity. Take a rectangle of width $2a$ and height $b$, with the Dirichlet boundary condition on every exterior side. Cut it at its vertical midline into two congruent half-rectangles, pulling the right-hand half back by reflection. The midline gluing matrix isReplace the connected assembly by the disjoint union of two width-$a$, height-$b$ rectangles: the first has Dirichlet conditions on all sides; the second has Dirichlet on three sides and Neumann on the side representing the cut. Its corresponding matrix is $D=\mathrm{diag}(-1,1)$. The invertible, indeed orthogonal, matrixintertwines the midline conditions. Every other face has matrix $-I$ on both assemblies, which automatically intertwines. The transplantation theorem proves equality of the complete spectra, although one surface is connected and the other has two components with the required uniform and mixed conditions.

Equivalently, odd reflection eigenfunctions vanish on the cut, while even reflection eigenfunctions have zero normal derivative there. A direct separation-of-variables check gives the connected rectangle's eigenvaluesEven $m=2j$ gives the fully Dirichlet half-rectangle spectrum, and odd $m=2j+1$, $j\ge 0$, gives the mixed half-rectangle spectrum. The split preserves every multiplicity, including coincidences between different pairs of indices.

Choose a generator $[S^n]$ of ${\tilde{H}}_n(S^n;\mathbb{Z})\cong \mathbb{Z}$. The mapping degree of a continuous map is the integer determined byFor $n\ge 1$ this is ordinary top-dimensional homology; using reduced homology also gives a convention for $n=0$. Domain and target use the same orientation, so reversing the chosen generator in both leaves the integer unchanged. Homotopy invariance of homology makes the mapping degree invariant under homotopy.

We interpret the manifold criterion for a suspension in the category of nonempty topological manifolds without boundary, and “sphere” as homeomorphic to the standard sphere. Let $X$ have dimension $d$. If $X\cong S^d$, an explicit homeomorphism from its suspension to $S^{d+1}$ isIt is a continuous map that is a bijection: the two collapsed ends become the poles, and every other point determines $t$ and $x$ uniquely. The compact-to-Hausdorff continuous bijection theorem makes it a homeomorphism.

Conversely suppose $SX$ is a topological manifold. Its open part $X\times (0,1)$ shows its dimension is $d+1$. At a suspension vertex $v$ there is an open cone neighbourhood $U$ on $X$. It is contractible, while $U\setminus \{v\}$ admits a deformation retraction onto $X$. The long exact sequence in relative homology and excision give the local homology from a link calculationA point of a $(d+1)$-dimensional topological manifold without boundary has local homology $\mathbb{Z}$ in degree $d+1$ and zero in all other degrees. ConsequentlyThus $X$ is an integral homology sphere. This conclusion alone does not identify its homeomorphism type.

If $d\ge 2$, it is also simply connected. Choose a cone neighbourhood $U$ of the vertex and an open coordinate ball $B$ around the vertex inside $U$. By compactness of $X$, sufficiently short entire cone neighbourhoods fit inside any neighbourhood of $v$: the inverse image of that neighbourhood contains $X\times \{0\}$, and a finite subcover supplies one uniform collar length. Choose such a shorter cone $V\subset B$. The inclusions of punctured neighbourhoods factor asThe composite induces an isomorphism of fundamental groups, since both cone punctures are products of $X$ with intervals and their inclusion is a homotopy equivalence. The middle punctured ball has the homotopy type of $S^d$ and is simply connected for $d\ge 2$. Hence the composite is also zero on the fundamental group, forcing ${\pi }_1(X)=0$. This uses the nested neighbourhoods, not an unsupported claim that an arbitrary punctured neighbourhood is a sphere.

The Hurewicz theorem, applied successively to the vanishing lower homology groups, now gives ${\pi }_j(X)=0$ for $j<d$ and ${\pi }_d(X)\cong H_d(X)\cong \mathbb{Z}$. A representative of its generator is a continuous map $S^d\to X$ inducing an isomorphism in every integral homology degree. Topological manifolds have the homotopy type of CW complexes, so the homological Whitehead theorem makes it a homotopy equivalence. We have proved that $X$ is a homotopy sphere.

At this point the topological classification theorem is essential: the topological generalized Poincare theorem says that a closed homotopy sphere is homeomorphic to the standard sphere. Applying it completes the converse for $d\ge 2$. For $d=1$, the local calculation makes $X$ a connected compact one-dimensional manifold without boundary, hence a circle. For $d=0$, a compact zero-dimensional manifold is a finite set, and ${\tilde{H}}_0(X)\cong \mathbb{Z}$ forces exactly two points. Thus it is $S^0$. Altogether,The last classification step is not a consequence of homology alone, and we make no assertion of diffeomorphism with a prescribed smooth structure. If the word manifold allows boundary on both sides, the printed assertion needs this correction: the suspension of the interval is a closed disk. For instance $[x,t]\mapsto ((2x-1)(1-|2t-1|),2t-1)$ identifies it with the filled diamond $|u|+|v|\le 1$, although the interval is not a sphere.

To construct sphere maps of arbitrary integer degree, first use $h_m:S^1\to S^1$, $h_m(z)=z^m$ for any integer $m$, including the constant map when $m=0$. Lifting its argument to the real line gives $\theta \mapsto m\theta$, so the fundamental one-cycle is sent to $m$ times itself. Therefore $\mathrm{deg}{h}_m=m$.

Two cone neighbourhoods cover a suspension; their intersection admits a deformation retraction onto the original space. The reduced Mayer–Vietoris theorem gives a natural suspension isomorphismNaturality means that the suspension of a continuous map induces the same integer multiplier. This proves degree under suspension. Using the standard identification $S(S^k)\cong S^{k+1}$, setThus every integer occurs in every positive sphere dimension, with negative degrees handled just as well as positive ones.

If “every $n$” includes zero, that final printed assertion is false. The generator of ${\tilde{H}}_0(S^0)$ is the difference of its two points. A map of a two-point set is the identity, the transposition, or one of two constant maps, giving preciselyThese degrees of maps of the zero-sphere are the explicit exception to the arbitrary-degree construction.

For the covariant version of the Yoneda embedding, put $Y(A)=\mathcal{C}(A,-)$. A morphism $u:A\to B$ induces the natural transformation $Y(u):Y(B)\to Y(A)$ whose component sends $v:B\to X$ to $vu$. Thus $Y$ is a functor from the opposite category ${\mathcal{C}}^{\mathrm{op}}$ to the functor category $[\mathcal{C},\mathbf{Set}]$. The locally small category hypothesis makes each value a set.

The Yoneda lemma says that, for a functor $F:\mathcal{C}\to \mathbf{Set}$, evaluation at the identity morphism gives a natural bijectionGiven $a\in F(A)$, define ${\theta }_X^a(v)=F(v)(a)$. For $w:X\to X^{\prime }$, the functor law gives $F(w){\theta }_X^a(v)=F(wv)(a)={\theta }_{X^{\prime }}^a(wv)$, proving naturality. Conversely, naturality of $\theta$ at $v:A\to X$ gives ${\theta }_X(v)=F(v){\theta }_A(1_A)$. These two constructions are inverse, because $F(1_A)(a)=a$.

The bijection is natural in both variables. A natural transformation $\beta :F\to H$ sends the element $a$ to ${\beta }_A(a)$, matching postcomposition by $\beta$. For $u:A\to B$, precomposing with $Y(u)$ sends $\theta$ to a transformation from $Y(B)$ and its distinguished element is ${\theta }_B(u)=F(u)(a)$. This is exactly the required dependence on $A$.

Taking $F=Y(B)$ gives $\mathrm{Nat}(Y(A),Y(B))\cong \mathcal{C}(B,A)$. Consequently the covariant Yoneda embedding is full and faithful, with the reversal of arrows accounted for by its opposite category domain.

Suppose $G$ is a representable functor, with a natural isomorphism $\theta :\mathcal{C}(R,-)\to G$. Put $r={\theta }_R(1_R)$. For any $(A,a)$ in the comma category $(1\downarrow G)$, the representing bijection gives a unique $f:R\to A$ with ${\theta }_A(f)=a$. By naturality, ${\theta }_A(f)=G(f)(r)$, exactly the condition for $f:(R,r)\to (A,a)$. Hence $(R,r)$ is an initial object.

Conversely, if $(R,r)$ is an initial object, thenis a bijection for each $A$: existence and uniqueness are precisely initiality applied to every $(A,a)$. For $h:A\to B$, $G(h){\theta }_A(f)=G(hf)(r)={\theta }_B(hf)$, proving naturality. Thus $r$ is a universal element and $\theta$ is a representation of a functor. Being representable is equivalent to the singleton comma category having an initial object.

Define the forgetful functor $G^{\mathbb{T}}(A,a)=A$, acting as the identity on underlying morphisms. Define the free algebra functor byThe monad laws make ${\mu }_X$ an algebra for a monad structure, and naturality of $\mu$ makes $T(h)$ an monad algebra morphism.

For $(A,a)$, define the transpose mapsThe map $\Psi (k)$ is an monad algebra morphism, because naturality of $\mu$ and the algebra associativity law giveFor $k:X\to A$, naturality of $\eta$ gives $\Phi \Psi (k)=aT(k){\eta }_X=a{\eta }_{A}k=k$. Conversely, if $h$ is an monad algebra morphism, thenPrecomposing by a map into $X$ or postcomposing by an monad algebra morphism respects both formulas. Thus the bijection is natural and $F^{\mathbb{T}}⊣G^{\mathbb{T}}$. This is the free-forgetful Eilenberg-Moore adjunction.

Its adjunction unit is the given ${\eta }_X$; its adjunction counit at $(A,a)$ is the monad algebra morphism $a:(TA,{\mu }_A)\to (A,a)$. Hence $G^{\mathbb{T}}{F}^{\mathbb{T}}=T$, and the induced multiplication is the underlying counit at $(TX,{\mu }_X)$, namely ${\mu }_X$. Therefore this adjunction induces exactly the original monad, including its unit and multiplication of a monad.

For bounded weak compositions, start with the unrestricted stars and bars set $S$ and let $A_i$ be its subset where $n_i\ge a_i$. For an index subset $J\subseteq \{0,\dots ,r\}$, subtract $a_i$ from each coordinate with $i\in J$. This is a bijection from ${\bigcap }_{i\in J}{A}_i$ to nonnegative tuples summing toThuswhere a negative remaining sum gives zero, in accordance with the stipulated convention. Apply the avoidance form of the inclusion-exclusion principle:Expanding by subset size gives the alternating single-index, pair-index and higher-index sums. The empty subset supplies $\left(\genfrac{}{}{0ex}{}{N+r}{r}\right)$.

Use a stars and bars bijection. For a tuple, place $N$ stars in $r+1$ consecutive blocks of lengths $n_0,\dots ,n_r$, separated by $r$ bars. The bar positions form an $r$-element subset of $\{1,\dots ,N+r\}$. Explicitly,They satisfy $1\le b_1<\cdots <b_r\le N+r$. Conversely, such a subset determinesThese numbers are nonnegative and sum to $N$, proving that the two constructions are inverse. HenceZero-length blocks are permitted, so the bijection also covers $N=0$.

Use the parabola obstruction to countable line coverings. The curveis in bijection with the real line and hence is an uncountable set. A vertical line meets $\mathcal{P}$ in one point. A nonvertical line $y=ax+b$ meets it only where $t^2-at-b=0$, so it meets $\mathcal{P}$ in at most two points.

If countably many lines covered the plane, their intersections with $\mathcal{P}$ would cover $\mathcal{P}$. That would express $\mathcal{P}$ as a countable union of countable sets, indeed of sets with at most two elements, contradicting its uncountability. Therefore no countable collection of lines covers the plane.

For the cardinality of integer-periodic function spaces, fix a positive period $n$ first. A periodic function $\mathbb{Z}\to \mathbb{Z}$ with that period is completely and uniquely determined by its $n$ values at $0,\dots ,n-1$, so this class is in bijection with ${\mathbb{Z}}^n$. The integers are a countable set, and repeated pairing shows that a finite Cartesian product of countable sets is countable. Taking the union over positive $n$ and using the countable union of countable sets proves that the integer-domain periodic functions form a countable set.

For the rational domain, even period one leaves infinitely many independent choices. Let $q_k=1/(k+2)$ for $k\in {\mathbb{N}}_0$; these are distinct members of $\mathbb{Q}\cap [0,1)$. For every subset $A\subseteq {\mathbb{N}}_0$, defineThe fractional part is unchanged by adding one, so $f_A$ is an integer-valued periodic function on $\mathbb{Q}$. Distinct subsets give distinct functions because $f_A(q_k)$ records whether $k\in A$. Thus the uncountable power set of ${\mathbb{N}}_0$ injects into these functions. The rational-domain periodic functions form an uncountable set. The difference is that $\mathbb{Z}$ has only finitely many residue classes modulo a fixed integer period, whereas $\mathbb{Q}$ has infinitely many.