and to me it’s not yet obvious that for all Bayesian graphs, if P(A) > P(B) > 0.5, then learning the truth of a descendant node which proves !(A & B) will cause B to decrease in probability more than A.
Consider learning “not A,” for example.
Consider learning “not A,” for example.