How does the bisection method construct sequences to approximate the supremum of a bounded set?
The bisection method starts with an element in the set and an upper bound . It iteratively calculates the midpoint . If is an upper bound for , it becomes the new upper bound ; otherwise, an element greater than is found and becomes the new lower bound . This recursively generates two sequences and that narrow the interval containing the supremum.
Conditions
- is a non-empty subset of .
- is bounded from above.
- and is an upper bound for .
Reasoning, step by step
- Choose an arbitrary element and an upper bound .
- Calculate the midpoint .
- Check if is an upper bound for .
- If yes, set and .
- If no, find such that , set and .
- Repeat the process to generate sequences and .
Example
The video illustrates this on a number line, showing how the interval is halved at each step by evaluating the midpoint , updating either the lower or upper bound to get closer to the supremum of .
Common misconceptions
- Assuming the method always updates both bounds simultaneously; it only updates one bound per step based on whether the midpoint is an upper bound.
- Thinking the sequences and converge to different limits; they converge to the same limit, which is the supremum.
Watch the explanation
4:00 – 6:00Watch this moment ↗
Explore next
Answers are generated from source material and independently checked. Consult the original video or creator if something is unclear.