Prove application is a contraction

In summary, the conversation discusses the proof of h, an application from (C[0,1], R) to (C[0,1], R), being a contraction. The proof involves showing the existence of a constant k, 0<k<1, such that the supremum of the difference between the integrals of two functions f and g is less than or equal to k times the supremum of the difference between f and g. The conversation also includes a suggestion to use the sum-to-product formulas and the inequality |sin x| <= |x| in order to simplify the proof.
  • #1
burritoloco
83
0

Homework Statement


We have the application h: (C[0,1], R) --> (C[0,1], R), defined by
h(f(x)) = [tex]\[\int_0^x cos(f(t))/2\, dt \][/tex]

Prove that h is a contraction.


Homework Equations


Need to prove there exists k, 0<k<1 s.t.

sup_(x in [0,1]) [tex]\left|\int_0^x (cos(f(t)) - cos(g(t)))/2\, dt \right|\][/tex]
<= K sup_(x in [0,1]) |f(x) - g(x)|

for all f, g in domain.

The Attempt at a Solution


I tried saying that the cosine function is smaller or equal to 1, but the LHS became smaller or equal to 1, in which case I can't derive the RHS relationship. Not sure what to do now...
Thanks for your help! (sorry about my latex code)
 
Last edited:
Physics news on Phys.org
  • #2
btw there should be absolute symbols outside the integral
 
  • #3
Hi burritoloco!

A personal question: do you speak French? It's just a guess :smile:

I guess you already did the following step?

[tex]\int_0^x{(\cos(f(t))-\cos(g(t)))/2dt}\leq x|(\cos(f(t))-\cos(g(t)))/2|[/tex]

Now, what happens if you apply the sum-to-product formulas? (or Simpson formula)
 
  • #4
Hello and thanks for your help! I don't speak french, but I do speak spanish :) However my prof is french, very good prof.

Using that inequality (which I had forgotten :P) then using the sum-to-product formulas, and finally using |sin x| <= |x|, I got LHS <= |f(x) - g(x)|/2 as needed.

Thanks again :).
 

FAQ: Prove application is a contraction

How do you prove that an application is a contraction?

To prove that an application is a contraction, you need to show that it satisfies the definition of a contraction. This means that there exists a constant k, such that for all points x and y in the domain of the application, the distance between the images of x and y is less than k times the distance between x and y. In other words, the application must "contract" the distance between points.

What is the significance of proving an application is a contraction?

Proving that an application is a contraction is important because it guarantees the existence and uniqueness of a fixed point for that application. This means that there is a point in the domain that does not move when the application is applied, and this point is the only one that does not move. This has implications in various areas of mathematics, such as optimization and dynamical systems.

What are some common techniques for proving an application is a contraction?

There are several techniques that can be used to prove an application is a contraction. One common approach is to use the mean value theorem to show that the application satisfies the definition of a contraction. Another technique is to use the Banach fixed point theorem, which provides a general framework for proving the existence and uniqueness of a fixed point for certain types of applications.

What types of applications are typically studied in relation to contractions?

Applications that are studied in relation to contractions are typically those that map a set in a metric space to itself. This includes functions, operators, and transformations. Some examples of applications that are commonly studied as contractions include the logistic map, the Newton-Raphson method, and the gradient descent algorithm.

Can an application be both a contraction and an expansion?

No, an application cannot be both a contraction and an expansion. This is because a contraction must decrease distances between points, while an expansion must increase distances. It is possible for an application to be neither a contraction nor an expansion, in which case it is called an isometry, meaning it preserves distances between points.

Back
Top