Abstract Algebra: Group and Ring Theory

Group Isomorphisms and Structural Equivalence

  • Definition of Group Isomorphism:

    • An isomorphism ϕ\phi from a group GG to a group G‾\overline{G} is a one-to-one (injective) and onto (surjective) mapping from GG to G‾\overline{G} that preserves the group operation.

    • Formally, for all a,b∈Ga, b \in G:     ϕ(ab)=ϕ(a)ϕ(b)\phi(ab) = \phi(a)\phi(b)

    • When an isomorphism exists from GG onto G‾\overline{G}, the groups are said to be isomorphic, denoted by G≈G‾G \approx \overline{G} (or G≅G‾G \cong \overline{G}).

    • In an isomorphism equation ϕ(ab)=ϕ(a)ϕ(b)\phi(ab) = \phi(a)\phi(b), the operation on the left-hand side (abab) is computed using the binary operation of GG, whereas the operation on the right-hand side (ϕ(a)ϕ(b)\phi(a)\phi(b)) is computed using the binary operation of G‾\overline{G}.

    • Isomorphic groups share identical structural properties and differ only in the notation used for their elements and operations. An immediate consequence is that isomorphic groups must have identical orders: ∣G∣=∣G‾∣|G| = |\overline{G}|.

  • Operation Tables Under an Isomorphism:

    • If ϕ:G→G‾\phi: G \to \overline{G} is an isomorphism, the complete operation table of G‾\overline{G} is obtained directly from the operation table of GG by replacing each element entry xx with its image ϕ(x)\phi(x).

