Abuse of notation
   HOME

TheInfoList



OR:

In mathematics, abuse of notation occurs when an author uses a mathematical notation in a way that is not entirely formally correct, but which might help simplify the exposition or suggest the correct intuition (while possibly minimizing errors and confusion at the same time). However, since the concept of formal/syntactical correctness depends on both time and context, certain notations in mathematics that are flagged as abuse in one context could be formally correct in one or more other contexts. Time-dependent abuses of notation may occur when novel notations are introduced to a theory some time before the theory is first formalized; these may be formally corrected by solidifying and/or otherwise improving the theory. ''Abuse of notation'' should be contrasted with ''misuse'' of notation, which does not have the presentational benefits of the former and should be avoided (such as the misuse of
constants of integration In calculus, the constant of integration, often denoted by C (or c), is a constant term added to an antiderivative of a function f(x) to indicate that the indefinite integral of f(x) (i.e., the set of all antiderivatives of f(x)), on a connected ...
). A related concept is abuse of language or abuse of terminology, where a ''term'' — rather than a notation — is misused. Abuse of language is an almost synonymous expression for abuses that are non-notational by nature. For example, while the word ''representation'' properly designates a group homomorphism from a group ''G'' to GL(''V''), where ''V'' is a vector space, it is common to call ''V'' "a representation of ''G''". Another common abuse of language consists in identifying two mathematical objects that are different, but canonically isomorphic. Other examples include identifying a constant function with its value, identifying a group with a
binary operation In mathematics, a binary operation or dyadic operation is a rule for combining two elements (called operands) to produce another element. More formally, a binary operation is an operation of arity two. More specifically, an internal binary op ...
with the name of its underlying set, or identifying to \mathbb R^3 the Euclidean space of dimension three equipped with a
Cartesian coordinate system A Cartesian coordinate system (, ) in a plane is a coordinate system that specifies each point uniquely by a pair of numerical coordinates, which are the signed distances to the point from two fixed perpendicular oriented lines, measured ...
.


Examples


Structured mathematical objects

Many
mathematical object A mathematical object is an abstract concept arising in mathematics. In the usual language of mathematics, an ''object'' is anything that has been (or could be) formally defined, and with which one may do deductive reasoning and mathematical ...
s consist of a set, often called the underlying set, equipped with some additional structure, such as a mathematical operation or a
topology In mathematics, topology (from the Greek words , and ) is concerned with the properties of a geometric object that are preserved under continuous deformations, such as stretching, twisting, crumpling, and bending; that is, without closing ho ...
. It is a common abuse of notation to use the same notation for the underlying set and the structured object (a phenomenon known as ''suppression of parameters''). For example, \mathbb Z may denote the set of the
integer An integer is the number zero (), a positive natural number (, , , etc.) or a negative integer with a minus sign ( −1, −2, −3, etc.). The negative numbers are the additive inverses of the corresponding positive numbers. In the language ...
s, the group of integers together with addition, or the ring of integers with addition and multiplication. In general, there is no problem with this if the object under reference is well understood, and avoiding such an abuse of notation might even make mathematical texts more pedantic and more difficult to read. When this abuse of notation may be confusing, one may distinguish between these structures by denoting (\mathbb Z, +) the group of integers with addition, and (\mathbb Z, +, \cdot) the ring of integers. Similarly, a topological space consists of a set (the underlying set) and a topology \mathcal, which is characterized by a set of
subset In mathematics, set ''A'' is a subset of a set ''B'' if all elements of ''A'' are also elements of ''B''; ''B'' is then a superset of ''A''. It is possible for ''A'' and ''B'' to be equal; if they are unequal, then ''A'' is a proper subset o ...
s of (the
open set In mathematics, open sets are a generalization of open intervals in the real line. In a metric space (a set along with a distance defined between any two points), open sets are the sets that, with every point , contain all points that a ...
s). Most frequently, one considers only one topology on , so there is usually no problem in referring as both the underlying set, and the pair consisting of and its topology \mathcal — even though they are technically distinct mathematical objects. Nevertheless, it could occur on some occasions that two different topologies are considered simultaneously on the same set. In which case, one must exercise care and use notation such as (X, \mathcal) and (X, \mathcal') to distinguish between the different topological spaces.


Function notation

One may encounter, in many textbooks, sentences such as "Let be a function ...". This is an abuse of notation, as the name of the function is , and usually denotes the value of the function for the element of its domain. The correct phrase would be "Let be a function of the variable ..." or "Let be a function ..." This abuse of notation is widely used, as it simplifies the formulation, and the systematic use of a correct notation quickly becomes pedantic. A similar abuse of notation occurs in sentences such as "Let us consider the function ...", when in fact is not a function. The function is the operation that associates to , often denoted as . Nevertheless, this abuse of notation is widely used, since it can help one avoid the pedantry while being generally not confusing.


Equality vs. isomorphism

Many mathematical structures are defined through a characterizing property (often a universal property). Once this desired property is defined, there may be various ways to construct the structure, and the corresponding results are formally different objects, but which have exactly the same properties (i.e., isomorphic). As there is no way to distinguish these isomorphic objects through their properties, it is standard to consider them as equal, even if this is formally wrong. One example of this is the Cartesian product, which is often seen as associative: :(E \times F) \times G = E \times (F \times G) = E \times F \times G. But this is strictly speaking not true: if x \in E, y \in F and z \in G, the identity ((x, y), z) = (x, (y, z)) would imply that (x, y) = x and z = (y, z), and so ((x, y), z) = (x, y, z) would mean nothing. However, these equalities can be legitimized and made rigorous in category theory—using the idea of a natural isomorphism. Another example of similar abuses occurs in statements such as "there are two non-Abelian groups of order 8", which more strictly stated means "there are two isomorphism classes of non-Abelian groups of order 8".


Equivalence classes

Referring to an
equivalence class In mathematics, when the elements of some set S have a notion of equivalence (formalized as an equivalence relation), then one may naturally split the set S into equivalence classes. These equivalence classes are constructed so that elements ...
of an
equivalence relation In mathematics, an equivalence relation is a binary relation that is reflexive, symmetric and transitive. The equipollence relation between line segments in geometry is a common example of an equivalence relation. Each equivalence relatio ...
by ''x'' instead of 'x''is an abuse of notation. Formally, if a set ''X'' is partitioned by an equivalence relation ~, then for each ''x'' ∈ ''X'', the equivalence class is denoted 'x'' But in practice, if the remainder of the discussion is focused on the equivalence classes rather than the individual elements of the underlying set, then it is common to drop the square brackets in the discussion. For example, in modular arithmetic, a finite group of
order Order, ORDER or Orders may refer to: * Categorization, the process in which ideas and objects are recognized, differentiated, and understood * Heterarchy, a system of organization wherein the elements have the potential to be ranked a number of d ...
''n'' can be formed by partitioning the integers via the equivalence relation "''x'' ~ ''y'' if and only if ''x'' ≡ ''y'' (mod ''n'')". The elements of that group would then be ..., 'n'' − 1 but in practice they are usually denoted simply as 0, 1, ..., ''n'' − 1. Another example is the space of (classes of) measurable functions over a measure space, or classes of Lebesgue integrable functions, where the equivalence relation is equality " almost everywhere".


Subjectivity

The terms "abuse of language" and "abuse of notation" depend on context. Writing "" for a partial function from to is almost always an abuse of notation, but not in a category theoretic context, where can be seen as a morphism in the category of sets and partial functions.


See also

* Mathematical notation * Misnomer


References

{{Reflist Mathematical notation Mathematical terminology