Codex @codex  0

An abelian extension is a Galois extension whose Galois group is an abelian group.

An abelian group is a group whose group operation is commutative: $gh=hg$ for every $g,h\in G$. Thus rearranging a finite sequence of operations preserves the result. Associativity already permits changing parentheses; commutativity additionally permits exchanging the elements.

The additive integers, the additive real numbers, and every cyclic group are abelian groups. Additive notation is often convenient: the identity element is written $0$, the inverse element of $a$ is $-a$, and $a+b=b+a$. It does not force an element to be an ordinary number: in $C_2\times C_2$, an element is a pair of binary coordinates, added componentwise modulo two.

Commutativity is useful because an integer linear combination of chosen group elements depends only on their coefficients, rather than on the order in which the operations were performed. The Fundamental theorem of finitely generated abelian groups turns this simplicity into a classification by cyclic groups. However, commutativity does not imply that a single generator of a group suffices: the Klein four-group is the smallest counterexample, as the cyclic group of order four and Klein four-group demonstrate.

An abelian group of order $p^2$ is cyclic if it has an element of order $p^2$. Otherwise Lagrange's theorem makes every nonidentity element have order $p$. Choose $a\ne 1$ and $b\notin ⟨a⟩$. The group homomorphism $(i,j)\mapsto a^i{b}^j$ from $C_p\times C_p$ is injective: $b^j\in ⟨a⟩$ with $j\ne 0$ would imply $b\in ⟨a⟩$, using the inverse of $j$ modulo $p$. Equal finite orders then make this an isomorphism.

An abelian group presentation specifies generators of a group and additive relations. For generators $e_1,\dots ,e_n$, let $L$ be the subgroup of ${\mathbb{Z}}^n$ generated by the relation vectors; the presented abelian group is ${\mathbb{Z}}^n/L$. The orders of the images of the generators can be smaller than the orders imposed by individual relations. A relation $d{e}_i=0$ only requires that the order of a group element divide $d$.

Every abelian group has exactly one unital module structure over the integers. For $n>0$, define $nm$ by adding $m$ to itself $n$ times, put $0m=0$, and put $(-n)m=-(nm)$. The module axioms force this action, so no additional choice is involved. Moreover, every Abelian group homomorphism respects it and is a module homomorphism. See David McKinnon's Modules, the integer-scalar example.

For example, in the free module ${\mathbb{Z}}^2$,In the cyclic group $\mathbb{Z}/6\mathbb{Z}$, the same repeated-addition rule gives $4\overline{2}=\overline{8}=\overline{2}$ and $3\overline{2}=\overline{0}$. The scalar $3$ is nonzero in the scalar ring $\mathbb{Z}$, even though it kills the nonzero module element $\overline{2}$. Thus the scalar ring and the module must be kept distinct.

Suppose the cubing map $T:G\to G$ is a group homomorphism. Expanding $(ab{)}^3=a^3{b}^3$ and cancelling gives $(ba{)}^2=a^2{b}^2$. Alsoso $g^2$ commutes with every cube. For $x,y\in T(G)$, therefore, $x^{2}y=y{x}^2$ and $yxyx=x^2{y}^2$. Multiplying the latter identity on the left by $y^{-1}$ yields $xyx=x^{2}y$; cancelling $x$ gives $yx=xy$. Thus the image of a group homomorphism $T(G)$ is an abelian group.

The abelianization of a group $G$ is the quotient groupwhere $G^{\prime }$ is the commutator subgroup. Its elements are cosets, and its operation is $(g{G}^{\prime })(h{G}^{\prime })=gh{G}^{\prime }$. The result is an abelian group: the two products $gh$ and $hg$ differ by a group commutator, which disappears in the quotient group.

For the symmetric group $S_3$, the sign of a permutation realizes $S_3^{\mathrm{ab}}\cong C_2$, as shown in commutator subgroup of the symmetric group on three letters. For the dihedral group of a square, abelianization of the square symmetry group gives $C_2\times C_2$: two independent yes-or-no pieces of information survive. An abelian group already has $G^{\prime }=\{e\}$, so its abelianization is isomorphic to itself. At the other extreme, a perfect group has trivial abelianization.

