Equality (mathematics)

Uses your system voice; voice and rate in settings.

Snapshot

≈ 19 min read

Names in other languages

No names in other languages are held for this entry yet.

Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.

, used to represent equality symbolically in an equation In mathematics, equality is a relationship between two quantities or expressions, stating that they have the same value, or represent the same mathematical object. Equality between and is denoted with an equals sign as , and read " equals ". A written expression of equality is called an equation or identity depending on the context. Two objects that are not equal are said to be distinct . Equality is often considered a primitive notion, meaning it is not formally defined, but rather informally said to be "a relation each thing bears to itself and nothing else". This characterization is notably circular ("nothing else"), reflecting a general conceptual difficulty in fully characterizing the concept. Basic properties about equality like reflexivity, symmetry, and transitivity have been understood intuitively since at least the ancient Greeks, but were not symbolically stated as general properties of relations until the late 19th century by Giuseppe Peano. Other properties like substitution and function application weren't formally stated until the development of symbolic logic. There are generally two ways that equality is formalized in mathematics: through logic or through set theory.…

, used to represent equality symbolically in an equation In mathematics, equality is a relationship between two quantities or expressions, stating that they have the same value, or represent the same mathematical object. Equality between and is denoted with an equals sign as , and read " equals ". A written expression of equality is called an equation or identity depending on the context. Two objects that are not equal are said to be distinct . Equality is often considered a primitive notion, meaning it is not formally defined, but rather informally said to be "a relation each thing bears to itself and nothing else". This characterization is notably circular ("nothing else"), reflecting a general conceptual difficulty in fully characterizing the concept. Basic properties about equality like reflexivity, symmetry, and transitivity have been understood intuitively since at least the ancient Greeks, but were not symbolically stated as general properties of relations until the late 19th century by Giuseppe Peano. Other properties like substitution and function application weren't formally stated until the development of symbolic logic. There are generally two ways that equality is formalized in mathematics: through logic or through set theory. In logic, equality is a primitive predicate (a statement that may have free variables) with the reflexive property (called the law of identity), and the substitution property. From those, one can derive the rest of the properties usually needed for equality. After the foundational crisis in mathematics at the turn of the 20th century, set theory (specifically Zermelo–Fraenkel set theory) became the most common foundation of mathematics. In set theory, any two sets are defined to be equal if they have all the same members. This is called the axiom of extensionality. , in an equation expressed as 14x+15=71 using modern notation, from The Whetstone of Witte (1557) by Robert Recorde|upright=1.2 [[File:Recorde - The Whetstone of Witte - equals.jpg|thumb|Recorde's introduction of . "And to avoid the tedious repetition of these words: 'is equal to' I will set as I do often in work use, a pair of parallels, or twin lines of one [the same] length, thus: ==, because no 2 things can be more equal." |upright=1.2 In English, the word equal is derived from the Latin ('like', 'comparable', 'similar'), which itself stems from ('level', 'just'). The word entered Middle English around the 14th century, borrowed from Old French (modern ). More generally, the interlingual synonyms of equal have been used more broadly throughout history (see ). Before the 16th century, there was no common symbol for equality, and equality was usually expressed with a word, such as aequales, aequantur, esgale, faciunt, ghelijck, or gleich, and sometimes by the abbreviated form aeq, or simply and . Diophantus's use of , short for ( 'equals'), in Arithmetica ( ) is considered one of the first uses of an equals sign. The sign , now universally accepted in mathematics for equality, was first recorded by Welsh mathematician Robert Recorde in The Whetstone of Witte (1557), just one year before his death. The original form of the symbol was much wider than the present form. In his book, Recorde explains his symbol as "Gemowe lines", from the Latin ('twin'), using two parallel lines to represent equality because he believed that "no two things could be more equal." Recorde's symbol was not immediately popular. After its introduction, it wasn't used again in print until 1618 (61 years later), in an anonymous Appendix in Edward Wright's English translation of Descriptio, by John Napier. It wasn't until 1631 that it received more than general recognition in England, being adopted as the symbol for equality in a few influential works. Later used by several influential mathematicians, most notably, both Isaac Newton and Gottfried Leibniz, and due to the prevalence of calculus at the time, it quickly spread throughout the rest of Europe. For every and , with some function f(x), if , then f(a) = f(b). For example: The first three properties are generally attributed to Giuseppe Peano for being the first to explicitly state these as fundamental properties of equality in his (1889). However, the basic notions have always existed; for example, in Euclid's Elements ( ), he includes 'common notions': "Things that are equal to the same thing are also equal to one another" (transitivity), "Things that coincide with one another are equal to one another" (reflexivity), along with some function-application properties for addition and subtraction. The function-application property was also stated in Peano's , however, it had been common practice in algebra since at least Diophantus ( ). The substitution property is generally attributed to Gottfried Leibniz ( ), and often called Leibniz's Law. An equation is a symbolic equality of two mathematical expressions connected with an equals sign (=). Algebra is the branch of mathematics concerned with equation solving: the problem of finding values of some variable, called , for which the specified equality is true. Each value of the unknown for which the equation holds is called a of the given equation; also stated as the equation. For example, the equation x^2 - 6x + 5=0 has the values x=1 and x=5 as its only solutions. The terminology is used similarly for equations with several unknowns. The set of solutions to an equation or system of equations is called its solution set. In mathematics education, students are taught to rely on concrete models and visualizations of equations, including geometric analogies, manipulatives including sticks or cups, and "function machines" representing equations as flow diagrams. One method uses balance scales as a pictorial approach to help students grasp basic problems of algebra. The mass of some objects on the scale is unknown and represents variables. Solving an equation corresponds to adding and removing objects on both sides in such a way that the sides stay in balance until the only object remaining on one side is the object of unknown mass. Often, equations are considered to be a statement, or relation, which can be true or false. For example, 1+1=2 is true, and 1+1=3 is false. Equations with unknowns are considered conditionally true; for example, x^2 - 6x + 5=0 is true when x=1 or x=5, and false otherwise. There are several different terminologies for this. In mathematical logic, an equation is a binary predicate (i.e. a logical statement, that can have free variables) which satisfies certain properties. In computer science, an equation is defined as a boolean-valued expression, or relational operator, which returns 1 and 0 for true and false respectively. An identity is an equality that is true for all values of its variables in a given domain. An "equation" may sometimes mean an identity, but more often than not, it a subset of the variable space to be the subset where the equation is true. An example is \left(x + 1\right)\left(x + 1\right) = x^2 + 2 x + 1, which is true for each real number x. 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. Sometimes, but not always, an identity is written with a triple bar: \left(x + 1\right)\left(x + 1\right) \equiv x^2 + 2 x + 1. This notation was introduced by Bernhard Riemann in his 1857 lectures (published in 18991). Alternatively, identities may be viewed as an equality of functions, where instead of writing f(a) = g(a) \text{ for all } a, one may simply write f = g. This is called the extensionality of functions. In this sense, the function-application property refers to operators, operations on a function space (functions mapping between functions) like composition or the derivative, commonly used in operational calculus. An identity can contain functions as "unknowns", which can be solved for similarly to a regular equation, called a functional equation. A functional equation involving derivatives is called a differential equation. Equations are often used to introduce new terms or symbols for constants, assert equalities, and introduce shorthand for complex expressions, which is called "equal by definition", and often denoted with ( := ). It is similar to the concept of assignment of a variable in computer science. For example, \mathbb{e} := \sum_{n=0}^\infty \frac{1}{n!} defines Euler's number, and i^2 = -1 is the defining property of the imaginary number i. In mathematical logic, this is called an extension by definition (by equality) which is a conservative extension to a formal system. This is done by taking the equation defining the new constant symbol as a new axiom of the theory. The first recorded symbolic use of "Equal by definition" appeared in Logica Matematica (1894) by Cesare Burali-Forti, an Italian mathematician. Burali-Forti, in his book, used the notation ( =_\text{Def} ). The precursor to the substitution property of equality was first formulated by Gottfried Leibniz in his Discourse on Metaphysics (1686), stating, roughly, that "No two distinct things can have all properties in common." This has since broken into two principles, the substitution property (if x=y, then any property of x is a property of y ), and its converse, the identity of indiscernibles (if x and y have all properties in common, then x=y ). Around the turn of the 20th century, it would become necessary to have a more concrete description of equality. In 1879 Gottlob Frege would publish his pioneering text Begriffsschrift, which would shift the focus of logic from Aristotelian logic, focused on classes of objects, to being property-based, with what would grow to become modern predicate logic. This was followed by a movement for describing mathematics in logical foundations, called logicism. This trend lead to the axiomatization of equality through the law of identity and the substitution property especially in mathematical logic and analytic philosophy. Later, Frege's Foundations of Arithmetic (1884) and Basic Laws of Arithmetic (1893, 1903) would attempt to derive the foundations of mathematics from the logical system developed in his Begriffsschrift. This would eventually be shown to be flawed by allowing Russell's paradox, and would contribute to the foundational crisis of mathematics. The work of Frege would eventually be resolved by a three volume work by Bertrand Russell and Alfred Whitehead known as (1910 1913). Russell and Whitehead's work would also introduce and formalize the Leibniz' Law to symbolic logic, wherein they claim it follows from their axiom of reducibility, but credit Leibniz for the idea. , a major contributor to 17th-century mathematics and philosophy of mathematics.|upright=1.1 Law of identity: Stating that each thing is identical with itself, without restriction. That is, for every a, a = a. It is the first of the traditional three laws of thought. The above can be stated symbolically as: \forall a(a = a). Substitution property: Generally stating that if two things are equal, then any property of one must be a property of the other. It is sometimes referred to as "Leibniz's law". It can be stated formally as: for every and , and any formula \phi(x), with a free variable , if a=b, then \phi(a) implies \phi(b). The above can be stated symbolically as: (a=b) \implies \bigl[ \phi(a) \Rightarrow \phi(b) \bigr]. Function application is also sometimes included in the axioms of equality, but isn't necessary as it can be deduced from the other two axioms, and similarly for symmetry and transitivity (see ). In first-order logic, these are axiom schemas (usually, see below), each of which specify an infinite set of axioms. If a theory has a predicate that satisfies the law of identity and substitution property, it is common to say that it "has equality", or is "a theory with equality". The use of "equality" here somewhat of a misnomer in that any system with equality can be modeled by a theory without standard identity, and with indiscernibles. Those two axioms are strong enough, however, to be isomorphic to a model with identity; that is, if a system has a predicate satisfying those axioms standard equality, there is a model of that system standard equality. This can be done by defining a new domain whose objects are the equivalence classes of the original "equality". If a model is interpreted to have equality then those properties are enough, since if x has all the same properties as y, and x has the property of being equal to x, then y has the property of being equal to x. As axioms, one can deduce from the first using universal instantiation, and the from second, given a = b and \phi (a), by using modus ponens twice. Alternatively, each of these may be included in logic as rules of inference. The first called "equality introduction", and the second "equality elimination" (also called paramodulation), used by some theoretical computer scientists like John Alan Robinson in their work on resolution and automated theorem proving. The substitution property can produce false statements when applied naively. For example, if n denotes "the number of planets in the solar system," then the statement "Johannes Kepler did not know that is true, since Uranus and Neptune were discovered after his death. However, since n = 8 , applying the substitution property gives the statement "Johannes Kepler did not know that which is false. The difference here is that while the expressions "the number of planets" and "8" refer to the same object (their extension), they have different meanings (their intension). Thus, the substitution property can only be guaranteed in extensional contexts, which is guaranteed in modern mathematics by the axiom of extensionality. Reflexivity: Given any expression a, by the law of identity, a = a. Symmetry: Given a = b, take the formula \phi(x) : x = a. Accordingly, (a=b) \implies ((a=a) \Rightarrow (b=a)). Since a=b by assumption, and a=a by reflexivity, it follows that b=a. Transitivity: Given a = b and b = c, take the formula \phi(x): x=c. Accordingly, (b=a) \implies ((b=c) \Rightarrow (a=c)). Since b=a by symmetry, and b=c by assumption, it follows that a=c. Function application: Given some function f(x) and expressions and , such that , then take the formula \phi(x): f(a) = f(x). Accordingly, (a=b) \implies [(f(a) = f(a)) \Rightarrow (f(a) = f(b))]. Since a=b by assumption, and f(a) = f(a) by reflexivity, it follows that f(a) = f(b). \{x\in \Z \mid 0 The term extensionality, as used in 'Axiom of Extensionality has its roots in logic and grammar (cf. Extension (semantics)). In grammar, an intensional definition describes the necessary and sufficient conditions for a term to apply to an object. For example: "A Platonic solid is a convex, regular polyhedron in three-dimensional Euclidean space." An extensional definition instead lists all objects where the term applies. For example: "A Platonic solid is one of the following: Tetrahedron, Cube, Octahedron, Dodecahedron, or Icosahedron." In logic, the extension of a predicate is the set of all objects for which the predicate is true. Further, the logical principle of extensionality judges two objects to be equal if they satisfy the same external properties. Since, by the axiom, two sets are defined to be equal if they satisfy membership, sets are extentional. José Ferreirós credits Richard Dedekind for being the first to explicitly state the principle, although he does not assert it as a definition: Logic axiom: x = y \implies \forall z, (z \in x \iff z \in y) Logic axiom: x = y \implies \forall z, (x \in z \iff y \in z) Set theory axiom: (\forall z, (z \in x \iff z \in y)) \implies x = y The first two are given by the substitution property of equality from first-order logic; the last is a new axiom of the theory. Incorporating half of the work into the first-order logic may be regarded as a mere matter of convenience, as noted by Azriel Lévy: Set theory definition: (x = y) \ := \ \forall z, (z \in x \iff z \in y) Set theory axiom: x = y \implies \forall z, (x \in z \iff y \in z) Or, equivalently, one may choose to define equality in a way that mimics, the substitution property explicitly, as the conjunction of all atomic formulas: Set theory definition: (x = y) \, := \, \forall z ( z \in x \implies z \in y) \, \and \, \forall w (x \in w \implies y \in w) Set theory axiom: (\forall z, (z \in x \iff z \in y)) \implies x = y In either case, the axiom of extensionality based on first-order logic without equality states that sets which contain the same elements are always contained in the same sets: \forall z ( z \in x \iff z \in y) \implies \forall w (x \in w \iff y \in w). Reflexivity: Given a set X, assume z \in X, it follows trivially that z \in X, and the same follows in reverse, thus \forall z, (z \in X \iff z \in X), therefore X = X. Symmetry: Given sets X, Y, such that X=Y, then \forall z, (z \in X \iff z \in Y), which implies \forall z, (z \in Y \iff z \in X), therefore Y=X. Transitivity: Given sets X, Y, Z, such that: X = Y, and Y = Z, assume z \in X. Then, z \in Y by (1), which implies z \in Z by (2), and similarly for the reverse. Thus \forall z, (z \in X \iff z \in Z), therefore X=Z. Substitution: See . Function application: Given a = b and f(a) = c, then (a,c) \in f. Since a = b and c = c, then (a,c) = (b,c). This is the defining property of an ordered pair. Since (a,c) = (b,c), by the axiom of extensionality, they must belong to the same sets. Thus, since (a,c) \in f, it follows that (b,c) \in f, or f(b) = c. Therefore, f(a) = f(b). More formally, an isomorphism is a bijective mapping (or morphism) f between two sets or structures A and B such that f and its inverse f^{-1} preserve the operations, relations, or functions defined on those structures. This means that any operation or relation valid in A corresponds precisely to the operation or relation in B under the mapping. For example, in group theory, a group isomorphism f: G \mapsto H satisfies f(a * b) = f(a) * f(b) for all elements a, b, where * denotes the group operation. When two objects or systems are isomorphic, they are considered indistinguishable in terms of their internal structure, even though their elements or representations may differ. For instance, all cyclic groups of order \infty are isomorphic to the integers, \Z, with addition. Similarly, in linear algebra, two vector spaces are isomorphic if they have the same dimension, as there exists a linear bijection between their elements. When objects such as the ones discussed above are defined in terms of their mapping properties (i.e., universal properties), any two such objects are isomorphic to each other in a unique manner. Whether they should be considered to be the same (unique) object and be regarded as equal, even if their concrete constructions are different, is a matter of some discussion. This is sometimes done tacitly in the mathematical literature when such objects are canonically identified and connected using the equal sign '=', in some cases hiding technical issues that may need (potentially tedious) verification. However, this practice has led to difficulties when proofs asserting such an 'equality' are formally checked using proof assistants. The concept of isomorphism extends to numerous branches of mathematics, including graph theory (graph isomorphism), topology (homeomorphism), and algebra (group and ring isomorphisms), among others. Isomorphisms facilitate the classification of mathematical entities and enable the transfer of results and techniques between similar systems. Bridging the gap between isomorphism and equality was one motivation for the development of category theory, as well as for homotopy type theory and univalent foundations. 2 + 2 = 5 Essentially unique Frege–Church ontology Identity type Identity (object-oriented programming) Inequality Logical equality Logical equivalence Setoid Theory of pure equality Uniqueness quantification

Text derived from https://en.wikipedia.org/w/index.php?oldid=1375212682 under CC BY-SA 4.0; modifications have been made.

References

  1. ↩Wikipedia “Equality (mathematics)” revision 1375212682 · retrieved 2026-10-20 publication date (×1) · confidence 0.95 revision URL