proof of criterion for convexity
Theorem 1.
Proof.
We begin by showing that, for any natural numbers and ,
by induction. When , there are three possibilities: , , and . The first possibility is a hypothesis of the theorem being proven and the other two possibilities are trivial.
Assume that
for some and all . Let be a number less than or equal to . Then either or . In the former case we have
In the other case, we can reverse the roles of and .
Now, every real number has a binary expansion; in other words, there exists a sequence of integers such that . If , then we also have so, by what we proved above,
Since is assumed to be continuous, we may take the limit of both sides and conclude
which implies that is convex. ∎
Title | proof of criterion for convexity |
---|---|
Canonical name | ProofOfCriterionForConvexity |
Date of creation | 2013-03-22 17:00:23 |
Last modified on | 2013-03-22 17:00:23 |
Owner | rspuzio (6075) |
Last modified by | rspuzio (6075) |
Numerical id | 5 |
Author | rspuzio (6075) |
Entry type | Proof |
Classification | msc 52A41 |
Classification | msc 26A51 |
Classification | msc 26B25 |