Math 360, Fall 2021, Assignment 4
From cartan.math.umb.edu
Revision as of 20:52, 1 October 2021 by Steven.Jackson (talk | contribs) (Created page with "__NOTOC__ ''Mathematicians are like Frenchmen: whatever you say to them they translate into their own language, and forthwith it is something entirely different.'' : - Goethe...")
Mathematicians are like Frenchmen: whatever you say to them they translate into their own language, and forthwith it is something entirely different.
- - Goethe
Read:
- Section 4.
Carefully define the following terms, then give one example and one non-example of each:
- $(\mathrm{Fun}(S,S))$.
- $f\circ g$ (the composition of the functions $f$ and $g$).
- $\iota$ (the identity function from a set $S$ to itself).
- $\mathbb{Z}_n$.
- $+_n$ (addition modulo $n$).
- $\cdot_n$ (multiplication modulo $n$).
- Semigroup.
- Monoid.
- Inverse (of an element of a monoid).
- Group.
- Abelian (group).
Carefully state the following theorems (you do not need to prove them):
- Theorem regarding associativity of composition.
- Theorem asserting that $+_n$ is well-defined.
Solve the following problems:
- Section 4, problems 1, 3, 5, 11, 12, 13, 14, 18, and 19.
- Give an example of (a) a binary structure which is not a semigroup, (b) a semigroup which is not a monoid, (c) a monoid which is not a group, and (d) a group which is not abelian.
- By making an operation table, determine which elements of the commutative monoid $(\mathbb{Z}_5,\cdot_5)$ have inverses. Then do the same for $(\mathbb{Z}_6,\cdot_6)$ and $(\mathbb{Z}_8,\cdot_8)$.
- Based on the results of the previous problem, try to make a conjecture regarding which elements of $(\mathbb{Z}_n,\cdot_n)$ have inverses.
- Carefully show that the operation $\cdot_n$ is well-defined (i.e. state and prove a theorem analogous to the theorem asserting that $+_n$ is well-defined).