Monotonic Function

Thursday, 10 May 2012

upload

go to the top
About WN
Contact
Feedback
Privacy Policy
© 2012 World News Inc., all Rights Reserved

fullscreen

Lights Out

Play next
List all Videos
Autoplay
Autorepeat
Shuffle
Replay

Determining where a function is increasing and decreasing using the first deriviative

01 Sentna - Monotonic Function Of Theta

Intro to Monotonic and Bounded Sequences, Ex 1

02 Sentna - What's Wrong With The Planet

3.3b Increasing & Decreasing Functions and the 1st Derivative Test - Calculus

130910 10 Determine whether following utility functions are monotonic or strongly monotonic max{x,y} and x+2y

Sentna - Escaping Velocity [Monotonic Function Of Theta]

Increasing and Decreasing Functions Part 1.avi

6c. Marginal Rate of Substitution and Monotonic Transformations of Utility

3.3a2 Increasing & Decreasing Functions and the 1st Derivative Test - Calculus

3.3a1 Increasing & Decreasing Functions and the 1st Derivative Test - Calculus

Differentiation : Increasing & Decreasing Functions : ExamSolutions

Monotonic and bounded sequences

MEC 290 Microeconomics - Monotonic Property & Consumer Preferences

Sequences 2 - Examples of Convergent/Monotonic/Bounded

Determine Where a Function is Increasing and Decreasing

Increasing/Decreasing Functions & the 1st Derivative

Monotone Subsequence

Calculus: Monotonic and Bounded Sequences

College Algebra 2.1 Video #1 Increasing, decreasing, constant functions

Analysis 1 - Monotonic Sequences

11.1 Infinite Sequence Lecture 9; Monotonic Sequence Theorem

show more results remove add to playlist

In mathematics, a monotonic function (or monotone function) is a function that preserves the given order. This concept first arose in calculus, and was later generalized to the more abstract setting of order theory.

Monotonicity in calculus and analysis

In calculus, a function ''f'' defined on a subset of the real numbers with real values is called monotonic (also monotonically increasing, increasing or non-decreasing), if for all ''x'' and ''y'' such that ''x'' ≤ ''y'' one has ''f''(''x'') ≤ ''f''(''y''), so ''f'' preserves the order (see Figure 1). Likewise, a function is called monotonically decreasing (also decreasing, or non-increasing) if, whenever ''x'' ≤ ''y'', then ''f''(''x'') ≥ ''f''(''y''), so it ''reverses'' the order (see Figure 2).

If the order ≤ in the definition of monotonicity is replaced by the strict order <, then one obtains a stronger requirement. A function with this property is called strictly increasing. Again, by inverting the order symbol, one finds a corresponding concept called strictly decreasing. Functions that are strictly increasing or decreasing are one-to-one (because for ''x'' not equal to ''y'', either ''x'' < ''y'' or ''x'' > ''y'' and so, by monotonicity, either ''f''(''x'') < ''f''(''y'') or ''f''(''x'') > ''f''(''y''), thus ''f''(''x'') is not equal to ''f''(''y'')).

The terms "non-decreasing" and "non-increasing" are meant to avoid confusion with "strictly increasing" and "strictly decreasing", respectively, but should not be confused with the (much weaker) negative qualifications "not decreasing" and "not increasing"; see also strict. When functions between discrete sets are considered in combinatorics, it is not always obvious that "increasing" and "decreasing" are taken to include the possibility of repeating the same value at successive arguments, so one finds the terms weakly increasing and weakly decreasing to stress this possibility.

The term ''monotonic transformation'' can also possibly cause some confusion because it refers to a transformation by a strictly increasing function. Notably, this is the case in economics with respect to the ordinal properties of a utility function being preserved across a monotonic transform (see also monotone preferences).

A function ''f''(''x'') is said to be absolutely monotonic over an interval (''a'', ''b'') if the derivatives of all orders of ''f'' are nonnegative at all points on the interval.

Some basic applications and results

The following properties are true for a monotonic function ''f'' : R → R:

''f'' has limits from the right and from the left at every point of its domain;

''f'' has a limit at infinity (either ∞ or −∞) of either a real number, ∞, or −∞.

''f'' can only have jump discontinuities;

''f'' can only have countably many discontinuities in its domain.

These properties are the reason why monotonic functions are useful in technical work in analysis. Two facts about these functions are:

if ''f'' is a monotonic function defined on an interval ''I'', then ''f'' is differentiable almost everywhere on ''I'', i.e. the set of numbers ''x'' in ''I'' such that ''f'' is not differentiable in ''x'' has Lebesgue measure zero.

if ''f'' is a monotonic function defined on an interval [''a'', ''b''], then ''f'' is Riemann integrable.

An important application of monotonic functions is in probability theory. If ''X'' is a random variable, its cumulative distribution function :''F_X''(''x'') = Prob(''X'' ≤ ''x'') is a monotonically increasing function.

A function is ''unimodal'' if it is monotonically increasing up to some point (the ''mode'') and then monotonically decreasing.

Monotonicity in functional analysis

In functional analysis on a topological vector space ''X'', a (possibly non-linear) operator ''T'' : ''X'' → ''X''^∗ is said to be a monotone operator if

: $(Tu - Tv, u - v) \geq 0 \quad \forall u,v \in X.$

Kachurovskii's theorem shows that convex functions on Banach spaces have monotonic operators as their derivatives.

A subset ''G'' of ''X'' × ''X''^∗ is said to be a monotone set if for every pair [''u''₁,''w''₁] and [''u''₂,''w''₂] in ''G'',

