JustToThePoint English Website Version
JustToThePoint en español

Maximize your online presence with our exclusive offer: Get a stunning hero banner, the hero you need and deserve, at an unbeatable price! Bew, 689282782, bupparchard@gmail.com

Direct Products II

I have yet to see any problem, however complicated, which, when looked at in the right way did not become still more complicated, Paul Anderson.

Image

Theorem. If r is a divisor of m and s is a divisor of n, m ⊕ ℤn has a subgroup isomorphic to ℤr ⊕ ℤs.

Lemma 1. Suppose G1 and G2 are groups, H1 ≤ G1 and H2 ≤ G2. Then, (H1 ⊕ H2) ≤ (G1 ⊕ G2)

Proof.

∀ a, b ∈ H1 ⊕ H2, a = (a1, a2), b = (b1, b2), a1, b1 ∈ H1, a2, b2 ∈ H2 ⇒ [H1 ≤ G1 and H2 ≤ G2] ∃b1-1 ∈ H1, b2-1 ∈ H2 such that a·b-1 = (a1, a2)·(b1-1, b2-1) = (a1·b1-1, a2·b2-1) ∈ H1 ⊕ H2

Lemma 2. If G1, G2, H1, H2 are groups such that G1 ≋ H1 and G2 ≋ H2, then G1 ⊕ G2 ≋ H1 ⊕ H2

Proof.

Since G1 ≋ H1 and G2 ≋ H2 ⇒ ∃Φ1: G1 → H1, Φ2: G2 → H2 isomorphism.

Define a function Φ: G1 ⊕ G2 → H1 ⊕ H2, by Φ(g1, g2) = (Φ1(g1), Φ2(g2)). It is pretty easy to show that Φ is indeed an isomorphism.

Proof. (Main Theorem)

Recall the following Theorem. Let a be an arbitrary element of order n in a group G, and let k be a positive integer. Then, ⟨ak⟩=⟨agcd(n,k)⟩ and |⟨ak⟩| = $\frac{n}{gcd(n,k)}.$

If r is a divisor of m and s is a divisor of n, the subgroup ⟨m/r⟩ ≤ ℤm is cyclic of order r (so it is isomorphic to ℤr) and the subgroup ⟨n/s⟩ ≤ ℤn is cyclic of order s (so it is isomorphic to ℤs) ⇒ [Lemma 1] ⟨m/r⟩ ⊕ ⟨n/s⟩ ≤ ℤm ⊕ ℤm and [By Lemma 2] isomorphic to ℤr ⊕ ℤs

  1. We notice that ℤ30 ⊕ ℤ12 has a subgroup isomorphic to ℤ6 ⊕ ℤ4.
  2. ⟨5⟩ is a subgroup of ℤ30, |⟨5⟩| = 6. ⟨3⟩ is a subgroup of ℤ12, |⟨3⟩| = 4.
  3. By the previous result, ⟨5⟩ ⊕ ⟨3⟩ is such a subgroup.

Criterion for the direct product to be cyclic. Let G and H be finite cyclic groups. Then, the external direct product of both groups G ⊕ H is cyclic if and only if their orders are relatively prime,i.e., |G| and |H| are relatively prime, (|G|, |H|) = 1.

Proof.

⇒) |G| = m, |H| = n, |G ⊕ H| = nm. Let’s assume G ⊕ H is cyclic, ∃ g∈ G, h ∈H such that G ⊕ H = ⟨(g, h)⟩, let d = gcd(n,m).

$(g, h)^{\frac{mn}{d}}=(g^{\frac{mn}{d}}, h^{\frac{mn}{d}})=((g^{m})^{\frac{n}{d}},(h^{n})^{\frac{m}{d}})=(e^{\frac{n}{d}},e’^{\frac{m}{d}})$ = (e, e’) where e and e’ are the identity in G and H respectively, and mn/d, n/d and m/d are integers by the gcd definition ⇒ [|G ⊕ H| = nm and by assumption, G ⊕ H = ⟨(g, h)⟩] |(g, h)| = nm ≤ mn/d ⇒ d = 1.

