I'm a total newb and bottom rung hobbyist mathematician, just fair warning.
Say points a,b,c,d,e are in the plane (general position) and triangle abc contains point d, triangle ade contains point c. It seems intuitive that triangle bcd cannot contian point e, but I don't know how to prove it, without trying actual values for the coordinates. My first thought was to set up a system of inequalities, one for each statement of containment, similar to barrycentric coordinates (but using cross products), then somehow deduce a contradiction.
The inequality list looks like this. I gather one would have to check a number of different sign conditions, and perhaps all possible orderings of x and y. I'm ok to assume a specific ordering, like $a_x < e_x < c_x < d_x < b_x$ and $a_y < b_y < d_y < c_y < e_y$, if that helps. I already checked for simple sign conflicts (some orderings are easy to prove immediately via sign conflicts):
ABC contains D $$(d_x - a_x) (c_y - a_y) - (c_x - a_x) (d_y - a_y)>0$$ $$(d_x - b_x) (a_y - b_y) - (a_x - b_x) (d_y - b_y)>0$$ $$(d_x - c_x) (b_y - c_y) - (b_x - c_x) (d_y - c_y)>0$$
ADE contains C $$(c_x - a_x) (e_y - a_y) - (e_x - a_x) (c_y - a_y)>0$$ $$(c_x - d_x) (a_y - d_y) - (a_x - d_x) (c_y - d_y)>0$$ $$(c_x - e_x) (d_y - e_y) - (d_x - e_x) (c_y - e_y)>0$$
BCD contains E $$(e_x - b_x) (d_y - b_y) - (d_x - b_x) (e_y - b_y)>0$$ $$(e_x - c_x) (b_y - c_y) - (b_x - c_x) (e_y - c_y)>0$$ $$(e_x - d_x) (c_y - d_y) - (c_x - d_x) (e_y - d_y)>0$$
Can it be shown, just with the above statements, that the three "containment" statements cannot co-exist? I guess we also need to say that no three points are colinear and no two points are the same. Here's an example drawing, but of course I'm looking to prove this without assuming any particular configuration of the points. While a geometric reasoning proof would be interesting, my goal is to be able to programatically prove these sorts of statements, so analytical is best. I'm happy to improve the question with any feedback. thanks!
