Is D1 u D2 Both a Subdivision and a Refinement of D1?

  • Thread starter Thread starter TheyCallMeMini
  • Start date Start date
  • Tags Tags
    Proof
TheyCallMeMini
Messages
5
Reaction score
0

Homework Statement



If each of D1 and D2 is a subdivision of [a,b], then...
1. D1 u D2 is a subdivision of [a,b], and
2. D1 u D2 is a refinement of D1.

Homework Equations



**Definition 1: The statement that D is a subdivision of the interval [a,b] means...
1. D is a finite subset of [a,b], and
2. each of a and b belongs to D.


**Definition 2: The statement that K is a refinement of the subdivision D means...
1. K is a subdivision of [a,b], and
2. D is a subset of K.

The Attempt at a Solution



I just proved that, "If K is a refinement of H and H is a refinement of the subdivision D of [a,b], then K is a refinement of D." Well I haven't wrote it down but the 2nd definition part 2 is what makes it easy to relate just being a transitive proof.

My problem is that I've taken a lot of logic courses in the past so when I see the union of two variables I only need to prove that one is actually true. In this particular situation both are true so its obvious but I don't know how to state that fact.

For the 2nd part of the proof, wouldn't I just say that D1 is a subset of itself, and its already given that D1 is a subdivision of [a,b]? It just seems too easy...I also had questions about proofs I've already turned in that I did poorly on but I didn't want to flood this place with questions.
 
Physics news on Phys.org
TheyCallMeMini said:
For the 2nd part of the proof, wouldn't I just say that D1 is a subset of itself, and its already given that D1 is a subdivision of [a,b]? It just seems too easy...

Yes, I agree. Since by the first part you will have already shown that D1 u D2 is a subdivision of [a,b], all you have to do in part 2 is simply state that D1 is a subset of D1 u D2, thus the definition of refinement is satisfied.
 
There are two things I don't understand about this problem. First, when finding the nth root of a number, there should in theory be n solutions. However, the formula produces n+1 roots. Here is how. The first root is simply ##\left(r\right)^{\left(\frac{1}{n}\right)}##. Then you multiply this first root by n additional expressions given by the formula, as you go through k=0,1,...n-1. So you end up with n+1 roots, which cannot be correct. Let me illustrate what I mean. For this...
Back
Top