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

Binary Relations

College Depth 71 in the knowledge graph ☐ I know this ☆ Set as goal
3,254topics build on this
324prerequisites beneath it
See this on the map →
Cartesian ProductPartial Orders→→Axiom of ChoiceCategories and Morphisms+11 more
relations binary

Core Idea

A binary relation R on sets A and B is a subset of A × B, expressing relationships between elements. Relations have properties: reflexive (relates to itself), symmetric (mutual), transitive (chaining). These properties characterize equivalence and ordering relations.

Explainer

When you studied the Cartesian product A × B, you saw how to form ordered pairs from two sets. A binary relation is simply a *selection* from those pairs: it picks out which pairs are related. For example, the relation "is a factor of" on the integers selects pairs like (2, 6) and (3, 12) but not (4, 7), because 2 divides 6 but 4 does not divide 7. Formally, R ⊆ A × A (or A × B for a relation between two different sets).

Relations become interesting when we ask about their structural properties. Reflexivity means every element is related to itself — (a, a) ∈ R for all a in A. Equality is reflexive; "is strictly less than" is not. Symmetry means the relation goes both ways: if (a, b) ∈ R then (b, a) ∈ R. "Is a sibling of" is symmetric; "is a parent of" is not. Transitivity means the relation chains: if a R b and b R c, then a R c. "Is an ancestor of" is transitive; "is a friend of" often is not in practice.

These three properties combine in important ways. A relation that is reflexive, symmetric, and transitive is called an equivalence relation — it partitions a set into groups of mutually related elements (equivalence classes). You will study this formally next. A relation that is reflexive, antisymmetric, and transitive is a partial order — like ≤ or "is a subset of" — which captures the idea of ranking or containment without requiring every pair to be comparable.

One subtlety worth watching: the empty relation (no pairs at all) is both symmetric and transitive *vacuously* — there are simply no pairs to violate those conditions. But it is not reflexive on any non-empty set because no element is self-related. This shows that symmetry + transitivity does not automatically give you reflexivity, contrary to a common intuition.

Practice Questions 3 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 → Cartesian Products and Relations → Partial Orders → Binary Relations

Longest path: 72 steps · 324 total prerequisite topics

Prerequisites (2)

Leads To (13)