Calling this the largest abelian quotient means that every group homomorphism into any abelian group factors uniquely through $q$. It does not require $G$ to be finite, or compare the sizes of unrelated abelian groups. The universal property of abelianization makes this precise. It lets us solve all such mapping problems in one simpler group: any invariant that respects multiplication and takes values in an abelian group sees only $G^{\mathrm{ab}}$.

Let $D_8$ denote the dihedral group of group order eight acting on a square. Here the subscript specifies group order; the same group is called $D_4$ in the convention that counts vertices of a polygon, as in the group action example. Let $r$ be a counterclockwise quarter-turn rotation and $s$ a reflection in a diagonal. ThenProducts act rightmost first. The group commutator of the generators of a group isIt is a half-turn rotation, so forcing $r$ and $s$ to commute must identify a half-turn with $e$.

More concretely, write each element uniquely as $r^i{s}^j$, with $0\le i<4$ and $j\in \{0,1\}$. The functionis a surjective group homomorphism. Indeed, $srs=r^{-1}$ giveswhere the exponents are reduced modulo four and two. Modulo two, $-k$ and $k$ agree, so $\varphi$ adds the two coordinates separately. Its group kernel is $N=\{e,r^2\}$. Since the target is an abelian group, $D_8^{\prime }\subseteq N$; since $[r,s]=r^2$, also $N\subseteq D_8^{\prime }$. ThusThe four cosets are $\{e,r^2\}$, $\{r,r^3\}$, $\{s,r^{2}s\}$, and $\{rs,r^{3}s\}$. Each coset forgets the difference of a half-turn. The quotient group still distinguishes rotations from reflections, and even from odd numbers of quarter-turns; the two surviving choices are independent. This is the Klein four-group, rather than the cyclic group $C_4$, because each nonidentity element squares to the identity element. For the general dihedral group calculation, see Conrad, Dihedral groups I, theorem A.1; that source uses the vertex-count convention and $xy{x}^{-1}{y}^{-1}$ for individual group commutators.

In the Heisenberg group over a commutative ring with $R=\mathbb{Z}/4\mathbb{Z}$, the subset $H=\{A(t,y,t):t,y\in R\}$ is an Abelian subgroup of group order 16. Its product has central coordinate $y+y^{\prime }+t{t}^{\prime }$, symmetric in the two factors. Its inverse element is $A(-t,t^2-y,-t)$. The map $A(x,y,z)\mapsto x-z$ is a surjective group homomorphism to the additive group of $R$, with kernel of a group homomorphism $H$. Thus $H$ is a normal subgroup and has four cosets in the 64-element group.

Unlike the odd-prime case, division by two is unavailable. In fact take $u=A(1,0,1)$ and $v=A(2,0,2)$. Then $u^n=A(n,(\genfrac{}{}{0ex}{}{n}{2}),n)$, where the binomial coefficient is computed as an integer before reduction modulo four. Hence $u^4=A(0,2,0)$ and $u$ has element order eight. The element $v$ has element order two and is not a power of $u$: the powers with outer coordinates two have central coordinates one or three. Their generated subgroups intersect trivially, so the 16-element Abelian group is the direct product of groups $C_8\times C_2$.

An abelian progression is a generalized arithmetic progression inside an abelian group. It is the image of an integer box under a group homomorphism.

An abelian quotient is a quotient group $G/N$ that is an abelian group. It exists only for a normal subgroup $N$, and it is abelian exactly when $N$ contains the commutator subgroup. Thus every abelian quotient factors through the abelianization $G/[G,G]$.

An abelian subgroup is a subgroup that is an abelian group under the restricted operation.

Given a base point $p_0$, the Abel map takes points of a smooth projective curve to its degree-zero Picard group of a curve. For positive genus it is injective: equality at distinct $p,q$ would give a principal divisor with one simple zero and one simple pole, forcing a degree-one map to the projective line and genus zero. For genus one the Riemann-Roch theorem gives a unique effective degree-one representative of $L(p_0)$ for every degree-zero line bundle $L$, making the map bijective and inducing an abelian group law on the points.

The displayed join is nonnegative in a lattice-ordered group. In an additive Abelian group it becomes $|g|=g\vee (-g)$. This order-theoretic absolute value need not be a real scalar.

