Skip to content
The Lumenary

Practice · First-year graduate

Measure theory and integration

Measure theory and integration

Warm-upHuman

Let A\mathcal A be the collection of subsets E⊆NE \subseteq \N such that EE is finite or N∖E\N \setminus E is finite. Which statement is true?

Choose one

Measure theory and integration

Warm-upHuman

Let f=5⋅1Q∩[0,1]+3⋅1[0,2]f = 5 \cdot \mathbf 1_{\Q \cap [0, 1]} + 3 \cdot \mathbf 1_{[0, 2]} on R\R. Compute the Lebesgue integral ∫f dλ\int f \, d\lambda.

Measure theory and integration

CoreHuman

Let gn=1[n,n+1]g_n = \mathbf 1_{[n, n+1]} on R\R with Lebesgue measure. Then gn→0g_n \to 0 pointwise, but ∫gn=1\int g_n = 1 for all nn. Which hypothesis of the dominated convergence theorem fails?

Choose one

Measure theory and integration

CoreHuman

The proof of Fatou's lemma sets gk=inf⁡n≥kfng_k = \inf_{n \ge k} f_n and concludes ∫lim inf⁡fn=lim⁡k∫gk\int \liminf f_n = \lim_k \int g_k. Which result justifies this equality?

Choose one

Measure theory and integration

CoreHuman

For m,n≥0m, n \ge 0 let am,n=1a_{m,n} = 1 if m=nm = n, am,n=−1a_{m,n} = -1 if m=n+1m = n + 1, and am,n=0a_{m,n} = 0 otherwise. Compute ∑m=0∞(∑n=0∞am,n)\displaystyle \sum_{m=0}^\infty \Big( \sum_{n=0}^\infty a_{m,n} \Big).

Measure theory and integration

CoreFormal

Which Lean statement correctly formalises Markov's inequality ε μ({f≥ε})≤∫f dμ\varepsilon\,\mu(\{f \ge \varepsilon\}) \le \int f \, d\mu for measurable f:α→[0,∞]f : \alpha \to [0, \infty]? (Here ℝ≥0∞ is [0,∞][0, \infty] and ∫⁻ is the integral of such functions.)

Choose one

Measure theory and integration

CoreHuman

Select all true statements.

Choose all that apply

Measure theory and integration

StretchHuman

In the proof that LpL^p is complete, given a Cauchy sequence (fn)(f_n) we choose n1<n2<⋯n_1 < n_2 < \cdots with ∥fnj+1−fnj∥p<2−j\|f_{n_{j+1}} - f_{n_j}\|_p < 2^{-j}. Why is this subsequence needed?

Choose one

Measure theory and integration

CoreComputational

Write union_length(intervals) that returns the Lebesgue measure of a finite union of closed intervals, given as a list of pairs (a, b) with a <= b. The intervals may overlap. (Countable subadditivity says the answer is at most the sum of the lengths; overlaps make it smaller.)

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