### 1. Representations

Motivation:

Anticipating the end goal of this study, understanding of mod p linear representations of Galois groups, the abstract concept of representation is a good place to start. Counting is shown to be an instance of set representation.

The definition of representation depends on the usual definitions for set, function, 1-1 correspondence, and morphism. Morphism is an abstract term for correspondence between sets that preserves structure. A representation is a morphism between an abstract object about whose structure we want to learn, and a model object whose structure is well-understood.

In the notation of representations, states that model object with well-known structure represents abstract object via a morphism (arrow). Thus, a representation has three components, two objects and a morphism. Facts regarding the abstract structure can now be inferred from the model structure. These structural facts are considered to be the common form of the objects.

Counting is the most natural example of a representation, a 1-1 function (bijection) between an abstract object to be counted, set with elements, and the model object , the set of natural numbers with the same number of elements (cardinality) (where one uses to enclose the elements in a set). The preserved structure under the 1-1 counting morphism is the cardinality of the represented set.

One may indicate by that the natural numbers represent (count) a set with elements, .

### 1.1. Supplement: Morphisms in Specific Contexts

Morphism is a term suited to this abstracted discussion in Fearless. But more specific object-related terminology is generally used, as in the following concrete realizations of morphism. If the object is a set, a morphism is simply a function that preserves structure, e.g. a function on an ordered set that preserves order. If the object is a group or vector space, morphisms are called transformations or homomorphisms. For example, a linear transformation on a vector space preserves vector addition and scalar multiplication. The homomorphisms on Euclidean space, preserving both distance and a given point, form the group of orthogonal transformations of space. A homomorphism that establishes a 1-1 correspondence between all the elements in the source and target sets (that maps the source onto the target) is called an isomorphism. Only within discussions of the abstract object called a category is the naked term morphism likely to be encountered. All morphisms are associative.

### 2. Groups

Motivation:

Sets with group structure are the most common mathematical objects for formalizing the concept of symmetry. In the remainder, the objects under discussion most often will be groups.

A couple of definitions lead off this discussion. When and are sets, one writes a direct product to mean the larger set formed from all possible pairs of elements, taking one from and one from . A binary operator is associative if .

A set forms a group under the following conditions:

an associative binary composition operator }

an identity element , where for each element in

inverse elements for each element , where

commutative group operator (optional), if for all elements

, the Lie (continuous) group of rotations of a sphere, is a non-commutative group. This is a group of morphisms (rotations of the sphere). One means by the group operation on two rotations, , that is done first, then .

, the integers under addition, is a discrete commutative group.

### 2.1. Supplement: Basic Notions of Groups

A typical notation for the composition operator is: for non-commutative groups; + for commutative (Abelian) groups. Often one just writes , rather than , which can be referred to generically as ‘multiplication’. One says the group is closed under the group operator because it maps pairs of elements of back into .

The order of a finite group , is the cardinality of the set . For every element in finite group , there is some power of , say , that is the least positive integer such that . Each element thus defines a cycle, and is the order (or period) of element .

A cyclic group consists of the identity and one cyclic element: . One says is generated by , and . A cyclic group is Abelian. For every finite group containing element , is a factor of . A group with prime is necessarily cyclic, and has no proper subgroups.

Group structures may be identified by their element cycles as follows, where is the identity, are abstract elements, and is a cyclic group of order . The direct products of cyclic groups below is a shorthand notation. For example, the Klein vierergruppe (four group or quadratic group), written , is a way of writing the 4-element group obtained by . Similarly, the other direct product representations above can be expanded.

The 14 canonical forms of the groups of order 8 or less are:

Abelian:

Non-Abelian:

the dihedral group of order 6, (aka

the dihedral group of order 8,

the dicyclic quaternion group of order 8,

If is a subset of group , is called a subgroup of if is closed under the group operator of . A subgroup contains the parent group identity element and all of its own inverse elements. itself, and the group consisting only of , are the improper subgroups of . All other subgroups are called proper.

Let be a group and a subgroup, and an element in . The left coset of in determined by is defined as , and the right coset of in determined by is , where is called the representative of each coset. , the coset space of in , is the set of left cosets (or right cosets) of . All the cosets of have the same cardinality as . The index of in , is the number of left cosets (or right cosets) of , the cardinality of . Lagrange proved for finite that , and ( means divides).

A subgroup of is said to be normal (invariant), written , if for all in . If is Abelian, every subgroup is normal. Given a normal subgroup, the coset space is a subgroup called the quotient group of by . The identity of is . For example, if and , the cosets of are the even and odd integers. The quotient group , read the integers mod the even integers, is a group with two elements, isomorphic to using addition [see Chapt. 4, Modular Arithmetic].

Given groups and , a group homomorphism, is structure-preserving, meaning . Define the kernel of f:

and the image of f:

where means such that and means contained in. Then is a subgroup of , is a subgroup of , , every normal subgroup of is the kernel of some group homomorphism on , and ( means is isomorphic to).

### 3. Permutations

Motivation: A goal of ANT is to formalize information regarding solutions to polynomial equations with integer coefficients. Galois permutation groups permute the roots of polynomials, a useful tool. This chapter defines properties of permutations, and the representation of abstract groups by their corresponding permutation groups.

Given a finite abstract group (or any finite set) with elements, the group of permutations of the elements of (bijections : ) forms a group called the symmetric group of degree (called or ). In particular, when , the symmetric group is written . Because permutations are bijections, they have inverses that undo the corresponding permutation.

A permutation has one or more cycles, where each cycle’s elements map in sequence until an element repeats. One expresses a permutation’s cycle decomposition by grouping in parentheses the elements in each cycle. E.g., given set , the permutation

has a single cycle where takes to , to , to , back to . Similarly,

has two cycles , called transpositions, where takes to , back to , to , back to .

has three cycles .

has four cycles , the identity permutation. The lengths of the cycles of a permutation reveal useful information about the permutation.

### 3.1. Supplement: Basic Notions of Permutations and Symmetry Groups

Disjoint permutation cycles commute. Every element of (permutation) can be written uniquely as the product of disjoint cycles of length greater than 1, and can be written as a product of transpositions (not uniquely, the transpositions are not disjoint). A permutation is even or odd depending on whether it can be written as a product of an even or odd number of transpositions.

One can consider each element of as a permutation function acting through the group operator. Let be all the elements of and be one of these elements also. Then is a permutation of all elements of via multiplication by . The set of permutations so defined form a group isomorphic to , say called the regular representation of . If G is non-Abelian, one would distinguish right and left regular representations. Cayley showed that any group is isomorphic to a subgroup of . In particular, the regular representation is a subgroup of . In our representation notation, .

The set of even permutations is a normal subgroup of , called the alternating group , where . For , is generated by the 3-cycles in .

, , and the regular representation of are large and not of much mathematical interest. A smaller permutation representation of is obtained by considering for subgroup of group . is a group homomorphism and is the largest normal subgroup of contained in .

Consider symmetries of triangles of varying regularity together with their symmetry groups. Each type of triangle symmetry has a corresponding representation group consisting of motions in the plane (transformations) that map the triangle onto itself (that preserve the form of the triangle). consists only of the identity transformation. consists of the identity and a reflection about the axis of symmetry. consists of identity, two rotations about the center, and three reflections. Thus, the respective symmetry groups have 1, 2, and 6 elements, in order of increasing object symmetry. The group is the dihedral group of order 6 above, , and is a special case of a regular -sided polygon whose transformation group is the dihedral group of order . is isomorphic to , the symmetry group with , representing abstract groups of order 3. Such transformation groups of regular polygons are subgroups of , where , the Cartesian plane.

Proceed to Modular Arithmetic, Complex Numbers, Equations and Varieties