Function - Revision history

Vipul at 00:41, 29 April 2014

2014-04-29T00:41:54Z

← Older revision		Revision as of 00:41, 29 April 2014
Line 1:		Line 1:
			{{core term}}

	==Definition==		==Definition==

Vipul at 20:51, 19 September 2011

2011-09-19T20:51:20Z

← Older revision		Revision as of 20:51, 19 September 2011
Line 51:		Line 51:
	** <math>g</math> is not a [[one-one function]], but the restriction <math>f</math> is a one-one function.		** <math>g</math> is not a [[one-one function]], but the restriction <math>f</math> is a one-one function.
	** <math>g</math> attains its absolute minimum value, but the restriction <math>f</math> does not.		** <math>g</math> attains its absolute minimum value, but the restriction <math>f</math> does not.

			==Description of functions==

			A ''description'' of a function should be a clear and actionable way of describing (i) what the domain is, and (ii) how to compute the output of the function from any given input in the domain. There are three main kinds of descriptions:

			* '''A'''lgebraic (expression-based or formula-based, or procedural)
			* '''N'''umerical (in the form of a table of inputs and outputs)
			* '''G'''raphical (in the form of the graph of the function)

			===Algebraic, expression-based or procedural descriptions===

			This is a description of the function that uses a formula or expression based on known functions and known techniques for [[pointwise combination of functions\|pointwise combination]], [[composition of two functions\|composition]], taking the [[inverse function]], and using [[piecewise definition of function\|piecewise definitions]]. The known techniques are the tools used to build complicated functions from the existing simpler ones.

			An algebraic description is typically written in the form:

			<math>\! x \mapsto </math> expression in <math>x</math>

			The way this is interpreted is that, to evaluate the function at any actual input, we replace all occurrences of <math>x</math> on the right side with that input and compute.

			Alternatively, if the function is denoted by the letter <math>g</math>, we can also write, in place of the above:

			<math>\! g(x) := </math> expression in <matH>x</math>

			{{quotation\|'''DUMMY VARIABLE''': The letter <math>x</math> used above is a dummy variable (or a ''local'' variable). In other words, replacing <math>x</math> on both the left side and in the right side expression by a single other letter gives an ''identical'' function definition. Also, if the letter <math>x</math> is ''already'' in use, then some other letter should be used for the function description.}}

			In some cases, the algebraic description may be too complicated to write in a single straight line expression. In this case, we may express it in terms of a procedure or algorithm.

			Here are some examples:

			{\| class="sortable" border="1"
			! Function !! Algebraic description of function !! Comments
			\|-
			\| [[identity function]] \|\| <math>x \mapsto x</math> \|\|
			\|-
			\| [[square function]] \|\| <math>x \mapsto x^2</math> \|\|
			\|-
			\| [[sine-squared function]] \|\| <math>x \mapsto \sin^2x</math> \|\| We are using a [[composite of two functions]]: the [[square function]] and the [[sine function]].
			\|-
			\| [[absolute value function]] \|\| <math>x \mapsto \left\lbrace x, & x \ge 0 \\ -x, & x < 0 \\\end{array}\right.</math>\|\| we use a [[piecewise definition of function]]. Specifically, this function is a [[piecewise linear function]].
			\|}

Vipul: Created page with "==Definition== ===General definition=== A '''function''' from a set $A$ to a set $B$ is a rule that associates, to each element of $A$ , a ''uni..."

2011-09-19T20:39:34Z

Created page with "==Definition== ===General definition=== A '''function''' from a set <math>A</math> to a set <math>B</math> is a rule that associates, to each element of <math>A</math>, a ''uni..."

New page

==Definition==

===General definition===

A '''function''' from a set <math>A</math> to a set <math>B</math> is a rule that associates, to each element of <math>A</math>, a ''unique'' element of <math>B</math>.

Functions are typically denoted by lower-case or upper-case ''single'' letters, though some functions have special notations. To say that a function <math>f</math> is from <math>A</math> to <math>B</math>, we write ''<math>f:A \to B</math> is a function''.

For an element <math>a</math> of the domain <math>A</math>, the unique element of <math>B</math> associated with <math>a</math> is denoted as <math>f(a)</math>. The act of going from <math>a</math> to <math>f(a)</math> is termed ''applying'' the function. The element <math>a</math> is termed an ''input'' to the function and the corresponding element <math>f(a)</math> is termed the ''output'' or ''image'' of the function corresponding to that input.