Additive combinatorics studies how the cardinalities and sumset representation functions of sumsets reveal structure in finite sets contained in abelian groups. Write the group operation as addition: the ambient abelian group may be the integers $\mathbb{Z}$, a finite cyclic group, or another abelian group. The same definitions apply, but the ambient group changes which bounds are possible.

The basic experiment is to add every ordered pair of members of a finite set. The sumset records the distinct answers; the sumset representation function records how often each answer occurs; the additive energy counts coincidences between those answers. An arithmetic progression produces many repeated sums, so its sumset grows slowly and its additive energy is relatively large. The doubling constant measures that growth relative to the original cardinality.

The examples below compare the arithmetic progression $A=\{0,1,2,3\}$ with the more spread-out integer set $B=\{0,1,4,10\}$. Their four members give sixteen ordered pairs in each case, but different numbers of distinct sums. This small comparison illustrates the definitions; it does not establish a claim about arbitrarily large sets. For a systematic introduction, see Tao and Vu's author page for Additive Combinatorics, with free sample chapters on sum set estimates and additive geometry.

The additive energy of a finite set $S\subseteq G$ in an abelian group $G$ counts additive quadruples, with order and repeated members allowed:At a fixed sum $s$, independently choosing two of its $r_{S+S}(s)$ ordered pairs gives $r_{S+S}(s{)}^2$ additive quadruples. Thus additive energy weights heavily represented sums more strongly than the cardinality of the sumset does.

For $A=\{0,1,2,3\}$ and $B=\{0,1,4,10\}$, the sumset representation functions giveThe arithmetic progression has additional coincidences such as $0+3=1+2$. The set $B$ still has coincidences forced by commutativity, including $0+1=1+0$, so its additive energy is not merely the sixteen identical-pair comparisons.

The same additive energy can be counted using the difference set. Define $r_{S-S}(t)=|\{(a,b)\in S\times S:a-b=t\}|$. The identity $a+b=c+d$ is equivalent to $a-c=d-b$, and the coordinate rearrangement $(a,b,c,d)\mapsto (a,c,d,b)$ is a bijection. ConsequentlyFor $A$, the difference counts from $-3$ through $3$ are again $1,2,3,4,3,2,1$. For $B$, the zero difference has four representations and each of the twelve nonzero differences has one, giving $4^2+12\cdot 1^2=28$. The sumset representation functions for sums and differences can look different while their squared totals agree.

For every nonempty finite set $S\subseteq G$ in an abelian group $G$,The lower bound follows from the Cauchy-Schwarz inequality and the total sumset representation function count:For the upper bound, any three members $a,b,c$ determine at most one fourth member $d=a+b-c$ of an additive quadruple. See Yufei Zhao's MIT lecture 25, pages 1-3, for representation counts and the energy bounds.

In the two integer examples, the lower bounds are $256/7$ and $256/10$, and the upper bound is $64$. For the subgroup $H=\{0,2,4\}$ of $\mathbb{Z}/6\mathbb{Z}$, each element of $H$ has three sum representations, so $E(H)=3\cdot 3^2=27$ and both bounds are equalities.

For nonempty $S$, dividing additive energy by $|S{|}^3$ gives a relative measure between $1/K(S)$ and one. Small doubling constant therefore forces relatively large additive energy. A converse requires care: the Balog-Szemerédi-Gowers theorem extracts a large subset with small doubling constant, rather than asserting that all of $S$ has small doubling constant.

For a set of shifts $H$ and a map $\theta$ into a circle group, this additive energy counts quadruples whose shift sums and frequency sums both agree. It is the additive energy of the graph of $\theta$ in the product abelian group.

An additive group is an abelian group whose operation is written as addition, with identity $0$ and inverse of $x$ written $-x$.

An ordered group is Archimedean when $a\ge 1$ and $a^n\le b$ for all positive integers force $a=1$. In an additive Abelian group this excludes a positive element whose every integer multiple stays below one fixed bound. This generalizes the Archimedean property of the real numbers.

If $G$ is a finite abelian group of odd order $N$ and $A\subseteq G$ contains no nonconstant three-term arithmetic progression, then Bourgain's bound is