: $(w_1 - w_2, u_1 - u_2) \geq 0.$

''G'' is said to be maximal monotone if it is maximal among all monotone sets in the sense of set inclusion. The graph of a monotone operator ''G''(''T'') is a monotone set. A monotone operator is said to be maximal monotone if its graph is a maximal monotone set.

Monotonicity in order theory

In order theory, one does not restrict to real numbers, but one is concerned with arbitrary partially ordered sets or even with preordered sets. In these cases, the above definition of monotonicity is relevant as well. However, the terms "increasing" and "decreasing" are avoided, since they lose their appealing pictorial motivation as soon as one deals with orders that are not total. Furthermore, the strict relations < and > are of little use in many non-total orders and hence no additional terminology is introduced for them.

A monotone function is also called isotone, or . The dual notion is often called antitone, anti-monotone, or order-reversing. Hence, an antitone function ''f'' satisfies the property

: ''x'' ≤ ''y'' implies ''f''(''x'') ≥ ''f''(''y''),

for all ''x'' and ''y'' in its domain. It is easy to see that the composite of two monotone mappings is also monotone.

A constant function is both monotone and antitone; conversely, if ''f'' is both monotone and antitone, and if the domain of ''f'' is a lattice, then ''f'' must be constant.

Monotone functions are central in order theory. They appear in most articles on the subject and examples from special applications are to be found in these places. Some notable special monotone functions are order embeddings (functions for which ''x'' ≤ ''y'' if and only if ''f''(''x'') ≤ ''f''(''y'')) and order isomorphisms (surjective order embeddings).

Monotonicity in computer science

In computer science, monotonicity (also called consistency) is a condition applied to heuristic functions. A heuristic ''h(n)'' is monotonic if, for every node ''n'' and every successor ''n''' of ''n'' generated by any action ''a'', the estimated cost of reaching the goal from ''n'' is no greater than the step cost of getting to '' n' '' plus the estimated cost of reaching the goal from '' n' '',

: $h(n) \leq c(n, a, n') + h(n').$

This is a form of triangle inequality, with ''n'', ''n''', and the goal ''G_n'' closest to ''n''. Because every monotonic heuristic is also admissible, monotonicity is a stricter requirement than admissibility. In some heuristic algorithms, such as A*, the algorithm can be considered optimal if it is monotonic.

Boolean functions

Image:Monotone Boolean functions 0,1,2,3.svg|400px|thumb|right|The free distributive lattices of monotonic Boolean functions on 0, 1, 2, and 3 arguments (move mouse over right diagram to see description)

circle 659 623 30 circle 658 552 35 circle 587 480 35 circle 659 481 35 circle 729 481 35 circle 588 410 35 circle 658 410 35 circle 729 410 35 circle 548 339 30 circle 604 339 30 circle 758 339 30 circle 661 339 35 circle 588 268 35 circle 659 267 35 circle 729 268 35 circle 588 197 35 circle 658 197 35 circle 729 197 35 circle 658 126 35 circle 659 56 30

desc bottom-left In Boolean algebra, a monotonic function is one such that for all ''a''_''i'' and ''b''_''i'' in {0,1} such that ''a''₁ ≤ ''b''₁, ''a''₂ ≤ ''b''₂, ..., ''a''_''n'' ≤ ''b''_''n''

it is true that

:f(''a''₁, ... , ''a''_''n'') ≤ f(''b''₁, ... , ''b''_''n'').

In other words, a Boolean function is monotonic if, for every combination of inputs, switching one of the inputs from false to true can only cause the output to switch from false to true and not from true to false.

Graphically, this means that a Boolean function is monotonic when in its Hasse diagram (dual of its Venn diagram), there is no 1 (red vertex) connected to a higher 0 (white vertex).

The monotonic Boolean functions are precisely those which can be defined by an expression combining the inputs (which may appear more than once) using only the operators ''and'' and ''or'' (in particular ''not'' is forbidden). For instance "at least two of ''a'',''b'',''c'' hold" is a monotonic function of ''a'',''b'',''c'', since it can be written for instance as ((''a'' and ''b'') or (''a'' and ''c'') or (''b'' and ''c'')).

The number of such functions on ''n'' variables is known as the Dedekind number of ''n''.

Monotonic logic

Monotonicity of entailment is a property of many logic systems that states that the hypotheses of any derived fact may be freely extended with additional assumptions. Any true statement in a logic with this property continues to be true, even after adding new axioms. Logics with this property may be called monotonic, to differentiate them from non-monotonic logic.

Notes

Bibliography

(Definition 9.31)

External links

Convergence of a Monotonic Sequence by Anik Debnath and Thomas Roxlo (The Harker School), Wolfram Demonstrations Project.

Definition of a Monotonic function from Wolfram Alpha

Category:Functional analysis Category:Order theory Category:Real analysis Category:Types of functions

ar:دالة رتيبة ca:Funció monòtona cs:Monotónní funkce de:Monotonie (Mathematik) el:Μονοτονία συνάρτησης es:Función monótona eo:Monotona funkcio fr:Fonction monotone ko:단조 함수 is:Einhalla fall it:Funzione monotona he:פונקציה עולה kk:Өспелі функция nl:Monotone functie ja:単調写像 pl:Funkcja monotoniczna pt:Função monótona ro:Monotonia funcţiilor ru:Монотонная функция sk:Monotónna funkcia sl:Monotonost sr:Монотоност функције sh:Monotonost funkcije sv:Monoton funktion uk:Монотонна функція zh:单调函数

This text is licensed under the Creative Commons CC-BY-SA License. This text was originally published on Wikipedia and was developed by the Wikipedia community.