Equality (mathematics)

These last three properties make equality an equivalence relation. They were originally included among the Peano axioms for natural numbers. Although the symmetric and transitive properties are often seen as fundamental, they can be deduced from substitution and reflexive properties.

Equality as predicate

When A and B are not fully specified or depend on some

When A and B may be viewed as functions of some variables, then A = B means that A and B define the same function. Such an equality of functions is sometimes called an identity. An example is ${\displaystyle \left(x+1\right)\left(x+1\right)=x^{2}+2x+1.}$ Sometimes, but not always, an identity is written with a triple bar: ${\displaystyle \left(x+1\right)\left(x+1\right)\equiv x^{2}+2x+1.}$

Equations

An equation is a problem of finding values of some variables, called unknowns, for which the specified equality is true. The term "equation" may also refer to an equality relation that is satisfied only for the values of the variables that one is interested in. For example, ${\displaystyle x^{2}+y^{2}=1}$ is the equation of the unit circle.

There is no standard notation that distinguishes an equation from an identity, or other use of the equality relation: one has to guess an appropriate interpretation from the semantics of expressions and the context. An identity is asserted to be true for all values of variables in a given domain. An "equation" may sometimes mean an identity, but more often than not, it specifies a subset of the variable space to be the subset where the equation is true.

Approximate equality

There are some

The binary relation "is approximately equal" (denoted by the symbol ${\displaystyle \approx }$) between

Viewed as a relation, equality is the archetype of the more general concept of an equivalence relation on a set: those binary relations that are reflexive, symmetric and transitive. The identity relation is an equivalence relation. Conversely, let R be an equivalence relation, and let us denote by x^R the equivalence class of x, consisting of all elements z such that x R z. Then the relation x R y is equivalent with the equality x^R = y^R. It follows that equality is the finest equivalence relation on any set S in the sense that it is the relation that has the smallest equivalence classes (every class is reduced to a single element).

In some contexts, equality is sharply distinguished from

the latter being equivalence classes of fractions: the fractions ${\displaystyle 1/2}$ and ${\displaystyle 2/4}$ are distinct as fractions (as different strings of symbols) but they "represent" the same rational number (the same point on a number line). This distinction gives rise to the notion of a

quotient set

.

Similarly, the sets

${\displaystyle \{{\text{A}},{\text{B}},{\text{C}}\}}$ and ${\displaystyle \{1,2,3\}}$

are not equal sets – the first consists of letters, while the second consists of numbers – but they are both sets of three elements and thus isomorphic, meaning that there is a bijection between them. For example

${\displaystyle {\text{A}}\mapsto 1,{\text{B}}\mapsto 2,{\text{C}}\mapsto 3.}$

However, there are other choices of isomorphism, such as

${\displaystyle {\text{A}}\mapsto 3,{\text{B}}\mapsto 2,{\text{C}}\mapsto 1,}$

and these sets cannot be identified without making such a choice – any statement that identifies them "depends on choice of identification". This distinction, between equality and isomorphism, is of fundamental importance in category theory and is one motivation for the development of category theory.

In some cases, one may consider as equal two mathematical objects that are only equivalent for the properties and structure being considered. The word congruence (and the associated symbol ${\displaystyle \cong }$) is frequently used for this kind of equality, and is defined as the

predicate

P, P(x) if and only if P(y).

Equality in set theory

Equality of sets is axiomatized in set theory in two different ways, depending on whether the axioms are based on a first-order language with or without equality.

Set equality based on first-order logic with equality

In first-order logic with equality, the axiom of extensionality states that two sets which contain the same elements are the same set.^[6]

• Logic axiom: ${\displaystyle x=y\implies \forall z,(z\in x\iff z\in y)}$
• Logic axiom: ${\displaystyle x=y\implies \forall z,(x\in z\iff y\in z)}$
• Set theory axiom: ${\displaystyle (\forall z,(z\in x\iff z\in y))\implies x=y}$

Incorporating half of the work into the first-order logic may be regarded as a mere matter of convenience, as noted by Lévy.

"The reason why we take up first-order predicate calculus with equality is a matter of convenience; by this we save the labor of defining equality and proving all its properties; this burden is now assumed by the logic."^[7]

Set equality based on first-order logic without equality

In first-order logic without equality, two sets are defined to be equal if they contain the same elements. Then the axiom of extensionality states that two equal sets are contained in the same sets.^[8]

• Set theory definition: ${\displaystyle (x=y)\ :=\ \forall z,(z\in x\iff z\in y)}$
• Set theory axiom: ${\displaystyle x=y\implies \forall z,(x\in z\iff y\in z)}$

See also

• Extensionality
• Homotopy type theory
• Inequality
• List of mathematical symbols
• Logical equality
• Proportionality (mathematics)

Notes

References

• "Equality axioms", Encyclopedia of Mathematics, EMS Press, 2001 [1994]