Operations and axioms
Set
Set
SMeaning
A collection of distinct objects treated as one mathematical object.
When to use it
Use a set to specify the carrier on which algebraic operations are defined.
Worked example
ℤ={..., -2, -1, 0, 1, 2, ...}.Math Reference
Learn algebraic structures from operations and groups through rings, fields, finite fields, modules, and vector spaces with definitions and worked examples.
Each structure adds specific axioms; fields support division by every nonzero element.
ℤ/nℤ is a field exactly when n is prime; composite moduli can contain zero divisors.
63 matching terms
Operations and axioms
Set
SA collection of distinct objects treated as one mathematical object.
Use a set to specify the carrier on which algebraic operations are defined.
ℤ={..., -2, -1, 0, 1, 2, ...}.Operations and axioms
Binary operation
*:S×S→SA rule that combines two elements of a set and returns one element of the same set.
Use it as the operation underlying magmas, semigroups, groups, rings, and fields.
Addition is a binary operation on ℤ because a+b∈ℤ for all integers a and b.Operations and axioms
Closure
The property that applying an operation to allowed elements always produces another allowed element.
Check closure before claiming that a subset inherits an algebraic structure.
The positive integers are closed under addition but not under subtraction.Operations and axioms
Associativity
(a*b)*c=a*(b*c)The property that regrouping three operands does not change the result.
Use it to omit parentheses in repeated products or sums and to define powers consistently.
Matrix multiplication is associative even though it is not generally commutative.Operations and axioms
Commutativity
a*b=b*aThe property that exchanging the order of two operands does not change the result.
Use it to distinguish Abelian groups and commutative rings from noncommutative structures.
Integer multiplication is commutative, while matrix multiplication usually is not.Operations and axioms
Identity element
eAn element that leaves every element unchanged when used in the operation.
Use it to define inverses, powers, monoids, groups, and rings with identity.
0 is the additive identity and 1 is the multiplicative identity in ℤ.Operations and axioms
Inverse element
a⁻¹An element that combines with a given element to produce the identity.
Use it to reverse group operations and determine which ring elements are units.
The additive inverse of 5 is -5; the multiplicative inverse of 3 in ℚ is 1/3.Operations and axioms
Magma
(M,*)A set equipped with one closed binary operation, without requiring associativity or an identity.
Use it as the least restrictive starting point in the hierarchy of one-operation structures.
Every semigroup is a magma, but a magma need not be associative.Operations and axioms
Semigroup
(S,*)A magma whose operation is associative.
Use it to model composable processes that do not necessarily have an identity or inverses.
All nonempty strings form a semigroup under concatenation.Operations and axioms
Monoid
(M,*,e)A semigroup with an identity element.
Use it for sequences, transformations, endomorphisms, and computations that compose from a neutral value.
All strings including the empty string form a monoid under concatenation.Groups
Group
(G,*)A monoid in which every element has an inverse.
Use groups to describe symmetries and reversible operations.
The integers form a group under addition.Groups
Abelian group
a*b=b*aA group whose operation is commutative.
Use it for additive structures such as integers, vectors, and the additive part of a ring.
Every vector space is an Abelian group under vector addition.Groups
Subgroup
H≤GA subset of a group that is itself a group under the restricted operation.
Use it to isolate symmetries, generated elements, stabilizers, and solution sets inside a group.
2ℤ is a subgroup of (ℤ,+).Groups
Cyclic group
G=⟨g⟩A group generated by one element.
Use it to represent every group element as a power or integer multiple of one generator.
(ℤ/nℤ,+) is cyclic and generated by [1].Groups
Group generator
⟨g⟩An element or set of elements whose repeated operations and inverses produce the entire group.
Use it to give compact presentations and test whether a group is cyclic.
The element [1] generates the additive group ℤ/5ℤ.Groups
Order of a group element
ord(g)The smallest positive exponent that sends an element to the identity.
Use it to determine cycle length and generated subgroup size.
In the additive group ℤ/6ℤ, the element [2] has element order 3.Groups
Order of a group
|G|The number of elements in a finite group.
Use it with Lagrange's theorem, counting arguments, and classification of finite groups.
The symmetry group of an equilateral triangle has group order 6.Groups
Coset
gH or HgA translate of a subgroup obtained by multiplying every subgroup element by a fixed group element.
Use cosets to partition a group and construct quotient groups.
The cosets of 3ℤ in ℤ are 3ℤ, 1+3ℤ, and 2+3ℤ.Groups
Lagrange's theorem
|G|=[G:H]|H|For a finite group, the order of every subgroup divides the order of the group.
Use it to restrict possible subgroup and element orders.
A finite group with group order 12 cannot contain a subgroup with group order 5.Groups
Normal subgroup
N◁GA subgroup whose left and right cosets coincide for every group element.
Use it as the condition required for cosets to form a quotient group.
The kernel of every group homomorphism is a normal subgroup.Groups
Quotient group
G/NA group of cosets formed from a group and a normal subgroup.
Use it to collapse a normal subgroup to the identity and study group structure at a coarser scale.
ℤ/nℤ is the quotient group ℤ/nℤ under addition.Groups
Group homomorphism
φ(ab)=φ(a)φ(b)A map between groups that preserves the group operation.
Use it to compare groups while retaining their algebraic operation.
The map φ:ℤ→ℤ/nℤ given by φ(k)=[k] preserves addition.Groups
Group isomorphism
G≅HA bijective group homomorphism showing that two groups have the same abstract structure.
Use it to treat differently represented groups as structurally identical.
Every infinite cyclic group is isomorphic to (ℤ,+).Groups
Kernel of a group homomorphism
ker(φ)The subgroup of elements mapped to the identity of the target group.
Use it to measure information lost by a homomorphism and test injectivity.
A group homomorphism is injective if and only if its kernel is the identity subgroup.Groups
Image of a group homomorphism
im(φ)The subgroup of target elements actually reached by a homomorphism.
Use it to determine the effective output structure and test surjectivity.
A homomorphism is surjective exactly when its image equals the target group.Groups
First isomorphism theorem for groups
G/ker(φ)≅im(φ)A theorem identifying the quotient by a homomorphism's kernel with its image.
Use it to connect kernels, images, and quotient structures.
For φ:ℤ→ℤ/nℤ, ℤ/nℤ≅im(φ).Groups
Direct product of groups
G×HA group formed from ordered pairs with componentwise operations.
Use it to combine independent group structures and decompose finite Abelian groups.
ℤ/2ℤ×ℤ/3ℤ is isomorphic to ℤ/6ℤ.Rings
Ring
(R,+,×)A set whose addition forms an Abelian group and whose associative multiplication distributes over addition.
Use rings to study integers, polynomials, matrices, and modular arithmetic with addition and multiplication.
ℤ is a commutative ring with identity.Rings
Commutative ring
ab=baA ring whose multiplication is commutative.
Use it in number theory and algebraic geometry where polynomial-like multiplication is commutative.
ℤ and F[x] are commutative rings when F is a field.Rings
Ring with identity
1_RA ring containing a multiplicative identity element.
Use it when defining units, modules with scalar identity, and homomorphisms that preserve 1.
The even integers form a ring without their own multiplicative identity under the inherited operations.Rings
Subring
S⊆RA subset that is itself a ring under the operations inherited from a larger ring.
Use it to identify smaller arithmetic systems inside a ring.
The integers ℤ form a subring of the rational numbers ℚ.Rings
Unit of a ring
R×An element possessing a multiplicative inverse inside the ring.
Use units to identify reversible multiplication and form the multiplicative group of a ring.
The units of ℤ are 1 and -1.Rings
Zero divisor
ab=0A nonzero ring element that multiplies with another nonzero element to give zero.
Use it to detect failure of cancellation and distinguish integral domains from general rings.
In ℤ/6ℤ, [2][3]=[0]; therefore [2] and [3] are zero-divisor elements.Rings
Nilpotent element
a^k=0An element whose positive power equals zero.
Use it to study nonreduced rings, matrix structure, and infinitesimal algebraic behavior.
The matrix [[0,1],[0,0]] is nonzero but its square is zero.Rings
Integral domain
A nonzero commutative ring with identity and no zero divisors.
Use it where cancellation works and fractions can be constructed consistently.
ℤ is an integral domain but not a field.Rings
Division ring
A ring in which every nonzero element has a multiplicative inverse, without requiring multiplication to commute.
Use it to distinguish noncommutative division structures from fields.
The quaternions form a division ring but not a field.Rings
Ideal
I◁RAn additive subgroup that absorbs multiplication by arbitrary ring elements from the required side or sides.
Use ideals as kernels of ring homomorphisms and to construct quotient rings.
nℤ is an ideal of ℤ.Rings
Principal ideal
(a)An ideal generated by one element.
Use it to express divisibility and compare principal ideal domains with more general rings.
In ℤ, the ideal generated by 6 is (6)=6ℤ.Rings
Quotient ring
R/IA ring of cosets formed by identifying every element of an ideal with zero.
Use it to impose algebraic relations and model modular arithmetic.
ℤ/nℤ is the quotient ring ℤ/(n).Rings
Polynomial ring
R[x]The ring of polynomials with coefficients in a ring R.
Use it for equations, factorization, ideals, field extensions, and algebraic geometry.
When F is a field, the polynomial ring F[x] is a Euclidean domain.Rings
Matrix ring
Mₙ(R)The ring of square matrices over a ring, using matrix addition and multiplication.
Use it for linear transformations and as a standard example of a noncommutative ring.
M₂(ℝ) is a ring, but matrix multiplication is not commutative.Rings
Ring homomorphism
φ(a+b), φ(ab)A map preserving ring addition and multiplication, with identity preservation depending on convention.
Use it to compare rings and obtain ideals as kernels.
State whether ring homomorphisms are required to preserve the multiplicative identity.
Evaluation f(x)↦f(0) is a ring homomorphism from R[x] to R.Rings
Ring isomorphism
R≅SA bijective ring homomorphism showing that two rings have the same ring structure.
Use it to replace a ring with an easier but structurally equivalent representation.
The Chinese remainder theorem can give ℤ/15ℤ≅ℤ/3ℤ×ℤ/5ℤ.Fields
Field
(F,+,×)A commutative ring with 1 not equal to 0 in which every nonzero element has a multiplicative inverse.
Use fields as scalar systems for exact division, vector spaces, polynomials, and linear algebra.
ℚ, ℝ, and ℂ are fields, while ℤ is not.Fields
Subfield
K⊆FA subset of a field that is itself a field under the inherited operations.
Use it to compare scalar systems and define field extensions.
ℚ is a subfield of ℝ, and ℝ is a subfield of ℂ.Fields
Characteristic of a field
char(F)The smallest positive number of copies of 1 that sum to zero, or 0 if none exists.
Use it to distinguish characteristic-zero fields from finite-characteristic arithmetic.
The rational field has char(ℚ)=0, while the finite prime field has char(𝔽ₚ)=p.Fields
Prime field
The smallest subfield contained in a field, isomorphic to ℚ or to 𝔽ₚ.
Use it as the arithmetic foundation generated by the multiplicative identity.
Every field of characteristic p contains a copy of 𝔽ₚ.Fields
Finite field
𝔽_qA field containing finitely many elements.
Use it in coding theory, cryptography, checksums, and finite geometry.
The field 𝔽₅={0,1,2,3,4} uses arithmetic modulo 5 for both addition and multiplication.Fields
Prime-power order of a finite field
q=pⁿA finite field exists with q elements exactly when q is a power of a prime.
Use it to determine valid finite-field sizes before constructing one.
A field with 8 elements exists, but a field with 6 elements does not.Fields
Galois field
GF(pⁿ)Another name for the finite field with pⁿ elements, unique up to isomorphism.
Use it for extension-field arithmetic in error-correcting codes and cryptographic systems.
GF(2⁸) is widely used for byte-oriented finite-field arithmetic.Fields
Field extension
L/KA field L containing a field K as a subfield.
Use it to adjoin roots, enlarge scalar systems, and construct finite fields.
ℂ/ℝ is a field extension obtained by adjoining i.Fields
Degree of a field extension
[L:K]The vector-space dimension of L when regarded as a vector space over K.
Use it to measure extension size and apply the tower law.
The extension degree is [ℂ:ℝ]=2, with basis {1,i} over ℝ.Fields
Algebraic element
An extension-field element that is a root of a nonzero polynomial over the base field.
Use it to construct finite-degree extensions and classify numbers over a field.
√2 is algebraic over ℚ because it satisfies x²-2=0.Fields
Transcendental element
An extension-field element satisfying no nonzero polynomial over the base field.
Use it to distinguish transcendental extensions from algebraic ones.
π and e are transcendental over ℚ.Fields
Minimal polynomial
m_α(x)The unique monic irreducible polynomial of least degree over the base field having an algebraic element as a root.
Use it to determine extension degree and arithmetic relations of an algebraic element.
The minimal polynomial of √2 over ℚ is x²-2.Fields
Splitting field
The smallest field extension over which a polynomial factors completely into linear factors.
Use it to contain all polynomial roots and study their symmetries.
The splitting field of x²+1 over ℝ is ℂ.Fields
Algebraic closure
An algebraic extension that is algebraically closed, so every nonconstant polynomial has a root.
Use it as a setting where polynomial equations split completely.
ℂ is algebraically closed and is an algebraic closure of ℝ only after noting ℂ/ℝ is algebraic.Connections and examples
Module
M over RAn Abelian group with scalar multiplication by elements of a ring.
Use modules to generalize vector spaces when scalars come from a ring rather than a field.
Every Abelian group is naturally a module over the integer ring ℤ.Connections and examples
Vector space over a field
V over FAn Abelian group with scalar multiplication by a field satisfying the vector-space axioms.
Use it to connect field structure with linear algebra, bases, dimension, and linear transformations.
ℂ is a two-dimensional vector space over ℝ.Connections and examples
Algebra over a field
A over FA vector space over a field equipped with a compatible bilinear multiplication.
Use it to combine linear algebra with ring multiplication.
Mₙ(F) is an algebra over F.Connections and examples
When ℤ/nℤ is a field
The quotient ring ℤ/nℤ is a field exactly when n is prime.
Use it to distinguish prime-modulus arithmetic from composite-modulus arithmetic with zero divisors.
ℤ/5ℤ is a field, but ℤ/6ℤ is not because [2][3]=[0].Connections and examples
Unit group of a ring
R×The group formed by all multiplicatively invertible elements of a ring.
Use it to connect ring multiplication with group theory and modular arithmetic.
(ℤ/nℤ)× contains exactly the residue classes coprime to n.Connections and examples
Scalar field
FThe field from which vector-space coefficients and matrix entries are taken.
State it because rank, eigenvalues, factorization, and solvability can change with the scalar field.
The matrix [[0,-1],[1,0]] has no real eigenvalues but has eigenvalues i and -i over ℂ.