Proving C is a Subset of D: Problem Statement & Attempt at Solution

  • Thread starter Thread starter HMPARTICLE
  • Start date Start date
  • Tags Tags
    Subsets
HMPARTICLE
Messages
95
Reaction score
0
1. The problem statement.
consider the following sets;
  1. C = {(x, y) ∈ R^2 : y ≥ (x + 2)^2},

    D = {(x, y) ∈ R^2 : y ≥ 4x + 4}.
show that C is a subset of D.

3. Attempt at solution.

Let (x,y) be an arbitrary element of C, then

y ≥ x^2 + 4x + 4.

Rearranging the inequality gives

y - 4 ≥ x^2 + 4x.

Now since x^2 ≥ 0 for all x in R. This implies that

y -4 ≥ 4x. Hence y ≥ 4x+4. As required.

Now my gut instinct is that i am totally wrong with this. I am just starting my degree and usually find these questions quite easy.
I have tried various other manipulations but to no avail :(. If i must be honest i have "forced it".

Note;
I do know this is a simple question and i only just started my degree.
 
Physics news on Phys.org
Your proof is fine, although you didn't need to subtract 4 and add it back. You could have just written$$
y\ge (x+2)^2 = x^2 + 4x + 4 \ge 4x + 4$$
 
Thank you so much for the swift reply, PF never fails.
 
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