Ask your own question, for FREE!
Mathematics 8 Online
OpenStudy (anonymous):

Let \[K_1,K_2,...,K_N\] be a compact subsets of the metric space (X,d). Show that a) \[K_1\cup K_2\cup...\cup K_N\] is compact. b) \[K_1∩K_2∩...∩K_N\] is compact

OpenStudy (anonymous):

Hint: I have to use the Pigeonhole principle. But I am not sure how to show this.

OpenStudy (michele_laino):

I'm sorry I don't know the answer. I have abandoned the study of higher mathematics, since I make research on nuclear physics

OpenStudy (triciaal):

sorry, I don't know either.

OpenStudy (fibonaccichick666):

Since no one has answered, I will give you my thoughts. It seems like you are trying to prove that the unions and intersections of compact sets are compact. Take this explanation of the pigeon hole principle "In mathematics, the pigeonhole principle states that if n items are put into m containers, with n > m, then at least one container must contain more than one item. This theorem is exemplified in real-life by truisms like "there must be at least two left gloves or two right gloves in a group of three glove" In this case, I would say we have n sets. Take the contrapositive if it is not a compact set and show by contradiction that the union of compact sets must be compact. That is my best guess, I hope it helps till someone else can answer.

OpenStudy (inkyvoyd):

To be dead honest, openstudy typically targets K-12 or K-14 education... I would suggest posting on stack exchange network (math.stackexchange; make sure if you are new to the site you read the posting rules) for a larger body of capable answerers. We do have a few people here that are familiar with higher math such as @Kainui and @ganeshie8 , but they're of course not always online. Best of luck!

OpenStudy (anonymous):

You can use induction if you can prove it for the union/intersection for any two K sets.

OpenStudy (anonymous):

Just remember to lists the properties of a compactness, then it shouldn't be too hard.

Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!
Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!