Group Theory
Group theory studies multiplication, symmetry and the structures carried by groups across many mathematical settings. This collection develops finite-group structure through Frattini subgroups, extraspecial groups, complements and extensions. Permutation actions, primitivity and socles lead to the O’Nan–Scott landscape, while modular representations, Brauer characters and decomposition matrices describe characteristic-dependent behavior.
The combinatorial and geometric branches study free groups, Schreier rewriting, HNN extensions, small cancellation, decision problems, Cayley graphs and word metrics. Group actions connect large-scale geometry to growth, hyperbolicity and amenability. Trees and graphs of groups provide the Bass–Serre framework; inverse systems and completions lead to profinite and pro-p groups. Cohomology, Schur multipliers and central extensions organize extension problems beyond their concrete presentations.
Coxeter Groups is a separate collection for symmetric-group structure and the general theory of reflection-style presentations. This category retains its general permutation-action pages, whose results apply to many groups beyond the Coxeter families. Representation Theory of Groups develops the broader character and unitary methods. Published and draft page statuses are preserved and distinguish available content from ongoing work.
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 · Group Theory
30 pagesFinite-group structure and permutation actions lead into combinatorial, geometric, profinite and cohomological branches. The elementary projective-line simple-group pair retains its draft status. Coxeter-specific foundations are available in their own category.
Finite matrix calculations construct PSL(2,7), count its elements, prove perfectness, and use its projective-line action to prove simplicity.
1 lemmaExamples & counterexamples →The page starts from the published language of group actions, orbits, free actions, semidirect products, and commutator subgroups.
7 definitions, 2 lemmas, 3 propositions, 6 theorems, 5 corollariesExamples & counterexamples →Published finite simple graph conventions, the walk and path definitions, and the tree characterisation supply the combinatorial background, while the group-action page…
21 definitions, 10 lemmas, 14 propositions, 11 theorems, 4 corollariesExamples & counterexamples →This page develops the concrete degree-one model of group cohomology.
7 definitions, 4 lemmas, 4 theorems, 2 corollaries, 5 false statementsExamples & counterexamples →This page fixes the algorithmic vocabulary before speaking about solvability.
9 definitions, 2 lemmas, 1 proposition, 2 theorems, 2 false statementsExamples & counterexamples →Published notions of centre, commutator subgroup, quotient group, and semidirect product supply the ambient group theory, while the prerequisite Frattini page supplies…
8 definitions, 12 lemmas, 12 propositions, 8 theorems, 8 corollariesExamples & counterexamples →This page records the basic dictionary for group extensions: equivalence and morphisms of short exact sequences, complements, retractions, and the outer action carried by an extension.
6 definitions, 4 lemmas, 2 propositions, 3 theorems, 1 corollary, 4 false statementsExamples & counterexamples →- Hnn Extensions and Brittons Lemma22 results
An HNN extension adjoins one stable letter that conjugates one chosen embedded subgroup of a base group onto another.
6 definitions, 5 lemmas, 2 propositions, 3 theorems, 2 corollaries, 4 false statementsExamples & counterexamples → This page fixes a splitting p-modular system, records reduction of OG-lattices, replaces the semisimple Maschke picture with radicals and Nakayama, develops projective covers…
8 definitions, 3 lemmas, 3 propositions, 9 theorems, 4 corollaries, 5 false statements, 1 remarkExamples & counterexamples →We establish the disc-diagram tools behind the small-cancellation torsion theorem.
5 definitions, 9 lemmas, 3 theoremsExamples & counterexamples →The published free-group page supplies reduced words, free bases, and presentations; this page uses those inputs to analyze subgroups through their right-coset Schreier graphs.
4 definitions, 6 lemmas, 5 theorems, 2 corollaries, 4 false statementsExamples & counterexamples →We construct rescaled ultralimits and prove the sublinear triangle-minsize criterion with its choice and compactness hypotheses explicit.
5 definitions, 14 lemmas, 1 proposition, 3 theoremsExamples & counterexamples →A fixed halting recognizer is compiled into a finite positive semigroup and then a finite group presentation.
2 definitions, 8 lemmas, 3 theorems, 3 false statementsExamples & counterexamples →This page fixes the modular-character package attached to a splitting p-modular system.
7 definitions, 5 lemmas, 2 propositions, 7 theorems, 1 corollary, 5 false statementsExamples & counterexamples →Normalized diagonal bar chains give an explicit finite-index transfer, including its coefficient action and independence from coset representatives.
5 definitions, 12 lemmas, 4 theoremsExamples & counterexamples →Finite integer reduction and commutator calculus lead to finite torsion, two distinct coordinate constructions, weighted collection, and both polynomial growth bounds.
2 definitions, 16 lemmas, 2 theoremsExamples & counterexamples →This page builds inverse limits concretely, adds the finite-discrete topology, characterises profinite groups through compact totally disconnected topology, and then…
12 definitions, 3 lemmas, 11 theorems, 1 corollary, 5 false statementsExamples & counterexamples →Traces of simple modules are separated by explicitly prescribed endomorphisms.
1 definition, 5 lemmas, 1 theoremExamples & counterexamples →This page develops the concrete factor-set model of degree-two group cohomology.
6 definitions, 6 lemmas, 5 theorems, 3 corollaries, 5 false statements, 1 remarkExamples & counterexamples →- Simplicial Trees and Group Actions25 results
This page passes from the library’s finite simple-tree language to the oriented simplicial graphs used in Bass-Serre theory.
9 definitions, 5 lemmas, 4 theorems, 2 corollaries, 5 false statementsExamples & counterexamples → - Small Cancellation and Dehn Algorithms26 results
This page follows the classical symmetrised C'(1/6) route through van Kampen diagrams, Greendlinger's lemma, and Dehn's algorithm.
7 definitions, 6 lemmas, 5 theorems, 3 corollaries, 5 false statementsExamples & counterexamples → - Socles and the Onan Scott Landscape19 results
This page develops the socle-level structure of finite primitive groups.
3 definitions, 4 lemmas, 3 propositions, 2 theorems, 1 corollary, 4 false statements, 2 remarksExamples & counterexamples → This page uses the published word-metric and quasi-isometry machinery, together with geodesic metric spaces and nilpotent-group conventions, to move from algebraic generators to geometric actions.
6 definitions, 5 lemmas, 4 theorems, 2 corollariesExamples & counterexamples →- Graphs of Groups and Bass Serre Theory25 results
This page presents Bass-Serre theory in both directions. Starting from a graph of groups, it defines the path group and the relative fundamental group, establishes a…
7 definitions, 2 lemmas, 8 theorems, 3 corollaries, 5 false statementsExamples & counterexamples → - Pro P Groups and the P Adic Integers25 results
This page specializes profinite inverse limits to finite p-group quotients, builds ℤ p as compatible residue classes, identifies its metric and inverse-limit topologies, and…
6 definitions, 2 lemmas, 3 propositions, 9 theorems, 1 corollary, 4 false statementsExamples & counterexamples → - Quantitative Hyperbolic Geometry Toolkit31 results
This draft develops metric hyperbolicity with explicit constants, local geodesics, word-metric consequences and sequence boundaries.
5 definitions, 24 lemmas, 2 theoremsExamples & counterexamples → The convention throughout is M(G)=H 2(G;ℤ). The degree-two cohomology sequence classifies central extensions with the Axiom of Choice and resolution data specified in its…
10 definitions, 8 lemmas, 3 propositions, 6 theorems, 4 corollaries, 6 false statements, 1 remarkExamples & counterexamples →This page develops the local finite-group theory of components, the layer and the generalized Fitting subgroup F^ (G).
3 definitions, 3 lemmas, 1 theorem, 5 false statements, 8 remarksExamples & counterexamples →- Amenable Groups and Folner Criteria27 results
This page treats amenability through three linked lenses: invariant means, Folner sets, and paradoxical decompositions.
7 definitions, 4 lemmas, 2 propositions, 8 theorems, 2 corollaries, 4 false statementsExamples & counterexamples → - Hyperbolic Spaces and Hyperbolic Groups32 results
This page develops the standard first pass through Gromov hyperbolicity: slim triangles, equivalent formulations, quasi-geodesic stability, quasi-isometry invariance…
7 definitions, 2 lemmas, 3 propositions, 12 theorems, 2 corollaries, 1 example, 5 false statementsExamples & counterexamples →