⇐) Suppose |G| = m, |H| = n, d = gcd(n, m) = 1, G = ⟨g⟩, H = ⟨h⟩ ⇒ [Order of an Element in a Direct Group] ⟨(g, h)⟩ = lcm(n, m) ⇒ [gcd(n, m) = 1] = nm, |G ⊕ H| = nm, and therefore (g, h) is a generator of G ⊕ H.

Using an induction argument and this criterion, we can generalize this result.

Theorem. Let G1, G2, and Gn be finite cyclic groups. Then, their external direct product G1 ⊕ G2 ⊕ ··· ⊕ Gn is cyclic if and only if their orders are coprime(relatively prime),i.e., |Gi| and |Gj| are relatively prime ∀i ≠ j.

Corollary. Let m = n1n2···nk. Then, ℤm, that is, (ℤn1n2···nk) is isomorphic to ℤn1 ⊕ ℤn2 ⊕ ··· ⊕ ℤnk if and only if ni and nj are relatively prime, ∀i ≠ j, i.e., n1n2···nk ≋ ℤn1 ⊕ ℤn2 ⊕ ··· ⊕ ℤnk ↭ (ni, nj) = 1, ∀i ≠ j.

Examples:

+ (0,0) (0,1) (0,2) (1,0) (1,1) (1,2)
(0,0) (0,0) (0,1) (0,2) (1,0) (1,1) (1,2)
(0,1) (0,1) (0,2) (0,0) (1,1) (1,2) (1,0)
(0,2) (0,2) (0,0) (0,1) (1,2) (1,0) (1,1)
(1,0) (1,0) (1,1) (1,2) (0,0) (0,1) (0,2)
(1,1) (1,1) (1,2) (1,0) (0,1) (0,2) (0,0)
(1,2) (1,2) (1,0) (1,1) (0,2) (0,0) (0,1)

The only two proper subgroups are {(0, 0), (1, 0)} and {(0, 0), (0, 1), (0, 2)}

The Group of Units Modulo n as an External Direct Product

Theorem. Suppose s and t are relatively prime. Then, U(st)≈U(s)⊕U(t), i.e., U(st) is isomorphic to the external direct product of U(s) and U(t). Futhermore, Us(st) ≈ U(t) and Ut(st) ≈ U(s)

Recall. Un = {[k]| gcd(k, n) = 1}, that is, Un consists of all [k], where k is relatively prime to n, e.g., U8 = {[1], [3], [5], [7]}, [3]2 = [9] = [1], [5]2 = [25] = [1], and [7]2 = [49] = [1], so all its elements (except the identity) have order two.

Recall. Uk(n) = {x ∈ U(n): x mod k = 1}, Uk(n) ≤ U(n), e.g., U105(5) = {1, 11, 16, 26, 31, 41, 46, 61, 71, 76, 86, 101}.

Proof. Let’s define an isomorphism, Φ: U(st) → U(s)⊕U(t), Φ(x) = (x mod s, x mod t). Analogously, Φ’ and Φ’’ are both isomorphisms, Φ’: Us(st) → U(t), Φ’(x) = (x mod t), Φ’’: Us(st) → U(s), Φ’’(x) = (x mod s).

Φ: U(st) → U(s)⊕U(t), Φ(x) = (x mod s, x mod t).

  1. Obviously, Φ is well-defined and Φ is operation preserving.
  2. Φ is one-to-one because Φ(x) = Φ(y) ⇒ x mod s = y mod s, x mod t = y mod t ⇒ x -y ≡ 0 mod s, and x -y ≡ 0 mod t ⇒ s | x-y and t | x -y ⇒ [By assumption, (s, t) = 1] st | x-y ⇒ x ≡ y mod st.
  3. Φ is onto. |U(st)| = θ(st) =[(s, t) = 1] θ(s)θ(t) = |U(s)||U(t)|. Therefore, Φ is one-to-one between two finite sets of the same order ⇒ Φ is onto.

    θ is Euler’s totient function, it counts the positive integers up to a given integer n that are relatively prime to n. It is a multiplicative function, meaning that if two numbers m and n are relatively prime, then θ(mn) = θ(m)θ(n).

