Let p(x) be a complete type over some set of parameters B, and let A be a subset of B. One says that p(x) splits over A if ϕ(x; b1) ∈ p(x), ϕ(x; b2) ∉ p(x) for some formula ϕ(x; y), and b1, b2 ∈ B having the same type over A. Splitting is a weaker condition than dividing, so not splitting is a stronger condition than not dividing. If M is a sufficiently saturated model containing A, (for example, the monster model), then p ∈ S(M) doesn't split over A if and only if p is Aut(M/A)-invariant. ::: ::: :::