Equality (mathematics)

In mathematics, equality is a relationship between two quantities or, more generally two mathematical expressions, asserting that the quantities have the same value, or that the expressions represent the same mathematical object. The equality between A and B is written A = B, and pronounced A equals B. The symbol "=" is called an "equals sign". Two objects that are not equal are said to be distinct.

For example:

  • means that x and y denote the same object.[1]
  • means that, if x is any number, the two expressions have the same value. This may also be interpreted by saying that the two sides of the equals sign represent the same function.
  • if and only if This assertion, which uses set-builder notation, means that, if the elements satisfying the property are the same as the elements satisfying then the two uses of the set-builder notation define the same set. This property often expressed as "two sets that have the same elements are equal." It is one of the usual axioms of set theory, called Axiom of extensionality.[2]

Etymology

The etymology of the word is from the Latin aequālis (“equal”, “like”, “comparable”, “similar”) from aequus (“equal”, “level”, “fair”, “just”).

Basic properties
  • Substitution property: For any quantities a and b and any expression F(x), if a = b, then F(a) = F(b) (if both sides make sense, i.e. are well-formed).

Some specific examples of this are:

  • For any real numbers a, b, and c, if a = b, then a + c = b + c (here F(x) is x + c);
  • For any real numbers a, b, and c, if a = b, then a − c = b − c (here F(x) is x − c);
  • For any real numbers a, b, and c, if a = b, then ac = bc (here F(x) is xc);
  • For any real numbers a, b, and c, if a = b and c is not zero, then a/c = b/c (here F(x) is x/c).
  • Reflexive property: For any quantity a, a = a.
  • Symmetric property: For any quantities a and b, if a = b, then b = a.
  • Transitive property: For any quantities a, b, and c, if a = b and b = c, then a = c.

These 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 variables, equality is a proposition, which may be true for some values and false for some other values. Equality is a binary relation or, in other words, a two-argument predicate, which may produce a truth value (false or true) from its arguments. In computer programming, its computation from two expressions is known as comparison.

Identities
Main article: Identity (mathematics)

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 (x + 1)2 = x2 + 2x + 1. Sometimes, but not always, an identity is written with a triple bar: (x + 1)2 ≡ x2 + 2x + 1.

Equations

An equation is a problem of finding values of some variables, called unknowns, for which the specified equality is true. 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, x2 + y2 = 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: a reader 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 it specifies a subset of the variable space to be the subset where the equation is true.

Congruences
Main articles: Congruence relation and Congruence (geometry)

In some cases, one may consider as equal two mathematical objects that are only equivalent for the properties that are considered. Particularly in the case of geometry, this is where two geometric shapes are said to be equal when one may be moved to coincide with the other. The word congruence is also used for this kind of equality.

Approximate equality

There are some logic systems that do not have any notion of equality. This reflects the undecidability of the equality of two real numbers defined by formulas involving the integers, the basic arithmetic operations, the logarithm and the exponential function. In other words, there cannot exist any algorithm for deciding such an equality.

The binary relation "is approximately equal" between real numbers or other things, even if more precisely defined, is not transitive (it may seem so at first sight, but many small differences can add up to something big). However, equality almost everywhere is transitive.

Relation with equivalence and isomorphism
Main articles: Equivalence relation and Isomorphism

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 xR 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 xR = yR. 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 equivalence or isomorphism.[3] For example, one may distinguish fractions from rational numbers, the latter being equivalence classes of fractions: the fractions and 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

and

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

However, there are other choices of isomorphism, such as

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.

Logical definitions
See also: First-order logic § Equality and its axioms, and Identity of indiscernibles

Leibniz characterized the notion of equality as follows:

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

Equality in set theory
Main article: Axiom of extensionality

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.[4]

  • Logic axiom: x = y ⇒ ∀z, (z ∈ x ⇔ z ∈ y)
  • Logic axiom: x = y ⇒ ∀z, (x ∈ z ⇔ y ∈ z)
  • Set theory axiom: (∀z, (z ∈ x ⇔ z ∈ y)) ⇒ 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."[5]

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.[6]

  • Set theory definition: "x = y" means ∀z, (z ∈ x ⇔ z ∈ y)
  • Set theory axiom: x = y ⇒ ∀z, (x ∈ z ⇔ y ∈ z)
gollark: ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌
gollark: ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌
gollark: ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌
gollark: ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌
gollark: ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌ ❌

See also

Notes
  1. Rosser 2008, p. 163.
  2. Lévy 2002, pp. 13, 358. Mac Lane & Birkhoff 1999, p. 2. Mendelson 1964, p. 5.
  3. (Mazur 2007)
  4. Kleene 2002, p. 189. Lévy 2002, p. 13. Shoenfield 2001, p. 239.
  5. Lévy 2002, p. 4.
  6. Mendelson 1964, pp. 159–161. Rosser 2008, pp. 211–213

References
  • Kleene, Stephen Cole (2002) [1967]. Mathematical Logic. Mineola, New York: Dover Publications. ISBN 978-0-486-42533-7.CS1 maint: ref=harv (link)
  • Lévy, Azriel (2002) [1979]. Basic set theory. Mineola, New York: Dover Publications. ISBN 978-0-486-42079-0.CS1 maint: ref=harv (link)
  • Mac Lane, Saunders; Birkhoff, Garrett (1999) [1967]. Algebra (Third ed.). Providence, Rhode Island: American Mathematical Society.CS1 maint: ref=harv (link)
  • Mazur, Barry (12 June 2007), When is one thing equal to some other thing? (PDF)
  • Mendelson, Elliott (1964). Introduction to Mathematical Logic. New York: Van Nostrand Reinhold.CS1 maint: ref=harv (link)
  • Rosser, John Barkley (2008) [1953]. Logic for mathematicians. Mineola, New York: Dover Publication. ISBN 978-0-486-46898-3.CS1 maint: ref=harv (link)
  • Shoenfield, Joseph Robert (2001) [1967]. Mathematical Logic (2nd ed.). A K Peters. ISBN 978-1-56881-135-2.CS1 maint: ref=harv (link)
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.