Insert constraints into estimates and error terms

a repository of mathematical know-how

Insert constraints into estimates and error terms

Title: *

Area of mathematics: *

A comma-separated list of areas of mathematics to which this article applies. Use ">" to tag in a subcategory. Example: Analysis > Harmonic analysis, Combinatorics

Keywords:

A comma-separated list of keywords associated with this article. Example: free group

Used in:

A comma-separated list of examples of where this technique is used. Example: Cauchy-Schwarz inequality

Parent articles:		Order

Body:

[QUICK DESCRIPTION]
In analysis and analytic number theory, one sometimes obtains estimates for expressions involving several variables or parameters subject to various constraints concerning their respective sizes. If these estimates have to be carried along and transformed in substantial ways, or if many of them involving different constraints must be combined at some point, it may be useful (if it is possible) to incorporate the constraints inside the estimates by adding terms which make the estimate trivial if the constraints are not satisfied, and reduce to the useful estimate otherwise.

This is similar in spirit to the use of a characteristic function of a set to represent a summation or integration condition, as described in [[Getting rid of nasty cutoffs]] for example.

[PREREQUISITES]
Basic calculus or even simple combinatorics and sums.

[GENERAL DISCUSSION]
The idea of the trick is best explained with concrete elementary examples.

[EXAMPLE]
Consider the inequality

[math] \sqrt{x}\leq x. [/math]

This is only valid if $x\geq 1$. However, if we write

[math] \sqrt{x}\leq x+1 [/math]

the inequality is valid for $x\geq 0$, and is not asymptotically worse than the previous one when $x$ gets large.

[EXAMPLE]
Suppose you have a function $S(n,p)$ depending on an integer $n\geq 1$ and a prime number $p$, and that you know the upper bound

[math] |S(n,p)|\leq p [/math]

for all $n$, and

[math] |S(n,p)|\leq \sqrt{p} [/math]

if $p$ does not divide $n$. If these estimates are used extensively later on, with different values of $n$ and $p$, sorting out which of the two applies may become a bookkeeping nightmare. Writing

[math] |S(n,p)|\leq \sqrt{(n,p)}\sqrt{p} [/math]

where $(n,p)$ is the GCD of $n$ and $p$ encapsulates both statements neatly and is much easier to carry around and combine with other estimates.

[note article incomplete]More examples of this are planned (in particular more convincing ones).[/note]

This is a stub

A stub is an article that is not sufficiently complete to be interesting.

Notifications

File attachments

Changes made to the attachments are not permanent until you save this post. The first "listed" file will be included in RSS feeds.

Attach new file:

Images are larger than 640x480 will be resized. The maximum upload size is 1 MB. Only files with the following extensions may be uploaded: jpg jpeg gif png svg.

Revision information

Log message:

An explanation of the additions or updates being made to help other authors understand your motivations.

Insert constraints into estimates and error terms

Recent articles

Active forum topics

Recent comments