# Category:Theorems in abstract algebra

Computing portal |

Here is a list of articles in the category **Theorems in abstract algebra** of the Computing portal that unifies foundations of mathematics and computations using computers.

## Subcategories

This category has the following 6 subcategories, out of 6 total.

### A

### G

### I

### R

## Pages in category "Theorems in abstract algebra"

The following 56 pages are in this category, out of 56 total.

### A

- Abhyankar's conjecture
*(computing)* - Abhyankar's inequality
*(computing)* - Abhyankar's lemma
*(computing)* - Ado's theorem
*(computing)* - Andreotti–Grauert theorem
*(computing)* - Artin approximation theorem
*(computing)* - Artin–Tate lemma
*(computing)* - Artin–Wedderburn theorem
*(computing)* - Artin–Zorn theorem
*(computing)* - Auslander–Buchsbaum formula
*(computing)* - Auslander–Buchsbaum theorem
*(computing)*

### B

- Beauville–Laszlo theorem
*(computing)* - Brauer–Nesbitt theorem
*(computing)*

### C

- Cartan's theorem
*(computing)* - Cartan–Dieudonné theorem
*(computing)* - Chevalley–Shephard–Todd theorem
*(computing)* - Closed-subgroup theorem
*(computing)* - Cohen structure theorem
*(computing)*

### D

- Dimension theorem for vector spaces
*(computing)* - Dold–Kan correspondence
*(computing)* - Double centralizer theorem
*(computing)*

### E

- Eakin–Nagata theorem
*(computing)* - Eckmann–Hilton argument
*(computing)*

### F

- Frobenius theorem (real division algebras)
*(computing)* - Fundamental theorem on homomorphisms
*(computing)*

### G

- Gabriel–Popescu theorem
*(computing)* - Generic flatness
*(computing)* - Going up and going down
*(computing)* - Goldie's theorem
*(computing)*

### H

- Hilbert's basis theorem
*(computing)* - Hilbert's syzygy theorem
*(computing)* - Hopkins–Levitzki theorem
*(computing)* - Hurwitz's theorem (composition algebras)
*(computing)* - Hurwitz's theorem (normed division algebras)
*(computing)*

### I

- Isomorphism extension theorem
*(computing)*

### J

- Jacobson density theorem
*(computing)*

### K

- Krull's principal ideal theorem
*(computing)* - Krull's separation lemma
*(computing)*

### L

- Latimer–MacDuffee theorem
*(computing)* - Levitzky's theorem
*(computing)* - Lie's third theorem
*(computing)*

### M

- Milnor–Moore theorem
*(computing)* - Mori–Nagata theorem
*(computing)* - Multiplicity theory
*(computing)*

### N

- Nakayama's lemma
*(computing)*

### P

- Poincaré–Birkhoff–Witt theorem
*(computing)* - Primary decomposition
*(computing)* - Primitive element theorem
*(computing)*

### Q

- Quillen's lemma
*(computing)* - Quillen–Suslin theorem
*(computing)*

### R

- Regev's theorem
*(computing)*

### S

- Serre's criterion for normality
*(computing)* - Serre's theorem on a semisimple Lie algebra
*(computing)*

### W

- Wedderburn's little theorem
*(computing)* - Whitehead's lemma
*(computing)*

### Z

- Zariski's lemma
*(computing)*