Geometrical description of a subset

  • Thread starter Thread starter dlevanchuk
  • Start date Start date
  • Tags Tags
    Geometrical
dlevanchuk
Messages
29
Reaction score
0
Could somebody explain to me please how to figure out a geometric description of a subspace? I understand how to check wether the set of vectors is a subset, but how t ogive them a geometric description??

lets say i have a subset in R3 {x: x3 = 2x1-x2}

why the G.D. is a plane with an equation 2x1-x2-x3 = 0??

or if I have subset {x: aTx = 0}, where a = [1;0; 0] (R3 again), the G.D is a plane yz... huh? how come? :(
 
Physics news on Phys.org
In the first example you just need to rearrange the set notation so that it reads:
{x: 2x1-x2-x3 = 0}. This is a plane, just as an equation like y-x+1=0 might describe a line in R2.

In the second case, I'm not sure what you mean by T, but I'm assuming that by aTx you just mean the vector multiplication of x by the transpose of a. In this case, note that in order to satisfy the equation, x can have non-zero y and z coordinates, but must have a zero x coordinate...ie. the equation defines the plane formed by the y and z-axes.

Note I have used a bold font for vectors...life can get a bit confusing if you use the same notation for vectors and points!
 
mrbohn1 said:
In the first example you just need to rearrange the set notation so that it reads:
{x: 2x1-x2-x3 = 0}. This is a plane, just as an equation like y-x+1=0 might describe a line in R2.

In the second case, I'm not sure what you mean by T, but I'm assuming that by aTx you just mean the vector multiplication of x by the transpose of a. In this case, note that in order to satisfy the equation, x can have non-zero y and z coordinates, but must have a zero x coordinate...ie. the equation defines the plane formed by the y and z-axes.

Note I have used a bold font for vectors...life can get a bit confusing if you use the same notation for vectors and points!


Gotcha. So i just have to look at the subset, and rearrange the equation, until it will look familiar (ie plane in 3d or a line in 2d..)

Thanks!
 
Thread 'Use greedy vertex coloring algorithm to prove the upper bound of χ'
Hi! I am struggling with the exercise I mentioned under "Homework statement". The exercise is about a specific "greedy vertex coloring algorithm". One definition (which matches what my book uses) can be found here: https://people.cs.uchicago.edu/~laci/HANDOUTS/greedycoloring.pdf Here is also a screenshot of the relevant parts of the linked PDF, i.e. the def. of the algorithm: Sadly I don't have much to show as far as a solution attempt goes, as I am stuck on how to proceed. I thought...
Back
Top