Equality (mathematics) : Equality (maths)

In mathematics, two mathematical objects are considered equal if they are precisely the same in every way. This defines a binary predicate[?], equality, denoted "="; x = y iff x and y are equal. A statement that two expressions denote equal quantities is an equation.

Beware that sometimes a statement of the form "A = B" may not be an equality. For example, the statement T(n) = O(n²) means that T(n) grows at the order of n². It isn't an equality, because the sign "=" in the statement isn't the equality sign; indeed, it is meaningless to write O(n²) = T(n). See Big O notation for more on this.

Given a set A, the restriction of equality to the set A is a binary relation, which is at once reflexive, symmetric, antisymmetric, and transitive. Indeed it is the only relation on A with all these properties. Dropping the requirement of antisymmetry yields the notion of equivalence relation. Conversely, given any equivalence relation R, we can form the quotient set A/R, and the equivalence relation will revert to equality in A/R.

Predicate logic contains standard axioms for equality that formalise Leibniz's law[?], put forward by the philosopher Gottfried Leibniz in the 1600s. Leibniz's idea was that two things are identical if and only if they have precisely the same properties. To formalise this, we wish to say

Given any x and y, x = y if and only if, given any predicate P, P(x) iff P(y).

However, in first order logic, we cannot quantify over predicates. Thus, we need to use an axiom schema[?]:

Given any x and y, if x equals y, then P(x) iff P(y).

This axiom schema, valid for any predicate P in one variable, takes care of only one direction of Leibniz's law; if x and y are equal, then they have the same properties. We can take care of the other direction by simply postulating:

Given any x, x equals x.

Then if x and y have the same properties, then in particular they are the same with respect to the predicate P given by P(z) iff x = z. Since P(x) holds, P(y) must also hold, so x = y.

Some basic logical properties of equality

Although the symmetric and transitive properties are often seen as fundamental, they can be proved from the substitution and reflexive properties.

		Equality (mathematics) : Equality (maths)
		In mathematics, two mathematical objects are considered equal if they are precisely the same in every way. This defines a binary predicate[?], equality, denoted "="; x = y iff x and y are equal. A statement that two expressions denote equal quantities is an equation. Beware that sometimes a statement of the form "A = B" may not be an equality. For example, the statement T(n) = O(n²) means that T(n) grows at the order of n². It isn't an equality, because the sign "=" in the statement isn't the equality sign; indeed, it is meaningless to write O(n²) = T(n). See Big O notation for more on this. Given a set A, the restriction of equality to the set A is a binary relation, which is at once reflexive, symmetric, antisymmetric, and transitive. Indeed it is the only relation on A with all these properties. Dropping the requirement of antisymmetry yields the notion of equivalence relation. Conversely, given any equivalence relation R, we can form the quotient set A/R, and the equivalence relation will revert to equality in A/R. Predicate logic contains standard axioms for equality that formalise Leibniz's law[?], put forward by the philosopher Gottfried Leibniz in the 1600s. Leibniz's idea was that two things are identical if and only if they have precisely the same properties. To formalise this, we wish to say Given any x and y, x = y if and only if, given any predicate P, P(x) iff P(y). However, in first order logic, we cannot quantify over predicates. Thus, we need to use an axiom schema[?]: Given any x and y, if x equals y, then P(x) iff P(y). This axiom schema, valid for any predicate P in one variable, takes care of only one direction of Leibniz's law; if x and y are equal, then they have the same properties. We can take care of the other direction by simply postulating: Given any x, x equals x. Then if x and y have the same properties, then in particular they are the same with respect to the predicate P given by P(z) iff x = z. Since P(x) holds, P(y) must also hold, so x = y. Some basic logical properties of equality The substitution property of equality The reflexive property of equality The symmetric property of equality The transitive property of equality Although the symmetric and transitive properties are often seen as fundamental, they can be proved from the substitution and reflexive properties.
Refer to us with this code