Note that <math>A</math> and <math>B</math> may be equal or distinct.

Some key terminology:

* The [[domain]] of a function <math>f:A \to B</math> is the set <math>A</math>.
* '''This term is not used in most basic treatments of the calculus of one variable''': The ''co-domain'' of a function <math>f:A \to B</math> is the set <math>B</math>.
* The [[range]] of a function <math>f:A \to B</math> is the subset of <math>B</math> given as <math>\{ f(a) \mid a \in A \}</math>, i.e., the set of elements of <math>B</math> that arise as outputs of the function.

===Definition for functions of one variable===

In the context of functions of one variable, the term ''function'' is used for a function whose domain is a subset of <math>\R</math> and whose co-domain is <math>\R</math>, i.e., for a real-valued function with a real variable as input. In other words, the term ''function'' is used for a function if both the domain and the range are subsets of <math>\R</math>.

==Key features==

===Equal inputs give equal outputs===

A key feature of ''functions'' is that, for a given function, the ''input'' to the function ''completely determines'' the ''output'', i.e., if the same input is fed into the same function at different times, the output will be the same each time. This feature can be captured by the phrase ''equal inputs give equal outputs''.

When people ask whether a function is ''well defined'', what they usually mean is whether it is a function at all, in the sense of whether it has the key feature of ''equal inputs give equal outputs''.

Here are some examples:

{| class="sortable" border="1"
! Example of a purported function !! Purported domain !! Does it satisfy the ''equal inputs give equal outputs'' property? !! So, is it ''really'' a function?
|-
| <math>f(d)</math> is defined as the area of a circle with diameter <math>d</math> || Positive reals || Yes, because any two circles with the same diameter are congruent and hence have the same area. In fact, we can also obtain an ''explicit'' formula: <math>f(d) := \pi d^2/4</math> || Yes
|-
| <math>f(x)</math> is defined as the area of a square with perimeter <math>x</math> || Positive reals || Yes, because any two squares with the same perimeter are congruent and hence have the same area. In fact, we can also obtain an ''explicit'' formula: <math>f(x) := x^2/16</math> || Yes
|-
| <math>f(x)</math> is defined as the area of a rectangle with perimeter <math>x</math> || Positive reals || No, because different rectangles with the same perimeter can have different shapes and consequently have different areas || No
|}

===Domain and restriction of domain===

The study of a function depends crucially on the [[domain]] on which the function is being studied. If a function of one variable is defined solely by means of an expression or procedure, the domain of the function is taken to be the largest possible subset of the reals on which that expression or procedure makes sense and gives a valid answer. However, we can also consider functions restricted to domains that are strictly smaller than the maximum possible domain on which the expression being used for the function makes sense. The behavior of the function, as well as answers to questions like whether it is increasing or decreasing and what its extreme values are, depends on what domain we are considering the function on.

Here are some examples:

* Consider the function <math>f</math> defined as follows: ''<math>f(d)</math> is defined as the area of a circle with diameter <math>d</math>''. Ignoring the boundary case of point circles and line circles, the only possible inputs for this function are positive reals, so <math>f</math> is a function from the positive reals to the positive reals given by the expression <math>f(d) := \pi d^2/4</math>. However, if we look ''only'' at the expression for <math>f</math>, then that expression makes sense for ''all'' real numbers, including zero and negative real numbers as well as positive real numbers. Call the latter function <math>g</math>, i.e., <math>g(d) := \pi d^2/4</math> for all <math>d \in \R</math>. Then, <math>f</math> is the restriction of <math>g</math> to the subdomain <math>(0,\infty)</math>. Note that:
** <math>g</math> is not an [[increasing function]], but the restriction <math>f</math> is an increasing function.
** <math>g</math> is not a [[one-one function]], but the restriction <math>f</math> is a one-one function.
** <math>g</math> attains its absolute minimum value, but the restriction <math>f</math> does not.

Function - Revision history

Vipul at 00:41, 29 April 2014

Vipul at 20:51, 19 September 2011

Vipul: Created page with "==Definition== ===General definition=== A '''function''' from a set A to a set B is a rule that associates, to each element of A, a ''uni..."

Vipul: Created page with "==Definition== ===General definition=== A '''function''' from a set $A$ to a set $B$ is a rule that associates, to each element of $A$ , a ''uni..."