This action might not be possible to undo. Are you sure you want to continue?

Welcome to Scribd! Start your free trial and access books, documents and more.Find out more

Portfolio Assignment 10: §5.3, 7.2-3 Name: Sean Fogerty

Problem 5.3.6 proposition: Let A be a non-empty set, and let be an equivalence relation on A. Let x, y ∈ A. Show that if x ∼ y, then [x] = [y] and that if x ∼ y, then [x] = [y]. proof (Direct, Contrapositive) Cases • ⊆ Let a be an arbitrary element of [x] and let x ∼ y. By the deﬁnition of relation class, x ∼ a. By the symmetric deﬁnition of a equivalence relation, we have y ∼ x. By the transitive deﬁnition of equivalence relations, we have y ∼ a. Thus, as a was arbitrarily chosen, [x] ⊆ [y]. ⊇ Let a be an arbitrary element of [y] and let x ∼ y. By the deﬁnition of relation class, y ∼ a. By the transitive deﬁnition of equivalence relations, we have x ∼ a. Thus, as a was arbitrarily chosen, [y] ⊆ [x]. Because [y] ⊆ [x] and [x] ⊆ [y] they must be equal. • Suppose that the intersection of [x] and [y] is not equal to the null set. Therefore, there exists an element a in [x] ∩ [y]. By the deﬁnition of intersection, we have a ∈ [x] and a ∈ [y]. By the deﬁnition of relation class, we have x ∼ a and y ∼ a. By the symmetric property of equivalence relations, we have a ∼ y. By the transitive property of equivalence relations, we have x ∼ y. Thus, by the contrapositive, if x ∼ y, then [x] = [y].

Problem 5.3.14 proposition: Let A be a non-empty set, and let E1 and E2 be equivalence relations on A. Let D1 and D2 denote the partitions of A that correspond to E1 and E2 respectively. Let E = E1 ∩E2 . Then E is an equivalence relation on A by Exercise 5.3.7(i). Let D denote the partition of A that correspond to E. What is the relation between D1 , D2 and D? Prove your result. proof (Direct) Cases Let the relation between D, D1 and D2 be D = D1 ∩ D2 . I will prove this by showing that D and D1 ∩ D2 are equal. ⊆ Let E = E1 ∩ E2 and suppose D = D1 ∩ D2 . Let a be an arbitrary element of D. By the deﬁnition of relation, there exists some b ∈ A such that (a, b) ∈ E. By substitution, we have (a, b) ∈ E1 ∩ E2 . By the deﬁnition of intersection, we have (a, b) ∈ E1 and (a, b) ∈ E2 . By the deﬁnition of relations and because E1 corresponds to D1 and E2 corresponds to D2 , we have a ∈ D1 and a ∈ D2 . Therefore, by the deﬁnition of intersection, a ∈ D1 ∩ D2 . Because a was arbitrarily chosen, it follows that D ⊆ D1 ∩ D2 . ⊇ Let E = E1 ∩E2 and suppose D = D1 ∩D2 . Let a be an arbitrary element of D1 ∩D2 . By the deﬁnition of relations and because E1 corresponds to D1 and E2 corresponds to D2 , there exists some b ∈ A such that (a, b) ∈ E1 ∩ E2 . By substitution, we have (a, b) ∈ E. By the deﬁnition of relations, we have a ∈ D. Because a was arbitrarily chosen, it follows that D ⊇ D1 ∩ D2 . Because D ⊇ D1 ∩ D2 and D ⊆ D1 ∩ D2 , they must be equal. 1

