Mathematics Exam  >  Mathematics Notes  >  Mathematics for IIT JAM, GATE, CSIR NET, UGC NET  >  Heine Borel - Sequences and Series, CSIR-NET Mathematical Sciences

Heine Borel - Sequences and Series, CSIR-NET Mathematical Sciences | Mathematics for IIT JAM, GATE, CSIR NET, UGC NET PDF Download

Theorem (Heine-Borel Theorem): A subset S of R is compact if and only if S is closed and bounded. Proof. First we suppose that S is compact. To see that S is bounded is fairly simple: Let In = (−n, n). Then

Heine Borel - Sequences and Series, CSIR-NET Mathematical Sciences | Mathematics for IIT JAM, GATE, CSIR NET, UGC NET

Therefore S is covered by the collection of {In }. Hence, since S is compact, finitely many will suffice.

Heine Borel - Sequences and Series, CSIR-NET Mathematical Sciences | Mathematics for IIT JAM, GATE, CSIR NET, UGC NET

where m = max{n1, . . . , nk}. Therefore |x| ≤ m for all x ∈ S , and S is bounded.

Now we will show that S is closed. Suppose not. Then there is some point p ∈ (cl S) \ S . For each n, define the neighborhood around p of radius 1/n, Nn = N (p, 1/n). Take the complement of the closure of Nn, Un  = R \ cl Nn . Then Un is open (since its complement is closed), and we have

Heine Borel - Sequences and Series, CSIR-NET Mathematical Sciences | Mathematics for IIT JAM, GATE, CSIR NET, UGC NET

Therefore, {Un} is an open cover for S . Since S is compact, there is a finite subcover {Un1 , � � � , Unk} for S . Furthermore, by the way they are constructed, Ui ⊆ Uj if i ≤ j . It follows that S ⊆ Um where m = max{n1, . . . , nk}. But then S ∩ N (p, 1/m)  = �, which contradicts our choice of p ∈ (cl S) \ S .

Conversely, we want to show that if S is closed and bounded, then S is compact. Let F be an open cover for S . For each x ∈ R, define the set

Sx = S ∩ (−∞, x],

and let

B = {x : Sx is covered by a finite subcover of F}.

Since S is closed and bounded, our lemma tells us that S has both a maximum and a minimum. Let d = min S . Then Sd = {d} and this is certainly covered by a finite subcover of F. Therefore, d ∈ B and B is nonempty. If we can show that B is not bounded above, then it will contain a number p greater than max S .
But then, Sp = S so we can conclude that S is covered by a finite subcover, and is therefore compact.

Toward this end, suppose that B is bounded above and let m = sup B. We shall show that m ∈ S and m Heine Borel - Sequences and Series, CSIR-NET Mathematical Sciences | Mathematics for IIT JAM, GATE, CSIR NET, UGC NET S both lead to contradictions.

If m ∈ S , then since F is is an open cover of S , there exists F0 in F such that m ∈ F0 . Since F0 is open there exists an interval [x1 , x2] in F0 such that

x1 < m < x2.

Since x1 < m and m = supB , there exists F1, . . . , Fk in F that cover Sx1 . But then F0 , F1 , . . . , Fk cover Sx2 , so that x2 ∈ B. But this contradicts m = sup B.

If m ∉ S , then since S is closed there exists ε > 0 such that N (m, ε) ∩ S = �. But then

Sm−ε = Sm+ε.

Since m − ε ∈ B we have m + ε ∈ B, which again contradicts m = sup B.

Therefore, either way, if B is bounded above, we get a contradiction. We conclude that B is not bounded above, and S must be compact.

The document Heine Borel - Sequences and Series, CSIR-NET Mathematical Sciences | Mathematics for IIT JAM, GATE, CSIR NET, UGC NET is a part of the Mathematics Course Mathematics for IIT JAM, GATE, CSIR NET, UGC NET.
All you need of Mathematics at this link: Mathematics
556 videos|198 docs

FAQs on Heine Borel - Sequences and Series, CSIR-NET Mathematical Sciences - Mathematics for IIT JAM, GATE, CSIR NET, UGC NET

1. What is the Heine-Borel theorem?
Ans. The Heine-Borel theorem is a fundamental result in analysis that characterizes compact sets in Euclidean spaces. It states that a set in Euclidean space is compact if and only if it is closed and bounded.
2. How does the Heine-Borel theorem relate to sequences and series?
Ans. The Heine-Borel theorem is often used to prove results about sequences and series. For example, it can be used to show that a sequence of real numbers has a convergent subsequence. Additionally, it can be used to prove the Bolzano-Weierstrass theorem, which states that every bounded sequence in Euclidean space has a convergent subsequence.
3. Can the Heine-Borel theorem be applied to infinite series?
Ans. No, the Heine-Borel theorem specifically applies to sets in Euclidean spaces, not to infinite series. However, it can be used to prove results about convergence of sequences or series, as mentioned earlier.
4. Are there any counterexamples to the Heine-Borel theorem?
Ans. No, the Heine-Borel theorem is a well-established result in analysis and has been proven to hold true for Euclidean spaces. There are no known counterexamples.
5. How does the Heine-Borel theorem impact the CSIR-NET exam in Mathematical Sciences?
Ans. The Heine-Borel theorem is an important topic in analysis, which is a major component of the CSIR-NET exam in Mathematical Sciences. Understanding and being able to apply the theorem is crucial for answering questions related to compactness, convergence, and boundedness in the exam.
556 videos|198 docs
Download as PDF
Explore Courses for Mathematics exam
Signup for Free!
Signup to see your scores go up within 7 days! Learn & Practice with 1000+ FREE Notes, Videos & Tests.
10M+ students study on EduRev
Related Searches

CSIR NET

,

UGC NET

,

Objective type Questions

,

GATE

,

UGC NET

,

GATE

,

CSIR-NET Mathematical Sciences | Mathematics for IIT JAM

,

Viva Questions

,

CSIR-NET Mathematical Sciences | Mathematics for IIT JAM

,

past year papers

,

pdf

,

MCQs

,

ppt

,

Sample Paper

,

CSIR-NET Mathematical Sciences | Mathematics for IIT JAM

,

CSIR NET

,

Exam

,

Summary

,

Heine Borel - Sequences and Series

,

Extra Questions

,

CSIR NET

,

UGC NET

,

Semester Notes

,

GATE

,

Important questions

,

shortcuts and tricks

,

Free

,

mock tests for examination

,

Heine Borel - Sequences and Series

,

Heine Borel - Sequences and Series

,

video lectures

,

practice quizzes

,

study material

,

Previous Year Questions with Solutions

;