离散数学1精品教学（华南理工大学）Lecture 2 Groups-I.pptVIP

Theorem Let (A, *) and (B, *) be semigroups, monoids or groups. Then the inverse f-1:B?A of any isomorphism f:A ? B is itself an isomorphism. Proof： The inverse f-1:B?A of an isomorphism f:A?B is itself a bijective function whose inverse is the function f:A ? B. It remains to show that f-1:B?A is a homomorphism. Let u and v be elements of B, and let x = f-1(u) and y = f-1(v). Then u = f(x) and v = f(y), and therefore f(x* y) = f(x)* f(y) = u *v and therefore f-1(u*v) = x *y = f-1(u) *f-1(v); showing that the function f-1:B ?A is a homomorphism from (B; *) to (A;* ), as required. Isom