Abstract Algebra: An Introduction

Record

Authors
Hungerford, T. W.
Year
2014
Title
Abstract Algebra: An Introduction
Edition
3rd
Type
Book
Our note
none yet
Verification
needs-review: a close but not exact match was found; awaiting review (checked against OpenAlex, 2026-11-14).
Identifiers found: OpenAlex W1591180289
The record found: Thomas W. Hungerford (1990). Abstract Algebra: An Introduction.
Differences: year 2014 vs 1990.
Id
hungerford-2014-abstract-algebra-introduction

Cited on

As cited

The pages cite this work in 44 forms.

  • Hungerford, T. W. (2014). Abstract Algebra: An Introduction (3rd ed.), Chapter 1. Brooks/Cole, Cengage Learning. The course text.
  • Hungerford, T. W. (2014). Abstract Algebra: An Introduction (3rd ed.), Chapter 13. Brooks/Cole, Cengage Learning. The course text.
  • Hungerford, T. W. (2014). Abstract Algebra: An Introduction (3rd ed.), Chapter 13. Brooks/Cole, Cengage Learning. The course text: a cancellation lemma for primes (Lemma 13.1) and Fermat's little theorem (Lemma 13.2), proved by the rearrangement argument in the language of congruences.
  • Hungerford, T. W. (2014). Abstract Algebra: An Introduction (3rd ed.), Chapter 13. Brooks/Cole, Cengage Learning. The course text: the RSA construction and the proof that decryption works (Theorem 13.3).
  • Hungerford, T. W. (2014). Abstract Algebra: An Introduction (3rd ed.), Chapter 2. Brooks/Cole, Cengage Learning. The course text.
  • Hungerford, T. W. (2014). Abstract Algebra: An Introduction (3rd ed.), Chapter 3, §§3.1 and 3.2. Brooks/Cole, Cengage Learning. The course text.
  • Hungerford, T. W. (2014). Abstract Algebra: An Introduction (3rd ed.), Chapter 4. Brooks/Cole, Cengage Learning. The course text.
  • Hungerford, T. W. (2014). Abstract Algebra: An Introduction (3rd ed.), Chapter 5. Brooks/Cole, Cengage Learning. The course text.
  • Hungerford, T. W. (2014). Abstract Algebra: An Introduction (3rd ed.), Chapter 6, with the Chinese remainder theorem for rings in §14.3. Brooks/Cole, Cengage Learning. The course text.
  • Hungerford, T. W. (2014). Abstract Algebra: An Introduction (3rd ed.), Chapter 7, §§7.1 to 7.5. Brooks/Cole, Cengage Learning. The course text.
  • Hungerford, T. W. (2014). Abstract Algebra: An Introduction (3rd ed.), Chapter 8, §§8.1 to 8.4, with the simplicity of the alternating groups in §8.5. Brooks/Cole, Cengage Learning. The course text.
  • Hungerford, T. W. (2014). Abstract Algebra: An Introduction (3rd ed.), §1.1. Brooks/Cole, Cengage Learning. The course text; the division algorithm is its Theorem 1.1.
  • Hungerford, T. W. (2014). Abstract Algebra: An Introduction (3rd ed.), §1.2. Brooks/Cole, Cengage Learning. The course text: the greatest common divisor as a linear combination (Theorem 1.2), its characterization by divisibility (Corollary 1.3), and the cancellation theorem (Theorem 1.4).
  • Hungerford, T. W. (2014). Abstract Algebra: An Introduction (3rd ed.), §1.3. Brooks/Cole, Cengage Learning. The course text: Euclid's lemma and its converse (Theorem 1.5 and Corollary 1.6), existence and uniqueness of factorization (Theorems 1.7 and 1.8, Corollary 1.9), and trial division (Theorem 1.10).
  • Hungerford, T. W. (2014). Abstract Algebra: An Introduction (3rd ed.), §2.1. Brooks/Cole, Cengage Learning. The course text: congruence is an equivalence relation (Theorem 2.1), respects sums and products (Theorem 2.2); two classes are equal exactly when their representatives are congruent and are otherwise disjoint (Theorem 2.3, Corollary 2.4), and the classes are exactly $[0], \ldots, [n - 1]$ (Corollary 2.5).
  • Hungerford, T. W. (2014). Abstract Algebra: An Introduction (3rd ed.), §2.1. Brooks/Cole, Cengage Learning. The course text: congruence is shown to be reflexive, symmetric and transitive (Theorem 2.1), and the results on congruence classes (Theorem 2.3, Corollary 2.4) are proved from those three properties alone.
  • Hungerford, T. W. (2014). Abstract Algebra: An Introduction (3rd ed.), §2.2 and the opening of §2.3. Brooks/Cole, Cengage Learning. The course text: addition and multiplication of classes are independent of the representatives (Theorem 2.6), the laws of arithmetic in $\mathbb{Z}_n$ (Theorem 2.7), and the convention of writing $a$ for $[a]$.
  • Hungerford, T. W. (2014). Abstract Algebra: An Introduction (3rd ed.), §2.3. Brooks/Cole, Cengage Learning. The course text: for $p > 1$, $p$ is prime if and only if every nonzero element of $\mathbb{Z}_p$ has an inverse, if and only if $\mathbb{Z}_p$ has no zero divisors (Theorem 2.8); $[a]x = [1]$ is solvable in $\mathbb{Z}_n$ if and only if $\gcd(a, n) = 1$ (Theorem 2.9), restated for units as Theorem 2.10; the definitions of unit and zero divisor.
  • Hungerford, T. W. (2014). Abstract Algebra: An Introduction (3rd ed.), §3.1 and §3.2. Brooks/Cole, Cengage Learning. The course text: the definitions of integral domain and field, both with $1_R \neq 0_R$ (§3.1); cancellation in an integral domain (Theorem 3.7); every field is an integral domain (Theorem 3.8); every finite integral domain is a field (Theorem 3.9).
  • Hungerford, T. W. (2014). Abstract Algebra: An Introduction (3rd ed.), §3.1 and §3.2. Brooks/Cole, Cengage Learning. The course text: the direct product $R \times S$ is a ring, commutative if $R$ and $S$ are and with identity if both have one (Theorem 3.1); subrings and subfields, and the subring test with closure under addition and multiplication, the zero and negatives (Theorem 3.2); the subring test for a nonempty subset closed under subtraction and multiplication (Theorem 3.6).
  • Hungerford, T. W. (2014). Abstract Algebra: An Introduction (3rd ed.), §3.1. Brooks/Cole, Cengage Learning. The course text: the definition of a ring by axioms for closure, associativity, commutativity of addition, a zero element, additive inverses and distributivity; commutative rings and rings with identity; the condition $1_R \neq 0_R$ in later definitions, to exclude the zero ring.
  • Hungerford, T. W. (2014). Abstract Algebra: An Introduction (3rd ed.), §3.2. Brooks/Cole, Cengage Learning. The course text: the equation $a + x = 0_R$ has a unique solution (Theorem 3.3); additive cancellation (Theorem 3.4); $a \cdot 0_R = 0_R$ and the rules of signs (Theorem 3.5); multiples and powers; the definitions of unit and zero divisor in a ring.
  • Hungerford, T. W. (2014). Abstract Algebra: An Introduction (3rd ed.), §3.3, with the Chinese remainder theorem in Chapter 14. Brooks/Cole, Cengage Learning. The course text.
  • Hungerford, T. W. (2014). Abstract Algebra: An Introduction (3rd ed.), §3.3. Brooks/Cole, Cengage Learning. The course text: the definitions of isomorphism and homomorphism; $f(0_R) = 0_S$, $f(-a) = -f(a)$ and $f(a - b) = f(a) - f(b)$, and for onto homomorphisms from a ring with identity, $f(1_R)$ is the identity of $S$ and units go to units (Theorem 3.10); the image of a homomorphism is a subring (Corollary 3.11).
  • Hungerford, T. W. (2014). Abstract Algebra: An Introduction (3rd ed.), §4.1 and §4.2. Brooks/Cole, Cengage Learning. The course text: the division algorithm in $F[x]$ (Theorem 4.6), divisors and degrees (Theorem 4.7), the greatest common divisor as a linear combination (Theorem 4.8), its characterization by divisibility (Corollary 4.9), and cancellation (Theorem 4.10).
  • Hungerford, T. W. (2014). Abstract Algebra: An Introduction (3rd ed.), §4.1. Brooks/Cole, Cengage Learning. The course text: the existence of $R[x]$ (Theorem 4.1, constructed in Appendix G), the degree of a product (Theorem 4.2), $R[x]$ an integral domain (Corollary 4.3), the inequality for degrees (Corollary 4.4), and the units of $R[x]$ (Corollary 4.5).
  • Hungerford, T. W. (2014). Abstract Algebra: An Introduction (3rd ed.), §5.1. Brooks/Cole, Cengage Learning. The course text: congruence modulo $p(x)$ is an equivalence relation (Theorem 5.1) that respects sums and products (Theorem 5.2); classes are equal exactly when their representatives are congruent and are otherwise disjoint (Theorem 5.3, Corollary 5.4); each class is the class of a unique polynomial of degree less than $\deg p$ or of 0 (Corollary 5.5).
  • Hungerford, T. W. (2014). Abstract Algebra: An Introduction (3rd ed.), §5.2 and the end of §5.3. Brooks/Cole, Cengage Learning. The course text: the operations on classes are well defined (Theorem 5.6); $F[x]/(p(x))$ is a commutative ring with identity containing a subring isomorphic to $F$ (Theorem 5.7), identified with $F$ (Theorem 5.8); classes relatively prime to the modulus are units (Theorem 5.9); $\mathbb{R}[x]/(x^2 + 1)$ and $\mathbb{C}$.
  • Hungerford, T. W. (2014). Abstract Algebra: An Introduction (3rd ed.), §5.3, with finite fields in §11.6. Brooks/Cole, Cengage Learning. The course text: $F[x]/(p(x))$ is a field if and only if it is an integral domain, if and only if $p(x)$ is irreducible (Theorem 5.10); it is an extension field containing a root of $p(x)$ (Theorem 5.11); every nonconstant polynomial has a root in some extension field (Corollary 5.12).
  • Hungerford, T. W. (2014). Abstract Algebra: An Introduction (3rd ed.), §6.1. Brooks/Cole, Cengage Learning. The course text: the definition of an ideal, the ideal test (Theorem 6.1), principal ideals in a commutative ring with identity (Theorem 6.2) and finitely generated ideals (Theorem 6.3).
  • Hungerford, T. W. (2014). Abstract Algebra: An Introduction (3rd ed.), §7.1 and §7.5. Brooks/Cole, Cengage Learning. The course text: the symmetric group $S_n$ of permutations under composition, with the right-hand factor applied first; cycle notation; disjoint cycles and the decomposition of a permutation into disjoint cycles; the order of a permutation as the least common multiple of its cycle lengths; transpositions, even and odd permutations, and the alternating group $A_n$ of order $n!/2$.
  • Hungerford, T. W. (2014). Abstract Algebra: An Introduction (3rd ed.), §7.1. Brooks/Cole, Cengage Learning. The course text: the definition of a group, with closure listed as an axiom; abelian groups; the order of a group; permutation groups and symmetry groups as first examples; every ring is an abelian group under addition, the nonzero elements of a field and the units of a ring with identity form groups under multiplication; the groups $U_n$ and $GL(2, \mathbb{R})$; direct products of groups.
  • Hungerford, T. W. (2014). Abstract Algebra: An Introduction (3rd ed.), §7.1. Brooks/Cole, Cengage Learning. The course text: the group of symmetries of the square as a first nonabelian group, and the dihedral group $D_n$ of a regular polygon with $n$ sides.
  • Hungerford, T. W. (2014). Abstract Algebra: An Introduction (3rd ed.), §7.2. Brooks/Cole, Cengage Learning. The course text: uniqueness of the identity and of inverses and the cancellation laws (Theorem 7.5); $(ab)^{-1} = b^{-1}a^{-1}$ and $(a^{-1})^{-1} = a$ (Corollary 7.6); the laws of exponents (Theorem 7.7); powers of an element of infinite order are distinct (Theorem 7.8); for an element of order $n$, $a^k = e$ exactly when $n \mid k$, $a^i = a^j$ exactly when $i \equiv j \pmod n$, and $a^t$ has order $d$ when $n = td$ (Theorem 7.9); multiplicative and additive notation.
  • Hungerford, T. W. (2014). Abstract Algebra: An Introduction (3rd ed.), §7.3. Brooks/Cole, Cengage Learning. The course text: subgroups; the subgroup test for nonempty subsets closed under products and inverses (Theorem 7.11) and for finite subsets closed under products (Theorem 7.12); the center is a subgroup (Theorem 7.13); the cyclic subgroup $\langle a \rangle$ (Theorem 7.14) and its order (Theorem 7.15); finite subgroups of the nonzero elements of $\mathbb{Q}$, $\mathbb{R}$, $\mathbb{C}$ or $\mathbb{Z}_p$ are cyclic (Theorem 7.16); subgroups of cyclic groups are cyclic (Theorem 7.17); the subgroup generated by a set (Theorem 7.18).
  • Hungerford, T. W. (2014). Abstract Algebra: An Introduction (3rd ed.), §7.4. Brooks/Cole, Cengage Learning. The course text: a one-to-one homomorphism is an isomorphism onto its image (Theorem 7.20); Cayley's theorem, every group is isomorphic to a group of permutations (Theorem 7.21); a finite group of order $n$ is isomorphic to a subgroup of $S_n$ (Corollary 7.22).
  • Hungerford, T. W. (2014). Abstract Algebra: An Introduction (3rd ed.), §7.4. Brooks/Cole, Cengage Learning. The course text: isomorphisms and homomorphisms of groups; infinite cyclic groups are isomorphic to $\mathbb{Z}$ and cyclic groups of order $n$ to $\mathbb{Z}_n$ (Theorem 7.19); a homomorphism sends the identity to the identity and inverses to inverses, its image is a subgroup, and a one-to-one homomorphism is an isomorphism onto its image (Theorem 7.20).
  • Hungerford, T. W. (2014). Abstract Algebra: An Introduction (3rd ed.), §8.1. Brooks/Cole, Cengage Learning. The course text: congruence modulo a subgroup, defined by $ab^{-1} \in K$, as an equivalence relation (Theorem 8.1) whose classes are the right cosets (Theorem 8.2), which are disjoint or identical (Corollary 8.3) and all of the same size (Theorem 8.4); the index; Lagrange's theorem (Theorem 8.5); the order of an element divides the order of the group, and $a^{\lvert G \rvert} = e$ (Corollary 8.6); groups of prime order are cyclic (Theorem 8.7).
  • Hungerford, T. W. (2014). Abstract Algebra: An Introduction (3rd ed.), §8.4. Brooks/Cole, Cengage Learning. The course text: kernels are normal subgroups (Theorem 8.16); a homomorphism is one-to-one exactly when its kernel is trivial (Theorem 8.17); the natural homomorphism onto $G/N$ has kernel $N$ (Theorem 8.18); equal images and equal cosets of the kernel (Lemma 8.19); the first isomorphism theorem for surjective homomorphisms (Theorem 8.20); subgroups of quotient groups (Theorems 8.21 and 8.24, Corollary 8.23); the third isomorphism theorem (Theorem 8.22, optional).
  • Hungerford, T. W. (2014). Abstract Algebra: An Introduction (3rd ed.), §§4.3 to 4.6. Brooks/Cole, Cengage Learning. The course text: irreducibles (Theorem 4.11), their characterization by products (Theorem 4.12, Corollary 4.13), unique factorization (Theorem 4.14), the remainder and factor theorems (Theorems 4.15 and 4.16), roots and irreducibility (Corollaries 4.17 to 4.20), the rational root test (Theorem 4.21), Gauss's lemma (Lemma 4.22, Theorem 4.23), Eisenstein's criterion (Theorem 4.24), reduction modulo $p$ (Theorem 4.25), and the real and complex cases (Theorem 4.26 to Corollary 4.31).
  • Hungerford, T. W. (2014). Abstract Algebra: An Introduction (3rd ed.), §§6.1 to 6.3. Brooks/Cole, Cengage Learning. The course text: congruence modulo an ideal is an equivalence relation (Theorem 6.4) compatible with sums and products (Theorem 6.5); cosets (Theorem 6.6, Corollary 6.7); well-defined coset operations (Theorem 6.8) and the quotient ring (Theorem 6.9); the natural homomorphism (Theorem 6.12); prime ideals and integral domains (Theorem 6.14), maximal ideals and fields (Theorem 6.15), maximal ideals are prime (Corollary 6.16).
  • Hungerford, T. W. (2014). Abstract Algebra: An Introduction (3rd ed.), §§8.2 to 8.5. Brooks/Cole, Cengage Learning. The course text: normal subgroups defined by $Na = aN$; congruence modulo a normal subgroup respects products (Theorem 8.10); equivalent conditions for normality (Theorem 8.11); the coset product is well defined (Theorem 8.12); the quotient group, its order, and quotients of abelian groups (Theorem 8.13); kernels are normal (Theorem 8.16); the natural homomorphism (Theorem 8.18); simple abelian groups (Theorem 8.25); the simplicity of $A_n$ for $n \ge 5$ (§8.5).
  • Hungerford, T. W. (2014). Abstract Algebra: An Introduction (3rd ed.). Brooks/Cole, Cengage Learning. The course text: isomorphisms and homomorphisms of rings, and the comparison of $\mathbb{Z}_{12}$ with $\mathbb{Z}_3 \times \mathbb{Z}_4$, in §3.3; the Chinese remainder theorem for integers (§14.1), its applications (§14.2) and its version for rings (§14.3) in an optional chapter (cited from the section titles only).
  • Hungerford, T. W. (2014). Abstract Algebra: An Introduction (3rd ed.). Brooks/Cole, Cengage Learning. The course text: §6.2, the kernel is an ideal (Theorem 6.10), a homomorphism is one-to-one exactly when its kernel is zero (Theorem 6.11), the natural homomorphism (Theorem 6.12), the first isomorphism theorem for onto homomorphisms (Theorem 6.13); §14.3, the Chinese remainder theorem for rings (cited from the section title only).

BibLaTeX

@book{hungerford-2014-abstract-algebra-introduction,
  author = {Hungerford, T. W.},
  title = {{Abstract Algebra: An Introduction}},
  date = {2014},
  edition = {3}
}

Download · JSON with CSL-JSON · the whole bibliography