## You are here

Homeboundedness theorem

## Primary tabs

# boundedness theorem

Boundedness Theorem. Let $a$ and $b$ be real numbers with $a<b$, and let $f$ be a continuous, real valued function on $[a,b]$. Then $f$ is bounded above and below on $[a,b]$.

Proof. Suppose not. Then for all natural numbers $n$ we can find some $x_{n}\in[a,b]$ such that $|f(x_{n})|>n$. The sequence $(x_{n})$ is bounded, so by the Bolzano-Weierstrass theorem it has a convergent sub sequence, say $(x_{{n_{i}}})$. As $[a,b]$ is closed $(x_{{n_{i}}})$ converges to a value in $[a,b]$. By the continuity of $f$ we should have that $f(x_{{n_{i}}})$ converges, but by construction it diverges. This contradiction finishes the proof.

Type of Math Object:

Theorem

Major Section:

Reference

## Mathematics Subject Classification

26A06*no label found*

- Forums
- Planetary Bugs
- HS/Secondary
- University/Tertiary
- Graduate/Advanced
- Industry/Practice
- Research Topics
- LaTeX help
- Math Comptetitions
- Math History
- Math Humor
- PlanetMath Comments
- PlanetMath System Updates and News
- PlanetMath help
- PlanetMath.ORG
- Strategic Communications Development
- The Math Pub
- Testing messages (ignore)

- Other useful stuff

## Recent Activity

Sep 17

new question: numerical method (implicit) for nonlinear pde by roozbe

new question: Harshad Number by pspss

Sep 14

new problem: Geometry by parag

Aug 24

new question: Scheduling Algorithm by ncovella

new question: Scheduling Algorithm by ncovella

new question: numerical method (implicit) for nonlinear pde by roozbe

new question: Harshad Number by pspss

Sep 14

new problem: Geometry by parag

Aug 24

new question: Scheduling Algorithm by ncovella

new question: Scheduling Algorithm by ncovella

## Info

## Versions

(v6) by classicleft 2013-03-22