The causal Markov and faithfulness conditions, together with the independent and identically distributed (i.i.d) sampling, no latent variables, and no selection bias, constitute a sufficient set of assumptions for the PC algorithm to converge to the correct Markov equivalence class in the limit of infinite sample size [1]}.
