Abstract Algebra
Abstract algebra develops structures defined by operations and the maps that preserve them. Its group sequence moves from subgroups, cosets, quotients and homomorphisms to actions, products, presentations, finite-group structure and solvability. Ring topics include ideals, quotient rings, divisibility, Euclidean and principal ideal domains, polynomial rings and localization. Field theory covers algebraic extensions, finite fields, splitting fields, separability, algebraic closures, cyclotomic extensions and Galois correspondence. Modules and exact sequences lead to tensor products, chain conditions, semisimplicity and canonical forms; the collection also develops finite-group characters and induced representations.
Some topics draw on Linear Algebra, Lie Theory and Functional Analysis, while others use results from Number Theory and Real Analysis. Algebraic structures and representation methods from this collection serve later work in Commutative Algebra, Algebraic Geometry, Representation Theory of Groups, Symmetric Groups and Symmetric Functions, and Coxeter Groups. Their results also recur in Combinatorics, Complex Analysis, Topology, Quantum Computing and related subjects, where groups, rings, fields and modules provide essential algebraic tools.
Pathway
The parts run in order. Everything a page needs from this group has been read by the time you reach it, and the level on each row is how many dependency steps into the group that page sits.
Part 1 · Groups, quotients and homomorphisms
5 pagesThe naturals, the integers, the rationals and the reals were each built with their own proofs of the same handful of facts, and a group is what those facts have in common: one associative operation, an identity, inverses. Cosets partition a group and give Lagrange's theorem, normality is the condition under which the cosets themselves form a group, and the isomorphism theorems say that every homomorphism is a quotient followed by an inclusion.
This page opens the abstract algebra track. Everything the library has built so far, the naturals, the integers, the rationals and the reals, was built one structure at a…
12 definitions, 13 lemmas, 2 theoremsExamples & counterexamples- Cosets, Index and Lagrange's Theorem15 results
Published definitions of groups and subgroups, finite cardinality and finite sums, integer divisibility, congruence classes, and the unit group modulo a positive integer provide the algebraic and counting setting.
2 definitions, 5 lemmas, 3 theorems, 5 corollariesExamples & counterexamples - Normal Subgroups and Quotient Groups18 results
Published group, subgroup, and coset results provide the ambient algebra.
5 definitions, 3 lemmas, 2 propositions, 5 theorems, 3 corollariesExamples & counterexamples Groups, normal subgroups, and quotient groups supply the ambient language.
3 definitions, 4 lemmas, 11 theorems, 2 corollariesExamples & counterexamples- Cyclic Groups and Direct Products6 results
The earlier development of groups, subgroups, element orders, and homomorphisms provides the language used here.
1 definition, 1 proposition, 4 theoremsExamples & counterexamples
Part 2 · Actions, permutations and presentations
3 pages · after Part 1A group acts when its elements become symmetries of a set, and the orbit-stabiliser relation turns a question about the group into a count. Cayley's theorem embeds any group in a symmetric group, cycle decomposition and the sign homomorphism describe permutations, and the alternating group is simple for degree at least five. In the other direction a free group has no relations at all, so every group is a quotient of one, which is what a presentation and an amalgamated free product are built from.
- Free Groups and Presentations32 results
Groups, homomorphisms, kernels, quotient groups, and isomorphisms supply the algebraic framework for the constructions here.
11 definitions, 2 lemmas, 4 propositions, 12 theorems, 3 corollariesExamples & counterexamples A group action turns the elements of a group into symmetries of a set.
9 definitions, 6 lemmas, 17 theorems, 5 corollariesExamples & counterexamples- Free Products and Amalgamation27 results
The declared prerequisites provide free groups, group presentations, von Dyck's theorem, normal closures, cyclic groups, and external direct products.
5 definitions, 2 lemmas, 1 proposition, 7 theorems, 11 corollaries, 1 remarkExamples & counterexamples
Part 3 · Finite and solvable groups
2 pages · after Parts 1 and 2A finite abelian group is a direct product of cyclic groups of prime power order, and the decomposition is unique, so the classification of that class is complete. A composition series breaks any finite group into simple pieces, Jordan-Holder says the pieces do not depend on the series, and solvability is the case where each piece is abelian.
Normal subgroups, quotient groups, isomorphism theorems, automorphisms, commutators, centres, direct products, and the well-ordering principle for ℕ provide the language used here.
7 definitions, 4 lemmas, 14 theorems, 2 corollariesExamples & counterexamplesFinite abelian groups inherit the cyclic-group classification, Lagrange's theorem, quotient groups, and external direct products from the declared cyclic-groups development.
8 definitions, 3 lemmas, 9 theorems, 7 corollariesExamples & counterexamples
Part 4 · Rings, ideals and polynomials
5 pages · after Parts 1 and 3A ring has two operations, and the interaction between them is what the earlier number systems kept re-proving. Ideals are the subobjects a quotient can be taken by, and the same isomorphism theorems hold. Divisibility then generalises: a Euclidean domain has division with remainder, every Euclidean domain is a principal ideal domain, and every principal ideal domain has unique factorisation. Polynomial rings supply the working examples, and the field of fractions and localisation invert what a domain lacks.
A group has one operation. Every number system this library has built has two, and every one of them re-proved the same handful of facts about how the two interact: that…
13 definitions, 14 lemmas, 1 theoremExamples & counterexamplesRings, unital subrings, additive quotients, group kernels, and Zorn's lemma provide the starting point.
5 definitions, 3 lemmas, 2 propositions, 13 theorems, 1 corollaryExamples & counterexamplesCommutative rings, integral domains, ideals, and units supply the setting for divisibility beyond the integers.
5 definitions, 1 lemma, 1 theoremExamples & counterexamplesEuclidean domains, principal ideal domains, unique factorisation domains, and the implication from Euclidean to principal ideal domain provide the divisibility framework used for polynomials over a field.
8 definitions, 5 lemmas, 3 propositions, 17 theorems, 10 corollaries, 1 remarkExamples & counterexamples- The Field of Fractions and Localisation24 results
The prerequisites supply commutative rings, homomorphisms, units, integral domains, ideals, quotient rings, fields, and polynomial rings.
5 definitions, 1 lemma, 3 propositions, 8 theorems, 6 corollaries, 1 exampleExamples & counterexamples
Part 5 · Field extensions
5 pages · after Part 4Adjoining a root of an irreducible polynomial is a quotient of a polynomial ring by a maximal ideal, which is how the complex numbers appear here rather than by decree. A splitting field factors a polynomial completely and is unique up to isomorphism; degrees multiply in towers, which classifies the finite fields; symmetric polynomials express what depends on the roots but not their order; and an algebraic closure exists, with embeddings and separability measuring how many extensions of a map there are.
Fields, subfields, polynomial rings, evaluation, division, irreducibility, principal ideals, and quotient rings provide the algebraic setting for adjoining elements.
4 definitions, 2 lemmas, 10 theorems, 5 corollariesExamples & counterexamples- Splitting Fields18 results
The prerequisites provide field extensions, generated subfields, polynomial evaluation, roots, factorisation, minimal polynomials, irreducible-root adjunctions, and power bases.
2 definitions, 3 lemmas, 6 propositions, 4 theorems, 3 corollariesExamples & counterexamples A field extension is a vector space over its base, so the published theory of bases and dimension measures its size: a basis has a well-defined cardinality and every element has unique coordinates with respect to it.
6 definitions, 3 lemmas, 4 propositions, 16 theorems, 5 corollaries, 1 counterexampleExamples & counterexamplesA splitting field presents a monic polynomial as a product of linear factors, so its roots are available in an extension field.
8 definitions, 2 lemmas, 3 propositions, 9 theorems, 7 corollariesExamples & counterexamplesPolynomial rings, finite extensions, splitting fields, and Frobenius provide the background for controlling algebraic roots.
13 definitions, 8 lemmas, 1 proposition, 25 theorems, 13 corollaries, 1 exampleExamples & counterexamples
Part 6 · Modules
5 pages · after Parts 2, 4 and 5A module is a vector space over a ring instead of a field, so a submodule need not be a direct summand and dimension need not exist. Exact sequences state that failure, free, projective and injective modules describe when it can be repaired, and the tensor product linearises bilinear maps. Chain conditions bound it from the other side, and Wedderburn-Artin says which rings have none. Over a principal ideal domain it disappears: a submodule of a finite free module has an aligned basis, yielding invariant factors, elementary divisors, Smith normal form and their uniqueness. Over the integers that classifies the finitely generated abelian groups; over a polynomial ring it gives rational canonical form, Cayley-Hamilton, Jordan form, and the similarity criterion.
Rings and ideals provide the scalars and quotient constructions used here, while vector spaces supply the motivating special case over a field.
7 definitions, 2 lemmas, 1 proposition, 4 theoremsExamples & counterexamplesModules, submodules, quotient modules, kernels, images, cokernels, and the module isomorphism theorems supply the algebraic background.
9 definitions, 4 lemmas, 15 theorems, 1 corollaryExamples & counterexamples- Tensor Products of Modules42 results
Left and right modules over a ring, module homomorphisms with their kernels, images and cokernels, quotient modules and the universal property of a quotient are published, as…
10 definitions, 4 propositions, 20 theorems, 8 corollariesExamples & counterexamples Submodules, quotient modules, short exact sequences, direct sums, simple modules, projective modules, and the module isomorphism theorem provide the algebraic language for chain conditions.
11 definitions, 1 proposition, 24 theorems, 7 corollariesExamples & counterexamplesModules, free modules, exact sequences, Noetherian conditions, principal ideals, determinants, and fraction fields supply the algebraic setting.
8 definitions, 5 lemmas, 6 propositions, 12 theorems, 8 corollariesExamples & counterexamples
Part 7 · Sylow theory and split extensions
11 pages · after Parts 2, 3, 4, 5 and 6A split extension is a semidirect product, so actions assemble groups from normal pieces, and Sylow theory turns the prime divisors of into existence, conjugacy, and counting statements for -subgroups. Nilpotence, the Frattini subgroup, the Galois correspondence, finite fields, cyclotomic extensions, solvability by radicals, and Artin's proof of the fundamental theorem of algebra show how extensions are built. Representation theory then passes to -modules, where Maschke gives semisimplicity. Finite averaging supplies the intervening linear-algebra and character-theory interface: projections, idempotent traces, class-function indicators, the normalized Hermitian form, equality for finite unit sums, and the Galois behavior of cyclotomic averages. Characters can then encode orthogonality and central-character arithmetic, while induction adds Frobenius reciprocity, Mackey decomposition, and Burnside's solvability theorem.
Group actions, their correspondence with homomorphisms into a symmetric group, normal subgroups, quotient groups and the first isomorphism theorem are the published setting for an extension.
8 definitions, 5 lemmas, 5 propositions, 6 theorems, 1 corollaryExamples & counterexamplesFinite group actions, orbit-stabilizer, the fixed-point congruence for finite p-groups, and the prime factorization of |G| provide the counting framework for Sylow theory.
8 definitions, 7 lemmas, 20 theorems, 6 corollaries, 5 false statementsExamples & counterexamplesThis page builds the finite-group representation language from the group algebra upward.
9 definitions, 1 proposition, 7 theorems, 6 corollariesExamples & counterexamplesThis page is the finite-group semisimplicity seam. It begins on the representation side with complete reducibility and Maschke's averaging projection, then crosses the…
4 definitions, 1 lemma, 7 theorems, 6 corollaries, 1 remarkExamples & counterexamples- The Galois Correspondence30 results
Finite extensions, splitting fields, embeddings into algebraic closures, normality, and separability provide the field-theoretic background.
6 definitions, 3 lemmas, 3 propositions, 14 theorems, 4 corollariesExamples & counterexamples - Finite Fields and Cyclotomic Extensions64 results
Finite fields on this page are governed by the Frobenius endomorphism, Artin's fixed-field theorem, and the finite Galois correspondence.
5 definitions, 12 lemmas, 6 propositions, 17 theorems, 4 corollaries, 13 examples, 1 counterexample, 5 false statements, 1 remarkExamples & counterexamples - The Fundamental Theorem of Algebra13 results
This page proves the fundamental theorem of algebra below the later analytic minimum-modulus proof, so the route here is deliberately different.
3 lemmas, 1 proposition, 3 theorems, 6 corollariesExamples & counterexamples These nine lemmas supply the finite linear algebra, function-space, and field-theoretic arguments used in finite averaging and character theory.
9 lemmasExamples & counterexamplesFinite Galois extensions, roots of unity, the Galois correspondence, solvable groups, and the earlier determinant, trace, and bilinear-form pages provide the background here.
7 definitions, 3 lemmas, 14 theorems, 4 corollariesExamples & counterexamplesThis page is ordinary character theory: throughout, G is finite, the base field is ℂ, and every representation is finite-dimensional.
9 definitions, 2 lemmas, 2 propositions, 11 theorems, 5 corollaries, 1 remarkExamples & counterexamplesThis page builds induction in the function model, shows how a choice of left coset representatives turns it into a direct sum, and derives the resulting character formula.
6 definitions, 1 lemma, 3 propositions, 12 theorems, 4 corollaries, 1 remarkExamples & counterexamples
Part 8 · Algebra and representation interfaces
3 pages · after Parts 5 and 6These draft extensions connect the existing foundations to algebraic structures and representation problems motivated by theoretical physics. Each companion supplies the planned examples and boundary cases; exact hypotheses, local proof obligations, and reuse holds remain in its page contract.
This page defines the finite-dimensional Heisenberg Lie algebra and the algebraic polynomial Weyl algebra with its central parameter.
2 definitions, 3 lemmas, 2 theorems, 1 remarkExamples & counterexamplesThis page develops three bounded constructions. A Jordan algebra is a commutative algebra satisfying the Jordan identity, not necessarily an associative algebra. The…
7 definitions, 2 lemmas, 1 proposition, 4 theoremsExamples & counterexamplesThis page connects the standard algebra, module, representation, and tensor language.
1 definition, 1 theoremExamples & counterexamples