Corollary. Let m be a integer that can be factored as n1n2···nk, where each of the factors is relatively prime to all of the others (∀i, j, i ≠ j, gcd(ni, nj) = 1). Then, U(m) ≋ U(n1)⊕U(n2)⊕···⊕U(nk).

Examples:

|U(21)| = 12. U(3) = {1, 2}, |U(3)| = 2; and U(7) = {1, 2, 3, 4, 5, 6}, |U(7)| = 6;

Φ: U(st) → U(s)⊕U(t), Φ(x) = (x mod s, x mod t). In particular, Φ: U(21) → U(3)⊕U(7), Φ(x) = (x mod 3, x mod 7).

U7(21) = {1, 8}, U3(21) = {1, 4, 10, 13, 16, 19}. Φ’: U7(21) → U(3), Φ’(x) = x mod 3. Φ’’: U3(21) → U(7), Φ’’(x) = x mod 7.

Theorem (Gauss, 1801). U(2) = {1} ≋ {0}, U(4) = {1, 3} ≋ ℤ2. U(2n) ≋ U(22) ⊕ U(2n-2) ≋ ℤ2⊕ℤ2n-2 ∀n ≥ 3, U(pn) ≋ ℤpn-pn-1 for p a positive integer and an odd prime.

Theorem. Every group U(n) is isomorphic to the external direct product of cyclic groups.

Examples

Claim. Let’s Suppose (a, b) ∈ ℝ* ⊕ ℝ* has finite order ⇒ ∃n: (a, b)n = (1, 1) ⇒ (an, bn) = (1, 1) ⇒[The only elements of finite order in ℝ* are 1 and -1] an = bn = 1 ⇒ a = ±1, b = ±1.

Case 1. |b| = 4 (there are two choices, i.e., 1 and 3), |c| = 3 (2, 4) or 6 (1, 5). We need to count 2 (|a|)·2(|b|)·4(|c|)·4(|d|) = 64.

Case 2. |d| = 4, |c| = 3 or 6. Besides, we need to add 2 (|a|)·2(|b| because we have already counted |b|=4, so |b|=1 or |b|=2, i.e., b = 0 or 2)·4(|c|)·2(|d|) = 32. Therefore, 64+32= 96 elements of order 12.

Let $\left(\begin{smallmatrix}1 & a & b\\ 0 & 1 & 0\\0 & 0 & 1\end{smallmatrix}\right),\left(\begin{smallmatrix}1 & c & d\\ 0 & 1 & 0\\0 & 0 & 1\end{smallmatrix}\right)$ ∈ H, then $\left(\begin{smallmatrix}1 & a & b\\ 0 & 1 & 0\\0 & 0 & 1\end{smallmatrix}\right)\left(\begin{smallmatrix}1 & c & d\\ 0 & 1 & 0\\0 & 0 & 1\end{smallmatrix}\right)=\left(\begin{smallmatrix}1 & c+a & d+b\\ 0 & 1 & 0\\0 & 0 & 1\end{smallmatrix}\right)$ ∈ H, so it is closed under matrix multiplication.

Futhermore, $\left(\begin{smallmatrix}1 & c & d\\ 0 & 1 & 0\\0 & 0 & 1\end{smallmatrix}\right)\left(\begin{smallmatrix}1 & a & b\\ 0 & 1 & 0\\0 & 0 & 1\end{smallmatrix}\right)=\left(\begin{smallmatrix}1 & a+c & b+d\\ 0 & 1 & 0\\0 & 0 & 1\end{smallmatrix}\right) = \left(\begin{smallmatrix}1 & c+a & d+b\\ 0 & 1 & 0\\0 & 0 & 1\end{smallmatrix}\right)$, and therefore H is Abelian.