it must be an abelian group. by the deﬁnition of the identity element. and associative laws. By substitution. ∆) satisﬁes the identity.12.2. we have x = x ∗ (g ∗ g −1 ) and x = (x ∗ g) ∗ g −1 . If g ∈ G. it is commutative and thus Abelian. Problem 7. • The inverse is the element itself because (X − X) ∪ (X − X) = ∅ • We assume the operation ∆ is associative. Additionally. because ﬂipping the variables simply ﬂips the set diﬀerences across the union. inverse. • The operation ∆ is trivially commutative. on Zn given in section 5. proof (Direct) Let g ∈ G and let (G. Thus. by the associativity of groups. inverse. By substitution. we have x ∗ g = y ∗ g.1 proposition: Let n ∈ N. Recall the deﬁnition of the set Zn and the operations + and . Because (P(A). Problem 7. proof (Direct) • Because the power set contains all subsets of A. the identity element is the ∅ because (X − ∅) ∪ (∅ − X) = X. +) is an abelian group. it must be an abelian group. • By the deﬁnition of set addition. and associative laws.2. ∗) be a group. +) satisﬁes the identity. commutative. commutative. ∗) be a group. By association and the deﬁnition of inverses. Because (Zn . Show that (Zn . we have x = y ∗ e.6 proposition: Let (G. • [∅] is the additive identity element and is included in Zn . we have x = (y ∗ g) ∗ g −1 . Deﬁne the binary operation ∆ on P(A) by X∆Y = (X − Y ) ∪ (Y − X) for all X. then g has a unique inverse. Therefor. 2 . proof (Direct) Cases • By the deﬁnition of relation classes and modular addition. Show that (P(A).Problem 7. every element of Zn has an additive element inZn . there exists some g ( − 1) ∈ G such that g ∗ g ( − 1) = e(the identity element). (Zn . x = x ∗ e and y = y ∗ e. x∗g = e and y ∗g = e. it is associative. ∆) is an abelian group. Suppose g has two inverses x and y.3 proposition: Let A be a set.2. Y ∈ P(A). By the deﬁnition of a group.2. which means that x = y and g has only one unique inverse. +) is a group. by substitution. by the deﬁnition of the identity element. Therefore. • By the deﬁnition of set addition.

and (K.) is a group? proof (Direct) No. we have f (a ∗ b) = f (a)@f (b). By the deﬁnition of homomorphism. we have j(f (a ∗ b)) = j(f (a))?j(f (b)). can you ﬁnd any conditions of n that would guarantee that (Zn − {[0]}. on Zn given in section 5. proof (Direct) Let (G. ∗). Let a.Problem 7.3 proposition: Recall the deﬁnition of the set Zn and the operations + and . By substitution.2. . j ◦ f is a homomorphism.) a group? If not. . it is not a group.7 proposition: Let G.12.2. Then j ◦ f is a homomorphism. Thus. H and K be groups. and let f : G → H and j : H → K be homomorphisms. n would have to be a prime integer. b ∈ G. (H. which is a homomorphism. @). ?) be groups. Thus f (a) ∈ H and f (b) ∈ H. Problem 7.3. By the deﬁnition of homomorphism. 3 . Is (Zn − {[0]}. we have j(f (a)@f (b)) = j(f (a))?j(f (b)).

- Group Theory 1
- Smarandache quasigroup rings
- Bm Session 5
- Sage Group Theory Primer
- The Not So Simple Idea of Galois' Theory
- 1._Introduction.ppt
- hw7s
- Group THeory
- M208 Assignment Book 1
- Geometry and Groups T. K. Carne
- Rep n Control
- Representation Theory
- ContentServer (3)
- nbhm_msc05
- Introduction to Mathematical Logic Midterm
- Petr Kurka- Topological dynamics of one-dimensional cellular automata
- Book of Proof by Richard Hammack
- Book of Proof
- Power Round
- Dajani Ergodic Theory
- Larry B. Schweitzer- C^infinity Functions on the Cantor Set, And a Smooth m-Convex Frechet Subalgebra of O2
- Joel David Hamkins and Saharon Shelah- Superdestructibility
- Matrix
- Assignment 2
- Mit Tutorial
- Lec-8-9-slide
- tifr33
- Math 321 - Intro to Analysis
- Part1Module1
- Binary Relation

Are you sure?

This action might not be possible to undo. Are you sure you want to continue?

We've moved you to where you read on your other device.

Get the full title to continue

Get the full title to continue reading from where you left off, or restart the preview.

scribd