Understanding Unbounded Sets and the Point at Infinity

Introduction

When we talk about "unbounded sets" in mathematics, we often describe them as sets that extend infinitely far in at least one direction. But what does that really mean? In this blog post, we'll explore a fundamental result: a set is unbounded if and only if every neighborhood of the "point at infinity" contains at least one point from that set.

By the end of this post, you'll understand:

  1. What it means for a set to be bounded or unbounded.
  2. The concept of compact sets and neighborhoods of the point at infinity.
  3. A rigorous proof of our main result with intuitive explanations.

This discussion assumes a basic understanding of set notation, limits, and real numbers. No knowledge of complex analysis is required!

What Does It Mean for a Set to Be Bounded?

A set SS in Rn\mathbb{R}^n (such as the number line R\mathbb{R} or the plane R2\mathbb{R}^2) is bounded if there exists a real number M>0M > 0 such that every point xx in SS satisfies:

∥x∥<M\|x\| < M

where ∥x∥\|x\| represents the Euclidean distance from the origin.

Example: The set S={x∈R∣−10≤x≤10}S = \{ x \in \mathbb{R} \mid -10 \leq x \leq 10 \} is bounded because we can choose M=11M = 11, and every point in SS has a distance from the origin less than 11.

In contrast, an unbounded set has points that extend arbitrarily far from the origin.

Example: The set S={x∈R∣x>0}S = \{ x \in \mathbb{R} \mid x > 0 \} is unbounded because for any large number MM, we can always find a point in SS greater than MM.

What Is the Point at Infinity?

Mathematicians often study infinity using one-point compactification, where we add a special "point at infinity" to Rn\mathbb{R}^n.

A neighborhood of the point at infinity is any set of the form:

Rn∖K\mathbb{R}^n \setminus K

where KK is a compact set.

A set KK is compact if it is both:

  • Closed: It contains all its limit points.
  • Bounded: There exists M>0M > 0 such that KK fits inside a ball of radius MM.

Example of a Compact Set: The closed interval [0,1][0,1] in R\mathbb{R} is compact because it is bounded (fits inside [−2,2][-2,2], for instance) and closed (contains its endpoints).

Example of a Neighborhood of Infinity: The set R∖[−10,10]=(−∞,−10)∪(10,∞)\mathbb{R} \setminus [-10,10] = (-\infty, -10) \cup (10, \infty) is a neighborhood of the point at infinity because it is the complement of a compact set.

The Main Theorem and Its Proof

We now prove the statement:

Theorem: A set S⊂RnS \subset \mathbb{R}^n is unbounded if and only if every neighborhood of the point at infinity contains at least one point from SS.

Proof (Forward Direction)

Step 1: Suppose SS is unbounded. This means that for every M>0M > 0, there exists a point x∈Sx \in S such that ∥x∥>M\|x\| > M.

Step 2: Consider any neighborhood of infinity, which is of the form Rn∖K\mathbb{R}^n \setminus K for some compact set KK.

Step 3: Since KK is compact, it is bounded, meaning there exists some large M>0M > 0 such that KK is contained within the ball B(0,M)B(0,M).

Step 4: Because SS is unbounded, there exists a point in SS outside B(0,M)B(0,M), meaning S∩(Rn∖K)≠∅S \cap (\mathbb{R}^n \setminus K) \neq \emptyset.

Step 5: This means that every neighborhood of infinity contains at least one point of SS, as required.

Proof (Reverse Direction)

Step 1: Assume that every neighborhood of infinity contains at least one point from SS.

Step 2: Suppose for contradiction that SS is bounded. Then SS is contained in some compact set KK, meaning S⊂KS \subset K.

Step 3: Consider the neighborhood of infinity given by Rn∖K\mathbb{R}^n \setminus K. Since SS is inside KK, we have S∩(Rn∖K)=∅S \cap (\mathbb{R}^n \setminus K) = \emptyset, contradicting our assumption that every neighborhood of infinity contains a point from SS.

Step 4: Thus, SS must be unbounded.

Conclusion

This theorem provides a powerful characterization of unbounded sets in terms of their behavior near infinity. In simpler terms, a set is unbounded precisely when, no matter how far you look, it still has points beyond that distance.

Understanding the point at infinity and neighborhoods of infinity allows mathematicians to work with infinity in a rigorous way, bridging the gap between finite and infinite structures.

Further Reading:

  • Introduction to Topology by Munkres
  • Principles of Mathematical Analysis by Rudin

If you enjoyed this post and have questions, leave a comment below!

Comments

Post a Comment

Popular posts from this blog

What is Mathematical Fluency?

What does it really mean for students to be mathematically fluent? If you’ve been in any math PD over the past few years, you’ve likely heard the phrase everywhere. We talk about fluency as something students should develop, strengthen, and demonstrate, but it can still feel abstract when we try to describe it in observable, classroom-ready terms. This post breaks down mathematical fluency into the two simplest frames we can use as teachers: what it looks like and what it sounds like . These descriptions can guide instruction, assessment, student goal-setting, and even walkthrough conversations with colleagues or administrators. What Mathematical Fluency Looks Like In a classroom where students are developing mathematical fluency, you see students making choices about strategies rather than following steps robotically. They use representations—number lines, diagrams, tables, graphs, manipulatives, symbolic expressions—and switch between them to make sense of a problem. They move ...
Read more

Unlocking the Group: Cosets, Cayley’s Theorem, and Lagrange’s Theorem

Mathematics is full of elegant ideas that take simple definitions and build deep, powerful structures. In group theory, three such concepts—cosets, Cayley's Theorem, and Lagrange’s Theorem—form a foundational trio that unveils the internal symmetry of algebraic systems. Let’s explore what they mean and why they matter. What’s a Coset, Really? Imagine you have a group and a smaller subgroup inside it. Now, pick any element from the big group and use it to shift every element in the subgroup by multiplying on the left. The resulting set is called a left coset . You can also do this multiplication on the right, forming a right coset . These cosets aren’t usually groups themselves—but they do break the original group into equal-sized, non-overlapping pieces. Intuitively , cosets act like “shifts” of the subgroup across the whole group. Think of tiling a floor: each tile is a copy of the same shape (the subgroup) placed in different locations (cosets). Lagrange’s Theorem: Size Matt...
Read more

Verifying the Binomial Formula with Mathematical Induction

The binomial formula states: ( z 1 + z 2 ) n = ∑ k = 0 n ( n k ) z 1 n − k z 2 k (z_1 + z_2)^n = \sum_{k=0}^n \binom{n}{k} z_1^{n-k} z_2^k where ( n k ) = n ! k ! ( n − k ) ! \binom{n}{k} = \frac{n!}{k!(n-k)!} and n = 1 , 2 , … n = 1, 2, \ldots . This is a powerful formula in algebra, expressing the expansion of ( z 1 + z 2 ) n (z_1 + z_2)^n as a sum of terms involving powers of z 1 z_1 and z 2 z_2 . We’ll verify this formula using mathematical induction . Mathematical induction is a logical method to prove that a statement holds for all positive integers n n . The process involves two steps: Base Case : Verify the formula for the smallest value of n n , typically n = 1 n = 1 . Inductive Step : Assume the formula holds for some n = k n = k , and then prove it holds for n = k + 1 n = k+1 . Step 1: Base Case ( n = 1 n = 1 ) For n = 1 n = 1 , the formula becomes: ( z 1 + z 2 ) 1 = ∑ k = 0 1 ( 1 k ) z 1 1 − k z 2 k (z_1 + z_2)^1 = \sum_{k=0}^1 \binom{1}{k} z_1^{1-k} z_2^k L...
Read more