Q1- Prove that ∼H is an equivalence relation on G. That is, ∼H satisfies: (i) For every g ∈ G, g ∼H (Reflexivity) (ii) For all g1, g2 ∈ G, If g1 ∼H g2, then g2 ∼H g1. (Symmetry) (iii) For all g1,g2,g3 ∈G, If g1 ∼H g2 and g2 ∼H g3,then g1 ∼H g3.  (Transitivity) Cosets. For g ∈ G, let gH = {g · h : h ∈ H}. The set gH is known as the left coset of H containing g. Q2- Let φ : G → H be a group homomorphism. (a) Prove that Ker(φ) is a normal subgroup of G. (a) Prove that Im(φ) is a subgroup of G. Is it normal? When?

Q1- Prove that ∼H is an equivalence relation on G. That is, ∼H satisfies: (i) For every g ∈ G, g ∼H (Reflexivity) (ii) For all g1, g2 ∈ G, If g1 ∼H g2, then g2 ∼H g1. (Symmetry) (iii) For all g1,g2,g3 ∈G, If g1 ∼H g2 and g2 ∼H g3,then g1 ∼H g3.  (Transitivity) Cosets. For g ∈ G, let gH = {g · h : h ∈ H}. The set gH is known as the left coset of H containing g. Q2- Let φ : G → H be a group homomorphism. (a) Prove that Ker(φ) is a normal subgroup of G. (a) Prove that Im(φ) is a subgroup of G. Is it normal? When?

Elements Of Modern Algebra

8th Edition

ISBN:9781285463230

Author:Gilbert, Linda, Jimmie

Publisher:Gilbert, Linda, Jimmie

Chapter1: Fundamentals

Section1.7: Relations

Problem 2E: 2. In each of the following parts, a relation is defined on the set of all integers. Determine in...

See similar textbooks

Similar questions

A relation R on a nonempty set A is called asymmetric if, for x and y in A, xRy implies yRx. Which of the relations in Exercise 2 areasymmetric? In each of the following parts, a relation R is defined on the set of all integers. Determine in each case whether or not R is reflexive, symmetric, or transitive. Justify your answers. a. xRy if and only if x=2y. b. xRy if and only if x=y. c. xRy if and only if y=xk for some k in . d. xRy if and only if xy. e. xRy if and only if xy. f. xRy if and only if x=|y|. g. xRy if and only if |x||y+1|. h. xRy if and only if xy i. xRy if and only if xy j. xRy if and only if |xy|=1. k. xRy if and only if |xy|1.
Prove Theorem 1.40: If is an equivalence relation on the nonempty set , then the distinct equivalence classes of form a partition of .
23. Let be the equivalence relation on defined by if and only if there exists an element in such that .If , find , the equivalence class containing.
21. A relation on a nonempty set is called irreflexive if for all. Which of the relations in Exercise 2 are irreflexive? 2. In each of the following parts, a relation is defined on the set of all integers. Determine in each case whether or not is reflexive, symmetric, or transitive. Justify your answers. a. if and only if b. if and only if c. if and only if for some in . d. if and only if e. if and only if f. if and only if g. if and only if h. if and only if i. if and only if j. if and only if. k. if and only if.
Let be a relation defined on the set of all integers by if and only if sum of and is odd. Decide whether or not is an equivalence relation. Justify your decision.
Label each of the following statements as either true or false. Let R be a relation on a nonempty set A that is symmetric and transitive. Since R is symmetric xRy implies yRx. Since R is transitive xRy and yRx implies xRx. Hence R is alsoreflexive and thus an equivalence relation on A.
Give an example of a relation R on a nonempty set A that is symmetric and transitive, but not reflexive.
Label each of the following statements as either true or false. If R is an equivalence relation on a nonempty set A, then any two equivalence classes of R contain the same number of element.
Let R be the relation defined on the set of integers by aRb if and only if ab. Prove or disprove that R is an equivalence relation.
2. In each of the following parts, a relation is defined on the set of all integers. Determine in each case whether or not is reflexive, symmetric or transitive. Justify your answers. a. if and only if . b. if and only if . c. if and only if for some in . d. if and only if . e. if and only if . f. if and only if . g. if and only if . h. if and only if . i. if and only if . j. if and only if . k. if and only if .
For any relation on the nonempty set, the inverse of is the relation defined by if and only if . Prove the following statements. is symmetric if and only if . is antisymmetric if and only if is a subset of . is asymmetric if and only if .