Skip to content
The Lumenary

Practice · Advanced undergraduate

Real analysis

Real analysis

Warm-upHuman

Which of these sequences converge (as n→∞n \to \infty)? Choose all that apply.

Choose all that apply

Real analysis

Warm-upHuman

Let an=nn+1a_n = \dfrac{n}{n + 1}, which converges to 11. For ε=150\varepsilon = \dfrac{1}{50}, what is the smallest NN such that ∣an−1∣<ε|a_n - 1| < \varepsilon for every n≥Nn \ge N?

Real analysis

CoreHuman

Each sequence converges pointwise to 00 on [0,1][0, 1]. Which converge uniformly on [0,1][0, 1]? Choose all that apply.

Choose all that apply

Real analysis

CoreHuman

The extreme value theorem says: a continuous function on a closed bounded interval [a,b][a, b] attains a maximum. Which example shows that the word closed cannot be dropped?

Choose one

Real analysis

CoreHuman

Here is a flawed proof that a pointwise limit ff of continuous functions fnf_n is continuous at cc.

  1. Let ε>0\varepsilon > 0.
  2. For each xx, choose NxN_x with ∣fn(x)−f(x)∣<ε/3|f_n(x) - f(x)| < \varepsilon/3 for n≥Nxn \ge N_x.
  3. Let N=NcN = N_c and choose δ>0\delta > 0 with ∣fN(x)−fN(c)∣<ε/3|f_N(x) - f_N(c)| < \varepsilon/3 when ∣x−c∣<δ|x - c| < \delta.
  4. For ∣x−c∣<δ|x - c| < \delta: ∣f(x)−f(c)∣≤∣f(x)−fN(x)∣+∣fN(x)−fN(c)∣+∣fN(c)−f(c)∣|f(x) - f(c)| \le |f(x) - f_N(x)| + |f_N(x) - f_N(c)| + |f_N(c) - f(c)|.
  5. Each of the three terms is less than ε/3\varepsilon/3, so ∣f(x)−f(c)∣<ε|f(x) - f(c)| < \varepsilon.

Which step is wrong?

Choose one

Real analysis

CoreFormal

Which Lean statement says that f n converges to g uniformly on the set S (and not merely pointwise)?

Choose one

Real analysis

CoreHuman

Let f(x)=x3f(x) = x^3 on [0,2][0, 2] and let PnP_n split [0,2][0, 2] into nn equal pieces. What is the smallest nn for which U(f,Pn)−L(f,Pn)≤1100U(f, P_n) - L(f, P_n) \le \dfrac{1}{100}?

Real analysis

CoreComputational

The proof of the intermediate value theorem can be turned into an algorithm by bisection (the nested-interval form of completeness). Write bisect(f, a, b, steps) which assumes f(a) <= 0 <= f(b) and returns the pair (lo, hi) after steps halvings: at each step let m = (lo + hi) / 2; if f(m) <= 0 replace lo by m, otherwise replace hi by m. The invariant f(lo) <= 0 <= f(hi) is kept, and hi - lo is halved each time.

Runs entirely in your browser, in an isolated worker. Nothing is sent to a server.

Real analysis

StretchHuman

With the usual distance ∣x−y∣|x - y|, in which of these sets does every Cauchy sequence converge to a point of the set? Choose all that apply.

Choose all that apply

Real analysis

StretchHuman

Let fn(x)=sin⁡(n2x)nf_n(x) = \dfrac{\sin(n^2 x)}{n} on R\R. Which statements are true? Choose all that apply.

Choose all that apply