A mathematical relation is a rule that specifies whether two objects are connected in a particular way. Comparison relations are used to determine whether one value is smaller than, larger than or equal to another. For real numbers, the familiar relations <, >, ≤ and ≥ define an order that is total: any two real numbers can be compared. However, not every mathematical set has a total order. In a partial order, some pairs of elements may not be comparable. For example, the subset relation ⊆ on sets is a partial order because neither of two sets must contain the other. An ordering relation is commonly examined through properties such as reflexivity, antisymmetry and transitivity. A strict order often uses irreflexivity and transitivity. Equivalence relations are different from ordering relations. An equivalence relation groups objects into classes that are regarded as equivalent according to a specified criterion. It must be reflexive, symmetric and transitive. Equality is the simplest equivalence relation, but congruence modulo an integer and equality of mathematical structures under a defined transformation are other examples. The symbol ∼ is frequently used for equivalence, but its exact meaning must be defined. The symbol ≈ may represent approximate equivalence rather than a formal equivalence relation. The subset symbols ⊆ and ⊂ are related to set inclusion, but conventions differ regarding whether ⊂ permits equality; many modern texts use ⊂ for strict inclusion and ⊆ for inclusion allowing equality. A relation's properties depend on the underlying set and definition, not merely on the visual symbol. These ideas are important in algebra, logic, number theory, computer science, data classification and scientific modelling.
Comparison, Ordering and Equivalence Relations
Comparison, ordering and equivalence relations describe how mathematical objects can be compared, arranged or classified as equivalent. They include numerical ordering, partial and total orders, equality-based equivalence, congruence and other formally defined relationships.
Equivalence relation R on a set S: reflexivity aRa; symmetry aRb ⇒ bRa; transitivity (aRb and bRc) ⇒ aRc. A partial order is commonly defined by reflexivity, antisymmetry and transitivity.
Explanation
Variables
| Symbol | Meaning | Si Unit |
|---|---|---|
< | Strictly less than in an ordered set. | Not applicable as a relation; operands must belong to an orderable domain. |
≤ | Less than or equal to. | Not applicable. |
≺ | Precedes or is strictly ordered before under a specified relation. | Not applicable. |
≼ | Precedes or is equal to under a specified partial or total order. | Not applicable. |
∼ | Equivalent or related under a defined equivalence relation. | Not applicable. |
≡ | Identical or equivalent under a specified convention, such as modular congruence. | Not applicable. |
⊆ | Subset relation, allowing equality. | Not applicable. |
⊂ | Subset symbol; frequently used for a proper subset, although conventions vary. | Not applicable. |
⊑ | A symbol used for a partial order or related ordering in some mathematical fields. | Not applicable. |
Example or application
A worked example has not yet been added.
Definition
A comparison or ordering relation specifies an ordered relationship between objects, while an equivalence relation partitions a set into classes of objects satisfying a defined relation that is reflexive, symmetric and transitive.
Purpose
These relations allow mathematical objects to be compared, ranked, grouped and classified according to precise rules.
Importance
Ordering and equivalence relations are foundational to algebra, number theory, set theory, computer science, logic, optimization and scientific classification. Their formal properties determine whether mathematical operations and proofs are valid.
Relation Properties
| Property | Definition | Formal Notation |
|---|---|---|
Reflexivity | Every element is related to itself. | aRa for every a in S. |
Symmetry | If one element is related to another, the reverse relation also holds. | aRb ⇒ bRa. |
Antisymmetry | If two elements are related in both directions, they must be equal. | (aRb and bRa) ⇒ a = b. |
Transitivity | If one element is related to a second and the second to a third, the first is related to the third. | (aRb and bRc) ⇒ aRc. |
Irreflexivity | No element is related to itself. | Not aRa for every a in S. |
Worked Examples
| Example | Interpretation |
|---|---|
2 < 5 and 5 < 8 imply 2 < 8. | The less-than relation on real numbers is transitive. |
A ⊆ B and B ⊆ A imply A = B. | The subset relation is antisymmetric. If each set contains all elements of the other, the sets are equal. |
17 ≡ 5 (mod 12). | Congruence modulo 12 is an equivalence relation on the integers. Integers with the same remainder when divided by 12 belong to the same equivalence class. |
For real numbers, define aRb when a − b is an integer. | This relation is reflexive, symmetric and transitive, so it is an equivalence relation. It groups real numbers that differ by an integer. |
Notation Rules
Specify the set on which a relation is defined.
State whether an order is total or partial when this distinction matters.
Check reflexivity, symmetry and transitivity before identifying a relation as an equivalence relation.
Check reflexivity, antisymmetry and transitivity before identifying a relation as a partial order.
Define whether ⊂ means proper subset or subset in the chosen mathematical convention.
Do not assume that approximate equality is automatically a formal equivalence relation.
Use relation symbols consistently throughout a proof or model.
Common Errors
Confusing an equivalence relation with an ordering relation.
Assuming every pair of objects in a partially ordered set must be comparable.
Confusing symmetry with antisymmetry.
Calling a relation an equivalence relation without checking all three required properties.
Using ⊂ and ⊆ interchangeably without defining the convention.
Assuming a relation's properties from its symbol rather than its definition.
Applications
Ordering numerical data and scientific measurements.
Classifying mathematical objects into equivalence classes.
Congruence and modular arithmetic.
Set inclusion and mathematical structures.
Database ordering and comparison operations.
Dependency relationships and partially ordered tasks in computing.
Equivalence and classification in algebra and geometry.
Limitations
The same symbol may be used for different relations in different fields. A relation is defined by its domain and formal properties, not simply by its notation. Partial orders do not require every pair to be comparable, and informal similarity does not necessarily satisfy the mathematical requirements of equivalence.
Reference
Kenneth H. Rosen, Discrete Mathematics and Its Applications.
Herbert B. Enderton, Elements of Set Theory.
ISO 80000-2: Quantities and units — Mathematical signs and symbols to be used in the natural sciences and technology.
Related Topic
Equality, Inequality and Approximation Symbols
Set Theory Symbols and Mathematical Membership Notation
Logic, Quantifiers and Propositional Symbols
Indexed Variables, Sequences and Component Notation
Sources and verification
Sources are shown as provided in the project data. Not every source has yet been independently verified. Please report errors or missing citations.
- Source verification pending; check an authoritative textbook, university, standards body, or peer-reviewed source.
Suggest a correction or source · More in Scientific Symbols & Notation