Groups, rings and fields: formulas
Pick a formula to see it explained with worked examples and a solver that shows every step.
About this topic
These are collections of things with rules for combining them. They describe symmetry and the structure of number systems. On this page you will find 15 pages, such as Sylow theorems, Smith normal form and Lagrange's theorem.
You will find clear examples, tips on mistakes and a step-by-step solver on every page. Begin with Sylow theorems.
Formulas in this topic
- Sylow theoremsIf |G|=p^(a)m with pnmid m, then G has subgroups of order p^(a) (Sylow p-subgroups), and their number n_p sat
- Fundamental theorem of finite abelian groupsEvery finite abelian group is isomorphic to a product of cyclic groups mathbb Z_n_1×…×mathb
- Eisenstein's criterionLet f(x)=a_nxⁿ+…+a_0 have integer coefficients. If a prime p divides every a_i with i<n, does not divi
- Smith normal formEvery integer matrix A can be reduced by integer row and column operations to diag(d_1,dots,d_
- Lagrange's theoremLagrange's theorem: if H is a subgroup of a finite group G, then |G|=|H|[G:H]; in particular |H| divides |G|
- Order of an elementThe order of an element g is the smallest n≥1 with gⁿ=e. In a finite group, ord(g) divides
- Orders of standard groupsThe orders of the standard groups: |S_n|=n!, |A_n|=tfracn!2, |D_n|=2n (symmetries of a regular n-gon), |ma
- Orbit–stabiliser theoremIf a finite group G acts on a set, then for each point x, |G|=|Orb(x)|·|Stab
- Burnside's lemmaBurnside's lemma: the number of orbits of a finite group G acting on a set equals the average number of fixed
- Class equationThe class equation of a finite group is |G|=|Z(G)|+Σ[G:C_G(g_i)], where Z(G) is the centre and the sum runs
- First isomorphism theoremIf varphi:G→ H is a group homomorphism, then G/kervarphicongimvarphi. For finite groups
- Cyclic group: number of generatorsThe cyclic group mathbb Z_n has exactly varphi(n) generators: the residues k with gcd(k,n)=1.
- Polynomial remainder in a fieldIn F[x], where F is a field, any polynomial f can be written uniquely as f=qg+r with deg r<deg g (for g≠0)
- Tower lawFor fields Fsubseteq Esubseteq K, the degrees of the extensions multiply: [K:F]=[K:E][E:F]. The degree is
- Fundamental theorem (counting)For a Galois extension K/F, |Gal(K/F)|=[K:F], and the intermediate fields correspond one-to-one
Groups, rings and fields questions
What is a group?
It is a set with one way of combining things that follows a few simple rules.
What if I get stuck?
Read the worked examples on the page first, then try the solver with your own numbers and compare each step.