Exercise 14.3.28. Fill in the blanks to complete the proof: Recall that permutations are defined as bijections on a set X. In order to show that the two permutations Or and to are equal, it's enough to show that they are the same function. In other words, we just need to show that OT(1) =_<1> for all r € X. We'll define A = {a1, a2, . .. ,a;} and B = {b1, b2, ..., br}. By hypothesis A and B are disjoint, so A_< 2 > _B = <3> . Given an arbitrary r € X, there are three possibilities: (i) z € A and r ¢ B; (ii) r € <4> _ and z¢ < 6 > ; (iii r ¢ _<7> _ and x¢ _< 8 > . (i) In this case, since r ¢ B it follows that 7(x) = 1. We then have OT(1) = 0(t(x)) = o(x). Furthermore, since r € A it follows that o(x) € A, so o(x) ¢ B. We then have ro(r) = t(0(r)) = o(x). It follows that στ(r ) -τσ (r). %3D %3D

Advanced Engineering Mathematics
10th Edition
ISBN:9780470458365
Author:Erwin Kreyszig
Publisher:Erwin Kreyszig
Chapter2: Second-order Linear Odes
Section: Chapter Questions
Problem 1RQ
icon
Related questions
Question

Please do Exercise 14.3.28 and please show step by step and explain

Proposition 14.3.27. Disjoint cycles commute: that is, given two disjoint
cycles o = (a1, a2,...,aj) and 7 =
(b1, b2,..., br) we have
OT = TO = (a1, a2, ..., a;) (b1, b2,..., br)
PROOF. We present this proof as a fill-in-the-blanks exercise:
Exercise 14.3.28. Fill in the blanks to complete the proof:
Recall that permutations are defined as bijections on a set X. In order
to show that the two permutations Or and to are equal, it's enough to show
that they are the same function. In other words, we just need to show that
OT(1) =_<1> for all r e X.
We'll define A = {a1,a2, ...,aj} and B = {b1,b2, ..., br}. By hypothesis
A and B are disjoint, so A_< 2 >B = _<3> . Given an arbitrary x € X,
there are three possibilities: (i) r € A and r ¢ B; (ii) x €<4> and
æ ¢ < 6 > ; (ii) æ ¢ _< 7 > _ and r¢ < 8 > .
(i) In this case, since r ¢ B it follows that T(x) = x. We then have
OT(x) = o(T(x)) = o(x). Furthermore, since r € A it follows that
o(x) E A, so o(x) ¢ B. We then have To(x) = T(0(x)) = o(x). It
follows that στ(1)-τσ (π).
Transcribed Image Text:Proposition 14.3.27. Disjoint cycles commute: that is, given two disjoint cycles o = (a1, a2,...,aj) and 7 = (b1, b2,..., br) we have OT = TO = (a1, a2, ..., a;) (b1, b2,..., br) PROOF. We present this proof as a fill-in-the-blanks exercise: Exercise 14.3.28. Fill in the blanks to complete the proof: Recall that permutations are defined as bijections on a set X. In order to show that the two permutations Or and to are equal, it's enough to show that they are the same function. In other words, we just need to show that OT(1) =_<1> for all r e X. We'll define A = {a1,a2, ...,aj} and B = {b1,b2, ..., br}. By hypothesis A and B are disjoint, so A_< 2 >B = _<3> . Given an arbitrary x € X, there are three possibilities: (i) r € A and r ¢ B; (ii) x €<4> and æ ¢ < 6 > ; (ii) æ ¢ _< 7 > _ and r¢ < 8 > . (i) In this case, since r ¢ B it follows that T(x) = x. We then have OT(x) = o(T(x)) = o(x). Furthermore, since r € A it follows that o(x) E A, so o(x) ¢ B. We then have To(x) = T(0(x)) = o(x). It follows that στ(1)-τσ (π).
(ii) In this case, since r ¢<9 > _ it follows that < 10 >_(x) = x. We
then have To(x) = < 11> _ = _< 12 > _(x). Furthermore, since r E
< 13 >_it follows that < 14 >(x) E< 15 >, so < 16 > (x)
< 17 > . We then have or(x)
follows that στ(ο)-τα (x).
< 18 >
< 19 > _(x). It
(iii) In this case, since r ¢ A it follows that < 20 >_(x) = x. Similarly
since r ¢ < 21 >_ it follows that < 22 > _(x) = x.We then have
TO(x)
TO(x).
= r.
< 23 > _ and or(x)
= < 24 > . It follows that or(æ) =
In all three cases we have or(r) = < 25 > , so therefore or = To.
What we've discovered about products of two disjoint cycles is also true for
products of any number of disjoint cycles. Since disjoint cycles act indepen-
dently, they all commute.
Transcribed Image Text:(ii) In this case, since r ¢<9 > _ it follows that < 10 >_(x) = x. We then have To(x) = < 11> _ = _< 12 > _(x). Furthermore, since r E < 13 >_it follows that < 14 >(x) E< 15 >, so < 16 > (x) < 17 > . We then have or(x) follows that στ(ο)-τα (x). < 18 > < 19 > _(x). It (iii) In this case, since r ¢ A it follows that < 20 >_(x) = x. Similarly since r ¢ < 21 >_ it follows that < 22 > _(x) = x.We then have TO(x) TO(x). = r. < 23 > _ and or(x) = < 24 > . It follows that or(æ) = In all three cases we have or(r) = < 25 > , so therefore or = To. What we've discovered about products of two disjoint cycles is also true for products of any number of disjoint cycles. Since disjoint cycles act indepen- dently, they all commute.
Expert Solution
steps

Step by step

Solved in 2 steps with 1 images

Blurred answer
Recommended textbooks for you
Advanced Engineering Mathematics
Advanced Engineering Mathematics
Advanced Math
ISBN:
9780470458365
Author:
Erwin Kreyszig
Publisher:
Wiley, John & Sons, Incorporated
Numerical Methods for Engineers
Numerical Methods for Engineers
Advanced Math
ISBN:
9780073397924
Author:
Steven C. Chapra Dr., Raymond P. Canale
Publisher:
McGraw-Hill Education
Introductory Mathematics for Engineering Applicat…
Introductory Mathematics for Engineering Applicat…
Advanced Math
ISBN:
9781118141809
Author:
Nathan Klingbeil
Publisher:
WILEY
Mathematics For Machine Technology
Mathematics For Machine Technology
Advanced Math
ISBN:
9781337798310
Author:
Peterson, John.
Publisher:
Cengage Learning,
Basic Technical Mathematics
Basic Technical Mathematics
Advanced Math
ISBN:
9780134437705
Author:
Washington
Publisher:
PEARSON
Topology
Topology
Advanced Math
ISBN:
9780134689517
Author:
Munkres, James R.
Publisher:
Pearson,