0% found this document useful (0 votes)
4 views1 page

Real Analysis Problem Set - Week 3

This document is a problem set for a Real Analysis and Calculus course at the Rajiv Gandhi Institute Of Petroleum Technology. It includes tutorial and assignment problems that focus on properties of real numbers, particularly the Archimedean Property, and tasks related to supremum and infimum. The problems require students to demonstrate understanding through proofs and solutions involving inequalities and sets of real numbers.

Uploaded by

piyushiitian2023
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
4 views1 page

Real Analysis Problem Set - Week 3

This document is a problem set for a Real Analysis and Calculus course at the Rajiv Gandhi Institute Of Petroleum Technology. It includes tutorial and assignment problems that focus on properties of real numbers, particularly the Archimedean Property, and tasks related to supremum and infimum. The problems require students to demonstrate understanding through proofs and solutions involving inequalities and sets of real numbers.

Uploaded by

piyushiitian2023
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

Department of Mathematical Sciences

Rajiv Gandhi Institute Of Petroleum Technology, Jais


MA111 / REAL ANALYSIS & CALCULUS
Week 3 / August 2023 Problem Set 1 GR

Real Analysis
Notations : Set of Real Numbers (R), Set of Natural Numbers (N), sup is supremum /
least upper bound, inf is infimum / greatest lower bound.

Properties of R : Archimedean Property, lub property etc.

■ Tutorial Problems
1. If a be a real number such that 0 ≤ a < n1 for every natural number n, then show
that a = 0. [Hint: Use Archimedean Property]

2. If y be a positive real number, show that there exists a natural number m such
that 0 < 21m < y. [Hint: Use Archimedean Property]
x+3
3. Find the solution set of the inequality ≤ 1.
2x − 6
4. Find sup A and inf A, where

(i) A = x ∈ R : x2 < 1 ,


(ii) A = x ∈ R : 3x2 + 8x − 3 < 0 ,




(iii) A = m1 + n1 : m, n ∈ N ,


n+(−1)n
n o
(iv) A = n : n∈N .

5. Let S be a non-empty subset of R bounded below. A lower bound ℓ of S is such


that for each natural number n there exists an elements sn in S satisfying sn <
ℓ + n1 . Prove that ℓ = inf S.
[Hint: Use the definition of infimum and the Archimedean Property]
■ Assignment Problems

1. A and B are non-empty bounded subsets of R. Prove that

(i) sup A ∪ B = max {sup A, sup B},


(ii) inf A ∪ B = min {inf A, inf B}.

————————- × ————————-

Common questions

Powered by AI

The lub property dictates that every non-empty set of real numbers that has an upper bound must have a least upper bound (supremum). This property underpins calculations in real analysis by ensuring that for bounded sets, a precise supremum always exists and is meaningful. In establishing this supremum, we can perform algebraic manipulations and use bounding techniques, knowing a definite upper limit will be recognized, facilitating more thorough and confident analyses of real number sets. The infimum is similarly guaranteed through the greatest lower bound property, allowing determination of value limits for set members .

The Archimedean property states that for any positive real number \( x \), there exists a natural number \( n \) such that \( \frac{1}{n} < x \). In the context of proving \( a = 0 \), if \( a \neq 0 \), then \( a \) must be positive. By the Archimedean property, we can select a natural number \( n \) such that \( \frac{1}{n} < a \), which contradicts the given condition \( 0 \leq a < \frac{1}{n} \) for all \( n \). Hence, \( a \) must be 0 .

To show \( \inf(A \cup B) = \min\{ \inf A, \inf B \} \), observe that each element in \( A \) and \( B \) is greater than or equal to \( \inf A \) and \( \inf B \), respectively. Therefore, every member in the union must also be at least \( \min\{ \inf A, \inf B \} \), establishing it as a lower bound. Since either \( \inf A \) or \( \inf B \) (or both) are contained in \( A \cup B \), no smaller lower bound can exist than the minimum, confirming it as the greatest lower bound (infimum). Hence, \( \inf(A \cup B) = \min\{ \inf A, \inf B \} \).

