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 ExamplesGroup 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 ZeroThe Number ZeroCounting to FiveCounting to 10Counting to 20Counting a Set of Objects Up to 20Cardinality: The Last Number CountedMatching Numerals to QuantitiesSubitizing Small QuantitiesAddition Within 10Number Bonds to 10Addition Within 20Doubles and Near DoublesDoubles Facts Within 10Near Doubles Facts Within 20Mental Math Strategies for AdditionMental Math: Adding and Subtracting TensAddition Within 100Repeated Addition as MultiplicationMultiplication as Equal GroupsMultiplication: ArraysBasic Multiplication Facts (0s, 1s, 2s, 5s, 10s)Multiplication Facts Within 100Division as Equal SharingDivision as Grouping (Measurement Division)Division: Grouping (Repeated Subtraction) ModelDivision: Fair Sharing ModelDivision as Equal SharingDivision as GroupingBasic Division FactsDivision Facts Within 100Multiplication and Division Fact FamiliesRelationship Between Multiplication and DivisionDivision Facts as Inverse of MultiplicationRemainders and Quotients in DivisionDivision Word ProblemsMulti-Step Word ProblemsSolving Multi-Step Word ProblemsMultiplication Word ProblemsDivision Word ProblemsIntroduction to Long DivisionFactors and MultiplesPrime and Composite NumbersEquivalent FractionsRelating Fractions and DecimalsDecimal Place ValueIntegers and the Number LineComparing and Ordering IntegersAbsolute ValueAdding IntegersSubtracting IntegersMultiplying IntegersIntroduction to ExponentsOrder of OperationsInteger Order of OperationsVariable ExpressionsThe Distributive PropertyVariables and Expressions ReviewIntroduction to PolynomialsAdding and Subtracting PolynomialsMultiplying PolynomialsFactorialPermutationsCombinationsCounting Principles: Addition and Multiplication RulesIntroduction to Graph TheoryPropositional Logic FoundationsLogical EquivalencesSet Operations: Union, Intersection, and ComplementProof by CasesProving by Cases and ExhaustionVacuous Truth and Trivial CasesProof by Cases (Proof by Exhaustion)Mathematical InductionBinary Operations and Algebraic StructuresGroup Definition and ExamplesBasic Properties of Groups

Longest path: 77 steps · 363 total prerequisite topics

Prerequisites (1)

Leads To (3)