vsage
My prof. assigned this problem as the only one for HW a few days back, and for some reason the answer seems too obvious. What subtleties could I possibly be missing?
Let G be a group of permutations in a set S. If x, y \in S and y \in orb_g(x), then orb_g(y) = orb_g(x)
Still, I am unsure how to put it in words. I'll edit this post as I come up with ideas but I think I might need a kick in the right direction, because even as I'm writing this I'm starting to realize it's not entirely trivial.
Let G be a group of permutations in a set S. If x, y \in S and y \in orb_g(x), then orb_g(y) = orb_g(x)
Still, I am unsure how to put it in words. I'll edit this post as I come up with ideas but I think I might need a kick in the right direction, because even as I'm writing this I'm starting to realize it's not entirely trivial.