Tour:Interdisciplinary problems two (beginners)
This page is a Interdisciplinary problems page, part of the Groupprops guided tour for beginners (Jump to beginning of tour)
PREVIOUS: Examples peek two (beginners)| UP: Introduction two | NEXT: Inquiry problems two (beginners)
NEXT SECTION Interdisciplinary problems: Interdisciplinary problems three
General instructions for the tour | Pedagogical notes for the tour | Pedagogical notes for this part
The problems here relate ideas in group theory to ideas in other subjects. Learners who already have some experience with the other subjects may try these problems to cement their understanding of what has been learned in parts one and two of the tour.
Contents
Topology
A topological group is a set with a topology as well as a group structure, so that the inverse map is continuous with respect to the topology, and the multiplication map is continuous as a map from to .
We'll need to remember the following facts about topological groups:
- For a topological group and an element , the left multiplication by , given by , is a homeomorphism. It sends open subsets to open subsets and closed subsets to closed subsets. Similarly, right multiplication by is a homeomorphism.
- An arbitrary union of open subsets of a topological space is open.
- A finite intersection of open subsets of a topological space is open.
- The subset of a topological space is closed if and only if its complement is open.
- Prove that if is an open subset of a topological group , then so is for any .
- Prove that if are subsets of , and either or is open, then is open.
- Prove that if are subsets of , with closed and finite, then is closed.
- (For those who know product topology) Prove that if is a nonempty open subset of , there exist nonempty open subsets of such that .
- A topological group can also be defined as a set with a group structure and topology, such that the map is continuous as a map from with the product topology, to . Prove that this is equivalent to the usual definition of topological group.
Category theory
In most of the problems below, the key is to translate the statements from category theory. Most of the problems here have already been solved either in the results presented in the part, or in the mind's eye test problems.
The collections of groups, monoids etc. as categories
The questions mentioned here use only the object structure of the categories and do not refer to the morphisms.
- Consider the functor from the category of groups to the category of monoids, that sends a group to its underlying monoid (forgetting the inverse map). Prove that this functor is injective on objects. In other words, two different groups cannot be mapped to the same monoid.
- Consider the functor from the category of monoids to the category of semigroups, that sends a monoid to its underlying semigroup. Prove that this functor is injective on objects. In other words, two different monoids cannot be mapped to the same semigroup.
- Consider the functor from the category of semigroups to the category of magmas, that sends a semigroup to its underlying magma. Prove that this functor is injective on objects.
The collection of groups, monoids etc. as categories with inclusion maps as the morphisms
- Consider the category whose objects are groups, with the morphisms being the inclusion map of a subgroup in a group. Prove that this is a category, with composition of morphisms being composition of subgroup inclusions.
- Consider a functor from this category to the category whose objects are monoids, with the morphisms being inclusion maps of a submonoid in a monoid. Prove that this functor is full, faithful and injective.
- Consider a functor from the category of monoids with inclusion maps of submonoids, to the category of semigroups with inclusion maps of subsemigroups. Prove that the functor is faithful, but not full.
- Consider the functor from the category of semigroups, with inclusion maps of subsemigroups, to the category of magmas, with inclusion maps of submagmas. Prove that the functor is full, faithful and injective.
- Consider the composition functor from the category of groups with inclusion maps of subgroups to the category of magmas with inclusion maps of submagmas. Prove that the functor is full, faithful and injective.
Groups and monoids as morphisms
- Prove that the morphisms from an object to itself in any (locally small) category form a monoid under composition.
- Prove that the invertible morphisms from an object to itself in any (locally small) category form a group under composition. (this group is termed the automorphism group of the object).
- Prove that there is a one-to-one correspondence between monoids and categories with one object.
- An initial object in a category is an object with the property that there is a unique morphism from it to any object. Prove that the automorphism group of the initial object in any category is the trivial group.
- A terminal object in a category is an object with the property that there is a unique morphism to it from any object. Prove that the automorphism group of the terminal object in any category is the trivial group.
Measure theory
A left-invariant measure on a group is a measure with the property that for any , the map is a measure-preserving transformation. In other words, for any measurable subset of , is measurable and .
In the exercises, we shall assume that is a group with left-invariant measure .
- Prove that if is a finite or countable subset of , and is a measurable subset, then is measurable, and .
- Prove that it is not necessarily true, for measurable subsets of , that .
Combinatorics
Sidon subsets
- A subset of an abelian group is termed a Sidon subset if we cannot find distinct such that . Prove that if is a Sidon subset of , and is a subset of , then is also a Sidon subset of .
- Prove that if is a subgroup of an Abelian group , and is a Sidon subset of , then is a Sidon subset of .
- Prove that any Sidon subset of an abelian group of order is contained in a Sidon subset of of size at least .
- Prove that if is an abelian group of order , and is a Sidon subset of size , then . Using this, show that .
- For any subset of an abelian group , define as the set (this is the additive notation equivalent for what we'd call in multiplicative notation). Prove that if is a Sidon subset of , so is for any .
- A maximal Sidon subset in an abelian group is a Sidon subset that is not properly contained in any bigger Sidon subset. Prove that a maximal Sidon subset of an abelian group cannot be contained in any proper subgroup.
Sidon subsets in other structures
- NEEDS LOT OF THOUGHT (be careful about non-commutativity while solving this): Call a subset of a group (now, not necessarily Abelian) a Sidon subset if we cannot find distinct , such that . Explore: Is it still true that any Sidon subset of the group of order is contained in a Sidon subset of size at least ? If not, does there exist a modification of that works? Explore: Is it still true that if has order , and is a Sidon subset of size , then ? If not, does there exist a modification of this that works?
- (For those who remember quasigroups) Define a Sidon subset in a commutative quasigroup, and prove that the bounds of problems (3) and (4) from the previous section continue to work for commutative quasigroups.
Fibonacci sequences
- A Fibonacci sequence in an Abelian group is defined as follows. and are defined as arbitrary elements of , and is defined inductively as . Prove that if is a nontrivial finite Abelian group of order , any Fibonacci sequence in is periodic, and that the period is at most .
- The set of sequences in an Abelian group can itself be viewed as an Abelian group, where the term of the sum of two sequences, is defined as the sum of the terms. Describe explicitly the identity element, additive inverses, and sums in this group. Prove that the Fibonacci sequences form a subgroup of this group. Find the size of the subgroup comprising Fibonacci sequences for a finite Abelian group of size
The combinatorics of algebraic structures
Number of structures
(Note: For those familiar with the notion of isomorphism, the problems below do not ask for the number of structures upto isomorphism, rather, they ask for the total number of structures possible).
- Suppose is a finite set of cardinality . Find the number of binary operations , i.e., the number of possible magma structures on .
- Find the number of commutative magma structures on , i.e., find the number of commutative binary operations on .
- Find the number of commutative unital magma structures on , i.e., find the number of commutative binary operations with a two-sided neutral element.
The combinatorics of associativity
- Write all the possible ways of parenthesizing the expression (there are five possible ways). Make a graph where two ways of parenthesization are connected by an edge if we can reach from one to the other by a single application of the associativity law. Prove that the graph obtained is cyclic, i.e., it is a pentagon.
- Find an expression for the number of ways of parenthesizing the expression (this number is often termed a Catalan number).
The combinatorics of quasigroups
- Prove that if is a finite commutative quasigroup with an odd number of elements, then every element of can be uniquely expressed as a square.
Universal algebra
A variety of algebras is described by an operator domain, that specifies a list of -ary operations for varying values of , and a collection of universal identities that these operations need to satisfy. For instance, the variety of groups is described by an operator domain with three operations: the 0-ary operation that yields the identity element, the unary operation for the inverse map, and the binary operation for the multiplication. There are three universal laws these operations must satisfy: associativity, the identity element property, and the inverse property.
- Prove that if is a variety of algebras, is an algebra in , and is a subalgebra of (in the sense that is closed under all the operations of ), then is also in (you need to argue that all the universal identities true in continue to be true in ).
- Consider the following variety of algebras. There is only one binary operation , satisfying the following conditions (with all variables universally quantified):
- .
Prove that any group is a member of this variety of algebras, where . Conversely, prove that any member of this variety of algebras that is a nonempty set can be given a group structure in a unique way.
- Add a constant operation to the above variety of algebras to make it correspond precisely with the variety of groups. (Essentially, declare a constant such that for all ).
This page is a Interdisciplinary problems page, part of the Groupprops guided tour for beginners (Jump to beginning of tour)
PREVIOUS: Examples peek two (beginners)| UP: Introduction two | NEXT: Inquiry problems two (beginners)
PREVIOUS SECTION Interdisciplinary problems: Interdisciplinary problems one|NEXT SECTION Interdisciplinary problems: Interdisciplinary problems three
General instructions for the tour | Pedagogical notes for the tour | Pedagogical notes for this part