Skip to content
TheChatArchiveThe Chat Archive
Geminigemini-pro-dev-api· GoogleHugging Face Arena Human Preference 55K

Give me a short proof of the dominated convergence theorem

From a Chatbot Arena battleThe same person sent this prompt to two anonymous models at once. Compare it with Claudeclaude-instant-1’s answer.
  1. User

    Give me a short proof of the dominated convergence theorem

  2. Gemini Assistant

    Let ( (f_n) ) be a sequence of measurable functions that converge pointwise to ( f ) almost everywhere on a measure space ( (X, \Sigma, \mu) ). Let ( g ) be a nonnegative measurable function such that ( |f_n| \le g ) almost everywhere for all ( n ).

    1. First, we show that ( f_n \to f ) in ( L^1 ).

    By Fatou's Lemma,

    ∫∣f∣ dμ≤lim inf⁡n→∞∫∣fn∣ dμ≤∫g dμ<∞.\int |f| \ d\mu \le \liminf_{n\to\infty} \int |f_n| \ d\mu \le \int g \ d\mu < \infty.

    So ( f \in L^1 ).

    Now, let ( \epsilon > 0 ). By the pointwise convergence of ( f_n ) to ( f ), there exists a set ( E \in \Sigma ) such that ( \mu(E) < \epsilon ) and ( |f_n - f| < 1 ) for all ( n ) on ( E^c ). Then,

    \begin{split} \int |f_n - f| \ d\mu &= \int_{E^c} |f_n - f| \ d\mu \\\ &\le \int_{E^c} 1 \ d\mu \\\ &= \mu(E^c) \\\ &< \epsilon. \end{split}

    Since ( \epsilon ) is arbitrary, ( f_n \to f ) in ( L^1 ).

    1. Next, we show that ( \int f_n \to \int f ).

    Since ( |f_n| \le g ) almost everywhere, we have

    ∣∫fn dμ−∫f dμ∣≤∫∣fn−f∣ dμ.\left| \int f_n \ d\mu - \int f \ d\mu \right| \le \int |f_n - f| \ d\mu.

    By the result in step 1, the right-hand side converges to 0 as ( n \to \infty ). Therefore, ( \int f_n \to \int f ).

Responses were produced in different, uncontrolled contexts (system prompts, settings, prior turns). This is not a benchmark.