We showed that, if the word embeddings are standardised and uncorrelated, then the expected 2 distance between analogous and non-analogous word-pairs is independent of bilinear terms, and the relation embedding further simplifies to the popular PairDiff operator under regularised settings.
a does not play any part in the expected loss over positive examples.