In mathematics, an expression is called **well-defined** or *unambiguous* if its definition assigns it a unique interpretation or value. Otherwise, the expression is said to be *not well-defined*, *ill-defined* or *ambiguous*.^{ [1] } A function is well-defined if it gives the same result when the representation of the input is changed without changing the value of the input. For instance, if *f* takes real numbers as input, and if *f*(0.5) does not equal *f*(1/2) then *f* is not well-defined (and thus not a function).^{ [2] } The term *well-defined* can also be used to indicate that a logical expression is unambiguous or uncontradictory.^{ [3] }

- Example
- "Definition" as anticipation of definition
- Independence of representative
- Functions with one argument
- Operations
- Well-defined notation
- Other uses of the term
- See also
- References
- Notes
- Sources

A function that is not well-defined is not the same as a function that is undefined. For example, if *f*(*x*) = 1/*x*, then the fact that *f*(0) is undefined does not mean that the *f* is *not* well-defined — but that 0 is simply not in the domain of *f*.

Let be sets, let and "define" as if and if .

Then is well-defined if . For example, if and , then would be well-defined and equal to .

However, if , then would not be well-defined because is "ambiguous" for . For example, if and , then would have to be both 0 and 1, which makes it ambiguous. As a result, the latter * is not well-defined and thus not a function.*

In order to avoid the apostrophes around "define" in the previous simple example, the "definition" of could be broken down into two simple logical steps:

*The definition*of the binary relation: In the example- ,

*The assertion*: The binary relation is a function; in the example- .

While the definition in step 1 is formulated with the freedom of any definition and is certainly effective (without the need to classify it as "well-defined"), the assertion in step 2 has to be proved. That is, is a function if and only if , in which case — as a function — is well-defined.

On the other hand, if , then for an , we would have that *and*, which makes the binary relation not *functional* (as defined in Binary relation#Special types of binary relations) and thus not well-defined as a function. Colloquially, the "function" is also called ambiguous at point (although there is *per definitionem* never an "ambiguous function"), and the original "definition" is pointless.

Despite these subtle logical problems, it is quite common to anticipatorily use the term definition (without apostrophes) for "definitions" of this kind — for three reasons:

- It provides a handy shorthand of the two-step approach.
- The relevant mathematical reasoning (i.e., step 2) is the same in both cases.
- In mathematical texts, the assertion is "up to 100%" true.

The question of well-definedness of a function classically arises when the defining equation of a function does not (only) refer to the arguments themselves, but (also) to elements of the arguments, serving as representatives. This is sometimes unavoidable when the arguments are cosets and the equation refers to coset representatives. The result of a function application must then not depend on the choice of reprentative.

For example, consider the following function

where and are the integers modulo *m* and denotes the congruence class of *n* mod *m*.

N.B.: is a reference to the element , and is the argument of *.*

The function * is well-defined, because*

As a counter example, the converse definition

does not lead to a well-defined function, since e.g. equals in , but the first would be mapped by to , while the second would be mapped to , and and are unequal in .

In particular, the term well-defined is used with respect to (binary) operations on cosets. In this case one can view the operation as a function of two variables and the property of being well-defined is the same as that for a function. For example, addition on the integers modulo some *n* can be defined naturally in terms of integer addition.

The fact that this is well-defined follows from the fact that we can write any representative of as , where is an integer. Therefore,

and similarly for any representative of , thereby making the same irrespective of the choice of representative.^{ [3] }

For real numbers, the product is unambiguous because (and hence the notation is said to be *well-defined*).^{ [1] } This property, also known as associativity of multiplication, guarantees that the result does not depend on the sequence of multiplications, so that a specification of the sequence can be omitted.

The subtraction operation, on the other hand, is not associative. However, there is a convention that is shorthand for , thus it is "well-defined".

Division is also non-associative. However, in the case of , parenthezation conventions are not so well established, so this expression is often considered **ill-defined**.

Unlike with functions, the notational ambiguities can be overcome more or less easily by means of additional definitions (e.g., rules of precedence, associativity of the operator). For example, in the programming language C the operator `-`

for subtraction is *left-to-right-associative*, which means that `a-b-c`

is defined as `(a-b)-c`

, and the operator `=`

for assignment is *right-to-left-associative*, which means that `a=b=c`

is defined as `a=(b=c)`

.^{ [4] } In the programming language APL there is only one rule: from right to left — but parentheses first.

A solution to a partial differential equation is said to be well-defined if it is determined by the boundary conditions in a continuous way as the boundary conditions are changed.^{ [1] }

In mathematics, a **binary relation** over sets X and Y is a subset of the Cartesian product ; that is, it is a set of ordered pairs (*x*, *y*) consisting of elements x in X and y in Y. It encodes the common concept of relation: an element x is *related* to an element y, if and only if the pair (*x*, *y*) belongs to the set of ordered pairs that defines the *binary relation*. A binary relation is the most studied special case *n* = 2 of an n-ary relation over sets *X*_{1}, ..., *X*_{n}, which is a subset of the Cartesian product

In mathematics, when the elements of some set have a notion of equivalence defined on them, then one may naturally split the set into **equivalence classes**. These equivalence classes are constructed so that elements and belong to the same **equivalence class** if, and only if, they are equivalent.

A **quotient group** or **factor group** is a mathematical group obtained by aggregating similar elements of a larger group using an equivalence relation that preserves some of the group structure. For example, the cyclic group of addition modulo *n* can be obtained from the group of integers under addition by identifying elements that differ by a multiple of *n* and defining a group structure that operates on each such class as a single entity. It is part of the mathematical field known as group theory.

An **integer** is colloquially defined as a number that can be written without a fractional component. For example, 21, 4, 0, and −2048 are integers, while 9.75, 5+1/2, and √2 are not.

In mathematics, specifically abstract algebra, an **integral domain** is a nonzero commutative ring in which the product of any two nonzero elements is nonzero. Integral domains are generalizations of the ring of integers and provide a natural setting for studying divisibility. In an integral domain, every nonzero element *a* has the cancellation property, that is, if *a* ≠ 0, an equality *ab* = *ac* implies *b* = *c*.

In mathematics, a **group** is a set equipped with an operation that combines any two elements to form a third element while being associative as well as having an identity element and inverse elements. These three conditions, called group axioms, hold for number systems and many other mathematical structures. For example, the integers together with the addition operation form a group. The formulation of the axioms is, however, detached from the concrete nature of the group and its operation. This allows one to handle entities of very different mathematical origins in a flexible way, while retaining essential structural aspects of many objects in abstract algebra and beyond. The ubiquity of groups in numerous areas—both within and outside mathematics—makes them a central organizing principle of contemporary mathematics.

In mathematics, **modular arithmetic** is a system of arithmetic for integers, where numbers "wrap around" when reaching a certain value, called the **modulus**. The modern approach to modular arithmetic was developed by Carl Friedrich Gauss in his book *Disquisitiones Arithmeticae*, published in 1801.

In mathematics, a **sequence** is an enumerated collection of objects in which repetitions are allowed and order matters. Like a set, it contains members. The number of elements is called the *length* of the sequence. Unlike a set, the same elements can appear multiple times at different positions in a sequence, and unlike a set, the order does matter. Formally, a sequence can be defined as a function from natural numbers to the elements at each position. The notion of a sequence can be generalized to an indexed family, defined as a function from an index set that may not be numbers to another set of elements.

In Euclidean geometry, an **affine transformation**, or an **affinity**, is a geometric transformation that preserves lines and parallelism.

In set theory, the **complement** of a set A, often denoted by *A*^{c}, are the elements not in A.

A **mathematical symbol** is a figure or a combination of figures that is used to represent a mathematical object, an action on mathematical objects, a relation between mathematical objects, or for structuring the other symbols that occur in a formula. As formulas are entirely constituted with symbols of various types, many symbols are needed for expressing all mathematics.

In mathematics, specifically group theory, a subgroup *H* of a group *G* may be used to decompose the underlying set of *G* into disjoint equal-size subsets called **cosets**. There are *left cosets* and *right cosets*. Cosets have the same number of elements (cardinality) as does *H*. Furthermore, *H* itself is both a left coset and a right coset. The number of left cosets of *H* in *G* is equal to the number of right cosets of *H* in *G*. This common value is called the index of *H* in *G* and is usually denoted by [*G* : *H*].

An **exact sequence** is a sequence of morphisms between objects such that the image of one morphism equals the kernel of the next.

In mathematics, a **function** is a binary relation between two sets that associates each element of the first set to exactly one element of the second set. Typical examples are functions from integers to integers, or from the real numbers to real numbers.

In mathematics, a **foliation** is an equivalence relation on an *n*-manifold, the equivalence classes being connected, injectively immersed submanifolds, all of the same dimension *p*, modeled on the decomposition of the real coordinate space **R**^{n} into the cosets *x* + **R**^{p} of the standardly embedded subspace **R**^{p}. The equivalence classes are called the **leaves** of the foliation. If the manifold and/or the submanifolds are required to have a piecewise-linear, differentiable, or analytic structure then one defines piecewise-linear, differentiable, or analytic foliations, respectively. In the most important case of differentiable foliation of class *C ^{r}* it is usually understood that

In mathematics, a **congruence subgroup** of a matrix group with integer entries is a subgroup defined by congruence conditions on the entries. A very simple example would be invertible 2 × 2 integer matrices of determinant 1, in which the off-diagonal entries are *even*. More generally, the notion of **congruence subgroup** can be defined for arithmetic subgroups of algebraic groups; that is, those for which we have a notion of 'integral structure' and can define reduction maps modulo an integer.

In mathematics, the **Grothendieck group** construction constructs an abelian group from a commutative monoid *M* in the most universal way, in the sense that any abelian group containing a homomorphic image of *M* will also contain a homomorphic image of the Grothendieck group of *M*. The Grothendieck group construction takes its name from a specific case in category theory, introduced by Alexander Grothendieck in his proof of the Grothendieck–Riemann–Roch theorem, which resulted in the development of K-theory. This specific case is the monoid of isomorphism classes of objects of an abelian category, with the direct sum as its operation.

In mathematics, a **CR manifold**, or **Cauchy–Riemann manifold**, is a differentiable manifold together with a geometric structure modeled on that of a real hypersurface in a complex vector space, or more generally modeled on an edge of a wedge.

In mathematics, particularly in the area of number theory, a **modular multiplicative inverse** of an integer a is an integer x such that the product ax is congruent to 1 with respect to the modulus m. In the standard notation of modular arithmetic this congruence is written as

In computer science and mathematics, more precisely in automata theory, model theory and formal language, a **regular numerical predicate** is a kind of relation over integers. Regular numerical predicates can also be considered as a subset of for some arity . One of the main interests of this class of predicates is that it can be defined in plenty of different ways, using different logical formalisms. Furthermore, most of the definitions use only basic notions, and thus allows to relate foundations of various fields of fundamental computer science such as automata theory, syntactic semigroup, model theory and semigroup theory.

- 1 2 3 Weisstein, Eric W. "Well-Defined". From MathWorld--A Wolfram Web Resource. Retrieved 2 January 2013.
- ↑ Joseph J. Rotman,
*The Theory of Groups: an Introduction*, p. 287 "... a function is "single-valued," or, as we prefer to say ... a function is*well defined*.", Allyn and Bacon, 1965. - 1 2 "The Definitive Glossary of Higher Mathematical Jargon".
*Math Vault*. 2019-08-01. Retrieved 2019-10-18. - ↑ "Operator Precedence and Associativity in C".
*GeeksforGeeks*. 2014-02-07. Retrieved 2019-10-18.

*Contemporary Abstract Algebra*, Joseph A. Gallian, 6th Edition, Houghlin Mifflin, 2006, ISBN 0-618-51471-6.*Algebra: Chapter 0*, Paolo Aluffi, ISBN 978-0821847817. Page 16.*Abstract Algebra*, Dummit and Foote, 3rd edition, ISBN 978-0471433347. Page 1.

This page is based on this Wikipedia article

Text is available under the CC BY-SA 4.0 license; additional terms may apply.

Images, videos and audio are available under their respective licenses.

Text is available under the CC BY-SA 4.0 license; additional terms may apply.

Images, videos and audio are available under their respective licenses.