Moral graph equals the conditional independence graph under faithfulness
= Moral graph equals the conditional independence graph under faithfulness
If <D-separation> and <conditional independence> are equivalent for a <Directed acyclic graph>, its <moral graph> is its <conditional independence graph>. After conditioning on all other vertices, an active path can only be a direct edge or a two-edge collider through a common child: two adjacent interior vertices cannot both be colliders. These are exactly the moral edges.