A topic in the Open Knowledge Graph — a free, open map of 15,290 topics and the order to learn them in.

Basic Properties of Groups

Graduate Depth 76 in the knowledge graph ☐ I know this ☆ Set as goal
616topics build on this
363prerequisites beneath it
See this on the map →
Group Definition and Examples→→Group HomomorphismsMathematical Symmetries and Structures in Composition+1 more
group-properties identity inverse cancellation

Core Idea

Every group has a unique identity element and every element has a unique inverse. The cancellation law holds: if ab = ac then b = c. These properties, derived from the group axioms, establish fundamental facts about group structure and behavior.

Explainer

When you first learn the group axioms from your prerequisite study, the axioms assert that an identity exists and that inverses exist — but they don't immediately say those elements are *unique*. What if a group had two different identity elements? What if some element had two different inverses? The basic properties of groups prove that this cannot happen, and that proof is more instructive than the facts themselves.

The uniqueness of the identity is proved by contradiction: suppose e and e' are both identities. Then e = e·e' (since e' is an identity) = e' (since e is an identity). The argument is just two applications of the axiom, but it reveals something deep — the identity is pinned in place by its own definition. Similarly, uniqueness of inverses follows by multiplying on the left by a supposed second inverse: if both b and c satisfy ab = e and ba = e, then b = b·e = b·(ac) = (ba)·c = e·c = c. Both uniqueness proofs use the associativity axiom in an essential way.

The cancellation law — if ab = ac then b = c — is the group-theoretic analogue of cancelling common factors in arithmetic. Multiply both sides on the left by a⁻¹, and associativity does the rest: a⁻¹(ab) = a⁻¹(ac) gives (a⁻¹a)b = (a⁻¹a)c, then e·b = e·c, then b = c. Notice you need both the existence of inverses and associativity; neither alone suffices. Right-cancellation (ba = ca implies b = c) is proved symmetrically by multiplying on the right.

These properties may seem obvious — of course identity elements are unique, you say. But in abstract algebra, "obvious" is not a proof. A monoid (associative operation with identity, but no inverses) can have a unique identity but fail cancellation. A quasigroup (cancellation holds, but no identity required) is a different structure entirely. What makes a group powerful is precisely the interaction of all four axioms together. Learning to derive consequences from minimal hypotheses — rather than assuming what feels obvious — is the central intellectual habit that abstract algebra trains.

Practice Questions 5 questions

Prerequisite Chain

Understanding Zero → The Number Zero → Counting to Five → Counting to 10 → Counting to 20 → Counting a Set of Objects Up to 20 → Cardinality: The Last Number Counted → Matching Numerals to Quantities → Subitizing Small Quantities → Addition Within 10 → Number Bonds to 10 → Addition Within 20 → Doubles and Near Doubles → Doubles Facts Within 10 → Near Doubles Facts Within 20 → Mental Math Strategies for Addition → Mental Math: Adding and Subtracting Tens → Addition Within 100 → Repeated Addition as Multiplication → Multiplication as Equal Groups → Multiplication: Arrays → Basic Multiplication Facts (0s, 1s, 2s, 5s, 10s) → Multiplication Facts Within 100 → Division as Equal Sharing → Division as Grouping (Measurement Division) → Division: Grouping (Repeated Subtraction) Model → Division: Fair Sharing Model → Division as Equal Sharing → Division as Grouping → Basic Division Facts → Division Facts Within 100 → Multiplication and Division Fact Families → Relationship Between Multiplication and Division → Division Facts as Inverse of Multiplication → Remainders and Quotients in Division → Division Word Problems → Multi-Step Word Problems → Solving Multi-Step Word Problems → Multiplication Word Problems → Division Word Problems → Introduction to Long Division → Factors and Multiples → Prime and Composite Numbers → Equivalent Fractions → Relating Fractions and Decimals → Decimal Place Value → Integers and the Number Line → Comparing and Ordering Integers → Absolute Value → Adding Integers → Subtracting Integers → Multiplying Integers → Introduction to Exponents → Order of Operations → Integer Order of Operations → Variable Expressions → The Distributive Property → Variables and Expressions Review → Introduction to Polynomials → Adding and Subtracting Polynomials → Multiplying Polynomials → Factorial → Permutations → Combinations → Counting Principles: Addition and Multiplication Rules → Introduction to Graph Theory → Propositional Logic Foundations → Logical Equivalences → Set Operations: Union, Intersection, and Complement → Proof by Cases → Proving by Cases and Exhaustion → Vacuous Truth and Trivial Cases → Proof by Cases (Proof by Exhaustion) → Mathematical Induction → Binary Operations and Algebraic Structures → Group Definition and Examples → Basic Properties of Groups

Longest path: 77 steps · 363 total prerequisite topics

Prerequisites (1)

Leads To (3)