Purchase Solution

Disjoint cycles and least common multiple

Not what you're looking for?

Ask Custom Question

Symmetric groups: G = Sn.

(i) Let g1, g2 belong G be two disjoint cycles, and let g = g1g2. Prove that o(g) = lcm
{ o( g1), o(g2)}, where lcm stands for the least common multiple.

(ii) Let g= g1g2 ... gr belong G, where g1,g2, ... gr are disjoint cycles. Prove that o(g) = lcm {o(g1), o(g2), ... o(gr)}.

Can you tell me how to start, and step by step guide?

Purchase this Solution
Solution Summary

There are two proofs here regarding least common multiple of disjoint cycles.

Solution Preview

Proof:
(i) Since g1 and g2 are disjoint cycles, then g1*g2=g2*g1. They are commutative.
g=g1*g2. Let o(g)=n, then g^n=(g1*g2)^n=(g1^n)*(g2^n)=e. This implies that
g1^n=e and g2^n=e. So o(g1) divides n and o(g2) divides n.
...

Purchase this Solution
Free BrainMass Quizzes
Probability Quiz

Some questions on probability

Exponential Expressions

In this quiz, you will have a chance to practice basic terminology of exponential expressions and how to evaluate them.

Multiplying Complex Numbers

This is a short quiz to check your understanding of multiplication of complex numbers in rectangular form.

Graphs and Functions

This quiz helps you easily identify a function and test your understanding of ranges, domains , function inverses and transformations.

Geometry - Real Life Application Problems

Understanding of how geometry applies to in real-world contexts

View More Free Quizzes
Related BrainMass Solutions

  • Product of Disjoint Cycles

    If the order of is , then we have This implies that and . So is the least common multiple of and . Therefore, . Products of disjoint cycles are investigated. The solution is detailed and well presented.

  • Group Theory : Symmetry Groups, Cyclic Subgroups and Permutations

    Problem #1 (a) We know, each element in can be expressed as disjoint cycles. The order of the element is the least common multiple of the lengths of those cycles. So we have the following elements with different orders from 1 to 6.

  • Cyclic Groups

    b) How to prove that the order of an element in Sn equals the least common multiple of the lengths of the cycles in its cycle decomposition. a) Proof: We only need to show that a^i has order m.

  • Symmetric Groups and Disjoint Cycles

    Symmetric groups and disjoint cycles are investigated. Products of disjoint cycles are determined.

  • group theory

    Since , then is disjoint from . Thus at least contains elements inside and . Then at least contains , a set of 6 elements. Since is a subgroup of , then divides . Then or 12.

  • Permutations and Disjoint Cycles

    109237 Permutations and Disjoint Cycles Let b be the permutation (1 2 3)(4 5 6 7)(8 9 10 11 12 13) what is b^99 as a product of disjoint cycles. -I know b^99=b^3 but I'm a little confused on the disjoint cycles part.

  • Abstract Algebra: Symmetric Group Problem

    c) Using examples and/or theorems, argue that G has at least one subgroup of every order dividing |G|. a) Since G = S_4, then each element can be expressed as multiplication of disjoint cycles.

  • Permutations as Product of Disjoint Cycles

    87115 Permutations as Product of Disjoint Cycles Modern Algebra Group Theory (LXXIX) Permutation Groups The Orbits and Cycles of Permutations Write the given permutation as the product of disjoint cycles 1 2 3 4 5 6 6 5 4 3 1 2

  • Composition of cycles

    22693 Composition of Cycles Functions Find the composition of the following cycles representing permutations on A = {1,2,3,4,5,6,7,8} Answer as a composition of one or more disjoint cycles.

View More Related Solutions