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 OrdersAxiom 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 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 ComplementCartesian Products and RelationsPartial OrdersBinary Relations

Longest path: 72 steps · 324 total prerequisite topics

Prerequisites (2)

Leads To (13)