Ma · Mathematics

Baby Rudin Chapter 4 Exercises 5 and 6: Solutions

Published By the 9to5Science editorial team

At a glance

  1. 1. Use the intermediate value theorem

    For Exercise 5, assume the function takes both positive and negative values; continuity then forces a zero between them.

  2. 2. Apply continuity to limits

    For Exercise 6, take a convergent sequence of zeros and use continuity to show its limit is also a zero.

  3. 3. Check the domain

    The zero set is closed relative to [a,b]; it need not be closed as a subset of all of R.

The exercise numbers below refer to the commonly used third edition of Walter Rudin’s Principles of Mathematical Analysis. Exercise numbering can differ across editions or printings, so check that your copy has the same statements.

Exercise 5 asks you to prove that the set of zeros of a continuous function on [a,b][a,b] is closed. Exercise 6 asks you to show that a continuous real-valued function on [a,b][a,b] with no zeros must be either positive everywhere or negative everywhere.

Exercise 5: The zero set is closed

Let

S={x∈[a,b]:f(x)=0},S=\{x\in[a,b]:f(x)=0\},

where f:[a,b]→Rf:[a,b]\to\mathbb{R} is continuous. To prove that SS is closed in [a,b][a,b], use the sequence criterion for closed sets: show that whenever a sequence (xn)(x_n) in SS converges to a point x∈[a,b]x\in[a,b], that limit belongs to SS.

For every nn, membership in SS means f(xn)=0f(x_n)=0. Since ff is continuous at xx and xn→xx_n\to x,

f(x)=lim⁡n→∞f(xn)=lim⁡n→∞0=0.f(x)=\lim_{n\to\infty} f(x_n)=\lim_{n\to\infty}0=0.

Thus x∈Sx\in S. Every convergent sequence in SS whose limit is in the domain has its limit in SS, so SS is closed relative to [a,b][a,b].

There is also a concise set-theoretic explanation. The singleton set {0}\{0\} is closed in R\mathbb{R}, and S=f−1({0})S=f^{-1}(\{0\}). A continuous function has a closed preimage of every closed set, so SS is closed in its domain. The sequence proof makes the key role of continuity explicit.

Exercise 6: A continuous nonzero function has constant sign

Suppose f:[a,b]→Rf:[a,b]\to\mathbb{R} is continuous and f(x)≠0f(x)\ne 0 for every x∈[a,b]x\in[a,b]. We want to show that either f(x)>0f(x)>0 for every xx, or f(x)<0f(x)<0 for every xx.

Assume, toward a contradiction, that ff takes both positive and negative values. Then there are points u,v∈[a,b]u,v\in[a,b] such that f(u)>0f(u)>0 and f(v)<0f(v)<0. If necessary, exchange their names so that u<vu<v. The function is continuous on [u,v][u,v], and 00 lies strictly between f(u)f(u) and f(v)f(v). By the intermediate value theorem, some c∈(u,v)c\in(u,v) satisfies f(c)=0f(c)=0. This contradicts the assumption that ff has no zeros.

Therefore ff cannot take both signs. Since it is nonzero at every point, all its values must be positive or all must be negative.

The interval condition matters: between any two points of an interval, every point between them is also in the domain. The same claim can fail on a disconnected domain. For example, define f(x)=xf(x)=x on [−1,0)∪(0,1][-1,0)\cup(0,1]. This function is continuous on its domain and never zero there, but it takes both signs; the missing point 00 prevents the intermediate value theorem from applying across the two pieces.

A worked example

Take f(x)=x2−1f(x)=x^2-1 on [0,2][0,2]. Its zero set is

S={x∈[0,2]:x2−1=0}={1},S=\{x\in[0,2]:x^2-1=0\}=\{1\},

which is closed in [0,2][0,2]. For any sequence of zeros (xn)(x_n), every term must equal 11, so its limit is also 11, in agreement with the proof of Exercise 5.

For Exercise 6, instead take g(x)=x2+1g(x)=x^2+1 on [0,2][0,2]. Since g(x)≥1>0g(x)\ge 1>0, it has no zeros and is positive everywhere. In contrast, h(x)=x−1h(x)=x-1 takes both negative and positive values on [0,2][0,2]; the intermediate value theorem predicts a zero, and indeed h(1)=0h(1)=0.

Common mistakes

  • Using continuity without an interval: The sign argument needs the intermediate value theorem on the segment between the two points. A disconnected domain may have a continuous, nonzero function with both signs.
  • Forgetting relative closure: Exercise 5 proves that SS is closed as a subset of [a,b][a,b]. It does not, by itself, say that a zero set restricted to an arbitrary domain is closed in all of R\mathbb{R}.
  • Assuming the zero set is nonempty: Exercise 5 allows S=∅S=\varnothing. The empty set is closed, so no separate nonemptiness argument is needed.
  • Claiming a zero set is always finite: It can contain infinitely many points, or even all of [a,b][a,b] if ff is identically zero. Closedness is the conclusion, not finiteness.

References

  1. Walter Rudin, Principles of Mathematical Analysis, 3rd edition

Spotted an error? Send a correction. Read how we write and check articles in our editorial policy.