and say that, in, and say that h is an i-map or independency map of p if p satisfies all of the independencies that we can read off the graph structure of h. and the theorem that we just proved, restated, says that if p factorizes over h then h is an i-map for p because we have shown that if, p factorizes over h then it satisfies all of the independencies that one can read off the graph h. now in the context of