The existence of a natural number \( m \) for any positive real number \( y \) such that \( \frac{1}{2^m} < y \) exemplifies the Archimedean property because it asserts the ability to find natural numbers that can approximate any positive real number as closely as desired from below. The property guarantees that no matter how small the positive real number \( y \) is, powers of two (or any sequence \( \frac{1}{n} \)) can be chosen such that \( \frac{1}{2^m} \) is still smaller than \( y \), showing the dense nature of natural numbers in real numbers .

The set \( A = \left\{ x \in \mathbb{R} : x^2 < 1 \right\} \) consists of real numbers whose squares are less than 1. This translates to \( -1 < x < 1 \). The supremum of \( A \) is the least upper bound, \( \sup A = 1 \), as any real number greater than or equal to 1 is not in \( A \). Similarly, the infimum, \( \inf A = -1 \), is the greatest lower bound because any real number less or equal to -1 is not included in the set .

To prove \( \sup(A \cup B) = \max\{ \sup A, \sup B \} \), observe that each element in \( A \) and \( B \) is individually less than or equal to \( \sup A \) and \( \sup B \), respectively. Thus, every element in \( A \cup B \) is less than or equal to \( \max\{ \sup A, \sup B \} \), establishing it as an upper bound. Since either \( \sup A \) or \( \sup B \) is contained in \( A \cup B \), no greater upper bound than \( \max\{ \sup A, \sup B \} \) can exist, making it the least upper bound or supremum. This proves \( \sup(A \cup B) = \max\{ \sup A, \sup B \} \).

To solve the inequality \( \frac{x + 3}{2x - 6} \leq 1 \), first bring all terms involving \( x \) to one side by subtracting 1 from both sides of the inequality, resulting in \( \frac{x + 3}{2x - 6} - 1 \leq 0 \). This simplifies to \( \frac{x + 3 - (2x - 6)}{2x - 6} \leq 0 \), simplifying further to \( \frac{-x + 9}{2x - 6} \leq 0 \). Analyze the intervals determined by the critical points where the numerator and denominator equal zero: \( x = 9 \) and \( x = 3 \), respectively. Checking the sign of \( \frac{-x + 9}{2x - 6} \) within and outside these intervals will determine where the inequality holds true .

The Archimedean property can generalize our understanding of sequences broader than natural numbers by encapsulating dense properties of real numbers. For sequences beyond \( \frac{1}{n} \) from naturals, it justifies finding intervening rational or decimal approximations approaching bounds arbitrarily close from within. This broader scope permits proving convergence properties and inferential limits crucial for deducing behaviors and identities in advanced calculus and broader mathematical contexts, reinforcing density characteristics of real numbers .

The expression \( \frac{n}{n + (-1)^n} \) introduces periodicity because \((-1)^n\) alternates between -1 and 1 depending on whether \( n \) is odd or even. For odd \( n \), \( \frac{n}{n + 1} \) is formed, converging towards 1. For even \( n \), \( \frac{n}{n - 1} \), diverges greater than 1 for large \( n \). This alternation moderates the sequence between smaller and larger values. Supremum over all \( n \) is 1, since for even \( n \) it surpasses 1 but sequentially approaches it from below as odd \( n \) rises. Infimum is less than 1 demonstrated by even \( n \) scenarios .

The Archimedean property is crucial in establishing that \( \ell \) is the infimum of \( S \). By definition, for every natural number \( n \), there exists an element \( s_n \in S \) such that \( s_n < \ell + \frac{1}{n} \). This implies that for any \( \epsilon > 0 \), elements of \( S \) can be found that are arbitrarily close to \( \ell \) from below. Consequently, no smaller number than \( \ell \) can serve as the greatest lower bound, confirming that \( \ell = \inf S \) because it is approached as closely as desired by elements of \( S \) but never exceeded .

You might also like