Section I.4.1

Sets with algebraic operations

[4/0%]
Show
LaTeX
Problem I.4.1.1

In item 2, as an example on Z\mathbb {Z}, the operation ∗:n∗m=−n−m*: n * m=-n-m was introduced, which is commutative but not associative. In the algebraic structure (Z,∗)(\mathbb {Z}, *) the relations (n∗m)∗m=n,m∗(m∗n)=n(n * m) * m=n, m *(m * n)=n hold. Suppose now we are given an arbitrary algebraic structure (X,∗)(X, *), in which (x∗y)∗y=x,y∗(y∗x)=x(x * y) * y=x, y *(y * x)=x for all x,y∈Xx, y \in X. Prove that x∗y=y∗xx * y=y * x, i.e., that the operation * is commutative.

?
Remark.
?

No hints for the solution are given, since this is one of the most useless exercises in the book. But nevertheless!

Problem I.4.1.2

Show that the set

Mn0(R)={A=(aij)∈Mn(R)∣∑j=1naij=0,i=1,2,…,n} M_{n}^{0}(\mathbb {R})=\left\{ A=\left(a_{i j}\right) \in M_{n}(\mathbb {R}) \mid \sum _{j=1}^{n} a_{i j}=0, \quad i=1,2, \ldots , n\right\}

with the usual operation of matrix multiplication is a semigroup. Is (Mn0(R),⋅)\left(M_{n}^{0}(\mathbb {R}), \cdot \right) a monoid?

?
Problem I.4.1.3

In a multiplicative monoid MM, an arbitrary element tt is chosen and a new operation ∗:x∗y=xty*: x * y=x t y is introduced. Show that (M,∗)(M, *) is a semigroup and that the invertibility of the element tt in MM is a necessary and sufficient condition for (M,∗)(M, *) to be a monoid with neutral (identity) element t−1t^{-1}.

?
Problem I.4.1.4

Show that the set Z\mathbb {Z} with the operation ∘:n∘m=n+m+nm=(1+n)×(1+m)−1\circ : n \circ m=n+m+n m=(1+n) \times (1+m)-1 is a commutative monoid. What serves as the neutral element in (Z,∘)(\mathbb {Z}, \circ )? Find all invertible elements in (Z,∘)(\mathbb {Z}, \circ ).

?