# Well-defined

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* 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* is also used to indicate whether a logical statement is unambiguous.

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 *f*(0) is undefined, but this has nothing to do with the question of whether *f*(*x*) = 1/*x* is well-defined. It is; 0 is simply not in the domain of the function.

## Contents

## Example[edit]

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

Then is well-defined if . This is e. g. the case when (then *f*(*a*) happens to be ).

If however then is not well-defined because is "ambiguous" for . This is e. g. the case when and . Indeed, and *f*(2) would have to be 0 as well as 1, which is impossible. Therefore, the latter *f* is not well-defined and thus not a function.

## "Definition" as anticipation of definition[edit]

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- .

Whereas 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: If and only if , we get a function , and the of "definition" is well-defined (as a function).
On the other hand: if then for an there is both, *and* , and the binary relation is not *functional* as defined in Binary relation#Special types of binary relations and thus not well-defined (as a function). Colloquially, the "function" is 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, firstly because it is sort of a short-hand of the two-step approach, secondly because the relevant mathematical reasoning (step 2.) is the same in both cases, and finally because in mathematical texts the assertion is «up to 100%» true.

## Independence of representative[edit]

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. This is sometimes unavoidable when the arguments are cosets and the equation refers to coset representatives.

### Functions with one argument[edit]

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 *f*.

The function *f* is well-defined, because

### Operations[edit]

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 k is an integer. Therefore,

and similarly for any representative of .

## Well-defined notation[edit]

For real numbers, the product is unambiguous because . (Therefore, the notation is said to be *well-defined*.^{[1]}) Because of this property of the operation (here ), which is known as associativity, the result does not depend on the sequence of multiplications, so that a specification of the sequence can be omitted.

The subtraction operation, , is not associative. However, there is a convention (or definition) in that the operation is understood as addition of the opposite, thus is the same as , and is called "well-defined".

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

Unlike with functions, the notational ambiguities can be overcome more or less easily by means of additional definitions, i. e. rules of precedence, and/or associativity of the operators. In the programming language C e. g. 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)`

. In the programming language APL there is only one rule: from right to left − but parentheses first.

## Other uses of the term[edit]

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]}

## See also[edit]

- Equivalence relation § Well-definedness under an equivalence relation
- Definitionism
- Existence
- Uniqueness
- Uniqueness quantification
- Undefined

## References[edit]

### Notes[edit]

- ^
^{a}^{b}^{c}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.

### Sources[edit]

*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.