- Source: Equality (mathematics)
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 A and B is written A = B, and pronounced "A equals B". In this equality, A and B are distinguished by calling them left-hand side (LHS), and right-hand side (RHS). Two objects that are not equal are said to be distinct.
A formula such as
x
=
y
,
{\displaystyle x=y,}
where x and y are any expressions, means that x and y denote or represent the same object. For example,
1.5
=
3
/
2
,
{\displaystyle 1.5=3/2,}
are two notations for the same number. Similarly, using set builder notation,
{
x
∣
x
∈
Z
and
0
<
x
≤
3
}
=
{
1
,
2
,
3
}
,
{\displaystyle \{x\mid x\in \mathbb {Z} {\text{ and }}0
since the two sets have the same elements. (This equality results from the axiom of extensionality that is often expressed as "two sets that have the same elements are equal".)
The truth of an equality depends on an interpretation of its members. In the above examples, the equalities are true if the members are interpreted as numbers or sets, but are false if the members are interpreted as expressions or sequences of symbols.
An identity, such as
(
x
+
1
)
2
=
x
2
+
2
x
+
1
,
{\displaystyle (x+1)^{2}=x^{2}+2x+1,}
means that if x is replaced with any number, then the two expressions take the same value. This may also be interpreted as saying that the two sides of the equals sign represent the same function (equality of functions), or that the two expressions denote the same polynomial (equality of polynomials).
Etymology
The word is derived from the Latin aequālis ("equal", "like", "comparable", "similar"), which itself stems from aequus ("equal", "level", "fair", "just").
Basic properties
Reflexivity: for every a, one has a = a.
Symmetry: for every a and b, if a = b, then b = a.
Transitivity: for every a, b, and c, if a = b and b = c, then a = c.
Substitution: Informally, this just means that if a = b, then a can replace b in any mathematical expression or formula without changing its meaning. For example:
Given real numbers a and b, if a = b, then
a
>
0
{\displaystyle a>0}
implies
b
>
0
{\displaystyle b>0}
Operation application: for every a and b, with some operation
f
(
x
)
{\displaystyle f(x)}
, if a = b, then
f
(
a
)
=
f
(
b
)
{\displaystyle f(a)=f(b)}
.For example:
Given real numbers a and b, if a = b, then
2
a
−
5
=
2
b
−
5
{\displaystyle 2a-5=2b-5}
. (Here,
f
(
x
)
=
2
x
−
5
{\displaystyle f(x)=2x-5}
. A unary operation)
Given positive reals a and b, if
a
2
=
2
b
2
{\displaystyle a^{2}=2b^{2}}
, then
a
2
/
b
2
=
2
{\displaystyle a^{2}/b^{2}=2}
. (Here,
f
(
x
,
y
)
=
x
/
y
2
{\displaystyle f(x,y)=x/y^{2}}
at
y
=
b
{\displaystyle y=b}
. A binary operation)
Given real functions
g
{\displaystyle g}
and
h
{\displaystyle h}
over some variable a, if
g
(
a
)
=
h
(
a
)
{\displaystyle g(a)=h(a)}
, then
d
d
a
g
(
a
)
=
d
d
a
h
(
a
)
{\textstyle {\frac {d}{da}}g(a)={\frac {d}{da}}h(a)}
. (Here,
f
(
x
)
=
d
x
d
a
{\textstyle f(x)={\frac {dx}{da}}}
. An operation over functions (i.e. an operator), called the derivative).
If restricted to the elements of a given set
S
{\displaystyle S}
, those first three properties make equality an equivalence relation on
S
{\displaystyle S}
. In fact, equality is the unique equivalence relation on
S
{\displaystyle S}
whose equivalence classes are all singletons. Given operations over
S
{\displaystyle S}
, that last property makes equality a congruence relation.
Equality as predicate
In logic, a predicate is a proposition which may have some free variables. Equality is a predicate, which may be true for some values of the variables (if any) and false for other values. More specifically, equality is a binary relation (i.e., a two-argument predicate) which may produce a truth value (true or false) from its arguments. In computer programming, equality is called a Boolean-valued expression, and its computation from the two expressions is known as comparison.
See also: Relational operator § Equality
Equations
An equation is the problem of finding values of some variable, called unknown, for which the specified equality is true. Each value of the unknown for which the equation holds is called a solution of the given equation; also stated as satisfying the equation. For example, the equation
x
2
−
6
x
+
5
=
0
{\displaystyle x^{2}-6x+5=0}
has the values
x
=
1
{\displaystyle x=1}
and
x
=
5
{\displaystyle x=5}
as its only solutions. The terminology is used similarly for equations with several unknowns.
An equation can be used to define a set. For example, the set of all solution pairs
(
x
,
y
)
{\displaystyle (x,y)}
of the equation
x
2
+
y
2
=
1
{\displaystyle x^{2}+y^{2}=1}
forms the unit circle in analytic geometry; therefore, this equation is called the equation of the unit circle.
See also: Equation solving
= Identities
=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 specifies a subset of the variable space to be the subset where the equation is true. An example is
(
x
+
1
)
(
x
+
1
)
=
x
2
+
2
x
+
1
{\displaystyle \left(x+1\right)\left(x+1\right)=x^{2}+2x+1}
is true for all real numbers
x
{\displaystyle 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:
(
x
+
1
)
(
x
+
1
)
≡
x
2
+
2
x
+
1.
{\displaystyle \left(x+1\right)\left(x+1\right)\equiv x^{2}+2x+1.}
In logic
In mathematical logic and mathematical philosophy, equality is often described through the following properties:
∀
a
(
a
=
a
)
{\displaystyle \forall a(a=a)}
Law of identity: Stating that each thing is identical with itself, without restriction. That is, for every
a
{\displaystyle a}
,
a
=
a
{\displaystyle a=a}
. It is the first of the historical three laws of thought.
(
a
=
b
)
⟹
[
ϕ
(
a
)
⇒
ϕ
(
b
)
]
{\displaystyle (a=b)\implies {\bigl [}\phi (a)\Rightarrow \phi (b){\bigr ]}}
Substitution property: Sometimes referred to as Leibniz's law, generally states that if two things are equal, then any property of one must be a property of the other. It can be stated formally as: for every a and b, and any formula
ϕ
(
x
)
,
{\displaystyle \phi (x),}
(with a free variable x), if
a
=
b
{\displaystyle a=b}
, then
ϕ
(
a
)
{\displaystyle \phi (a)}
implies
ϕ
(
b
)
{\displaystyle \phi (b)}
.
For example: For all real numbers a and b, if a = b, then a ≥ 0 implies b ≥ 0 (here,
ϕ
(
x
)
{\displaystyle \phi (x)}
is x ≥ 0)
These properties offer a formal reinterpretation of equality from how it is defined in standard Zermelo–Fraenkel set theory (ZFC) or other formal foundations. In ZFC, equality only means that two sets have the same elements. However, outside of set theory, mathematicians don't tend to view their objects of interest as sets. For instance, many mathematicians would say that the expression "
1
∪
2
{\displaystyle 1\cup 2}
" (see union) is an abuse of notation or meaningless. This is a more abstracted framework which can be grounded in ZFC (that is, both axioms can be proved within ZFC as well as most other formal foundations), but is closer to how most mathematicians use equality.
Note that this says "Equality implies these two properties" not that "These properties define equality"; this is intentional. This makes it an incomplete axiomatization of equality. That is, it does not say what equality is, only what "equality" must satify. However, the two axioms as stated are still generally useful, even as an incomplete axiomatization of equality, as they are usually sufficient for deducing most properties of equality that mathematicians care about. (See the following subsection)
If these properties were to define a complete axiomatization of equality, meaning, if they were to define equality, then the converse of the second statement must be true. The converse of the Substitution property is the identity of indiscernibles, which states that two distinct things cannot have all their properties in common. In mathematics, the identity of indiscernibles is usually rejected since indiscernibles in mathematical logic are not necessarily forbidden. Set equality in ZFC is capable of declairing these indiscernibles as not equal, but an equality solely defined by these properties is not. Thus these properties form a strictly weaker notion of equality than set equality in ZFC. Outside of pure math, the identity of indiscernibles has attracted much controversy and criticism, especially from corpuscular philosophy and quantum mechanics. This is why the properties are said to not form a complete axiomatization.
However, apart from cases dealing with indiscernibles, these properties taken as axioms of equality are equivalent to equality as defined in ZFC.
These are sometimes taken as the definition of equality, such as in some areas of first-order logic.
= Derivations of basic properties
=Reflexivity of Equality: Given some set S with a relation R induced by equality (
x
R
y
⇔
x
=
y
{\displaystyle xRy\Leftrightarrow x=y}
), assume
a
∈
S
{\displaystyle a\in S}
. Then
a
=
a
{\displaystyle a=a}
by the Law of identity, thus
a
R
a
{\displaystyle aRa}
.
The Law of identity is distinct from reflexivity in two main ways: first, the Law of Identity applies only to cases of equality, and second, it is not restricted to elements of a set. However, many mathematicians refer to both as "Reflexivity", which is generally harmless.
Symmetry of Equality: Given some set S with a relation R induced by equality (
x
R
y
⇔
x
=
y
{\displaystyle xRy\Leftrightarrow x=y}
), assume there are elements
a
,
b
∈
S
{\displaystyle a,b\in S}
such that
a
R
b
{\displaystyle aRb}
. Then, take the formula
ϕ
(
x
)
:
x
R
a
{\displaystyle \phi (x):xRa}
. So we have
(
a
=
b
)
⟹
(
a
R
a
⇒
b
R
a
)
{\displaystyle (a=b)\implies (aRa\Rightarrow bRa)}
. Since
a
=
b
{\displaystyle a=b}
by assumption, and
a
R
a
{\displaystyle aRa}
by Reflexivity, we have that
b
R
a
{\displaystyle bRa}
.
Transitivity of Equality: Given some set S with a relation R induced by equality (
x
R
y
⇔
x
=
y
{\displaystyle xRy\Leftrightarrow x=y}
), assume there are elements
a
,
b
,
c
∈
S
{\displaystyle a,b,c\in S}
such that
a
R
b
{\displaystyle aRb}
and
b
R
c
{\displaystyle bRc}
. Then take the formula
ϕ
(
x
)
:
x
R
c
{\displaystyle \phi (x):xRc}
. So we have
(
b
=
a
)
⟹
(
b
R
c
⇒
a
R
c
)
{\displaystyle (b=a)\implies (bRc\Rightarrow aRc)}
. Since
b
=
a
{\displaystyle b=a}
by symmetry, and
b
R
c
{\displaystyle bRc}
by assumption, we have that
a
R
c
{\displaystyle aRc}
.
Function application: Given some function
f
(
x
)
{\displaystyle f(x)}
, assume there are elements a and b from its domain such that a = b, then take the formula
ϕ
(
x
)
:
f
(
a
)
=
f
(
x
)
{\displaystyle \phi (x):f(a)=f(x)}
. So we have
(
a
=
b
)
⟹
[
(
f
(
a
)
=
f
(
a
)
)
⇒
(
f
(
a
)
=
f
(
b
)
)
]
{\displaystyle (a=b)\implies [(f(a)=f(a))\Rightarrow (f(a)=f(b))]}
Since
a
=
b
{\displaystyle a=b}
by assumption, and
f
(
a
)
=
f
(
a
)
{\displaystyle f(a)=f(a)}
by reflexivity, we have that
f
(
a
)
=
f
(
b
)
{\displaystyle f(a)=f(b)}
.
This is also sometimes included in the axioms of equality, but isn't necessary as it can be deduced from the other two axioms as shown above.
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 (see Richardson's theorem).
The binary relation "is approximately equal" (denoted by the symbol
≈
{\displaystyle \approx }
) between real numbers or other things, even if more precisely defined, is not transitive (since many small differences can add up to something big). However, equality almost everywhere is transitive.
A questionable equality under test may be denoted using the
=
?
{\displaystyle {\stackrel {?}{=}}}
symbol.
Relation with equivalence, congruence, 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. For example, one may distinguish fractions from rational numbers, the latter being equivalence classes of fractions: the fractions
1
/
2
{\displaystyle 1/2}
and
2
/
4
{\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
{
A
,
B
,
C
}
{\displaystyle \{{\text{A}},{\text{B}},{\text{C}}\}}
and
{
1
,
2
,
3
}
{\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
A
↦
1
,
B
↦
2
,
C
↦
3.
{\displaystyle {\text{A}}\mapsto 1,{\text{B}}\mapsto 2,{\text{C}}\mapsto 3.}
However, there are other choices of isomorphism, such as
A
↦
3
,
B
↦
2
,
C
↦
1
,
{\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 quotient set of the isomorphism classes between the objects. In geometry for instance, two geometric shapes are said to be equal or congruent when one may be moved to coincide with the other, and the equality/congruence relation is the isomorphism classes of isometries between shapes. Similarly to isomorphisms of sets, the difference between isomorphisms and equality/congruence between such mathematical objects with properties and structure was one motivation for the development of category theory, as well as for homotopy type theory and univalent foundations.
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.
Logic axiom:
x
=
y
⟹
∀
z
,
(
z
∈
x
⟺
z
∈
y
)
{\displaystyle x=y\implies \forall z,(z\in x\iff z\in y)}
Logic axiom:
x
=
y
⟹
∀
z
,
(
x
∈
z
⟺
y
∈
z
)
{\displaystyle x=y\implies \forall z,(x\in z\iff y\in z)}
Set theory axiom:
(
∀
z
,
(
z
∈
x
⟺
z
∈
y
)
)
⟹
x
=
y
{\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."
= 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.
Set theory definition:
(
x
=
y
)
:=
∀
z
,
(
z
∈
x
⟺
z
∈
y
)
{\displaystyle (x=y)\ :=\ \forall z,(z\in x\iff z\in y)}
Set theory axiom:
x
=
y
⟹
∀
z
,
(
x
∈
z
⟺
y
∈
z
)
{\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
Logical equivalence
Proportionality (mathematics)
Notes
References
Kata Kunci Pencarian:
- Sains, teknologi, teknik, dan matematika
- Tanda sama dengan
- Sejarah olahraga
- Pemberdayaan wanita
- Talat Basari
- Kesamaan
- 0,999...
- Dimensi Hausdorff
- Arianisme
- Penghargaan Hugo untuk Novella Terbaik
- Equality (mathematics)
- Equality
- Equals sign
- Outline of discrete mathematics
- Equal
- Similarity
- Relational operator
- Identity (mathematics)
- Equivalence
- Extensionality
