Loosely, equality is the state of being quantitatively the same. More formally, equality (or the identity relation) is the binary relation on a set X defined by
The identity relation is the archetype of the more general concept of an equivalence relation on a set: those binary relations which are reflexive, symmetric, and transitive. The relation of equality is also antisymmetric. These four properties uniquely determine the equality relation on any set S and render equality the only relation on S that is both an equivalence relation and a partial order. It follows from this that equality is the smallest equivalence relation on any set S, in the sense that it is a subset of any other equivalence relation on S.
An equation is simply an assertion that two expressions are related by equality (are equal).
The etymology of the word is from the Latin aequalis, meaning uniform or identical, from aequus, meaning "level, even, or just."
Contents
Logical formulations
The equality relation is always defined such that things that are equal have all and only the same properties. Some people define equality as congruence. Often equality is just defined as identity.
A stronger sense of equality is obtained if some form of Leibniz's law is added as an axiom; the assertion of this axiom rules out "bare particulars"â€”things that have all and only the same properties but are not equal to each otherâ€”which are possible in some logical formalisms. The axiom states that two things are equal if they have all and only the same properties. Formally:
In this law, the connective "if and only if" can be weakened to "if"; the modified law is equivalent to the original.
Instead of considering Leibniz's law as an axiom, it can also be taken as the definition of equality. The property of being an equivalence relation, as well as the properties given below, can then be proved: they become theorems. If a=b, then a can replace b and b can replace a.
Some basic logical properties of equality
The substitution property states:
 For any quantities a and b and any expression F(x), if a = b, then F(a) = F(b) (if either side makes sense, i.e. is wellformed).
In firstorder logic, this is a schema, since we can't quantify over expressions like F (which would be a functional predicate).
Full article ▸