Matrix multiplication is associative, $\left(\begin{smallmatrix}1 & 0 & 0\\ 0 & 1 & 0\\0 & 0 & 1\end{smallmatrix}\right)$ is the identity element, and $\left(\begin{smallmatrix}1 & -a & -b\\ 0 & 1 & 0\\0 & 0 & 1\end{smallmatrix}\right)$ is the inverse of $\left(\begin{smallmatrix}1 & a & b\\ 0 & 1 & 0\\0 & 0 & 1\end{smallmatrix}\right)$. Therefore, H is an Abelian group.

Futhermore, Φ: ℤ3 ⊕ ℤ3 → H defined by Φ(a, b) = $\left(\begin{smallmatrix}1 & a & b\\ 0 & 1 & 0\\0 & 0 & 1\end{smallmatrix}\right)$ is an isomorphism. It is clear that Φ is a bijection, and Φ((a, b) + (c, d)) = Φ(a + c, b + d) = $\left(\begin{smallmatrix}1 & a + c & b + d\\ 0 & 1 & 0\\0 & 0 & 1\end{smallmatrix}\right) = \left(\begin{smallmatrix}1 & a & b\\ 0 & 1 & 0\\0 & 0 & 1\end{smallmatrix}\right)\left(\begin{smallmatrix}1 & c & d\\ 0 & 1 & 0\\0 & 0 & 1\end{smallmatrix}\right)$ = Φ(a, b)Φ(c, d) ⇒ Φ is an homomorphism ⇒ Φ is an isomorphism ⇒ H ≋ ℤ3 ⊕ ℤ3.

Isomorphisms preserves order, i.e., ∀a ∈ ℤ105, |a| = |Φ(a)|, and we also know that Aut(ℤ105) ≈ U(105).

How many elements of order 12 are there in U105 = ℤ2 ⊕ ℤ4 ⊕ ℤ6? If (a, b, c) ∈ ℤ2 ⊕ ℤ4 ⊕ ℤ6 has order 12 ⇒ lcm (|a|, |b|, |c|) = 12 ⇒ |b| = 4 (b=1 or 3 -gcd(4, 3) = 1), |c| = 3 (c=2 or 4) or |c| = 6 (c = 1 or 5). Total elements of order 12 = 2 (|a|) x 2 (|b|) x 4 (|c|) = 16. There are 16 automorphisms of order 12.

Isomorphisms preserves order, i.e., ∀a ∈ ℤ720, |a| = |Φ(a)|, and we also know that Aut(ℤ720) ≈ U(720). Therefore (previous exercise), there are 96 elements of order 12 in U(720), and 96 automorphism of ℤ720 of order 12.

Bibliography

This content is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License. This post relies heavily on the following resources, specially on NPTEL-NOC IITM, Introduction to Galois Theory, Michael Penn, and Contemporary Abstract Algebra, Joseph, A. Gallian.
  1. NPTEL-NOC IITM, Introduction to Galois Theory.
  2. Algebra, Second Edition, by Michael Artin.
  3. LibreTexts, Abstract and Geometric Algebra, Abstract Algebra: Theory and Applications (Judson).
  4. Field and Galois Theory, by Patrick Morandi. Springer.
  5. Michael Penn (Abstract Algebra), and MathMajor.
  6. Contemporary Abstract Algebra, Joseph, A. Gallian.
  7. Andrew Misseldine: College Algebra and Abstract Algebra.
Bitcoin donation

JustToThePoint Copyright © 2011 - 2024 Anawim. ALL RIGHTS RESERVED. Bilingual e-books, articles, and videos to help your child and your entire family succeed, develop a healthy lifestyle, and have a lot of fun. Social Issues, Join us.

This website uses cookies to improve your navigation experience.
By continuing, you are consenting to our use of cookies, in accordance with our Cookies Policy and Website Terms and Conditions of use.