Start with all of and , namely , whose sum is . For in order, append copies of the triple
This uses all occurrences of and all occurrences of , exactly once. Together with the initial terms, every original occurrence is used, establishing a rearrangement of a series. Its beginning is
Each triple has sum zero. At its intermediate terms the partial sum is at most above . This bound tends to zero, so the whole series, rather than just the subsequence of sums at completed triples, has sum .
Place the single term in first. For in order, append copies of the pair
This uses all of and all of exactly once, so it is an explicit rearrangement of a series. Its beginning is
Every completed pair leaves the partial sum at . Within a level- pair the partial sum differs from by at most . As this tends to zero, proving that the rearranged series has sum .
In level , each group is
and there are such groups. The partial sums at completed groups are therefore zero. Inside a group of level , the only other partial sums are and . Every level contains finitely many terms, so the level containing the th term tends to infinity with . Thus all partial sums lie between zero and a bound tending to zero. By the squeeze theorem, the series has sum .
For the next two parts, label the positive occurrences of size by and the negative occurrences of size by . There are exactly occurrences in and in . Occurrences with equal value retain separate labels, so checking their counts verifies a bijection of terms.
Let . By the definition of Cauchy sequence, choose an integer such that whenever . Apply the given inequality with . It supplies for which
Both and are in the Cauchy sequence estimate, so
For every the triangle inequality gives
This is the definition of convergence to zero: . The proof uses only the Cauchy sequence estimate, positivity, and the stipulated inequality; it does not assume the general completeness of the real numbers theorem for Cauchy sequences. Taking also avoids the empty initial set in a literal reading of the condition for very small .
If , set . The definition of limit of a sequence gives for all sufficiently large , contradicting . Hence .
Factor the difference of cubes. Since both cube roots are at least one,
Given , the definition of limit of a sequence supplies with for . The displayed inequality then gives , proving directly that .
False. Take the finite sets . Their suprema are both , whereas the set of pairwise products is . Consequently
Negative factors can reverse an inequality, which prevents the proposed argument with separate suprema.
True. Write and . Every , satisfies , giving an upper bound for the set of pairwise differences. For every , the definitions of supremum and infimum give and with
Then . Hence no smaller upper bound works, and
Here means pairwise subtraction, rather than set difference.
True. Put , and . These suprema exist by completeness of the real numbers, since the sets are nonempty and bounded. Every set element of the union is at most , so is an upper bound. Conversely, every upper bound of bounds both and , and is therefore at least both suprema. Thus
For a nonabelian group, iv and iii imply . Substituting into i yields
The constant is sharp: the quaternion group has eight elements and the five conjugacy classes , , , , . To verify this directly, are central elements, conjugation by sends to , and similarly for ; its relations and , , show that conjugating by any of changes only its sign. Hence .
A conjugacy class is a singleton exactly when for every , equivalently when for every . Thus the singleton conjugacy classes correspond exactly to elements of the center of a group , and there are of them.
Every other conjugacy class has at least two elements. Since the conjugacy classes form a partition of a set , if is the number of these remaining classes then . Consequently
This conjugacy class count bound from the center needs no classification of the finite group.
If is not Abelian, the contrapositive of ii says that is not a cyclic group. The quotient group is finite because is finite. By iii, every group with fewer than four elements is a cyclic group. Hence
Equivalently, the center of a group satisfies , by the coset count in iii.
A smallest example is the Klein four-group
with coordinatewise addition modulo . Every nonidentity element has order of a group element , so none generates all four elements; hence this group is not a cyclic group.
A group of group order is a cyclic group. A group of group order or is also a cyclic group: choose a nonidentity element; by Lagrange's theorem, its order of a group element is a nontrivial divisor of that prime number, so equals the whole group order. Thus no smaller example exists, and the smallest possible group order is .
Suppose the quotient group is a cyclic group, generated by . For any , there are integers and such that
Since lie in the center of a group, they commute with every element, in particular with each other and with the integer powers of a group element . Therefore
As were arbitrary, is an abelian group. This is the cyclic quotient by the center.
The specified set is the center of a group . It contains . If and , then
so . From , multiplying on the left and right by gives , so . Hence is a subgroup.
For and , the defining commutativity gives . Thus the image of each element of under conjugation is in , and indeed . Consequently is a normal subgroup of .
The orbit of under conjugation is its conjugacy class
It contains by using , so the conjugacy classes cover . If , then , and the group action identity shows that conjugating either element further gives the same orbit; hence . If and intersect at , this gives . Thus distinct conjugacy classes are disjoint and the conjugacy classes form a partition of a set .
Write . If is the identity element of , then . Also, for ,
The middle equality uses associativity and the inverse element rule . Thus this is a left group action, the conjugation action of on itself.
Suppose there were only finitely many prime numbers. There is at least one, namely , so this finite set would have a largest element . The integer is greater than and therefore has a prime factor : for example, its least divisor greater than must be a prime number, since any proper factor of that divisor would contradict minimality.
By ii, , contradicting the choice of . Therefore there are infinitely many prime numbers, proving Euclid's theorem by orders of group elements in finite multiplicative groups.
The multiplicative group of a finite field has group order : its elements are exactly the nonzero residue classes. For any prime factor of , i and Lagrange's theorem therefore imply
Since and are positive integers, , and hence
This applies to every prime factor, including repeated prime factors viewed as the same prime number.
If the prime number divides , then , because is odd. Thus the residue of is an element of the multiplicative group of a finite field , and .
Let be its order of a group element. The integer division writes with . Then , so minimality of gives . Hence divides . Since is a prime number, or . The former would give , which would mean divides , an impossibility. Consequently
If , choose ordinary addition on , giving the additive group of integers. Every power function is the unique identity function on the singleton , so the group action axioms hold:
Thus ordinary addition supplies the required group operation on . Together with ii, existence is equivalent to being the trivial group.

There are unlisted articles, also show them or only show them.