Operation table of GOperation table of G-bar
  • The Four Notational Cases for Operation Preservation:

    • Multiplicative to Multiplicative: When GG uses ⋅\cdot and G‾\overline{G} uses ⋅\cdot, operation preservation takes the form:     ϕ(a⋅b)=ϕ(a)⋅ϕ(b)\phi(a \cdot b) = \phi(a) \cdot \phi(b)

    • Multiplicative to Additive: When GG uses ⋅\cdot and G‾\overline{G} uses ++, operation preservation takes the form:     ϕ(a⋅b)=ϕ(a)+ϕ(b)\phi(a \cdot b) = \phi(a) + \phi(b)

    • Additive to Multiplicative: When GG uses ++ and G‾\overline{G} uses ⋅\cdot, operation preservation takes the form:     ϕ(a+b)=ϕ(a)⋅ϕ(b)\phi(a + b) = \phi(a) \cdot \phi(b)

    • Additive to Additive: When GG uses ++ and G‾\overline{G} uses ++, operation preservation takes the form:     ϕ(a+b)=ϕ(a)+ϕ(b)\phi(a + b) = \phi(a) + \phi(b)

  • Standard Four-Step Procedure to Prove G≈G‾G \approx \overline{G}:

    • Step 1 — "Mapping": Define a candidate function ϕ\phi from GG to G‾\overline{G}. Verify that ϕ\phi is well-defined (each input in GG yields a unique, unambiguous output in G‾\overline{G}).

    • Step 2 — "1–1" (Injectivity): Assume ϕ(a)=ϕ(b)\phi(a) = \phi(b) for a,b∈Ga, b \in G, and prove algebraically that a=ba = b.

    • Step 3 — "Onto" (Surjectivity): Given an arbitrary element g‾∈G‾\overline{g} \in \overline{G}, find an element g∈Gg \in G such that ϕ(g)=g‾\phi(g) = \overline{g}.

    • Step 4 — "O.P." (Operation-Preserving): Prove that for all a,b∈Ga, b \in G, ϕ(ab)=ϕ(a)ϕ(b)\phi(ab) = \phi(a)\phi(b) according to the designated operations of GG and G‾\overline{G}.

  • Prototypical Isomorphism Examples:

    • Additive Reals to Multiplicative Positive Reals:

    • Let G=(R,+)G = (\mathbb{R}, +) and G‾=(R+,⋅)\overline{G} = (\mathbb{R}^+, \cdot). The function ϕ(x)=2x\phi(x) = 2^x establishes G≈G‾G \approx \overline{G}.

    • Step 1 (Mapping): For any x∈Rx \in \mathbb{R}, 2x2^x is a strictly positive real number.

    • Step 2 (1–1): If ϕ(x)=ϕ(y)\phi(x) = \phi(y), then 2x=2y2^x = 2^y. Taking the logarithm base 2 yields log⁡2(2x)=log⁡2(2y)\log_2(2^x) = \log_2(2^y), so x=yx = y.

    • Step 3 (Onto): Given any y∈R+y \in \mathbb{R}^+, choose x=log⁡2(y)∈Rx = \log_2(y) \in \mathbb{R}. Then ϕ(x)=2log⁡2(y)=y\phi(x) = 2^{\log_2(y)} = y.

    • Step 4 (O.P.): For any x,y∈Rx, y \in \mathbb{R}, ϕ(x+y)=2x+y=2x⋅2y=ϕ(x)ϕ(y)\phi(x + y) = 2^{x+y} = 2^x \cdot 2^y = \phi(x)\phi(y).

    • Cyclic Groups:

    • Any infinite cyclic group ⟨a⟩\langle a \rangle is isomorphic to (Z,+)(\mathbb{Z}, +) under the mapping ak↦ka^k \mapsto k.

    • Any finite cyclic group ⟨a⟩\langle a \rangle of order nn is isomorphic to (Zn,+)(\mathbb{Z}_n, +) under the mapping ak↦k(modn)a^k \mapsto k \pmod n.

    • Consequently, U(10)={1,3,7,9}U(10) = \{1, 3, 7, 9\} and U(5)={1,2,3,4}U(5) = \{1, 2, 3, 4\} are both cyclic groups of order 4, which implies:       U(10)≈Z4andU(5)≈Z4U(10) \approx \mathbb{Z}_4 \quad \text{and} \quad U(5) \approx \mathbb{Z}_4

    • Matrix Conjugation:

    • Let G=SL(2,R)G = SL(2, \mathbb{R}) (the special linear group of 2×22 \times 2 real matrices with determinant 1). For a fixed matrix M∈GM \in G, define the conjugation mapping ϕM(A)=MAM−1\phi_M(A) = MAM^{-1} for all A∈GA \in G.

    • Function Verification: det⁡(MAM−1)=det⁡(M)det⁡(A)det⁡(M)−1=1⋅1⋅1=1\det(MAM^{-1}) = \det(M)\det(A)\det(M)^{-1} = 1 \cdot 1 \cdot 1 = 1, so MAM−1∈GMAM^{-1} \in G.

    • 1–1: If ϕM(A)=ϕM(B)\phi_M(A) = \phi_M(B), then MAM−1=MBM−1MAM^{-1} = MBM^{-1}. Multiplying on the left by M−1M^{-1} and on the right by MM yields A=BA = B.

    • Onto: For any B∈GB \in G, set A=M−1BM∈GA = M^{-1}BM \in G. Then ϕM(A)=M(M−1BM)M−1=B\phi_M(A) = M(M^{-1}BM)M^{-1} = B.

    • Operation-Preserving: For A,B∈GA, B \in G, ϕM(AB)=M(AB)M−1=MA(M−1M)BM−1=(MAM−1)(MBM−1)=ϕM(A)ϕM(B)\phi_M(AB) = M(AB)M^{-1} = MA(M^{-1}M)BM^{-1} = (MAM^{-1})(MBM^{-1}) = \phi_M(A)\phi_M(B).

  • Demonstrating Non-Isomorphism:

    • Bijective Map Failing Operation Preservation:

    • The function ϕ:(R,+)→(R,+)\phi: (\mathbb{R}, +) \to (\mathbb{R}, +) defined by ϕ(x)=x3\phi(x) = x^3 is strictly increasing (hence 1–1) and covers all real numbers (hence onto).

    • However, it is not an isomorphism because (x+y)3≠x3+y3(x + y)^3 \ne x^3 + y^3 in general (for instance, ϕ(1+1)=23=8\phi(1 + 1) = 2^3 = 8, whereas ϕ(1)+ϕ(1)=1+1=2\phi(1) + \phi(1) = 1 + 1 = 2).

    • Non-Isomorphism Between (Q,+)(\mathbb{Q}, +) and (Q∗,⋅)(\mathbb{Q}^*, \cdot):

    • Suppose an isomorphism ϕ:(Q,+)→(Q∗,⋅)\phi: (\mathbb{Q}, +) \to (\mathbb{Q}^*, \cdot) exists.

    • Since ϕ\phi is onto, there exists some rational a∈Qa \in \mathbb{Q} such that ϕ(a)=−1\phi(a) = -1.

    • Decomposing a=12a+12aa = \frac{1}{2}a + \frac{1}{2}a, the operation-preserving property forces:       −1=ϕ(a)=ϕ(12a+12a)=ϕ(12a)⋅ϕ(12a)=[ϕ(12a)]2-1 = \phi(a) = \phi\left(\frac{1}{2}a + \frac{1}{2}a\right) = \phi\left(\frac{1}{2}a\right) \cdot \phi\left(\frac{1}{2}a\right) = \left[\phi\left(\frac{1}{2}a\right)\right]^2

    • This requires the existence of a rational number whose square equals −1-1, which is impossible in Q\mathbb{Q}. Thus, no such isomorphism can exist.

  • Properties of Isomorphisms Acting on Elements:

    • Let ϕ:G→G‾\phi: G \to \overline{G} be an isomorphism. The following properties hold:

    1. Identity Preservation: ϕ(e)=e′\phi(e) = e', where ee and e′e' are the identities of GG and G‾\overline{G}, respectively.

      • Proof: Because e=eee = ee, ϕ(e)=ϕ(ee)=ϕ(e)ϕ(e)\phi(e) = \phi(ee) = \phi(e)\phi(e). Multiplying by the identity of G‾\overline{G} gives e′ϕ(e)=ϕ(e)ϕ(e)e'\phi(e) = \phi(e)\phi(e). By right cancellation in G‾\overline{G}, e′=ϕ(e)e' = \phi(e).

    2. Power Preservation: For every integer nn and any element a∈Ga \in G, ϕ(an)=(ϕ(a))n\phi(a^n) = (\phi(a))^n (in additive notation, ϕ(na)=nϕ(a)\phi(na) = n\phi(a)).

      • Proof for n>0n > 0: By induction. Base case n=1n = 1 holds trivially. Assume ϕ(gn)=(ϕ(g))n\phi(g^n) = (\phi(g))^n. Then ϕ(gn+1)=ϕ(gng)=ϕ(gn)ϕ(g)=(ϕ(g))nϕ(g)=(ϕ(g))n+1\phi(g^{n+1}) = \phi(g^n g) = \phi(g^n)\phi(g) = (\phi(g))^n\phi(g) = (\phi(g))^{n+1}.

      • Proof for n<0n < 0: If n<0n < 0, then −n>0-n > 0. Because gng−n=eg^n g^{-n} = e, e′=ϕ(e)=ϕ(gng−n)=ϕ(gn)ϕ(g−n)=ϕ(gn)(ϕ(g))−ne' = \phi(e) = \phi(g^n g^{-n}) = \phi(g^n)\phi(g^{-n}) = \phi(g^n)(\phi(g))^{-n}. Multiplying on the right by (ϕ(g))n(\phi(g))^n gives ϕ(gn)=(ϕ(g))n\phi(g^n) = (\phi(g))^n.

      • Proof for n=0n = 0: ϕ(g0)=ϕ(e)=e′=(ϕ(g))0\phi(g^0) = \phi(e) = e' = (\phi(g))^0.

    3. Commutativity Preservation: Elements a,b∈Ga, b \in G commute if and only if ϕ(a)\phi(a) and ϕ(b)\phi(b) commute in G‾\overline{G}.

    4. Generator Preservation: G=⟨a⟩G = \langle a \rangle if and only if G‾=⟨ϕ(a)⟩\overline{G} = \langle \phi(a) \rangle.

      • Proof (⇒\Rightarrow): Every element of GG has the form aka^k. Since ϕ\phi is onto, every element of G‾\overline{G} is ϕ(ak)=(ϕ(a))k\phi(a^k) = (\phi(a))^k, so G‾=⟨ϕ(a)⟩\overline{G} = \langle \phi(a) \rangle.

      • Proof (⇐\Leftarrow): If G‾=⟨ϕ(a)⟩\overline{G} = \langle \phi(a) \rangle, take b∈Gb \in G. Then ϕ(b)=(ϕ(a))k=ϕ(ak)\phi(b) = (\phi(a))^k = \phi(a^k) for some kk. Because ϕ\phi is 1–1, b=akb = a^k, meaning G=⟨a⟩G = \langle a \rangle.

    5. Order Preservation: For all a∈Ga \in G, ∣a∣=∣ϕ(a)∣|a| = |\phi(a)|.

    6. Equation Solution Invariance: For a fixed integer kk and element b∈Gb \in G, the equation xk=bx^k = b has exactly the same number of solutions in GG as the equation xk=ϕ(b)x^k = \phi(b) has in G‾\overline{G}.

    7. Order Spectrum Invariance: If GG is finite, GG and G‾\overline{G} possess exactly the same number of elements of every order.

  • Properties of Isomorphisms Acting on Groups:

    • Let ϕ:G→G′\phi: G \to G' be an isomorphism. The following hold:

    1. Inverse Map is an Isomorphism: The inverse function ϕ−1:G′→G\phi^{-1}: G' \to G is also an isomorphism.

      • Proof: Bijectivity follows from the bijectivity of ϕ\phi. For x,y∈G′x, y \in G', let x=ϕ(a)x = \phi(a) and y=ϕ(b)y = \phi(b). Then ϕ−1(xy)=ϕ−1(ϕ(a)ϕ(b))=ϕ−1(ϕ(ab))=ab=ϕ−1(x)ϕ−1(y)\phi^{-1}(xy) = \phi^{-1}(\phi(a)\phi(b)) = \phi^{-1}(\phi(ab)) = ab = \phi^{-1}(x)\phi^{-1}(y).

    2. Abelian Property: GG is Abelian if and only if G′G' is Abelian.

      • Proof (⇒\Rightarrow): For x,y∈G′x, y \in G', x=ϕ(a)x = \phi(a), y=ϕ(b)y = \phi(b). Then xy=ϕ(a)ϕ(b)=ϕ(ab)=ϕ(ba)=ϕ(b)ϕ(a)=yxxy = \phi(a)\phi(b) = \phi(ab) = \phi(ba) = \phi(b)\phi(a) = yx.

      • Proof (⇐\Leftarrow): If G′G' is Abelian, ϕ(ab)=ϕ(a)ϕ(b)=ϕ(b)ϕ(a)=ϕ(ba)\phi(ab) = \phi(a)\phi(b) = \phi(b)\phi(a) = \phi(ba). Because ϕ\phi is 1–1, ab=baab = ba.

    3. Cyclic Property: GG is cyclic if and only if G′G' is cyclic.

    4. Subgroup Image: If K≤GK \le G, then ϕ(K)={ϕ(k)∣k∈K}\phi(K) = \{\phi(k) \mid k \in K\} is a subgroup of G′G'.

      • Proof: Since e∈Ke \in K, e′=ϕ(e)∈ϕ(K)e' = \phi(e) \in \phi(K). For x,y∈ϕ(K)x, y \in \phi(K), write x=ϕ(a)x = \phi(a) and y=ϕ(b)y = \phi(b) with a,b∈Ka, b \in K. Since KK is a subgroup, ab−1∈Kab^{-1} \in K. Thus xy−1=ϕ(a)(ϕ(b))−1=ϕ(ab−1)∈ϕ(K)xy^{-1} = \phi(a)(\phi(b))^{-1} = \phi(ab^{-1}) \in \phi(K). By the one-step subgroup test, ϕ(K)≤G′\phi(K) \le G'.

    5. Subgroup Preimage: If K′≤G′K' \le G', then ϕ−1(K′)={g∈G∣ϕ(g)∈K′}\phi^{-1}(K') = \{g \in G \mid \phi(g) \in K'\} is a subgroup of GG.

    6. Center Preservation: ϕ(Z(G))=Z(G′)\phi(Z(G)) = Z(G').

  • Tests for Establishing Non-Isomorphism:

    • To demonstrate that two groups GG and G‾\overline{G} are not isomorphic, show that they differ in at least one structural invariant:

    1. ∣G∣≠∣G‾∣|G| \ne |\overline{G}|.

    2. One group is cyclic and the other is not.

    3. One group is Abelian and the other is non-Abelian.

    4. The maximum element order in GG differs from that in G‾\overline{G}.

    5. The number of elements of some specific order (frequently order 2) differs between the groups.

  • Example (Groups of Order 12): Consider Z12\mathbb{Z}_{12}, D6D_6, and A4A_4. The maximum element orders are 12, 6, and 3, respectively. Hence, no two are isomorphic. Alternatively, the number of elements of order 2 is 1 in Z12\mathbb{Z}_{12}, 7 in D6D_6, and 3 in A4A_4.

  • Example (Q\mathbb{Q} vs Q∗\mathbb{Q}^*): In (Q,+)(\mathbb{Q}, +), every non-identity element has infinite order (nx=0  ⟺  n=0nx = 0 \iff n = 0 or x=0x = 0). In (Q∗,⋅)(\mathbb{Q}^*, \cdot), the element −1-1 has order 2 (∣−1∣=2|-1| = 2). Thus, Q≉Q∗\mathbb{Q} \not\approx \mathbb{Q}^*.

  • Automorphisms and Inner Automorphisms:

    • Automorphism: An isomorphism from a group GG onto itself is called an automorphism of GG.

    • Complex conjugation ϕ(a+bi)=a−bi\phi(a + bi) = a - bi is an automorphism of (C,+)(\mathbb{C}, +) and of (C∗,⋅)(\mathbb{C}^*, \cdot).

    • The map ϕ(a,b)=(b,a)\phi(a, b) = (b, a) (reflection across y=xy = x) is an automorphism of (R2,+)(\mathbb{R}^2, +). Any rotation or reflection through the origin is an automorphism of R2\mathbb{R}^2.

    • Inner Automorphism: For any group GG and a fixed a∈Ga \in G, the function ϕa:G→G\phi_a: G \to G defined by:     ϕa(x)=axa−1\phi_a(x) = axa^{-1}     is the inner automorphism induced by aa.

    • Automorphism Groups:

    • Aut(G)\text{Aut}(G) denotes the set of all automorphisms of GG.

    • Inn(G)\text{Inn}(G) denotes the set of all inner automorphisms of GG.

    • Both Aut(G)\text{Aut}(G) and Inn(G)\text{Inn}(G) form groups under the operation of function composition.

    • Generating Isomorphic Subgroups: Inner automorphisms produce isomorphic copies of a subgroup inside a parent group. In S4S_4, consider the subgroup:     H={(1),(1234),(13)(24),(1432),(12)(34),(24),(14)(23),(13)}H = \{(1), (1234), (13)(24), (1432), (12)(34), (24), (14)(23), (13)\}     Conjugating HH yields distinct, isomorphic subgroups:     (12)H(21)={(1),(1342),(14)(23),(1234),(12)(34),(14),(13)(24),(23)}(12)H(21) = \{(1), (1342), (14)(23), (1234), (12)(34), (14), (13)(24), (23)\}     (123)H(321)={(1),(1423),(12)(34),(1324),(14)(23),(34),(13)(24),(12)}(123)H(321) = \{(1), (1423), (12)(34), (1324), (14)(23), (34), (13)(24), (12)\}

  • The Automorphism Group of Zn\mathbb{Z}_n:

    • Since any endomorphism α\alpha of Zn\mathbb{Z}_n satisfies α(k)=kα(1)\alpha(k) = k\alpha(1), α\alpha is completely determined by α(1)\alpha(1).

    • Because α\alpha must preserve orders, ∣α(1)∣=∣1∣=n|\alpha(1)| = |1| = n, which requires gcd⁡(α(1),n)=1\gcd(\alpha(1), n) = 1. Thus, α(1)∈U(n)\alpha(1) \in U(n).

    • Theorem (Aut(Zn)≈U(n)\text{Aut}(\mathbb{Z}_n) \approx U(n)):

    • For every positive integer nn, Aut(Zn)≈U(n)\text{Aut}(\mathbb{Z}_n) \approx U(n).

    • Proof: Define T:Aut(Zn)→U(n)T: \text{Aut}(\mathbb{Z}_n) \to U(n) by T(α)=α(1)T(\alpha) = \alpha(1).

      • 1–1: If T(α)=T(β)T(\alpha) = T(\beta), then α(1)=β(1)\alpha(1) = \beta(1), which implies α(k)=kα(1)=kβ(1)=β(k)\alpha(k) = k\alpha(1) = k\beta(1) = \beta(k) for all kk, so α=β\alpha = \beta.

      • Onto: For any r∈U(n)r \in U(n), define αr(k)=kr(modn)\alpha_r(k) = kr \pmod n. This map is well-defined, operation-preserving, and invertible (via r−1∈U(n)r^{-1} \in U(n)). Hence αr∈Aut(Zn)\alpha_r \in \text{Aut}(\mathbb{Z}_n) with T(αr)=rT(\alpha_r) = r.

      • Operation-Preserving: T(αβ)=(αβ)(1)=α(β(1))=β(1)α(1)=α(1)β(1)=T(α)T(β)T(\alpha\beta) = (\alpha\beta)(1) = \alpha(\beta(1)) = \beta(1)\alpha(1) = \alpha(1)\beta(1) = T(\alpha)T(\beta).

    • Example (Aut(Z10)\text{Aut}(\mathbb{Z}_{10})):

    • Candidates for α(1)\alpha(1) are U(10)={1,3,7,9}U(10) = \{1, 3, 7, 9\}, giving four automorphisms α1,α3,α7,α9\alpha_1, \alpha_3, \alpha_7, \alpha_9.

    • Calculating powers: (α3∘α3)(1)=α3(3)=9=α9(1)(\alpha_3 \circ \alpha_3)(1) = \alpha_3(3) = 9 = \alpha_9(1), so α32=α9\alpha_3^2 = \alpha_9. Similarly, α33=α7\alpha_3^3 = \alpha_7 and α34=α1\alpha_3^4 = \alpha_1.

    • Thus, Aut(Z10)\text{Aut}(\mathbb{Z}_{10}) is a cyclic group of order 4 generated by α3\alpha_3, confirming Aut(Z10)≈U(10)\text{Aut}(\mathbb{Z}_{10}) \approx U(10).

  • Cayley’s Theorem:

    • Theorem: Every group is isomorphic to a group of permutations.

    • Proof:

    • Let GG be any group. For each g∈Gg \in G, define the left-multiplication function Tg:G→GT_g: G \to G by Tg(x)=gxT_g(x) = gx for all x∈Gx \in G.

    • Injectivity of TgT_g: If Tg(x)=Tg(y)T_g(x) = T_g(y), then gx=gygx = gy, so x=yx = y.

    • Surjectivity of TgT_g: For any y∈Gy \in G, Tg(g−1y)=g(g−1y)=yT_g(g^{-1}y) = g(g^{-1}y) = y. Hence TgT_g is a permutation on the set GG.

    • Set G‾={Tg∣g∈G}\overline{G} = \{T_g \mid g \in G\}. Note that TgTh(x)=Tg(hx)=g(hx)=(gh)x=Tgh(x)T_g T_h(x) = T_g(hx) = g(hx) = (gh)x = T_{gh}(x), so TgTh=TghT_g T_h = T_{gh}. This shows G‾\overline{G} is closed under composition, contains Te=idT_e = \text{id}, and possesses inverses (Tg)−1=Tg−1(T_g)^{-1} = T_{g^{-1}}.

    • Define ϕ:G→G‾\phi: G \to \overline{G} by ϕ(g)=Tg\phi(g) = T_g.

      • 1–1: If Tg=ThT_g = T_h, then Tg(e)=Th(e)  ⟹  ge=he  ⟹  g=hT_g(e) = T_h(e) \implies ge = he \implies g = h.

      • Onto: By construction, every element of G‾\overline{G} is TgT_g for some g∈Gg \in G.

      • O.P.: ϕ(gh)=Tgh=TgTh=ϕ(g)ϕ(h)\phi(gh) = T_{gh} = T_g T_h = \phi(g)\phi(h).

    • Thus, ϕ\phi is an isomorphism, and G‾\overline{G} is the left regular representation of GG.

    • Application to U(12)={1,5,7,11}U(12) = \{1, 5, 7, 11\}:

    • Expressing the permutations in array notation:       T1=(1571115711),T5=(1571151117)T_1 = \begin{pmatrix} 1 & 5 & 7 & 11 \\ 1 & 5 & 7 & 11 \end{pmatrix}, \quad T_5 = \begin{pmatrix} 1 & 5 & 7 & 11 \\ 5 & 1 & 11 & 7 \end{pmatrix}       T7=(1571171115),T11=(1571111751)T_7 = \begin{pmatrix} 1 & 5 & 7 & 11 \\ 7 & 11 & 1 & 5 \end{pmatrix}, \quad T_{11} = \begin{pmatrix} 1 & 5 & 7 & 11 \\ 11 & 7 & 5 & 1 \end{pmatrix}

    • The operation table of U(12)‾={T1,T5,T7,T11}\overline{U(12)} = \{T_1, T_5, T_7, T_{11}\} is identical to that of U(12)U(12).

External Direct Products of Groups

  • Definition and Group Structure:

    • Let G1,G2,…,GnG_1, G_2, \dots, G_n be a finite collection of groups. The external direct product, denoted G1⊕G2⊕⋯⊕GnG_1 \oplus G_2 \oplus \dots \oplus G_n, is the set of all nn-tuples:     G1⊕G2⊕⋯⊕Gn={(g1,g2,…,gn)∣gi∈Gi}G_1 \oplus G_2 \oplus \dots \oplus G_n = \{(g_1, g_2, \dots, g_n) \mid g_i \in G_i\}

    • The operation is performed componentwise:     (g1,g2,…,gn)(g1′,g2′,…,gn′)=(g1g1′,g2g2′,…,gngn′)(g_1, g_2, \dots, g_n)(g'_1, g'_2, \dots, g'_n) = (g_1 g'_1, g_2 g'_2, \dots, g_n g'_n)     where each product gigi′g_i g'_i utilizes the specific binary operation of GiG_i.

    • The resulting structure is itself a group, with identity (e1,e2,…,en)(e_1, e_2, \dots, e_n) and inverses (g1,…,gn)−1=(g1−1,…,gn−1)(g_1, \dots, g_n)^{-1} = (g_1^{-1}, \dots, g_n^{-1}).

    • If each GiG_i is finite, the order of the direct product is the product of the individual orders:     ∣G1⊕G2⊕⋯⊕Gn∣=∣G1∣∣G2∣⋯∣Gn∣|G_1 \oplus G_2 \oplus \dots \oplus G_n| = |G_1| |G_2| \cdots |G_n|

    • Common example: Rn=R⊕⋯⊕R\mathbb{R}^n = \mathbb{R} \oplus \dots \oplus \mathbb{R} under vector addition.

  • Computational Examples:

    • Multiplication in U(8)⊕U(10)U(8) \oplus U(10):

    • In U(8)⊕U(10)U(8) \oplus U(10), the product (3,7)(7,9)(3, 7)(7, 9) is evaluated componentwise:       3⋅7(mod8)=21(mod8)=53 \cdot 7 \pmod 8 = 21 \pmod 8 = 5       7⋅9(mod10)=63(mod10)=37 \cdot 9 \pmod{10} = 63 \pmod{10} = 3

    • Thus, (3,7)(7,9)=(5,3)(3, 7)(7, 9) = (5, 3).

    • Cyclicity of Z2⊕Z3\mathbb{Z}_2 \oplus \mathbb{Z}_3:

    • The elements of Z2⊕Z3\mathbb{Z}_2 \oplus \mathbb{Z}_3 are:       {(0,0),(0,1),(0,2),(1,0),(1,1),(1,2)}\{(0, 0), (0, 1), (0, 2), (1, 0), (1, 1), (1, 2)\}

    • Computing successive multiples of (1,1)(1, 1) under addition:       1(1,1)=(1,1),2(1,1)=(0,2),3(1,1)=(1,0)1(1, 1) = (1, 1), \quad 2(1, 1) = (0, 2), \quad 3(1, 1) = (1, 0)       4(1,1)=(0,1),5(1,1)=(1,2),6(1,1)=(0,0)4(1, 1) = (0, 1), \quad 5(1, 1) = (1, 2), \quad 6(1, 1) = (0, 0)

    • Because ⟨(1,1)⟩\langle (1, 1) \rangle contains all 6 elements, Z2⊕Z3\mathbb{Z}_2 \oplus \mathbb{Z}_3 is cyclic, meaning Z2⊕Z3≈Z6\mathbb{Z}_2 \oplus \mathbb{Z}_3 \approx \mathbb{Z}_6.

  • Classification of Groups of Order 4:

    • Any group GG of order 4 is isomorphic to either Z4\mathbb{Z}_4 or Z2⊕Z2\mathbb{Z}_2 \oplus \mathbb{Z}_2.

    • Proof: By Lagrange’s Theorem, the non-identity elements have order 2 or 4. If GG contains an element of order 4, GG is cyclic and G≈Z4G \approx \mathbb{Z}_4. If no element has order 4, all non-identity elements have order 2. Let a,b∈Ga, b \in G be distinct non-identity elements. By cancellation, ab≠aab \ne a, ab≠bab \ne b, and ab≠eab \ne e (since a=b−1=ba = b^{-1} = b is a contradiction). Thus G={e,a,b,ab}G = \{e, a, b, ab\}. Because every non-identity element has order 2, ab=(ab)−1=b−1a−1=baab = (ab)^{-1} = b^{-1}a^{-1} = ba. The operation table is uniquely fixed and matches that of Z2⊕Z2\mathbb{Z}_2 \oplus \mathbb{Z}_2.

  • Order of an Element in a Direct Product:

    • Theorem: The order of an element in an external direct product of a finite number of finite groups is the least common multiple of the orders of its components:     ∣(g1,g2,…,gn)∣=lcm(∣g1∣,∣g2∣,…,∣gn∣)|(g_1, g_2, \dots, g_n)| = \text{lcm}(|g_1|, |g_2|, \dots, |g_n|)

    • Proof: Let s=lcm(∣g1∣,…,∣gn∣)s = \text{lcm}(|g_1|, \dots, |g_n|) and t=∣(g1,…,gn)∣t = |(g_1, \dots, g_n)|. Because ss is a multiple of each ∣gi∣|g_i|, (g1,…,gn)s=(g1s,…,gns)=(e1,…,en)(g_1, \dots, g_n)^s = (g_1^s, \dots, g_n^s) = (e_1, \dots, e_n), which implies t≤st \le s. Conversely, (g1,…,gn)t=(e1,…,en)(g_1, \dots, g_n)^t = (e_1, \dots, e_n) implies git=eig_i^t = e_i for each ii, so tt must be a common multiple of all ∣gi∣|g_i|. Therefore, s≤ts \le t, proving s=ts = t.

  • Distinguishing Non-Isomorphic Groups of Order 100:

    • Groups of order 100 include: Z100\mathbb{Z}_{100}, Z25⊕Z2⊕Z2\mathbb{Z}_{25} \oplus \mathbb{Z}_2 \oplus \mathbb{Z}_2, Z5⊕Z5⊕Z4\mathbb{Z}_5 \oplus \mathbb{Z}_5 \oplus \mathbb{Z}_4, Z5⊕Z5⊕Z2⊕Z2\mathbb{Z}_5 \oplus \mathbb{Z}_5 \oplus \mathbb{Z}_2 \oplus \mathbb{Z}_2, D50D_{50}, D10⊕Z5D_{10} \oplus \mathbb{Z}_5, D5⊕Z10D_5 \oplus \mathbb{Z}_{10}, and D5⊕D5D_5 \oplus D_5.

    • These are proven pairwise non-isomorphic by comparing their maximum element orders (determined via lcm of component orders) alongside Abelian and non-Abelian traits.

  • Counting Elements and Subgroups in Direct Products:

    • Elements of Order 5 in Zm⊕Zn\mathbb{Z}_m \oplus \mathbb{Z}_n (with 5∣m5 \mid m and 5∣n5 \mid n):

    • To achieve ∣(a,b)∣=lcm(∣a∣,∣b∣)=5|(a, b)| = \text{lcm}(|a|, |b|) = 5, the orders ∣a∣|a| and ∣b∣|b| must belong to (1,5)(1, 5), excluding the identity (0,0)(0, 0).

    • Since Zm\mathbb{Z}_m and Zn\mathbb{Z}_n each possess a unique cyclic subgroup of order 5, there are 5 choices for aa and 5 choices for bb, yielding 5×5=255 \times 5 = 25 pairs.

    • Excluding (0,0)(0, 0) gives:       Number of elements of order 5=25−1=24\text{Number of elements of order } 5 = 25 - 1 = 24

    • General formula: If p∣mp \mid m and p∣np \mid n for a prime pp, the number of elements of order pp in Zm⊕Zn\mathbb{Z}_m \oplus \mathbb{Z}_n is p2−1p^2 - 1.

    • Cyclic Subgroups of Order 10 in Z150⊕Z50\mathbb{Z}_{150} \oplus \mathbb{Z}_{50}:

    • Any element of order 10 satisfies ∣a∣∈{1,2,5,10}|a| \in \{1, 2, 5, 10\} and ∣b∣∈{1,2,5,10}|b| \in \{1, 2, 5, 10\}, restricting (a,b)(a, b) to ⟨15⟩⊕⟨5⟩≈Z10⊕Z10\langle 15 \rangle \oplus \langle 5 \rangle \approx \mathbb{Z}_{10} \oplus \mathbb{Z}_{10}.

    • In Z10⊕Z10\mathbb{Z}_{10} \oplus \mathbb{Z}_{10} (100 elements total), subtract elements of non-10 orders:

      • Order 1: 1 element ((0,0)(0, 0)).

      • Order 5: 52−1=245^2 - 1 = 24 elements.

      • Order 2: 22−1=32^2 - 1 = 3 elements.

      • Order 10 elements: 100−24−3−1=72100 - 24 - 3 - 1 = 72.

    • Each cyclic subgroup of order 10 has ϕ(10)=4\phi(10) = 4 generators, and distinct cyclic subgroups intersect at non-generator elements. Thus:       Number of cyclic subgroups of order 10=724=18\text{Number of cyclic subgroups of order } 10 = \frac{72}{4} = 18

    • Elements of Order 2 in D4⊕Z4D_4 \oplus \mathbb{Z}_4:

    • Condition: lcm(∣a∣,∣b∣)=2\text{lcm}(|a|, |b|) = 2, meaning ∣a∣∈{1,2}|a| \in \{1, 2\} and ∣b∣∈{1,2}|b| \in \{1, 2\}, excluding (e,0)(e, 0).

    • In D4D_4 (order 8), the elements of order ≤2\le 2 are the identity, R180R_{180}, and the five reflections (total 6 elements).

    • In Z4\mathbb{Z}_4, elements of order ≤2\le 2 are (0,2)(0, 2) (total 2 elements).

    • Total pairs with ∣a∣,∣b∣≤2|a|, |b| \le 2 is 6×2=126 \times 2 = 12. Excluding the identity gives:       Elements of order 2=12−1=11\text{Elements of order } 2 = 12 - 1 = 11

    • Specifying Subgroups:

    • For each divisor rr of mm and ss of nn, Zm⊕Zn\mathbb{Z}_m \oplus \mathbb{Z}_n has a subgroup isomorphic to Zr⊕Zs\mathbb{Z}_r \oplus \mathbb{Z}_s.

    • Example: To find a subgroup of Z30⊕Z12\mathbb{Z}_{30} \oplus \mathbb{Z}_{12} isomorphic to Z6⊕Z4\mathbb{Z}_6 \oplus \mathbb{Z}_4, locate ⟨5⟩≤Z30\langle 5 \rangle \le \mathbb{Z}_{30} (order 6) and ⟨3⟩≤Z12\langle 3 \rangle \le \mathbb{Z}_{12} (order 4). The external product ⟨5⟩⊕⟨3⟩\langle 5 \rangle \oplus \langle 3 \rangle is the desired subgroup.

  • Criteria for Direct Products to Be Cyclic:

    • Theorem (G⊕HG \oplus H Cyclic): Let GG and HH be finite cyclic groups. Then G⊕HG \oplus H is cyclic if and only if ∣G∣|G| and ∣H∣|H| are relatively prime (gcd⁡(∣G∣,∣H∣)=1\gcd(|G|, |H|) = 1).

    • Proof (⇒\Rightarrow): Let ∣G∣=m|G| = m, ∣H∣=n|H| = n. If G⊕HG \oplus H is cyclic, it has an element (g,h)(g, h) of order mnmn. Let d=gcd⁡(m,n)d = \gcd(m, n). Then:       (g,h)mnd=((gm)nd,(hn)md)=(e,e)(g, h)^{\frac{mn}{d}} = \left((g^m)^{\frac{n}{d}}, (h^n)^{\frac{m}{d}}\right) = (e, e)       Hence mn=∣(g,h)∣≤mndmn = |(g, h)| \le \frac{mn}{d}, which forces d=1d = 1.

    • Proof (⇐\Leftarrow): If gcd⁡(m,n)=1\gcd(m, n) = 1, where G=⟨g⟩G = \langle g \rangle and H=⟨h⟩H = \langle h \rangle, then ∣(g,h)∣=lcm(m,n)=mn=∣G⊕H∣|(g, h)| = \text{lcm}(m, n) = mn = |G \oplus H|, so (g,h)(g, h) generates the group.

    • Corollary 1 (nn-Factor Cyclic Product): An external direct product G1⊕G2⊕⋯⊕GnG_1 \oplus G_2 \oplus \dots \oplus G_n of finite cyclic groups is cyclic if and only if gcd⁡(∣Gi∣,∣Gj∣)=1\gcd(|G_i|, |G_j|) = 1 whenever i≠ji \ne j.

  • Corollary 2 (Zm\mathbb{Z}_m Splitting): Let m=n1n2⋯nkm = n_1 n_2 \cdots n_k. Then:   Zm≈Zn1⊕Zn2⊕⋯⊕Znk\mathbb{Z}_m \approx \mathbb{Z}_{n_1} \oplus \mathbb{Z}_{n_2} \oplus \dots \oplus \mathbb{Z}_{n_k}   if and only if gcd⁡(ni,nj)=1\gcd(n_i, n_j) = 1 whenever i≠ji \ne j.

  • Regrouping Direct Products:

    • Permissible transformations: Z2⊕Z2⊕Z3⊕Z5≈Z2⊕Z6⊕Z5≈Z2⊕Z30\mathbb{Z}_2 \oplus \mathbb{Z}_2 \oplus \mathbb{Z}_3 \oplus \mathbb{Z}_5 \approx \mathbb{Z}_2 \oplus \mathbb{Z}_6 \oplus \mathbb{Z}_5 \approx \mathbb{Z}_2 \oplus \mathbb{Z}_{30}. Alternatively, Z2⊕Z3⊕Z2⊕Z5≈Z6⊕Z10\mathbb{Z}_2 \oplus \mathbb{Z}_3 \oplus \mathbb{Z}_2 \oplus \mathbb{Z}_5 \approx \mathbb{Z}_6 \oplus \mathbb{Z}_{10}. Hence Z2⊕Z30≈Z6⊕Z10\mathbb{Z}_2 \oplus \mathbb{Z}_{30} \approx \mathbb{Z}_6 \oplus \mathbb{Z}_{10}.

    • Invalid regrouping: Z2⊕Z30≉Z60\mathbb{Z}_2 \oplus \mathbb{Z}_{30} \not\approx \mathbb{Z}_{60}, since gcd⁡(2,30)=2≠1\gcd(2, 30) = 2 \ne 1.

  • Structure of U(n)U(n) via Direct Products:

    • Subgroup Uk(n)U_k(n): If k>1k > 1 is a proper divisor of nn, let:     Uk(n)={x∈U(n)∣x≡1(modk)}U_k(n) = \{x \in U(n) \mid x \equiv 1 \pmod k\}     Example: In U(105)U(105), U7(105)={1,8,22,29,43,64,71,92}U_7(105) = \{1, 8, 22, 29, 43, 64, 71, 92\}.

    • Decomposition Theorem: If ss and tt are relatively prime (gcd⁡(s,t)=1\gcd(s, t) = 1), then:     U(st)≈U(s)⊕U(t)U(st) \approx U(s) \oplus U(t)     Moreover, Us(st)≈U(t)U_s(st) \approx U(t) and Ut(st)≈U(s)U_t(st) \approx U(s).

    • Necessity of Coprimality: If gcd⁡(s,t)≠1\gcd(s, t) \ne 1, the theorem fails. For s=10,t=2s = 10, t = 2, ∣U(20)∣=8|U(20)| = 8, whereas ∣U(10)⊕U(2)∣=4⋅1=4|U(10) \oplus U(2)| = 4 \cdot 1 = 4. Since 8≠48 \ne 4, U(20)≉U(10)⊕U(2)U(20) \not\approx U(10) \oplus U(2).

  • Gauss's Classical Formulas (1801):

    • U(2)≈{0}U(2) \approx \{0\}

    • U(4)≈Z2U(4) \approx \mathbb{Z}_2

    • U(2n)≈Z2n−2⊕Z2U(2^n) \approx \mathbb{Z}_{2^{n-2}} \oplus \mathbb{Z}_2 for all n≥3n \ge 3

    • U(pn)≈Zpn−pn−1U(p^n) \approx \mathbb{Z}_{p^n - p^{n-1}} for any odd prime pp

  • Decomposition of U(105)U(105) and U(144)U(144):

    • For 105=3⋅5⋅7105 = 3 \cdot 5 \cdot 7:     U(105)≈U(3)⊕U(5)⊕U(7)≈Z2⊕Z4⊕Z6U(105) \approx U(3) \oplus U(5) \oplus U(7) \approx \mathbb{Z}_2 \oplus \mathbb{Z}_4 \oplus \mathbb{Z}_6

    • For 144=16⋅9144 = 16 \cdot 9:     U(144)≈U(16)⊕U(9)≈(Z4⊕Z2)⊕Z6U(144) \approx U(16) \oplus U(9) \approx (\mathbb{Z}_4 \oplus \mathbb{Z}_2) \oplus \mathbb{Z}_6

    • Because their direct product decompositions into cyclic groups are identical, U(105)≈U(144)U(105) \approx U(144).

    • From Z2⊕Z4⊕Z6\mathbb{Z}_2 \oplus \mathbb{Z}_4 \oplus \mathbb{Z}_6, the total order is 2⋅4⋅6=482 \cdot 4 \cdot 6 = 48, the element orders are divisors of 12, exactly 16 elements have order 12, and because Aut(Z105)≈U(105)\text{Aut}(\mathbb{Z}_{105}) \approx U(105), Z105\mathbb{Z}_{105} has exactly 16 automorphisms of order 12.

Normal Subgroups, Factor Groups, and Internal Direct Products

  • Normal Subgroups:

    • Definition: A subgroup HH of a group GG is called a normal subgroup of GG, denoted H◃GH \triangleleft G, if aH=HaaH = Ha for all a∈Ga \in G.

    • Normal Subgroup Test: A subgroup HH of GG is normal in GG if and only if xHx−1⊆HxHx^{-1} \subseteq H for all x∈Gx \in G.

    • Proof (⇒\Rightarrow): If H◃GH \triangleleft G, then for each x∈Gx \in G and h∈Hh \in H, there exists h′∈Hh' \in H such that xh=h′xxh = h'x. Thus xhx−1=h′∈Hxhx^{-1} = h' \in H, so xHx−1⊆HxHx^{-1} \subseteq H.

    • Proof (⇐\Leftarrow): Suppose xHx−1⊆HxHx^{-1} \subseteq H for all xx. For x=ax = a, aHa−1⊆H  ⟹  aH⊆HaaHa^{-1} \subseteq H \implies aH \subseteq Ha. For x=a−1x = a^{-1}, a−1Ha⊆H  ⟹  Ha⊆aHa^{-1}Ha \subseteq H \implies Ha \subseteq aH. Thus aH=HaaH = Ha.

    • Standard Families of Normal Subgroups:

    • Every subgroup of an Abelian group is normal (ah=ha  ⟹  aH=Haah = ha \implies aH = Ha).

    • The center Z(G)Z(G) of any group is normal (ah=haah = ha for all h∈Z(G)h \in Z(G)).

    • The alternating group AnA_n is normal in SnS_n ([Sn:An]=2[S_n : A_n] = 2).

    • In the dihedral group DnD_n, any subgroup consisting exclusively of rotations is normal (rotations commute, and for any reflection FF and rotation RR, FR=R−1FFR = R^{-1}F).

    • The special linear group SL(2,R)SL(2, \mathbb{R}) is normal in GL(2,R)GL(2, \mathbb{R}) because det⁡(xhx−1)=det⁡(x)det⁡(h)det⁡(x)−1=1\det(xhx^{-1}) = \det(x)\det(h)\det(x)^{-1} = 1.

    • Any unique subgroup of a given finite order in a group GG is normal (conjugation preserves order, so gHg−1=HgHg^{-1} = H by uniqueness).

    • Subgroup Product Theorem (HKHK):

    • If H◃GH \triangleleft G and K≤GK \le G, then HK={hk∣h∈H,k∈K}HK = \{hk \mid h \in H, k \in K\} is a subgroup of GG.

    • Proof: Let a=h1k1a = h_1 k_1 and b=h2k2b = h_2 k_2. Because HH is normal, k1k2−1h2−1=h′k1k2−1k_1 k_2^{-1} h_2^{-1} = h' k_1 k_2^{-1} for some h′∈Hh' \in H. Then:       ab−1=h1k1(h2k2)−1=h1k1k2−1h2−1=h1(h′k1k2−1)=(h1h′)(k1k2−1)∈HKab^{-1} = h_1 k_1 (h_2 k_2)^{-1} = h_1 k_1 k_2^{-1} h_2^{-1} = h_1 (h' k_1 k_2^{-1}) = (h_1 h')(k_1 k_2^{-1}) \in HK       By the one-step subgroup test, HK≤GHK \le G.

    • Subgroups of A4A_4:

    • The Klein four-subgroup H={(1),(12)(34),(13)(24),(14)(23)}H = \{(1), (12)(34), (13)(24), (14)(23)\} is normal in A4A_4 because it is the unique subgroup of order 4 in A4A_4.

    • None of the four subgroups of order 3 in A4A_4 is normal. If K≤A4K \le A_4 with ∣K∣=3|K| = 3 were normal, then H∩K={e}H \cap K = \{e\}, forcing ∣HK∣=4⋅3=12|HK| = 4 \cdot 3 = 12, meaning A4=HK≈H⊕KA_4 = HK \approx H \oplus K. Because HH and KK are Abelian, their direct product would be Abelian, contradicting that A4A_4 is non-Abelian.

  • Factor Groups (Quotient Groups):

    • Theorem: Let GG be a group and H◃GH \triangleleft G. The set of cosets G/H={aH∣a∈G}G/H = \{aH \mid a \in G\} forms a group under the operation:     (aH)(bH)=abH(aH)(bH) = abH

    • Proof:

    • Well-defined: If aH=a′HaH = a'H and bH=b′HbH = b'H, then a′=ah1a' = ah_1 and b′=bh2b' = bh_2 for h1,h2∈Hh_1, h_2 \in H. Because H◃GH \triangleleft G, h1b=bh3h_1 b = b h_3 for some h3∈Hh_3 \in H. Then a′b′=ah1bh2=abh3h2∈abHa'b' = ah_1 bh_2 = a b h_3 h_2 \in abH. Thus a′b′H=abHa'b'H = abH.

    • Identity: The coset eH=HeH = H serves as the identity: (aH)(eH)=aeH=aH(aH)(eH) = aeH = aH.

    • Inverses: (aH)(a−1H)=aa−1H=eH=H(aH)(a^{-1}H) = aa^{-1}H = eH = H, so (aH)−1=a−1H(aH)^{-1} = a^{-1}H.

    • Associativity: Follows from the associativity of GG.

    • Factor Group Examples:

    • In Z\mathbb{Z}, the factor group Z/4Z\mathbb{Z}/4\mathbb{Z} has cosets 0+4Z0 + 4\mathbb{Z}, 1+4Z1 + 4\mathbb{Z}, 2+4Z2 + 4\mathbb{Z}, 3+4Z3 + 4\mathbb{Z}. The operation table matches Z4\mathbb{Z}_4, and in general:       Z/nZ≈Zn\mathbb{Z}/n\mathbb{Z} \approx \mathbb{Z}_n

    • In Z18/⟨6⟩\mathbb{Z}_{18}/\langle 6 \rangle, with H=⟨6⟩={0,6,12}H = \langle 6 \rangle = \{0, 6, 12\}, the factor group has order 18/3=618/3 = 6. Adding cosets: (5+H)+(4+H)=9+H=3+6+H=3+H(5 + H) + (4 + H) = 9 + H = 3 + 6 + H = 3 + H.

    • Dual Meaning of ∣aH∣|aH|:

      • As a set: ∣3+H∣=∣{3,9,15}∣=3|3 + H| = |\{3, 9, 15\}| = 3.

      • As an element of G/HG/H: 3+H3 + H has order 2, because (3+H)+(3+H)=6+H=0+H(3 + H) + (3 + H) = 6 + H = 0 + H.

  • The G/ZG/Z Theorem:

    • Theorem: Let GG be a group and Z(G)Z(G) its center. If G/Z(G)G/Z(G) is cyclic, then GG is Abelian.

    • Proof: Let G/Z(G)=⟨gZ(G)⟩G/Z(G) = \langle gZ(G) \rangle. Any element a∈Ga \in G belongs to some coset (gZ(G))i=giZ(G)(gZ(G))^i = g^i Z(G), so a=giz1a = g^i z_1 for some z1∈Z(G)z_1 \in Z(G). Similarly, any b∈Gb \in G can be written as b=gjz2b = g^j z_2 for some z2∈Z(G)z_2 \in Z(G). Since gig^i and gjg^j commute, and elements of the center commute with everything:     ab=(giz1)(gjz2)=gigjz1z2=gjgiz2z1=(gjz2)(giz1)=baab = (g^i z_1)(g^j z_2) = g^i g^j z_1 z_2 = g^j g^i z_2 z_1 = (g^j z_2)(g^i z_1) = ba     Thus, GG is Abelian.

  • The Inner Automorphism Isomorphism Theorem:

    • Theorem: For any group GG, G/Z(G)≈Inn(G)G/Z(G) \approx \text{Inn}(G).

    • Proof: Define T:G/Z(G)→Inn(G)T: G/Z(G) \to \text{Inn}(G) by T(gZ(G))=ϕgT(gZ(G)) = \phi_g, where ϕg(x)=gxg−1\phi_g(x) = gxg^{-1}.

    • Well-defined and 1–1: gZ(G)=hZ(G)  ⟺  h−1g∈Z(G)  ⟺  h−1gx=xh−1g  ∀x  ⟺  gxg−1=hxh−1  ∀x  ⟺  ϕg=ϕhgZ(G) = hZ(G) \iff h^{-1}g \in Z(G) \iff h^{-1}gx = xh^{-1}g \; \forall x \iff gxg^{-1} = hxh^{-1} \; \forall x \iff \phi_g = \phi_h.

    • Onto: By definition, any inner automorphism is of the form ϕg\phi_g.

    • Operation-Preserving: ϕg∘ϕh=ϕgh\phi_g \circ \phi_h = \phi_{gh}, so T(gZ⋅hZ)=T(ghZ)=ϕgh=ϕgϕh=T(gZ)T(hZ)T(gZ \cdot hZ) = T(ghZ) = \phi_{gh} = \phi_g \phi_h = T(gZ)T(hZ).

    • Application (Inn(D6)\text{Inn}(D_6)): In the dihedral group D6D_6 (order 12), ∣Z(D6)∣=2|Z(D_6)| = 2, so ∣D6/Z(D6)∣=12/2=6|D_6/Z(D_6)| = 12/2 = 6. Groups of order 6 are isomorphic to either Z6\mathbb{Z}_6 or D3D_3. If D6/Z(D6)D_6/Z(D_6) were cyclic (Z6\mathbb{Z}_6), the G/ZG/Z Theorem would force D6D_6 to be Abelian, which is false. Thus:     Inn(D6)≈D6/Z(D6)≈D3\text{Inn}(D_6) \approx D_6/Z(D_6) \approx D_3

  • Cauchy’s Theorem for Finite Abelian Groups:

    • Theorem: Let GG be a finite Abelian group and let pp be a prime that divides ∣G∣|G|. Then GG has an element of order pp.

    • Proof: By induction on ∣G∣|G|. The base case ∣G∣=2|G| = 2 holds. Assume the theorem holds for all Abelian groups of order less than ∣G∣|G|. Choose a non-identity element x∈Gx \in G. If ∣x∣=m=qn|x| = m = qn for some prime qq, then xnx^n has order qq. If q=pq = p, the claim is proved. If q≠pq \ne p, form the factor group G‾=G/⟨xn⟩\overline{G} = G/\langle x^n \rangle. Because GG is Abelian, ⟨xn⟩◃G\langle x^n \rangle \triangleleft G. Since q≠pq \ne p, pp divides ∣G‾∣=∣G∣/q|\overline{G}| = |G|/q. By induction, G‾\overline{G} has an element y⟨xn⟩y\langle x^n \rangle of order pp. If ∣y∣=k|y| = k, then (y⟨xn⟩)k=yk⟨xn⟩=e⟨xn⟩(y\langle x^n \rangle)^k = y^k \langle x^n \rangle = e\langle x^n \rangle, so p∣kp \mid k. Write k=prk = pr. Then yry^r is an element of order pp in GG.

  • Internal Direct Products:

    • Definition (Two Factors): A group GG is the internal direct product of subgroups HH and KK, written G=H×KG = H \times K, if:

    1. H◃GH \triangleleft G and K◃GK \triangleleft G.

    2. G=HKG = HK.

    3. H∩K={e}H \cap K = \{e\}.

    • General Definition (nn Factors): GG is the internal direct product of normal subgroups H1,…,HnH_1, \dots, H_n, denoted G=H1×⋯×HnG = H_1 \times \dots \times H_n, if:

    1. G=H1H2⋯HnG = H_1 H_2 \cdots H_n.

    2. (H1H2⋯Hi)∩Hi+1={e}(H_1 H_2 \cdots H_i) \cap H_{i+1} = \{e\} for i=1,2,…,n−1i = 1, 2, \dots, n - 1.

    • Isomorphism Between Internal and External Products:

    • Theorem: If G=H1×⋯×HnG = H_1 \times \dots \times H_n, then G≈H1⊕⋯⊕HnG \approx H_1 \oplus \dots \oplus H_n.

    • Proof Steps:

      1. Commutation of elements from different factors: For hi∈Hih_i \in H_i and hj∈Hjh_j \in H_j (i≠ji \ne j), the commutator hihjhi−1hj−1=(hihjhi−1)hj−1∈Hjh_i h_j h_i^{-1} h_j^{-1} = (h_i h_j h_i^{-1})h_j^{-1} \in H_j and hi(hjhi−1hj−1)∈Hih_i (h_j h_i^{-1} h_j^{-1}) \in H_i. Hence it belongs to Hi∩Hj={e}H_i \cap H_j = \{e\}, proving hihj=hjhih_i h_j = h_j h_i.

    1. Uniqueness of Representation: If h1⋯hn=h1′⋯hn′h_1 \cdots h_n = h'_1 \cdots h'_n, then hn′hn−1=(h1′)−1h1⋯(hn−1′)−1hn−1∈(H1⋯Hn−1)∩Hn={e}h'_n h_n^{-1} = (h'_1)^{-1}h_1 \cdots (h'_{n-1})^{-1}h_{n-1} \in (H_1 \cdots H_{n-1}) \cap H_n = \{e\}, so hn=hn′h_n = h'_n. By induction, hi=hi′h_i = h'_i for all ii.

    2. Isomorphism Map: The assignment ϕ(h1⋯hn)=(h1,…,hn)\phi(h_1 \cdots h_n) = (h_1, \dots, h_n) is well-defined, 1–1, onto, and operation-preserving.

  • Structural Applications:

    • If gcd⁡(s,t)=1\gcd(s, t) = 1, then U(st)=Us(st)×Ut(st)U(st) = U_s(st) \times U_t(st).

    • D6={R0,R120,R240,F,R120F,R240F}×{R0,R180}≈D3⊕Z2D_6 = \{R_0, R_{120}, R_{240}, F, R_{120}F, R_{240}F\} \times \{R_0, R_{180}\} \approx D_3 \oplus \mathbb{Z}_2.

    • In U(1000)≈U(8)⊕U(125)≈Z2⊕Z2⊕Z100U(1000) \approx U(8) \oplus U(125) \approx \mathbb{Z}_2 \oplus \mathbb{Z}_2 \oplus \mathbb{Z}_{100}, a subgroup of order 4 is U125(1000)={1,251,501,751}U_{125}(1000) = \{1, 251, 501, 751\}, a subgroup of order 100 is U8(1000)U_8(1000), and since ∣251∣=2|251| = 2, ⟨251⟩U8(1000)\langle 251 \rangle U_8(1000) has order 2⋅100=2002 \cdot 100 = 200.

  • Abelian Groups of Square-Free Order:

    • Theorem: Every Abelian group of order p1p2⋯pkp_1 p_2 \cdots p_k, where each pip_i is a distinct prime, is cyclic.

    • Proof: By Cauchy’s Theorem, GG has a subgroup HiH_i of order pip_i for each ii. Since GG is Abelian, each Hi◃GH_i \triangleleft G. Their coprime orders ensure trivial intersections, yielding G=H1×⋯×Hk≈H1⊕⋯⊕HkG = H_1 \times \dots \times H_k \approx H_1 \oplus \dots \oplus H_k. Each Hi≈ZpiH_i \approx \mathbb{Z}_{p_i}, and since all orders are pairwise coprime, the product is cyclic (\mathbb{Z}_{p_1 \cdots p_k}$).\n* **Classification of Groups of Order p^2:**\n * **Theorem:** Every group of order p^2(where(wherepisprime)isisomorphictois prime) is isomorphic to\mathbb{Z}{p^2}oror\mathbb{Z}_p \oplus \mathbb{Z}_p.\n * *Proof:* If Gcontainsanelementofordercontains an element of orderp^2,,G \approx \mathbb{Z}{p^2}.Otherwise,allnon−identityelementshaveorder. Otherwise, all non-identity elements have orderp.Everysubgroupoforder. Every subgroup of orderpisnormal:ifis normal: if\langle a \ranglewerenotnormal,therewouldexistwere not normal, there would existbsuchthatsuch thatb\langle a \rangle b^{-1} \cap \langle a \rangle = {e},whichwouldyieldacontradictionbycountingcosets.Picking, which would yield a contradiction by counting cosets. Pickingx e eandandy otin \langle x \rangle,both, both\langle x \rangleandand\langle y \ranglearenormaloforderare normal of orderpwithtrivialintersection,meaningwith trivial intersection, meaningG = \langle x \rangle \times \langle y \rangle \approx \mathbb{Z}p \oplus \mathbb{Z}_p.\n* **Corollary:** Every group of order p^2 is Abelian.\n\n# Ring Fundamentals, Subrings, and Integral Domains\n\n* **Axiomatic Definition of a Ring:**\n * A ring Risasetequippedwithtwobinaryoperations,addition(is a set equipped with two binary operations, addition (a + b)andmultiplication() and multiplication (ab),satisfyingthefollowingsixaxiomsforall), satisfying the following six axioms for alla, b, c \in R:\n 1. a + b = b + a (Additive Commutativity).\n 2. (a + b) + c = a + (b + c) (Additive Associativity).\n 3. There exists an element 0 \in Rsuchthatsuch thata + 0 = a (Additive Identity).\n 4. For each a \in R,thereexists, there exists-a \in Rsuchthatsuch thata + (-a) = 0 (Additive Inverse).\n 5. a(bc) = (ab)c (Multiplicative Associativity).\n 6. a(b + c) = ab + acandand(b + c)a = ba + ca (Left and Right Distributive Laws).\n * In summary, (R, +) is an Abelian group, multiplication is associative, and multiplication distributes over addition.\n\n* **Terminology and Ring Taxonomies:**\n * **Commutative Ring:** A ring Riscommutativeifis commutative ifab = baforallfor alla, b \in R.\n * **Unity (Multiplicative Identity):** A nonzero element 1 \in Rsuchthatsuch that1 \cdot a = a \cdot 1 = aforallfor alla \in R.\n * **Unit:** In a commutative ring with unity, a nonzero element a \in Risaunitifitpossessesamultiplicativeinverseinis a unit if it possesses a multiplicative inverse inR((ab = 1forsomefor someb \in R).\n * **Divisibility:** For a e 0,,adividesdividesb(written(writtena \mid b)if) ifb = acforsomefor somec \in R.Anelement. An elementaisaunitifandonlyifis a unit if and only ifa \mid 1.\n\n* **Standard Examples of Rings:**\n * \mathbb{Z}, \mathbb{Q}, \mathbb{R}, \mathbb{C}: Commutative rings with unity 1 under standard arithmetic.\n * \mathbb{Z}_n:Integersmodulo: Integers modulon, commutative ring with unity 1.\n * \mathbb{Z}[x]: Polynomials with integer coefficients, commutative ring with unity 1.\n * M_2(\mathbb{Z}):Theringof: The ring of2 \times 2integermatrices.Noncommutativewithunityinteger matrices. Noncommutative with unity\begin{pmatrix} 1 & 0 \ 0 & 1 \end{pmatrix}. Noncommutativity is shown by:\n    \begin{pmatrix} 1 & 1 \ 0 & 1 \end{pmatrix} \begin{pmatrix} 1 & 0 \ 1 & 1 \end{pmatrix} = \begin{pmatrix} 2 & 1 \ 1 & 1 \end{pmatrix} e \begin{pmatrix} 1 & 1 \ 1 & 2 \end{pmatrix} = \begin{pmatrix} 1 & 0 \ 1 & 1 \end{pmatrix} \begin{pmatrix} 1 & 1 \ 0 & 1 \end{pmatrix}\n * 2\mathbb{Z}: Even integers, commutative ring without unity.\n * **Direct Sum of Rings:** If R_1, \dots, R_narerings,theirdirectsumare rings, their direct sumR_1 \oplus \dots \oplus R_nisaringundercomponentwiseadditionandmultiplication.Inis a ring under componentwise addition and multiplication. In\mathbb{Z}_2 \oplus \mathbb{Z}_3,theelement, the element(1, 2)satisfiessatisfies(1, 2) + (1, 2) = (0, 1)andand(1, 2)(1, 2) = (1, 1).Since. Since(1, 1)istheunity,is the unity,(1, 2) is a unit and is its own multiplicative inverse.\n\n* **Elementary Algebraic Properties of Rings:**\n * For all a, b, c \in R:\n 1. a0 = 0a = 0.\n * *Proof:* 0 + a0 = a0 = a(0 + 0) = a0 + a0.Byadditivecancellation,. By additive cancellation,a0 = 0.Similarly,. Similarly,0a = 0.\n 2. a(-b) = (-a)b = -(ab).\n * *Proof:* a(-b) + ab = a(-b + b) = a0 = 0.Adding. Adding-(ab)tobothsidesgivesto both sides givesa(-b) = -(ab).\n 3. (-a)(-b) = ab.\n * *Proof:* Applying Rule 2 twice: (-a)(-b) = -[a(-b)] = -[-(ab)] = ab.\n 4. a(b - c) = ab - acandand(b - c)a = ba - ca.\n * *Proof:* a(b + (-c)) = ab + a(-c) = ab + (-(ac)) = ab - ac.\n 5. If Rhasunity1:has unity 1:(-1)a = -aandand(-1)(-1) = 1.\n * *Proof:* (-1)a = -(1 \cdot a) = -a,and, and(-1)(-1) = 1 \cdot 1 = 1.\n * **Uniqueness:** If a ring has a unity, it is unique. If a ring element possesses a multiplicative inverse, it is unique.\n\n* **Failure of Group-Like Multiplicative Properties in Rings:**\n * Rings are not groups under multiplication. As illustrated by \mathbb{Z}_6:\n * *No Cancellation:* ab = acwithwitha e 0doesnotimplydoes not implyb = c.In. In\mathbb{Z}_6,,2 \cdot 1 = 2andand2 \cdot 4 = 8 \equiv 2,but, but1 e 4.\n* *No Idempotent Restriction:* In the real numbers, a^2 = a \implies a \in {0, 1}.In. In\mathbb{Z}_6,,3^2 = 9 \equiv 3,yet, yet3 otin {0, 1}.\n * *Zero-Divisors:* Nonzero elements can multiply to zero: in \mathbb{Z}_6,,2 \cdot 3 = 0.\n\n* **Subrings:**\n * **Definition:** A subset Sofaringof a ringRisasubringifis a subring ifSisitselfaringundertheoperationsofis itself a ring under the operations ofR.\n * **The Subring Test:** A nonempty subset S \subseteq Risasubringifandonlyifis a subring if and only ifS is closed under subtraction and multiplication:\n    a - b \in S \quad \text{and} \quad ab \in S \quad \text{whenever } a, b \in S\n * **Examples and Non-Examples:**\n * The diagonal matrices S = \left{\begin{pmatrix} a & 0 \ 0 & b \end{pmatrix} \;\middle|\; a, b \in \mathbb{Z}\right}formasubringofform a subring ofM_2(\mathbb{Z}) because differences and products of diagonal matrices remain diagonal.\n * The subset S = 2\mathbb{Z} \cup 3\mathbb{Z} \subset \mathbb{Z}is∗not∗asubring:itcontains3and2,butis *not* a subring: it contains 3 and 2, but3 - 2 = 1 otin S, failing subtraction closure.\n* Trivial subrings: For any ring R,theset, the set(0)andandR itself are subrings.\n* Gaussian integers: \mathbb{Z}[i] = {a + bi \mid a, b \in \mathbb{Z}}isasubringofis a subring of\mathbb{C}.\n* Multiples of n::n\mathbb{Z}isasubringofis a subring of\mathbb{Z}.\n* Modular Subring with Distinct Unity: The subset S = {0, 2, 4, 6, 8} \subset \mathbb{Z}{10} is a subring.\n\n| \cdot | 0 | 2 | 4 | 6 | 8 |\n|---|---|---|---|---|---|\n| **0** | 0 | 0 | 0 | 0 | 0 |\n| **2** | 0 | 4 | 8 | 2 | 6 |\n| **4** | 0 | 8 | 6 | 4 | 2 |\n| **6** | 0 | 2 | 4 | 6 | 8 |\n| **8** | 0 | 6 | 2 | 8 | 4 |\n\n * In this subring S,theelement6actsastheunity(, the element 6 acts as the unity (6 \cdot x = xforallfor allx \in S),and8isthemultiplicativeinverseof2(), and 8 is the multiplicative inverse of 2 (2 \cdot 8 = 16 \equiv 6).Neitherelementisaunitintheambientring). Neither element is a unit in the ambient ring\mathbb{Z}{10}.\n\n* **Integral Domains:**\n * **Zero-Divisor:** A nonzero element a \in Rinacommutativeringisazero−divisorifthereexistsanonzeroin a commutative ring is a zero-divisor if there exists a nonzerob \in Rsuchthatsuch thatab = 0.\n * **Definition:** An integral domain is a commutative ring with a nonzero unity (1 e 0) containing no zero-divisors.\n * Equivalent zero-product property: For all a, b \in R,,ab = 0 \implies a = 0ororb = 0.\n* **Standard Integral Domains:** \mathbb{Z},,\mathbb{Z}[i],,\mathbb{Z}[x],,\mathbb{Z}[\sqrt{2}],and, and\mathbb{Z}_p((p prime).\n* **Non-Domains:**\n * \mathbb{Z}_6(containszero−divisors(contains zero-divisors2 \cdot 3 = 0).\n * \mathbb{Z} \oplus \mathbb{Z}(containszero−divisors(contains zero-divisors(1, 0)(0, 1) = (0, 0)).\n * M_2(\mathbb{Z}) (noncommutative and contains zero-divisors).\n * 2\mathbb{Z} (lacks a multiplicative identity).\n* **Cancellation Law:** If a, b, cbelongtoanintegraldomainandbelong to an integral domain anda e 0, then:\n    ab = ac \implies b = c\n* *Proof:* ab = ac \implies a(b - c) = 0.Because. Becausea e 0andtheringcontainsnozero−divisors,and the ring contains no zero-divisors,b - c = 0,so, sob = c.\n\n* **Fields:**\n * **Definition:** A field is a commutative ring with unity 1 e 0 in which every nonzero element is a unit (has a multiplicative inverse).\n* **Implication Chain:**\n  \text{Field} \implies \text{Integral Domain} \implies \text{Commutative Ring with Unity}\n* Every field is an integral domain because if ab = 0withwitha e 0,multiplyingby, multiplying bya^{-1}givesgivesb = a^{-1}(ab) = a^{-1}0 = 0.Theconversefails:. The converse fails:\mathbb{Z} is an integral domain but not a field.\n* **Theorem (Finite Domains are Fields):** Every finite integral domain is a field.\n * *Proof:* Let Dbeafiniteintegraldomainandletbe a finite integral domain and leta \in D \setminus {0}.Considerthepowers. Consider the powersa, a^2, a^3, \dots.Byfiniteness,thereexistintegers. By finiteness, there exist integersi > j \ge 1suchthatsuch thata^i = a^j.Thus. Thusa^j(a^{i-j} - 1) = 0.Because. Becausea e 0andandDhasnozero−divisors,has no zero-divisors,a^{i-j} = 1.Since. Sincei - j \ge 1,wewrite, we writea \cdot a^{i-j-1} = 1.Therefore,. Therefore,a^{-1} = a^{i-j-1} \in D, proving that every nonzero element has a multiplicative inverse.\n * **Corollary:** \mathbb{Z}_pisafieldforeveryprimeis a field for every primep.\n\n* **Characteristic of a Ring:**\n * **Definition:** The characteristic of a ring R,denoted, denoted\text{char}(R),istheleastpositiveinteger, is the least positive integernsuchthatsuch thatn \cdot x = 0forallfor allx \in R.Ifnosuchpositiveintegerexists,. If no such positive integer exists,\text{char}(R) = 0.\n * **Theorem:** In a ring with unity 1, \text{char}(R) equals the additive order of 1 (or 0 if 1 has infinite order).\n * *Proof:* If |1| = \infty,nopositiveintegersatisfies, no positive integer satisfiesn \cdot 1 = 0,so, so\text{char}(R) = 0.If. If|1| = n < \infty,thenforany, then for anyx \in R,,n \cdot x = x + \dots + x = (1 + \dots + 1)x = (n \cdot 1)x = 0x = 0.Minimalityof. Minimality ofnensuresensures\text{char}(R) = n.\n * **Theorem (Characteristic of an Integral Domain):** The characteristic of an integral domain is either 0 or a prime number.\n * *Proof:* Suppose \text{char}(R) = n > 0.If. Ifnwerecomposite,were composite,n = rswithwith1 < r, s < n.Then. Then0 = n \cdot 1 = (rs) \cdot 1 = (r \cdot 1)(s \cdot 1).Sinceanintegraldomainhasnozero−divisors,either. Since an integral domain has no zero-divisors, eitherr \cdot 1 = 0orors \cdot 1 = 0,contradictingtheminimalityof, contradicting the minimality ofn.Thus,. Thus,n must be prime.\n\n* **Idempotent and Nilpotent Elements:**\n * **Idempotent:** An element a \in Risidempotentifis idempotent ifa^2 = a.Example:In. Example: In\mathbb{Z}_6,,3^2 = 9 \equiv 3, so 3 is idempotent.\n * **Nilpotent:** An element a \in Risnilpotentifis nilpotent ifa^n = 0forsomepositiveintegerfor some positive integern.Example:In. Example: In\mathbb{Z}_8,,2^3 = 8 \equiv 0, so 2 is nilpotent.\n\n# Ideals, Factor Rings, and Prime/Maximal Ideals\n\n* **Ideals:**\n * **Analogy:** Ideals play the structural role in ring theory that normal subgroups play in group theory, serving as the kernels of homomorphisms and the sub-structures required to build factor rings.\n * **Definition:** A subring Aofaringof a ringRisa(two−sided)idealofis a (two-sided) ideal ofRifforeveryif for everyr \in Randeveryand everya \in A,both, bothra \in Aandandar \in A.\n * In terms of set products, rA \subseteq AandandAr \subseteq Aforallfor allr \in R (absorption under multiplication by ambient elements).\n * **The Ideal Test:** A nonempty subset A \subseteq Risanidealofis an ideal ofR if and only if:\n 1. a - b \in Awheneverwhenevera, b \in A (Additive subgroup condition).\n 2. ra \in Aandandar \in Awheneverwhenevera \in Aandandr \in R (Absorption condition).\n * **Examples of Ideals:**\n * *Trivial Ideals:* (0)andandRareidealsofanyringare ideals of any ringR.\n * *Multiples in \mathbb{Z}:∗Foranypositiveinteger:* For any positive integern,,n\mathbb{Z}isanidealofis an ideal of\mathbb{Z}.\n * *Principal Ideals:* In a commutative ring with unity, the ideal generated by a single element a,denoted, denoted\langle a \rangle, is:\n      \langle a \rangle = {ra \mid r \in R}\n * *Vanishing Constant Term:* In \mathbb{R}[x],thesetofpolynomialswithconstantterm0istheprincipalideal, the set of polynomials with constant term 0 is the principal ideal\langle x \rangle.\n * *Finitely Generated Ideals:* In a commutative ring with unity, the ideal generated by elements a_1, \dots, a_n is:\n      \langle a_1, a_2, \dots, a_n \rangle = {r_1 a_1 + r_2 a_2 + \dots + r_n a_n \mid r_i \in R}\n * *Even Constant Terms:* In \mathbb{Z}[x],thesetofpolynomialswithevenconstanttermistheideal, the set of polynomials with even constant term is the ideal\langle x, 2 \rangle.\n * **Subring That Is Not an Ideal:**\n * In \mathbb{R}[x],let, letS = {f(x) \in \mathbb{R}[x] \mid f(0) \in \mathbb{Q}}.\n * S is closed under subtraction and multiplication, so it is a subring.\n * However, consider the constant polynomial f(x) = 1 \in Sandandr(x) = \sqrt{2} \in \mathbb{R}[x].Theproduct. The product(rf)(x) = \sqrt{2} \cdot 1 = \sqrt{2},whoseconstantterm, whose constant term\sqrt{2} otin \mathbb{Q}.Thus. Thusrf otin S, failing absorption.\n\n* **Factor Rings (Quotient Rings):**\n * **Construction:** Let Rbearingandbe a ring andAanidealofan ideal ofR.Because. Because(R, +)isanAbeliangroupandis an Abelian group andAisanormalsubgroupunderaddition,thecosetsis a normal subgroup under addition, the cosetsR/A = {r + A \mid r \in R} form an additive group. Multiplication is defined by:\n    (s + A)(t + A) = st + A\n * **Theorem (Existence of Factor Rings):** Let Rbearingandbe a ring andAasubringofa subring ofR.Thesetofcosets. The set of cosetsR/Aisaringundercosetadditionandmultiplicationifandonlyifis a ring under coset addition and multiplication if and only ifAisanidealofis an ideal ofR.\n * *Proof (\Leftarrow):∗Assume):* AssumeAisanideal.Ifis an ideal. Ifs + A = s' + Aandandt + A = t' + A,then, thens = s' + aandandt = t' + bforfora, b \in A. Then:\n      st = (s' + a)(t' + b) = s't' + s'b + at' + ab\n      Because Aisanideal,is an ideal,s'b \in A,,at' \in A,and, andab \in A.Thus. Thusst - s't' \in A,whichproves, which provesst + A = s't' + A. Multiplication is well-defined.\n * *Proof (\Rightarrow):∗Assume):* AssumeAisasubringbutnotanideal.Thenthereexistis a subring but not an ideal. Then there exista \in Aandandr \in Rsuchthatsuch thatar otin A(withoutlossofgenerality).Since(without loss of generality). Sincea \in A,,a + A = 0 + A = A. Evaluating products:\n      (a + A)(r + A) = ar + A \quad \text{and} \quad (0 + A)(r + A) = 0 + A = A\n      Because ar otin A,,ar + A e A.Thus. Thus(a + A)(r + A) e (0 + A)(r + A)despitedespitea + A = 0 + A, meaning coset multiplication is not well-defined.\n * **Examples of Factor Rings:**\n * In \mathbb{Z}/4\mathbb{Z},operationsmatcharithmeticmodulo4:, operations match arithmetic modulo 4:(2 + 4\mathbb{Z})(3 + 4\mathbb{Z}) = 6 + 4\mathbb{Z} = 2 + 4\mathbb{Z}.\n * In 2\mathbb{Z}/6\mathbb{Z} = {0 + 6\mathbb{Z}, 2 + 6\mathbb{Z}, 4 + 6\mathbb{Z}},theelement, the element4 + 6\mathbb{Z} acts as a multiplicative unity:\n      (4 + 6\mathbb{Z})(2 + 6\mathbb{Z}) = 8 + 6\mathbb{Z} = 2 + 6\mathbb{Z}\n      (4 + 6\mathbb{Z})(4 + 6\mathbb{Z}) = 16 + 6\mathbb{Z} = 4 + 6\mathbb{Z}\n      A factor ring can possess a unity even when the original ring lacks one.\n * *Noncommutative Factor Ring of Order 16:* Let R = M_2(\mathbb{Z})andletand letIbetheidealofmatriceswithevenentries.Thefactorringbe the ideal of matrices with even entries. The factor ringR/Ihasorderhas order2^4 = 16,isnoncommutative,andisisomorphicto, is noncommutative, and is isomorphic toM_2(\mathbb{Z}_2).\n\n* **Prime Ideals and Maximal Ideals:**\n * **Definitions:** Let R be a commutative ring.\n * **Prime Ideal:** A proper ideal A \subsetneq Risprimeifforallis prime if for alla, b \in R,,ab \in A \implies a \in Aororb \in A.\n * **Maximal Ideal:** A proper ideal A \subsetneq Rismaximalifwheneveris maximal if wheneverBisanidealofis an ideal ofRwithwithA \subseteq B \subseteq R,then, thenB = AororB = R.\n * **Examples in \mathbb{Z}andand\mathbb{Z}{36}:**\n * In \mathbb{Z},theideal, the idealn\mathbb{Z}((n > 1)isprimeifandonlyif) is prime if and only ifnisprime.is prime.(0)isalsoaprimeidealofis also a prime ideal of\mathbb{Z}.\n * In \mathbb{Z}{36},idealscorrespondtodivisorsof36.Anideal, ideals correspond to divisors of 36. An ideal\langle d \ranglecontainscontains\langle e \rangleifandonlyifif and only ifd \mid e.Themaximalidealssitdirectlybeneath. The maximal ideals sit directly beneath\mathbb{Z}{36},correspondingtotheprimedivisors:, corresponding to the prime divisors:\langle 2 \rangleandand\langle 3 \rangle.\n * **Proof that \langle x^2 + 1 \rangleisMaximalinis Maximal in\mathbb{R}[x]:**\n * Let I = \langle x^2 + 1 \rangleandassumeanidealand assume an idealAsatisfiessatisfiesI \subsetneq A \subseteq \mathbb{R}[x].Pick. Pickf(x) \in A \setminus I.\n * By the division algorithm, f(x) = q(x)(x^2 + 1) + r(x)wherewhere\deg(r) < 2.\n * Since f(x) otin I,,r(x) = ax + b e 0((a, b \in \mathbb{R}).Because). Becausef(x) \in Aandandq(x)(x^2 + 1) \in I \subset A,wehave, we haveax + b \in A.\n* Ideal absorption gives (ax + b)(ax - b) = a^2 x^2 - b^2 \in Aandanda^2(x^2 + 1) = a^2 x^2 + a^2 \in A.\n* Subtracting these expressions yields a^2 + b^2 \in A.Since. Since(a, b) e (0, 0),,c = a^2 + b^2 > 0isanonzerorealnumber.Itsinverseis a nonzero real number. Its inversec^{-1} \in \mathbb{R},so, so1 = c^{-1}c \in A,whichforces, which forcesA = \mathbb{R}[x].Thus,. Thus,\langle x^2 + 1 \rangle is maximal.\n* **Non-Prime Example:** In \mathbb{Z}2[x],,\langle x^2 + 1 \rangleisnotprimebecauseis not prime because(x + 1)(x + 1) = x^2 + 2x + 1 \equiv x^2 + 1 \in \langle x^2 + 1 \rangle,butthefactor, but the factorx + 1 otin \langle x^2 + 1 \rangle(since(since\deg(x + 1) < 2).\n* **Characterization Theorems:**\n * **Theorem (Domain Condition):** Let Rbeacommutativeringwithunityandbe a commutative ring with unity andAanidealofan ideal ofR.Then. ThenR/Aisanintegraldomainifandonlyifis an integral domain if and only ifA is prime.\n * *Proof (\Rightarrow):∗Assume):* AssumeR/Aisanintegraldomainandis an integral domain andab \in A.Then. Then(a + A)(b + A) = ab + A = 0 + A.Since. SinceR/Ahasnozero−divisors,has no zero-divisors,a + A = 0 + Aororb + A = 0 + A,meaning, meaninga \in Aororb \in A.\n * *Proof (\Leftarrow):∗Assume):* AssumeAisprime.Thenis prime. ThenR/Aisacommutativeringwithunityis a commutative ring with unity1 + A.If. If(a + A)(b + A) = 0 + A,then, thenab \in A.Primalitygives. Primality givesa \in Aororb \in A,so, soa + A = 0 + Aororb + A = 0 + A.Thus. ThusR/A has no zero-divisors.\n * **Theorem (Field Condition):** Let Rbeacommutativeringwithunityandbe a commutative ring with unity andAanidealofan ideal ofR.Then. ThenR/Aisafieldifandonlyifis a field if and only ifA is maximal.\n * *Proof (\Rightarrow):∗Assume):* AssumeR/Aisafieldandis a field andBisanidealwithis an ideal withA \subsetneq B \subseteq R.Let. Letb \in B \setminus A.Then. Thenb + A e 0 + A.Since. SinceR/Aisafield,thereexistsis a field, there existsc + Asuchthatsuch that(b + A)(c + A) = 1 + A,so, so1 - bc \in A \subset B.Because. Becauseb \in B,,bc \in B.Thus. Thus1 = (1 - bc) + bc \in B,forcing, forcingB = R.\n* *Proof (\Leftarrow):∗Assume):* AssumeAismaximalandletis maximal and letb + A e 0 + A(so(sob otin A).Constructtheideal). Construct the idealB = {br + a \mid r \in R, a \in A}.Clearly. ClearlyA \subsetneq B.Maximalityforces. Maximality forcesB = R,so, so1 = bc + a'forsomefor somec \in R, a' \in A.Passingtocosets,. Passing to cosets,1 + A = bc + a' + A = (b + A)(c + A).Thus. Thusb + Aisinvertible,provingis invertible, provingR/A is a field.\n* **Prime Ideal That Is Not Maximal:**\n * In \mathbb{Z}[x],theprincipalideal, the principal ideal\langle x \rangle = {f(x) \in \mathbb{Z}[x] \mid f(0) = 0}isprime:ifis prime: ifg(x)h(x) \in \langle x \rangle,then, theng(0)h(0) = 0,so, sog(0) = 0ororh(0) = 0.\n * However, \langle x \rangleisnotmaximalbecauseitisstrictlycontainedintheproperidealis not maximal because it is strictly contained in the proper ideal\langle x, 2 \rangle:\n    \langle x \rangle \subsetneq \langle x, 2 \rangle \subsetneq \mathbb{Z}[x]\n * Here 2 \in \langle x, 2 \ranglebutbut2 otin \langle x \rangle,and, and1 otin \langle x, 2 \ranglebecauseallconstanttermsinbecause all constant terms in\langle x, 2 \rangle are even.\n\n# Ring Homomorphisms and Polynomial Rings\n\n* **Ring Homomorphisms:**\n * **Definition:** A ring homomorphism \phifromaringfrom a ringRtoaringto a ringSisamappingthatpreservesbothringoperationsforallis a mapping that preserves both ring operations for alla, b \in R:\n    \phi(a + b) = \phi(a) + \phi(b) \quad \text{and} \quad \phi(ab) = \phi(a)\phi(b)\n * A bijective ring homomorphism is called a ring isomorphism (R \cong S).\n * **Evaluation Map:** The evaluation mapping \phi: \mathbb{R}[x] \to \mathbb{R}givenbygiven by\phi(f(x)) = f(1) is a surjective ring homomorphism:\n    \phi(f + g) = (f + g)(1) = f(1) + g(1) = \phi(f) + \phi(g)\n    \phi(fg) = (fg)(1) = f(1)g(1) = \phi(f)\phi(g)\n * **Homomorphisms from \mathbb{Z}{12}toto\mathbb{Z}9:**\n * Viewing \mathbb{Z}{12}additively,additively,\phi(1)determinesthemap,anddetermines the map, and|\phi(1)|mustdivideboth12and9,restrictingcandidatesformust divide both 12 and 9, restricting candidates for\phi(1)toto(0, 3, 6).\n * Multiplicative preservation forces \phi(1) = \phi(1 \cdot 1) = (\phi(1))^2,so, so\phi(1)mustbeanidempotentinmust be an idempotent in\mathbb{Z}9.\n * Testing candidates: 3^2 = 9 \equiv 0 e 3,and, and6^2 = 36 \equiv 0 e 6.\n * Thus, \phi(1) = 0,provingthezeromapistheuniqueringhomomorphismfrom, proving the zero map is the unique ring homomorphism from\mathbb{Z}{12}toto\mathbb{Z}9.\n * **General Homomorphism Theorem (\mathbb{Z}_m \to \mathbb{Z}_n):**\n * The mapping x \mapsto kxfromfrom\mathbb{Z}_mtoto\mathbb{Z}_n is a ring homomorphism if and only if:\n 1. The additive order of kinin\mathbb{Z}_ndividesbothdivides bothmandandn.\n 2. kisanidempotentinis an idempotent in\mathbb{Z}_n((k^2 \equiv k \pmod n).\n\n* **Properties of Ring Homomorphisms:**\n * Let \phi: R \to Sbearinghomomorphism,be a ring homomorphism,Aasubringofa subring ofR,and, andBanidealofan ideal ofS:\n 1. \phi(nr) = n\phi(r)andand\phi(r^n) = (\phi(r))^nforanyfor anyr \in R, n \in \mathbb{Z}^+.\n 2. \phi(A)isasubringofis a subring ofS.\n 3. If Aisanidealofis an ideal ofRandand\phimapsontomaps ontoS,then, then\phi(A)isanidealofis an ideal ofS.\n 4. The preimage \phi^{-1}(B) = {r \in R \mid \phi(r) \in B}isanidealofis an ideal ofR.\n 5. If Riscommutative,thenis commutative, then\phi(R) is commutative.\n 6. If Rhasunity1,has unity 1,S e {0},and, and\phiisonto,thenis onto, then\phi(1)istheunityofis the unity ofS, and units map to units.\n 7. \phiisanisomorphismifandonlyifis an isomorphism if and only if\phiisontoandis onto and\text{Ker}(\phi) = {0}.\n 8. If \phi: R \to Sisanisomorphism,is an isomorphism,\phi^{-1}: S \to R is an isomorphism.\n 9. If aisidempotentinis idempotent inR,then, then\phi(a)isidempotentinis idempotent in\phi(R).\n\n* **Kernels and the First Isomorphism Theorem for Rings:**\n * **Theorem (Kernel is an Ideal):** Let \phi: R \to S be a ring homomorphism. Then:\n    \text{Ker}(\phi) = {r \in R \mid \phi(r) = 0}\n    is an ideal of R.\n * *Proof:* Nonempty since \phi(0) = 0.If. Ifa, b \in \text{Ker}(\phi),,\phi(a - b) = \phi(a) - \phi(b) = 0 - 0 = 0,so, soa - b \in \text{Ker}(\phi).Forany. For anyr \in Randanda \in \text{Ker}(\phi),,\phi(ra) = \phi(r)\phi(a) = \phi(r) \cdot 0 = 0andand\phi(ar) = \phi(a)\phi(r) = 0 \cdot \phi(r) = 0,so, sora, ar \in \text{Ker}(\phi).\n * **First Isomorphism Theorem for Rings:**\n * Let \phi: R \to Sbearinghomomorphism.Themappingbe a ring homomorphism. The mapping\psi: R/\text{Ker}(\phi) \to \phi(R)definedbydefined by\psi(r + \text{Ker}(\phi)) = \phi(r) is an isomorphism:\n      R/\text{Ker}(\phi) \cong \phi(R)\n * *Proof:* Well-definedness and injectivity follow from r - s \in \text{Ker}(\phi) \iff \phi(r) = \phi(s).Preservesoperations:. Preserves operations:\psi((r+K) + (s+K)) = \phi(r+s) = \phi(r)+\phi(s) = \psi(r+K) + \psi(s+K),and, and\psi((r+K)(s+K)) = \phi(rs) = \phi(r)\phi(s) = \psi(r+K)\psi(s+K).Surjectivityisimmediatefromthedefinitionof. Surjectivity is immediate from the definition of\phi(R).\n * **Ideals are Kernels:** Every ideal Aofaringof a ringRisthekernelofthenaturalprojectionhomomorphismis the kernel of the natural projection homomorphism\gamma: R \to R/Agivenbygiven by\gamma(r) = r + A.\n\n* **Characteristic and Canonical Embeddings:**\n * **Theorem:** Let Rbearingwithunity1.Themappingbe a ring with unity 1. The mapping\phi: \mathbb{Z} \to Rdefinedbydefined by\phi(n) = n \cdot 1 is a ring homomorphism.\n * **Theorem:** If \text{char}(R) = n > 0,,Rcontainsasubringisomorphictocontains a subring isomorphic to\mathbb{Z}_n.If. If\text{char}(R) = 0,,Rcontainsasubringisomorphictocontains a subring isomorphic to\mathbb{Z}.\n * *Proof:* By the First Isomorphism Theorem, \mathbb{Z}/\text{Ker}(\phi) \cong \phi(\mathbb{Z}) \subseteq R.Here. Here\text{Ker}(\phi) = \langle n \rangle,where, wherenistheadditiveorderof1(is the additive order of 1 (\text{char}(R)).\n * **Steinitz’s Theorem (1910):**\n * Every field Fcontainsasubfieldisomorphictocontains a subfield isomorphic to\mathbb{Z}_pifif\text{char}(F) = p,orto, or to\mathbb{Q}ifif\text{char}(F) = 0.\n * The smallest subfield of a field is its prime subfield. The prime subfield is isomorphic to \mathbb{Z}_p(if(if\text{char}(F) = p)orto) or to\mathbb{Q}(if(if\text{char}(F) = 0).\n\n* **Field of Quotients:**\n * **Theorem:** Let Dbeanintegraldomain.Thereexistsafieldbe an integral domain. There exists a fieldF,calledthefieldofquotientsof, called the field of quotients ofD,containingasubringisomorphicto, containing a subring isomorphic toD.\n * Elements are formal equivalence classes of fractions a/b((b e 0)undertherelation) under the relationa/b = c/d \iff ad = bc.\n * When D = \mathbb{Z}[x],itsfieldofquotientsisthefieldofrationalfunctions, its field of quotients is the field of rational functions\mathbb{Q}(x).Ingeneral,thequotientfieldof. In general, the quotient field ofF[x]forafieldfor a fieldFisdenotedis denotedF(x).\n\n* **Polynomial Rings:**\n * **Definition:** For a commutative ring R,thepolynomialring, the polynomial ringR[x] consists of expressions:\n    f(x) = a_n x^n + a{n-1} x^{n-1} + \dots + a_1 x + a_0 \quad (a_i \in R)\n * Operations:\n * Addition: Adds corresponding coefficients: (f + g)(x) = \sum (a_k + b_k)x^k.\n * Multiplication: (fg)(x) = \sum c_k x^k,where, wherec_k = \sum_{i+j=k} a_i b_j.\n * *Worked Computation in \mathbb{Z}3[x]:*\n * Let f(x) = 2x^3 + x^2 + 2x + 2andandg(x) = 2x^2 + 2x + 1.\n * Sum: (2)x^3 + (1+2)x^2 + (2+2)x + (2+1) = 2x^3 + 0x^2 + 1x + 0 = 2x^3 + x.\n * Product: Evaluating the convolution modulo 3 yields x^5 + 2x^3 + 2.\n * **Domain Theorem:** If Disanintegraldomain,thenis an integral domain, thenD[x] is an integral domain.\n * *Proof:* Nonzero polynomials f(x), g(x)haveleadingtermshave leading termsa_n x^n, b_m x^m((a_n e 0, b_m e 0).In). Inf(x)g(x),theleadingtermis, the leading term isa_n b_m x^{n+m}.Because. BecauseDhasnozero−divisors,has no zero-divisors,a_n b_m e 0,so, sof(x)g(x) e 0.\n\n* **Division Algorithm and Roots in F[x]((F a Field):**\n * **Theorem (Division Algorithm):** Let f(x), g(x) \in F[x]withwithg(x) e 0.Thereexistuniquepolynomials. There exist unique polynomialsq(x), r(x) \in F[x] such that:\n    f(x) = g(x)q(x) + r(x) \quad \text{where } r(x) = 0 \text{ or } \deg(r(x)) < \deg(g(x))\n * *Worked Example in \mathbb{Z}_5[x]:∗Dividing:* Dividing3x^4 + x^3 + 2x^2 + 1bybyx^2 + 4x + 2producesquotientproduces quotientq(x) = 3x^2 + 4xandremainderand remainderr(x) = 2x + 1.\n * **Remainder Theorem:** If a \in Fandandf(x) \in F[x],theremainderondividing, the remainder on dividingf(x)bybyx - aistheconstantis the constantf(a).\n * **Factor Theorem:** An element a \in Fisazeroofis a zero off(x)ifandonlyifif and only ifx - adividesdividesf(x).\n * **Root Bound Theorem:** A nonzero polynomial of degree noverafieldover a fieldFhasatmosthas at mostnzerosinzeros inF, counting multiplicity.\n\n* **Principal Ideal Domains (PIDs):**\n * **Definition:** A principal ideal domain is an integral domain in which every ideal is principal (I = \langle a \rangle).\n * **Theorem (Minimal Degree Generator):** If Iisanonzeroidealinis a nonzero ideal inF[x],then, thenI = \langle g(x) \rangleifandonlyifif and only ifg(x)isanonzeropolynomialofminimumdegreeinis a nonzero polynomial of minimum degree inI.\n * **Theorem:** If Fisafield,thenis a field, thenF[x] is a principal ideal domain.\n\n# Factorization of Polynomials and Divisibility in Integral Domains\n\n* **Irreducible and Reducible Polynomials:**\n * Let Dbeanintegraldomain.Anonzeropolynomialbe an integral domain. A nonzero polynomialf(x) \in D[x]thatisnotaunitisirreducibleoverthat is not a unit is irreducible overDif,wheneverif, wheneverf(x) = g(x)h(x),theneither, then eitherg(x)ororh(x)isaunitinis a unit inD[x].\n * A nonzero, nonunit polynomial that is not irreducible is called reducible over D.\n * **Domain Dependence:**\n * 3x^2 + 6isirreducibleoveris irreducible over\mathbb{Q}(factorsareunitsin(factors are units in\mathbb{Q}[x]),butreducibleover), but reducible over\mathbb{Z}sincesince3x^2 + 6 = 3(x^2 + 2)andneither3norand neither 3 norx^2 + 2isaunitinis a unit in\mathbb{Z}[x].\n * x^2 + 4isirreducibleoveris irreducible over\mathbb{R},butreducibleover, but reducible over\mathbb{C}(((x + 2i)(x - 2i)).\n * x^2 - 3isirreducibleoveris irreducible over\mathbb{Q},butreducibleover, but reducible over\mathbb{R}(((x - \sqrt{3})(x + \sqrt{3})).\n * x^2 + 2isirreducibleoveris irreducible over\mathbb{Z}_5,butreducibleover, but reducible over\mathbb{Z}_3(((x + 1)(x + 2) = x^2 + 3x + 2 \equiv x^2 + 2).\n\n* **Reducibility Test for Degrees 2 and 3:**\n * **Theorem:** Let Fbeafield.Ifbe a field. Iff(x) \in F[x]hasdegree2or3,thenhas degree 2 or 3, thenf(x)isreducibleoveris reducible overFifandonlyifif and only iff(x)hasazeroinhas a zero inF.\n * *Proof (\Rightarrow):∗If):* Iff(x)isreducible,writeis reducible, writef(x) = g(x)h(x)withwith\deg(g), \deg(h) \ge 1.Since. Since\deg(g) + \deg(h) = \deg(f) \in {2, 3},atleastonefactor,say, at least one factor, sayg(x),musthavedegree1.Thus, must have degree 1. Thusg(x) = ax + b((a e 0).Then). Then-a^{-1}b \in Fisazeroofis a zero ofg(x),andhenceazeroof, and hence a zero off(x).\n * *Proof (\Leftarrow):∗If):* Iff(a) = 0,thenbytheFactorTheorem, then by the Factor Theoremf(x) = (x - a)q(x).Because. Because\deg(q) = \deg(f) - 1 \ge 1,neitherfactorisaunit,so, neither factor is a unit, sof(x) is reducible.\n * **Failure for Degree \ge 4:∗∗Over:** Over\mathbb{R},thepolynomial, the polynomialx^4 + 2x^2 + 1 = (x^2 + 1)^2isreducible,yetithasnozeroinis reducible, yet it has no zero in\mathbb{R}.\n\n* **Content and Primitive Polynomials in \mathbb{Z}[x]:**\n * **Content:** The content of a nonzero polynomial f(x) = a_n x^n + \dots + a_0 \in \mathbb{Z}[x]isis\gcd(a_n, \dots, a_0).\n * **Primitive:** A polynomial in \mathbb{Z}[x] is primitive if its content is 1.\n * 6x^3 + 9x - 15hascontenthas content\gcd(6, 9, 15) = 3 (not primitive).\n * 4x^2 + 6x + 9hascontenthas content\gcd(4, 6, 9) = 1 (primitive).\n * **Gauss’s Lemma:** The product of two primitive polynomials is primitive.\n * *Proof:* Let f(x), g(x)beprimitive.Ifbe primitive. Iff(x)g(x)werenotprimitive,someprimewere not primitive, some primepwoulddivideitscontent.Reducecoefficientsmodulowould divide its content. Reduce coefficients moduloptogetto get\overline{f}(x), \overline{g}(x) \in \mathbb{Z}_p[x].Then. Then\overline{f}(x)\overline{g}(x) = \overline{f(x)g(x)} = 0.Because. Because\mathbb{Z}_pisafield,is a field,\mathbb{Z}_p[x]isanintegraldomain,sois an integral domain, so\overline{f}(x) = 0oror\overline{g}(x) = 0.Thisrequires. This requiresptodivideeverycoefficientofto divide every coefficient off(x)ororg(x), contradicting their primitivity.\n * **Reducibility over \mathbb{Q}vsvs\mathbb{Z}:**\n * **Theorem:** Let f(x) \in \mathbb{Z}[x].If. Iff(x)isreducibleoveris reducible over\mathbb{Q},thenitisreducibleover, then it is reducible over\mathbb{Z}.\n * *Worked Factorization:* Let f(x) = 6x^2 + x - 2.Factoringover. Factoring over\mathbb{Q}yieldsyields(4x - 2)(\frac{3}{2}x + 1).Clearingdenominators:. Clearing denominators:2f(x) = (4x - 2)(3x + 2) = 2(2x - 1)(3x + 2).Cancelling2givestheintegerfactorization. Cancelling 2 gives the integer factorizationf(x) = (2x - 1)(3x + 2).\n\n* **Irreducibility Tests over \mathbb{Q}:**\n * **Mod p Irreducibility Test:**\n * **Theorem:** Let f(x) \in \mathbb{Z}[x]withwith\deg(f(x)) > 1,andlet, and letpbeaprimesuchthatbe a prime such thatpdividesneithertheleadingcoefficientnortheconstanttermofdivides neither the leading coefficient nor the constant term off(x).Ifthereducedpolynomial. If the reduced polynomial\overline{f}(x) \in \mathbb{Z}_p[x]isirreducibleoveris irreducible over\mathbb{Z}_p,then, thenf(x)isirreducibleoveris irreducible over\mathbb{Q}.\n * *Example:* For f(x) = 5x^3 + 7x + 6,,p = 2, 3dividetheconstantterm6,anddivide the constant term 6, andp = 5dividestheleadingcoefficient5.Testingwithdivides the leading coefficient 5. Testing withp = 7givesgives\overline{f}(x) = 5x^3 + 6 \in \mathbb{Z}_7[x].Cubesin. Cubes in\mathbb{Z}_7are0,1,6,whichproduceoutputs6,4,1.Havingnozeros,are 0, 1, 6, which produce outputs 6, 4, 1. Having no zeros,\overline{f}(x)isirreducibleoveris irreducible over\mathbb{Z}_7,so, sof(x)isirreducibleoveris irreducible over\mathbb{Q}.\n * *Example:* For f(x) = 21x^3 - 3x^2 + 2x + 9,modulo2gives, modulo 2 gives\overline{f}(x) = x^3 + x^2 + 1.Since. Since\overline{f}(0) = 1andand\overline{f}(1) = 1,ithasnozerosin, it has no zeros in\mathbb{Z}_2,provingirreducibilityover, proving irreducibility over\mathbb{Q}.\n * *False Signals:* If \overline{f}(x)isreducibleoveris reducible over\mathbb{Z}_p,,f(x)maystillbeirreducibleovermay still be irreducible over\mathbb{Q}.For. Forf(x) = 21x^3 - 3x^2 + 2x + 8,modulo2gives, modulo 2 givesx^2(x + 1)(reducible),butmodulo5gives(reducible), but modulo 5 givesx^3 + 2x^2 + 2x + 3,whichhasnozerosin, which has no zeros in\mathbb{Z}_5,establishingirreducibilityover, establishing irreducibility over\mathbb{Q}.\n * **Eisenstein’s Criterion (1850):**\n * **Theorem:** Let f(x) = a_n x^n + \dots + a_0 \in \mathbb{Z}[x].Ifthereisaprime. If there is a primep such that:\n      p mid a_n, \quad p \mid a{n-1}, \dots, p \mid a_0, \quad \text{and} \quad p^2 mid a_0\n      then f(x)isirreducibleoveris irreducible over\mathbb{Q}.\n* *Proof:* If f(x) = g(x)h(x)withwithg(x) = \sum b_i x^iandandh(x) = \sum c_j x^j,then, thena_0 = b_0 c_0.Because. Becausep \mid a_0andandp^2 mid a_0,,pdividesexactlyonefactor,saydivides exactly one factor, sayp \mid b_0, p mid c_0.Because. Becausep mid a_n = b_r c_s,,p mid b_r.Let. Lettbethesmallestindexwithbe the smallest index withp mid b_t.In. Ina_t = b_t c_0 + b_{t-1}c_1 + \dots + b_0 c_t,,p \mid a_t(since(sincet < n)and) andpdividesalltermsafterdivides all terms afterb_t c_0.Thus. Thusp \mid b_t c_0,forcing, forcingp \mid b_tororp \mid c_0, a contradiction.\n * *Example:* f(x) = 3x^5 + 15x^4 - 20x^3 + 10x + 20isirreducibleoveris irreducible over\mathbb{Q}usingusingp = 5.\n * **Cyclotomic Polynomials:**\n * The p−thcyclotomicpolynomial-th cyclotomic polynomial\Phi_p(x) = \frac{x^p - 1}{x - 1} = x^{p-1} + x^{p-2} + \dots + x + 1isirreducibleoveris irreducible over\mathbb{Q}.\n * *Proof:* Shift the variable by setting x \mapsto x + 1:\n      f(x) = \Phi_p(x + 1) = \frac{(x + 1)^p - 1}{x} = x^{p-1} + \binom{p}{1}x^{p-2} + \dots + \binom{p}{p-1}\n      For 1 \le k \le p - 1,,p \mid \binom{p}{k},andtheconstanttermis, and the constant term is\binom{p}{p-1} = p,whichisnotdivisibleby, which is not divisible byp^2.ByEisenstein′sCriterion,. By Eisenstein's Criterion,\Phi_p(x + 1)isirreducibleoveris irreducible over\mathbb{Q},whichforces, which forces\Phi_p(x)tobeirreducibleoverto be irreducible over\mathbb{Q}.\n\n* **Ideal Structure and Field Construction in F[x]:**\n * **Maximal Ideals in F[x]:∗∗Let:** LetFbeafield.Theidealbe a field. The ideal\langle p(x) \rangleismaximalinis maximal inF[x]ifandonlyifif and only ifp(x)isirreducibleoveris irreducible overF.\n * **Field Construction:** If p(x)isirreducibleoverafieldis irreducible over a fieldF,thenthefactorring, then the factor ringF[x]/\langle p(x) \rangle is a field.\n * *Example:* In \mathbb{Z}2[x],,x^2 + x + 1hasnoroots,henceisirreducible.Thefactorringhas no roots, hence is irreducible. The factor ring\mathbb{Z}_2[x]/\langle x^2 + x + 1 \rangleisafieldoforderis a field of order2^2 = 4,withelements, with elements{0, 1, x, x + 1}.\n * *Example:* \mathbb{R}[x]/\langle x^2 + 1 \rangle \cong \mathbb{C}.\n * **Euclid’s Lemma for Polynomials:** If p(x)isirreducibleoveris irreducible overFandandp(x) \mid a(x)b(x),then, thenp(x) \mid a(x)ororp(x) \mid b(x).\n\n* **Divisibility in General Integral Domains:**\n * **Definitions:** Let D be an integral domain.\n * **Associates:** Elements a, b \in Dareassociatesifare associates ifa = ubforsomeunitfor some unitu \in D.\n * **Irreducible:** A nonzero nonunit a \in Disirreducibleifis irreducible ifa = bc \implies bisaunitoris a unit orc is a unit.\n * **Prime:** A nonzero nonunit a \in Disprimeifis prime ifa \mid bc \implies a \mid borora \mid c.\n * An element aisprimeifandonlyifis prime if and only if\langle a \rangle is a prime ideal.\n * **The Norm on \mathbb{Z}[\sqrt{d}]:**\n * Defined by N(a + b\sqrt{d}) = |a^2 - db^2|.\n * Properties: N(x) = 0 \iff x = 0;;N(xy) = N(x)N(y);;xisaunitis a unit\iff N(x) = 1;if; ifN(x)isprime,is prime,x is irreducible.\n * **Irreducible That Is Not Prime:**\n * In \mathbb{Z}[\sqrt{-3}],consider, consider1 + \sqrt{-3}.Itsnormis. Its norm is1^2 + 3(1^2) = 4.Anontrivialfactorizationwouldrequirefactorsofnorm2,but. A nontrivial factorization would require factors of norm 2, buta^2 + 3b^2 = 2hasnointegersolutions.Thushas no integer solutions. Thus1 + \sqrt{-3} is irreducible.\n * However, (1 + \sqrt{-3})(1 - \sqrt{-3}) = 4 = 2 \cdot 2,so, so1 + \sqrt{-3} \mid 2 \cdot 2.\n * Setting 2 = (1 + \sqrt{-3})(a + b\sqrt{-3})requiresrequiresa - 3b = 2andanda + b = 0,yielding, yieldingb = -1/2 otin \mathbb{Z}.Thus. Thus1 + \sqrt{-3} mid 2, proving it is not prime.\n * **Prime Implies Irreducible:** In any integral domain, every prime element is irreducible.\n * *Proof:* Let abeprimeandbe prime anda = bc.Then. Thena \mid bc,so, soa \mid borora \mid c.If. Ifat = b,then, thenb = bc t \implies 1 = ct(bycancellation),showing(by cancellation), showingc is a unit.\n * **PID Property:** In a principal ideal domain, an element is irreducible if and only if it is prime.\n * *Proof ( \Leftarrow):∗Let):* Letabeirreducibleandbe irreducible anda \mid bc.Considertheideal. Consider the idealI = \langle a, b \rangle.BecausetheringisaPID,. Because the ring is a PID,I = \langle d \rangle,so, soa = dr.Irreducibilityof. Irreducibility ofarequiresrequiresdororrtobeaunit.Ifto be a unit. Ifdisaunit,is a unit,I = D,so, so1 = ax + by \implies c = acx + bcy.Since. Sincea \mid bc,,a \mid c.If. Ifrisaunit,is a unit,\langle a \rangle = \langle d \rangle,so, sob \in \langle a \rangle,meaning, meaninga \mid b.\n\n* **Hierarchy of Integral Domains:**\n * **Definitions:**\n * **Unique Factorization Domain (UFD):** An integral domain where every nonzero nonunit factors into irreducibles, and factorization is unique up to order and associates.\n * **Principal Ideal Domain (PID):** An integral domain in which every ideal is principal.\n * **Euclidean Domain (ED):** An integral domain possessing a measure d: D \setminus {0} \to \mathbb{Z}{\ge 0}suchthatsuch thatd(a) \le d(ab)andforalland for alla, b e 0,,a = bq + rwithwithr = 0orord(r) < d(b).\n* **The Ascending Chain Condition (ACC):** In a PID, any strictly ascending chain of ideals I_1 \subsetneq I_2 \subsetneq I_3 \subsetneq \dots must be finite in length.\n * *Proof:* The union I = \bigcup I_kisanideal,sois an ideal, soI = \langle a \rangle.Because. Becausea \in I,,a \in I_nforsomefor somen,forcing, forcingI_k \subseteq I_nforallfor allk.\n* **Hierarchy Chain:**\n  \text{Euclidean Domain (ED)} \implies \text{Principal Ideal Domain (PID)} \implies \text{Unique Factorization Domain (UFD)}\n * *Proof (ED \impliesPID):∗InanED,letPID):* In an ED, letIbeanonzeroidealandchoosebe a nonzero ideal and choosea \in I \setminus {0}minimizingminimizingd(a).Forany. For anyb \in I,,b = aq + r.If. Ifr e 0,,r = b - aq \in Iandandd(r) < d(a),contradictingminimality.Thus, contradicting minimality. Thusr = 0andandI = \langle a \rangle.\n * *Proof (PID \implies UFD):* Factor existence follows from the ACC; uniqueness follows because irreducibles are primes in a PID.\n* **Non-Reversibility of Implications:**\n * \text{UFD} ot\implies \text{PID}::\mathbb{Z}[x]isaUFD,butnotaPIDsinceis a UFD, but not a PID since\langle 2, x \rangle is not principal.\n* \text{PID} ot\implies \text{ED}: There exist PIDs that admit no Euclidean algorithm (e.g., demonstrated by T. Motzkin in 1949).\n* **Polynomial Rings over UFDs:** If DisaUFD,thenis a UFD, thenD[x]isaUFD.Consequently,is a UFD. Consequently,\mathbb{Z}[x]andandF[x_1, \dots, x_n] are UFDs.\n* **Non-UFD Example (\mathbb{Z}[\sqrt{-5}]):**\n * In \mathbb{Z}[\sqrt{-5}], the element 46 has two distinct factorizations into irreducibles:\n    46 = 2 \cdot 23 = (1 + 3\sqrt{-5})(1 - 3\sqrt{-5})\n * The norms are N(2) = 4,,N(23) = 529,and, andN(1 \pm 3\sqrt{-5}) = 1 + 5(9) = 46.\n * A proper factor of 2 must have norm 2 (a^2 + 5b^2 = 2),whichhasnointegersolutions.Properfactorsof23musthavenorm23(), which has no integer solutions. Proper factors of 23 must have norm 23 (a^2 + 5b^2 = 23),whichalsohasnosolutions.Thus2,23,and), which also has no solutions. Thus 2, 23, and1 \pm 3\sqrt{-5} are all irreducible.\n * Units are exclusively \pm 1,meaning2isnotanassociateof, meaning 2 is not an associate of1 \pm 3\sqrt{-5}.Thus,factorizationisnotunique,and. Thus, factorization is not unique, and\mathbb{Z}[\sqrt{-5}]$$ is not a UFD.