Skip to content
← All questions

How does the bisection method construct sequences to approximate the supremum of a bounded set?

The bisection method starts with an element a1a_1 in the set MM and an upper bound b1b_1. It iteratively calculates the midpoint cn=12(an+bn)c_n = \frac{1}{2}(a_n + b_n). If cnc_n is an upper bound for MM, it becomes the new upper bound bn+1b_{n+1}; otherwise, an element x∈Mx \in M greater than cnc_n is found and becomes the new lower bound an+1a_{n+1}. This recursively generates two sequences (an)(a_n) and (bn)(b_n) that narrow the interval containing the supremum.

Conditions

  • MM is a non-empty subset of R\mathbb{R}.
  • MM is bounded from above.
  • a1∈Ma_1 \in M and b1b_1 is an upper bound for MM.

Reasoning, step by step

  1. Choose an arbitrary element a1∈Ma_1 \in M and an upper bound b1b_1.
  2. Calculate the midpoint cn=12(an+bn)c_n = \frac{1}{2}(a_n + b_n).
  3. Check if cnc_n is an upper bound for MM.
  4. If yes, set bn+1=cnb_{n+1} = c_n and an+1=ana_{n+1} = a_n.
  5. If no, find x∈Mx \in M such that x>cnx > c_n, set an+1=xa_{n+1} = x and bn+1=bnb_{n+1} = b_n.
  6. Repeat the process to generate sequences (an)(a_n) and (bn)(b_n).

Example

The video illustrates this on a number line, showing how the interval [a1,b1][a_1, b_1] is halved at each step by evaluating the midpoint c1c_1, updating either the lower or upper bound to get closer to the supremum of MM.

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 (an)(a_n) and (bn)(b_n) converge to different limits; they converge to the same limit, which is the supremum.

Watch the explanation

Explore next

Answers are generated from source material and independently checked. Consult the original video or creator if something is unclear.